{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":21,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":21,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"078f92b992ac","filters":{"venue":"Journal of Logical and Algebraic Methods in Programming"}},"results":[{"id":"W1968226057","doi":"10.1016/j.jlamp.2016.02.003","title":"Relational and algebraic methods in computer science","year":2016,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Rotation formalisms in three dimensions; Algebraic number; Computer science; Categorical variable; Computation; Algebra over a field; Modal; Theoretical computer science; Mathematics; Programming language; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06523853055516791,"gpt":0.3784879762966727,"spread":0.3132494457415048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01237977,0.0002122722,0.0005115331,0.0005043347,0.0001544037,0.0002213407,0.0006653637,0.0001389979,0.0000185918],"category_scores_gemma":[0.001794757,0.0001187738,0.0000951042,0.0009984407,0.0006067276,0.0009410701,0.0005665276,0.0004348899,0.000001643071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007980516,"about_ca_system_score_gemma":0.0001434411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003334206,"about_ca_topic_score_gemma":0.000002522031,"domain_scores_codex":[0.9967047,0.001045658,0.0008333715,0.0005147398,0.000386469,0.0005150405],"domain_scores_gemma":[0.9965037,0.002441891,0.0003835206,0.0002078935,0.0001726858,0.0002903772],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001247594,0.00008271385,0.01071636,0.00001219358,0.000007738572,0.00005237702,0.0004516301,0.000003537818,0.002555968,0.1038419,0.000005045008,0.8822581],"study_design_scores_gemma":[0.003162773,0.001332339,0.1877917,0.0006090585,0.00002495535,0.001724078,0.00008475939,0.01808131,0.003280108,0.7757626,0.00741367,0.0007326651],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05680574,0.001662022,0.9397311,0.0009705273,0.0004197738,0.0001261673,1.471969e-7,0.00002332157,0.0002612011],"genre_scores_gemma":[0.1262291,0.0001336063,0.8732972,0.0001555206,0.0001433118,0.000005209987,6.347238e-8,0.00000576909,0.00003020337],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8815255,"threshold_uncertainty_score":0.4843457,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2396862742","doi":"10.1016/j.jlamp.2016.04.001","title":"Declarative layout constraints for testing web applications","year":2016,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Set (abstract data type); Web page; Window (computing); World Wide Web; Web application; Client-side scripting; Web browser; Information retrieval; Static web page; Programming language; Web navigation; The Internet","retraction":null,"screen_n_in":null,"score":{"opus":0.1014790092479599,"gpt":0.3946221533810154,"spread":0.2931431441330555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002826656,0.00009963317,0.0002869965,0.0001379882,0.00009283266,0.000107118,0.0003876522,0.00005853058,0.000005316198],"category_scores_gemma":[0.001733693,0.00005420233,0.00008682851,0.0003983955,0.0001566082,0.0002754474,0.0001078061,0.0001336736,7.713411e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000176755,"about_ca_system_score_gemma":0.00006654405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.426982e-7,"about_ca_topic_score_gemma":6.84078e-7,"domain_scores_codex":[0.998714,0.0002312444,0.0004891504,0.0002182049,0.0001288466,0.0002185885],"domain_scores_gemma":[0.9966471,0.002618467,0.0003237791,0.000133948,0.0001582649,0.0001184319],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000370224,0.00004238767,0.001900079,0.000008006028,0.00001971846,0.00000715974,0.00007388221,0.000001307753,0.004089376,0.01828962,0.00000968249,0.9755551],"study_design_scores_gemma":[0.007771206,0.003273273,0.008959414,0.001638246,0.0003140176,0.001818588,0.001658412,0.0337302,0.009577898,0.8013465,0.1282451,0.001667102],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006318677,0.0002718183,0.9922498,0.0008513341,0.00004532329,0.0001220242,0.000002269172,0.00001804893,0.000120668],"genre_scores_gemma":[0.136143,0.00001577031,0.8636349,0.0000761593,0.00007930808,0.00002449195,2.358885e-7,0.00000300015,0.00002306827],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.973888,"threshold_uncertainty_score":0.2210307,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4205763999","doi":"10.1016/j.jlamp.2015.03.002","title":"Relational and algebraic methods in computer science","year":2015,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Cognitive Science and Mapping","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Algebraic number; Computer science; Mathematics education; Algebra over a field; Mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1528972632299675,"gpt":0.4224186430106527,"spread":0.2695213797806852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01881702,0.0001602365,0.0003937832,0.0006133774,0.0001255082,0.000306738,0.0005642776,0.00008251202,0.000004332367],"category_scores_gemma":[0.002058352,0.0001150662,0.00005870322,0.001627439,0.0005677341,0.00129711,0.0006050759,0.0005020397,7.900753e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006696686,"about_ca_system_score_gemma":0.0002374132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006688608,"about_ca_topic_score_gemma":0.000002318798,"domain_scores_codex":[0.9970873,0.0008197289,0.0006976178,0.0004480991,0.0005093501,0.0004378991],"domain_scores_gemma":[0.997798,0.00114138,0.0002956326,0.0001440311,0.0002661211,0.0003548766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009120656,0.00005911308,0.005528809,0.00000825214,0.000003996453,0.0000572667,0.001010393,0.00002851135,0.001087493,0.02849414,0.000004049593,0.9637089],"study_design_scores_gemma":[0.002605633,0.001352264,0.1113873,0.0004305545,0.0000197621,0.00177025,0.0006865191,0.1183774,0.001672649,0.7555093,0.005514371,0.0006739615],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06923668,0.0009817192,0.9280561,0.001013624,0.0003708644,0.0001231567,8.998583e-8,0.00001516371,0.0002025768],"genre_scores_gemma":[0.09400542,0.00003927124,0.9054989,0.0003487417,0.00009154549,0.000003952854,9.389574e-8,0.000003351349,0.00000878174],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9630349,"threshold_uncertainty_score":0.6521643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032028343","doi":"10.1016/j.jlap.2014.02.005","title":"Relational style laws and constructs of linear algebra","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algebra over a field; Converse; Axiom; Relation (database); Context (archaeology); Domain (mathematical analysis); Symmetric algebra; Commutative property; Intersection (aeronautics); Pure mathematics; Algebra representation; Cellular algebra; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.04890587353074712,"gpt":0.3410464175587398,"spread":0.2921405440279927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481515,0.000134429,0.0004287856,0.0001485122,0.00007379947,0.00004090439,0.0002598972,0.000102179,0.00001015131],"category_scores_gemma":[0.001011405,0.00009207625,0.0000710078,0.0003089134,0.0002424445,0.0003471673,0.0001836978,0.0003506493,3.731905e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009668355,"about_ca_system_score_gemma":0.00002829306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001224789,"about_ca_topic_score_gemma":5.614768e-7,"domain_scores_codex":[0.998194,0.0004614649,0.0006710013,0.0002210191,0.0002343692,0.0002181407],"domain_scores_gemma":[0.9979277,0.001230771,0.0004548866,0.0001301712,0.0001108188,0.000145705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001219985,0.00005202681,0.003274667,0.00002325022,0.0000105124,0.00001212394,0.0001790154,0.00001592917,0.0007471695,0.3631107,0.000001879559,0.6325606],"study_design_scores_gemma":[0.002105927,0.001282498,0.02051635,0.0001971035,0.00002790581,0.0009166683,0.000186731,0.01379529,0.002211272,0.9494327,0.008979052,0.0003484985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.167762,0.000967823,0.8304552,0.0003648223,0.0001314584,0.00007275544,2.189152e-7,0.00001298156,0.0002326768],"genre_scores_gemma":[0.3404785,0.00005235699,0.6592976,0.0001009173,0.0000570294,0.000001220942,1.615327e-7,0.000003074855,0.000009199147],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.632212,"threshold_uncertainty_score":0.3754761,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386879846","doi":"10.1016/j.jlamp.2023.100919","title":"Branching pomsets: Design, expressiveness and applications to choreographies","year":2023,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Electronic Components and Systems for European Leadership; Key Digital Technologies Joint Undertaking; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Agence Nationale de la Recherche; Ministério da Ciência, Tecnologia e Ensino Superior; European Commission; Canadian Institute of Steel Construction","keywords":"Branching (polymer chemistry); Computer science; Concurrency; Theoretical computer science; ENCODE; Programming language; Event structure; Set (abstract data type); Operational semantics; Automaton; Semantics (computer science); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06223679255921293,"gpt":0.3772277272417923,"spread":0.3149909346825794,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003226086,0.0001444878,0.0003410978,0.0004130732,0.0001718854,0.0002471354,0.0004440203,0.00008045086,0.000002573863],"category_scores_gemma":[0.0005386663,0.00009848414,0.00007338986,0.001287097,0.00009828621,0.0002915507,0.0003111737,0.0002697249,0.000001675987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001115571,"about_ca_system_score_gemma":0.00002412431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002352503,"about_ca_topic_score_gemma":0.000001014552,"domain_scores_codex":[0.9983156,0.0004626008,0.00043905,0.0002877703,0.000181235,0.00031374],"domain_scores_gemma":[0.9982563,0.001091469,0.0001923129,0.000151392,0.00008451883,0.0002240508],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001162997,0.00004874577,0.002202786,0.00003170009,0.00001479427,0.00005056956,0.001018689,0.00003726486,0.001648155,0.02501777,0.00002529014,0.9698926],"study_design_scores_gemma":[0.002117668,0.001663355,0.06631757,0.0007033553,0.00006528342,0.00125981,0.001509321,0.00640443,0.005006077,0.8461437,0.06769445,0.001114934],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02299606,0.002162531,0.9738502,0.000447863,0.0001281752,0.0002514274,1.99925e-7,0.00005886422,0.0001046921],"genre_scores_gemma":[0.129803,0.0003695154,0.869477,0.000128654,0.000137098,0.00005624834,2.329615e-7,0.00000671896,0.00002147599],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9687777,"threshold_uncertainty_score":0.4016066,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982958309","doi":"10.1016/j.jlap.2014.02.006","title":"Discrete dualities for some algebras with relations","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Binary relation; Representation (politics); Scope (computer science); Syllogism; Existentialism; Algebra over a field; Mathematics; Field (mathematics); Binary number; Pure mathematics; Computer science; Discrete mathematics; Epistemology; Arithmetic; Programming language; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.03290005820379674,"gpt":0.3406227897451933,"spread":0.3077227315413966,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001891238,0.00009097613,0.0002199118,0.000132123,0.00009807443,0.000136736,0.0001462709,0.00004602541,0.000009961921],"category_scores_gemma":[0.000523919,0.00005799587,0.0000600801,0.0001916387,0.00008635604,0.0004932709,0.00004075124,0.0001705347,2.813152e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001517812,"about_ca_system_score_gemma":0.00003090199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000128907,"about_ca_topic_score_gemma":0.000002428993,"domain_scores_codex":[0.9988854,0.0002755135,0.0003939065,0.0001447239,0.0001389229,0.0001615358],"domain_scores_gemma":[0.998597,0.0009018434,0.0002446301,0.00008744814,0.0000786566,0.00009040924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000128977,0.00001787002,0.001544565,0.00001106468,0.0000107298,0.000002634398,0.0002365419,0.0001454868,0.00004490024,0.3712641,0.000007129552,0.6267021],"study_design_scores_gemma":[0.002776116,0.001958326,0.02061627,0.0002427097,0.0000578467,0.0006294305,0.0006272101,0.0683379,0.0006604126,0.8798345,0.0237544,0.0005048933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008696669,0.0001489887,0.9888824,0.001848616,0.0001281766,0.0001243033,2.459109e-7,0.00002086224,0.0001497867],"genre_scores_gemma":[0.1295263,0.0000172005,0.8701483,0.0001749088,0.00006645311,0.000008480481,4.371988e-7,0.000003717651,0.00005421892],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6261972,"threshold_uncertainty_score":0.2365003,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996431919","doi":"10.1016/j.jlamp.2014.11.001","title":"Models of computation for partial functions on the reals","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Countable set; Computability; Mathematics; Disjoint sets; Computation; Disjoint union (topology); Domain (mathematical analysis); Discrete mathematics; Sequence (biology); Algorithm; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.108559188326226,"gpt":0.3797519651047765,"spread":0.2711927767785505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006859328,0.0001166678,0.0003570529,0.0001105357,0.00009400481,0.00008823258,0.0003794038,0.00007022972,0.000002906426],"category_scores_gemma":[0.001216517,0.00006593527,0.0001477394,0.0003110227,0.0001145107,0.0001842899,0.0001273031,0.0002482125,2.545435e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002050336,"about_ca_system_score_gemma":0.00002862879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003295392,"about_ca_topic_score_gemma":8.643107e-7,"domain_scores_codex":[0.9977444,0.0008744153,0.0007065735,0.000216108,0.0002492279,0.0002093146],"domain_scores_gemma":[0.9946633,0.004472661,0.000422538,0.0001693443,0.0001905625,0.00008157715],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002606946,0.0001479201,0.0001027394,0.00001845612,0.00001301692,0.000001175944,0.0002327003,0.004664988,0.0001701373,0.1369058,0.00001830098,0.8576987],"study_design_scores_gemma":[0.0003603277,0.0009940782,0.0006697705,0.00003770239,0.00001141552,0.00002944986,0.00005351912,0.4601,0.0003687157,0.5364043,0.0008934897,0.00007724924],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02594917,0.000104206,0.9715787,0.001656489,0.0003104509,0.0002529934,4.007544e-7,0.00001554284,0.0001320125],"genre_scores_gemma":[0.344474,0.000005075194,0.6552915,0.0001131831,0.00009955282,0.000008841982,1.955436e-7,0.000002984099,0.000004694992],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8576215,"threshold_uncertainty_score":0.2688762,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2218924106","doi":"10.1016/j.jlamp.2015.08.004","title":"On the weaving process of aspect-oriented product family algebra","year":2015,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Weaving; Computer science; Product (mathematics); Rewriting; Feature (linguistics); Process (computing); Programming language; Separation of concerns; Software engineering; Software; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.09725424835872291,"gpt":0.3840404181785746,"spread":0.2867861698198517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00819358,0.0001791304,0.0004651691,0.0001810054,0.00005157034,0.00005680113,0.0007125727,0.00006691972,0.000001435417],"category_scores_gemma":[0.01481673,0.0000992604,0.00008611814,0.0007869917,0.0001596243,0.0003119996,0.0002046413,0.0005915817,3.371467e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003796875,"about_ca_system_score_gemma":0.00008038363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001424614,"about_ca_topic_score_gemma":1.601893e-7,"domain_scores_codex":[0.9974094,0.0009122278,0.0006752477,0.0002708498,0.0004344708,0.000297773],"domain_scores_gemma":[0.9955758,0.003288884,0.0004683296,0.000276797,0.0002606553,0.0001295348],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006902284,0.0001777084,0.0007061804,0.00006585704,0.00003860053,0.0000727706,0.002217576,0.003213119,0.002312313,0.1162108,0.00002313356,0.874893],"study_design_scores_gemma":[0.0009233942,0.001716717,0.003504958,0.0004277984,0.00002397393,0.0003162339,0.001515676,0.002113886,0.01738117,0.9705294,0.001161115,0.0003856678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1256154,0.001472852,0.8717232,0.0005228011,0.0003891623,0.0001609198,1.216421e-7,0.00004585226,0.00006962654],"genre_scores_gemma":[0.1900097,0.00002405354,0.8097946,0.00008432873,0.0000645281,0.000008136043,6.197706e-8,0.000007229959,0.000007369806],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8745073,"threshold_uncertainty_score":0.9934819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014332513","doi":"10.1016/j.jlap.2013.11.001","title":"Characterizations of semicomputable sets of real numbers","year":2013,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Disjoint sets; Mathematics; Class (philosophy); Algebraic number; Projection (relational algebra); Real number; Algebra over a field; Rational number; Algebraic operation; Discrete mathematics; Pure mathematics; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.03507238830327356,"gpt":0.3478299379551908,"spread":0.3127575496519172,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002389312,0.0001528682,0.0006191094,0.0002053008,0.00004260063,0.00007708528,0.000601646,0.0001072807,0.0000342922],"category_scores_gemma":[0.000425271,0.0001103903,0.0001414676,0.0006732165,0.0001714807,0.000473927,0.0003629641,0.000306727,6.464662e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002861058,"about_ca_system_score_gemma":0.00006406137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005165293,"about_ca_topic_score_gemma":0.000001291974,"domain_scores_codex":[0.9974814,0.0005664032,0.001123312,0.000243282,0.0003047121,0.000280911],"domain_scores_gemma":[0.997672,0.0009066501,0.000754534,0.0002296451,0.0003075802,0.0001295724],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007496806,0.0003316966,0.0121815,0.00008179406,0.00002974631,0.00001194235,0.0006945803,0.00009866418,0.01015809,0.009393476,0.000009049287,0.967002],"study_design_scores_gemma":[0.002490809,0.002657729,0.2748689,0.0006013165,0.00007468904,0.0009503894,0.0006004249,0.1229862,0.01451264,0.5779412,0.001446348,0.000869336],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.400507,0.0001688138,0.5985196,0.0002786528,0.0001971691,0.0001671628,4.821758e-7,0.00001502592,0.0001460534],"genre_scores_gemma":[0.2929169,0.00005411333,0.7069457,0.00003147186,0.00003539965,0.000004097363,3.762093e-7,0.000004211473,0.000007781669],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9661326,"threshold_uncertainty_score":0.4501586,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2790776996","doi":"10.1016/j.jlamp.2018.02.001","title":"Convergence: Integrating termination and abort-freedom","year":2018,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"National Science Foundation","keywords":"Abort; Heuristics; Convergence (economics); Computation; Computer science; Property (philosophy); Outcome (game theory); Mathematical optimization; Mathematics; Mathematical economics; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.04241309915636295,"gpt":0.3617428168297641,"spread":0.3193297176734012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004151659,0.0001550515,0.0003624652,0.0001761704,0.0001337047,0.0002700428,0.0003908341,0.0001211071,0.00001149662],"category_scores_gemma":[0.0008312339,0.00009989645,0.00006540925,0.0004081258,0.0002677801,0.000455852,0.0002011227,0.0003241746,0.000001280636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002262796,"about_ca_system_score_gemma":0.00003913153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001560936,"about_ca_topic_score_gemma":0.000006723766,"domain_scores_codex":[0.9980726,0.0004514907,0.000674265,0.00027107,0.0002438255,0.0002868024],"domain_scores_gemma":[0.9986535,0.0003926747,0.0004379087,0.0001492863,0.0002126357,0.0001540499],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008020382,0.00004481503,0.009174979,0.00002660877,0.00001156442,0.00004148474,0.001117643,2.525761e-7,0.0007499067,0.1551639,0.00001194246,0.8336489],"study_design_scores_gemma":[0.002640157,0.005114935,0.04364029,0.0002461659,0.00006654923,0.003126262,0.002445479,0.02637526,0.00405849,0.8592572,0.05204058,0.0009886215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04655134,0.001195316,0.9506125,0.0003012205,0.0007312664,0.0001481377,5.876897e-8,0.00003000565,0.0004300894],"genre_scores_gemma":[0.5001687,0.0000468873,0.4994933,0.00005678965,0.0002007956,0.000003707925,1.115542e-7,0.000003319531,0.00002641939],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8326603,"threshold_uncertainty_score":0.4073659,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2573726090","doi":"10.1016/j.jlamp.2016.12.002","title":"Solving computational tasks on finite topologies by means of relation algebra and the RelView tool","year":2017,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Network topology; Relation (database); Algebra over a field; Computer science; Algebraic number; Algebraic operation; Translation (biology); Simple (philosophy); Theoretical computer science; Mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05562391857438079,"gpt":0.3652962391740452,"spread":0.3096723205996644,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004070892,0.0001154404,0.0003992026,0.00007202036,0.0002570291,0.0002401264,0.0005320741,0.00008529008,0.000003163574],"category_scores_gemma":[0.004232632,0.0000617602,0.0000845797,0.00008185828,0.0005199262,0.0003441812,0.0002472845,0.0003148254,1.805516e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001028537,"about_ca_system_score_gemma":0.00002381189,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001010601,"about_ca_topic_score_gemma":0.000001519184,"domain_scores_codex":[0.9983271,0.0005212644,0.0005723903,0.0001775187,0.0002336411,0.0001680485],"domain_scores_gemma":[0.9952468,0.003719131,0.0007076763,0.0002074191,0.0000791891,0.00003978388],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000531511,0.00004462626,0.003853289,0.00002882033,0.0000262959,0.00001544776,0.0005929618,0.0001005619,0.00008093045,0.2127194,0.00003016365,0.7824544],"study_design_scores_gemma":[0.00230613,0.0006887052,0.07492477,0.0003703859,0.00004241677,0.0001688748,0.0004063469,0.02987275,0.0004694732,0.8889725,0.001550923,0.0002267063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08682987,0.00353785,0.9032499,0.005650378,0.0002334494,0.0001602008,4.317609e-7,0.00001547824,0.0003224568],"genre_scores_gemma":[0.4551189,0.0003059607,0.544388,0.0001465917,0.00002458221,0.000002635534,1.726535e-7,0.000002092658,0.0000111046],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7822276,"threshold_uncertainty_score":0.5067161,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3044333037","doi":"10.1016/j.jlamp.2020.100581","title":"Calculational relation-algebraic proofs in the teaching tool","year":2020,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Relation (database); Rewriting; Algebraic number; Associative property; Computer science; Algebra over a field; Proof assistant; Calculus (dental); Mathematics; Programming language; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06795301837812634,"gpt":0.3526213937981721,"spread":0.2846683754200458,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007091773,0.0001748025,0.0003873319,0.0001383608,0.0001437667,0.0003160153,0.0007093604,0.0001268149,0.000008190311],"category_scores_gemma":[0.00177256,0.0001006971,0.000134881,0.0006003872,0.00007917247,0.0005167875,0.0001598464,0.0009379517,0.000002239768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003277354,"about_ca_system_score_gemma":0.00006440552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000815055,"about_ca_topic_score_gemma":0.000002468809,"domain_scores_codex":[0.9964404,0.001513385,0.0009339568,0.0003118248,0.0004742958,0.0003261797],"domain_scores_gemma":[0.9981477,0.001087689,0.0004150952,0.0001628914,0.00006733345,0.000119299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001347199,0.0001096537,0.01097504,0.00002835558,0.00001250753,0.0001046966,0.003341284,0.00004858135,0.0001276573,0.4432031,0.00001876405,0.5420169],"study_design_scores_gemma":[0.00305148,0.001694819,0.104635,0.0001105439,0.00004413725,0.001223041,0.001498466,0.03632616,0.0001189088,0.7793757,0.07115958,0.0007620825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03551579,0.001225417,0.9572972,0.004869928,0.0002134936,0.0003567165,8.78316e-8,0.00003137869,0.000489993],"genre_scores_gemma":[0.6265491,0.000009856384,0.3726515,0.0005737597,0.0001916809,0.0000113311,4.688163e-7,0.000004524272,0.000007760171],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5910333,"threshold_uncertainty_score":0.4106308,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2279569925","doi":"10.1016/j.jlamp.2015.12.006","title":"Dependencies in relational models of databases","year":2016,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relational database; Computer science; Fuzzy logic; Set (abstract data type); Fuzzy set; Data mining; Relational model; Database; Binary number; Binary relation; Value (mathematics); Database model; Theoretical computer science; Mathematics; Artificial intelligence; Discrete mathematics; Programming language; Machine learning; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.1362856637825906,"gpt":0.3716287206328223,"spread":0.2353430568502317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003000485,0.00007825052,0.0002347867,0.0002228447,0.00001955796,0.00003295331,0.0003709988,0.00003070365,0.00001081845],"category_scores_gemma":[0.0004405981,0.00004310924,0.00004629867,0.0002990633,0.00007353661,0.001230493,0.0002938079,0.0001286087,3.088719e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001394791,"about_ca_system_score_gemma":0.00002334042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004855106,"about_ca_topic_score_gemma":0.000003238897,"domain_scores_codex":[0.9986557,0.0002413776,0.0005398721,0.0001567492,0.0002444299,0.0001619063],"domain_scores_gemma":[0.9987997,0.0007226603,0.0002506098,0.0001263323,0.00004778468,0.00005284763],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008293286,0.00006588216,0.004013973,0.00001137134,0.000006718348,0.00003658635,0.00006657034,0.00001813886,0.0003788748,0.2193751,0.000007186844,0.7760113],"study_design_scores_gemma":[0.002168901,0.0004900797,0.03054842,0.0007053323,0.00001920635,0.000168726,0.0002155125,0.02142322,0.001829436,0.9364905,0.005594647,0.0003460491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0226373,0.0005913393,0.9759117,0.0005283365,0.00009461141,0.00005822662,0.000001001427,0.000006043002,0.0001713859],"genre_scores_gemma":[0.1230362,0.0001597269,0.876713,0.00003149652,0.00002732727,0.000001922966,3.16557e-7,0.000001923789,0.00002808541],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7756653,"threshold_uncertainty_score":0.1757944,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991997530","doi":"10.1016/j.jlap.2014.02.010","title":"Towards “mouldable code” via nested code graph transformation","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Graph rewriting; Computer science; Programming language; Transformation (genetics); Abstract syntax tree; Theoretical computer science; Graph; Program transformation; Control flow graph; Code generation; Control flow; Parsing; Key (lock)","retraction":null,"screen_n_in":null,"score":{"opus":0.03748765793481015,"gpt":0.3395141873912903,"spread":0.3020265294564801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004144186,0.0001666689,0.0004027,0.000248401,0.00006246179,0.0001315613,0.0005167808,0.0001402241,0.000004149228],"category_scores_gemma":[0.0001157873,0.0001207743,0.0001150558,0.0004703941,0.00006027305,0.0005421585,0.00008813233,0.0004455135,4.079007e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003061794,"about_ca_system_score_gemma":0.00002286755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006666464,"about_ca_topic_score_gemma":0.000001591158,"domain_scores_codex":[0.9980916,0.0004390663,0.0006870915,0.0002028299,0.0002912701,0.0002881771],"domain_scores_gemma":[0.9990487,0.000251662,0.0002469024,0.0001846681,0.0001150583,0.0001530153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007868171,0.00004891489,0.0001650355,0.00003580144,0.00000901674,0.0000103339,0.0003593898,0.0001967401,0.001040329,0.09152285,0.000006297426,0.9065974],"study_design_scores_gemma":[0.001589374,0.001802221,0.004200289,0.0004280981,0.00004741297,0.001071512,0.00003099428,0.3258525,0.01620389,0.542282,0.1057292,0.0007626144],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006922252,0.0002587409,0.9917477,0.0005279374,0.0001792906,0.0001460141,2.666307e-7,0.0001428586,0.00007487531],"genre_scores_gemma":[0.1064433,0.00005346676,0.8933203,0.0001114686,0.00004790121,0.00001054722,4.158261e-7,0.000007601075,0.000005011623],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9058348,"threshold_uncertainty_score":0.4925035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4206823480","doi":"10.1016/j.jlap.2014.02.017","title":"Preface","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.03321505617706023,"gpt":0.3472563510243188,"spread":0.3140412948472586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004604059,0.0001314896,0.0003638126,0.0001192685,0.00007233081,0.0001614819,0.0005483903,0.00009614792,0.00001164791],"category_scores_gemma":[0.001302178,0.00008143659,0.0001059598,0.0003191592,0.0000826917,0.0002838025,0.0002174241,0.0003757497,0.000002544806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001796026,"about_ca_system_score_gemma":0.00002695442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000176652,"about_ca_topic_score_gemma":0.000001093387,"domain_scores_codex":[0.9981196,0.0006792452,0.000488793,0.0002200138,0.0001981833,0.0002941496],"domain_scores_gemma":[0.9984996,0.0007933518,0.0002790807,0.0001622826,0.00008711881,0.0001786193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006285006,0.00007470679,0.002050502,0.00001550977,0.000008036331,0.00002035973,0.0003648822,0.000004079271,0.0003741778,0.1127872,0.00002021387,0.884274],"study_design_scores_gemma":[0.002136535,0.002344275,0.02474729,0.0002597253,0.00003698865,0.001222078,0.0001973094,0.01682588,0.003236991,0.7677131,0.1806227,0.000657158],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02603614,0.001360869,0.9692056,0.0004394224,0.0003504031,0.00007175552,2.826641e-8,0.00002823375,0.002507544],"genre_scores_gemma":[0.2389343,0.00005097491,0.7606496,0.0001431829,0.0001424623,0.000002429507,4.758375e-8,0.000003587526,0.00007334608],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8836169,"threshold_uncertainty_score":0.3320888,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2793721708","doi":"10.1016/j.jlamp.2018.02.002","title":"A theoretical framework for cardinality-based feature models: The semantics and computational aspects","year":2018,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Cardinality (data modeling); Computer science; Feature (linguistics); Semantics (computer science); Formal semantics (linguistics); Theoretical computer science; Programming language; Decidability; Software product line; Operational semantics; Denotational semantics; Computational semantics; Algorithm; Software; Software development; Data mining; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.07762526643835502,"gpt":0.3969860829597516,"spread":0.3193608165213966,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004526219,0.0001373595,0.0003296025,0.00007894653,0.0001322284,0.0001369909,0.0003547497,0.0001257027,0.000001206667],"category_scores_gemma":[0.004296508,0.00007816516,0.00008680482,0.0002687341,0.0005078809,0.000161019,0.000143141,0.0004789719,5.114689e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001779608,"about_ca_system_score_gemma":0.0000401039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.160682e-7,"about_ca_topic_score_gemma":1.216599e-7,"domain_scores_codex":[0.9984156,0.0006024555,0.0003146019,0.0002151935,0.0002076177,0.000244546],"domain_scores_gemma":[0.9899955,0.009424567,0.0001727836,0.0001428452,0.0001763778,0.00008786264],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002586887,0.00001969648,0.00005537105,0.00002666052,0.00001511259,0.00001029575,0.0002847447,0.004806272,0.00001676987,0.7808071,0.000003147499,0.2139289],"study_design_scores_gemma":[0.0002258095,0.0003520842,0.0003304259,0.00007731609,0.0000135063,0.0001175974,0.00005946756,0.1218766,0.0001246552,0.8764939,0.0002366886,0.00009185488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002544511,0.001036267,0.9926645,0.003311015,0.0002332357,0.0001625617,4.706422e-7,0.00003542352,0.00001208294],"genre_scores_gemma":[0.1601232,0.00001444178,0.8394173,0.0002835427,0.0001473032,0.000007400782,1.409014e-7,0.000005802868,8.96268e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2138371,"threshold_uncertainty_score":0.5143632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2334804121","doi":"10.1016/j.jlamp.2016.02.005","title":"Logic programming approach to automata-based decision procedures","year":2016,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Datalog; Successor cardinal; Computer science; Logic programming; Horn clause; Automaton; Decision problem; Programming language; Inductive logic programming; Focus (optics); Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06277961365753304,"gpt":0.3824389205900534,"spread":0.3196593069325204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008421062,0.0002532708,0.0005223605,0.0004582619,0.0001151461,0.000248533,0.001065069,0.0001727285,0.000004720453],"category_scores_gemma":[0.005776113,0.0001370613,0.0001459267,0.001011701,0.0001395862,0.000636303,0.0002889307,0.0003265143,0.00000292688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008878051,"about_ca_system_score_gemma":0.0001164431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001403595,"about_ca_topic_score_gemma":5.352949e-7,"domain_scores_codex":[0.9965235,0.0008301851,0.001063358,0.0005027296,0.0005568998,0.0005233382],"domain_scores_gemma":[0.9973257,0.001228669,0.0005246761,0.0003775898,0.0002146809,0.0003286755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006477076,0.0002725716,0.0005396192,0.00005195438,0.000008969956,0.00001800899,0.0001672058,0.00003800623,0.001695058,0.04910831,0.00001332546,0.9480222],"study_design_scores_gemma":[0.01100543,0.01106108,0.04812774,0.004424161,0.0001479674,0.003381053,0.0007378392,0.07215253,0.03725377,0.7208982,0.08743108,0.003379219],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01181881,0.0003595595,0.9860281,0.0008196427,0.0002887009,0.0004326483,2.452638e-7,0.00008999057,0.0001623114],"genre_scores_gemma":[0.05869315,0.00002556424,0.9408035,0.0003099978,0.00008966652,0.00005316322,1.65181e-7,0.00001199978,0.00001278269],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.944643,"threshold_uncertainty_score":0.6914964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079634072","doi":"10.1016/j.jlap.2014.02.015","title":"Gunther Schmidt's life as a mathematician and computer scientist","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Period (music); Art history; Philosophy; Epistemology; History; Aesthetics","retraction":null,"screen_n_in":null,"score":{"opus":0.02887920734177913,"gpt":0.3494686280760919,"spread":0.3205894207343127,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003428699,0.0001288663,0.000386763,0.0001324818,0.0001062606,0.0001834388,0.0002344575,0.00005509911,0.00001128797],"category_scores_gemma":[0.0009165626,0.00008150549,0.00005370497,0.000243866,0.0001675089,0.0004594575,0.0002739059,0.000220896,0.000002380425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008950946,"about_ca_system_score_gemma":0.00002893598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002927923,"about_ca_topic_score_gemma":9.127947e-7,"domain_scores_codex":[0.9983929,0.0003965439,0.0005291196,0.0002305467,0.0002175067,0.000233322],"domain_scores_gemma":[0.9986848,0.0005193388,0.0003076869,0.0001632228,0.00006480629,0.0002601478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000005284159,0.00004052675,0.0004542225,0.00004568862,0.000008711968,0.00002483806,0.0002653889,0.000003079935,0.0002018182,0.3249059,0.00001843241,0.6740261],"study_design_scores_gemma":[0.003336261,0.002946213,0.01246384,0.00181365,0.00005705203,0.003608861,0.0005491496,0.06202302,0.001380487,0.4538772,0.4567419,0.001202346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03171233,0.0007924479,0.9665483,0.0004226115,0.0002356603,0.00009004689,1.697937e-7,0.00001695881,0.0001814215],"genre_scores_gemma":[0.0293642,0.00003318391,0.9699488,0.0004591628,0.0001594939,0.000003294355,1.19583e-7,0.000004873394,0.00002692425],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6728237,"threshold_uncertainty_score":0.3323697,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3001814250","doi":"10.1016/j.jlamp.2020.100525","title":"Preface to the special issue on the 11th International Conference on Graph Transformation","year":2020,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Graph rewriting; Computer science; Clique-width; Wait-for graph; Theoretical computer science; Graph; Voltage graph; Graph property; Null graph; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.08747451457374354,"gpt":0.3570788104032485,"spread":0.2696042958295049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001593972,0.0001054821,0.0001602953,0.00007080757,0.00005982198,0.0001596355,0.0007692061,0.0000450562,0.00002693652],"category_scores_gemma":[0.000155569,0.00005170144,0.000066099,0.0002721569,0.00003435544,0.0001562269,0.00008922313,0.0004429265,0.000002369633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001950223,"about_ca_system_score_gemma":0.00001483227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.569957e-7,"about_ca_topic_score_gemma":3.823172e-7,"domain_scores_codex":[0.9987953,0.0002758123,0.0003353892,0.0001449961,0.0003124705,0.0001359818],"domain_scores_gemma":[0.9993237,0.0002918635,0.0001186876,0.0001129963,0.00006373988,0.0000890297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002120569,0.00002286063,0.00001263367,0.000004039387,0.000007543013,0.000005896292,0.001753038,0.000330103,0.0001199757,0.2818174,0.0001679759,0.7157373],"study_design_scores_gemma":[0.0006137969,0.002732493,0.001254035,0.0003548521,0.00001611171,0.0001031499,0.0002516186,0.07872023,0.006891489,0.09294275,0.8157228,0.0003967001],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002454498,0.00002331295,0.9552067,0.04145097,0.0002461495,0.0001993177,4.122327e-7,0.00003606732,0.0003825669],"genre_scores_gemma":[0.06895564,0.00005218184,0.9285273,0.001732523,0.0007081581,0.00001339463,1.715431e-7,0.000004021088,0.000006581753],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8155548,"threshold_uncertainty_score":0.2108324,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066238078","doi":"10.1016/j.jlap.2014.02.011","title":"Relational properties of sequential composition of coalgebras","year":2014,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"","keywords":"Composition (language); Bisimulation; Dedekind cut; Mathematics; Algebraic number; Process (computing); Algebra over a field; Process calculus; Iterative and incremental development; Computer science; Pure mathematics; Theoretical computer science; Discrete mathematics; Programming language; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0893667256257699,"gpt":0.3298400920710254,"spread":0.2404733664452555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003842069,0.0001221257,0.0004792823,0.0001762232,0.00005133678,0.00004855839,0.0003281567,0.0001096575,0.000005878519],"category_scores_gemma":[0.0003457054,0.00007932794,0.0001326284,0.0002909484,0.000199097,0.0002844692,0.0001295201,0.0002420207,4.24778e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001724956,"about_ca_system_score_gemma":0.00004425754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000115615,"about_ca_topic_score_gemma":0.000001045715,"domain_scores_codex":[0.9975439,0.0007906164,0.0009515612,0.0001731608,0.0003516401,0.0001891183],"domain_scores_gemma":[0.9984684,0.0003165097,0.0007745945,0.0001360759,0.0002192499,0.0000851488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004514677,0.0002022692,0.004790198,0.0001609829,0.00003816272,0.00000804791,0.0006657007,0.00003812556,0.02600994,0.5726974,0.000003636627,0.3953404],"study_design_scores_gemma":[0.004237827,0.004874457,0.0200861,0.0006191431,0.0001356362,0.001234441,0.0005035822,0.01896137,0.1313309,0.8087885,0.008403964,0.0008241125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1281154,0.0009454957,0.8701864,0.000150369,0.0002593189,0.0001281097,9.55211e-8,0.00001238521,0.0002024855],"genre_scores_gemma":[0.6274922,0.00001260119,0.3724006,0.00001912284,0.00006296008,0.000002396693,2.822918e-7,0.000002897742,0.000006967254],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4993768,"threshold_uncertainty_score":0.3234899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2893802702","doi":"10.1016/j.jlamp.2018.09.004","title":"Cryptomorphic topological structures: A computational, relation-algebraic approach","year":2018,"lang":"en","type":"article","venue":"Journal of Logical and Algebraic Methods in Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Relation (database); Closure (psychology); Topology (electrical circuits); Mathematics; Closed set; Algebraic number; Topological space; Algebraic topology; Irreducible component; Set (abstract data type); Algebra over a field; Computer science; Discrete mathematics; Pure mathematics; Combinatorics; Homotopy; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.05015518455874311,"gpt":0.3599268618012973,"spread":0.3097716772425542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003185653,0.0002409215,0.0005442261,0.0002639286,0.000239493,0.0002573332,0.0007234708,0.0002329724,0.00006184648],"category_scores_gemma":[0.001278353,0.0001544544,0.0001646615,0.000750048,0.00048104,0.0004164743,0.0002965563,0.00064127,0.000004429168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000470253,"about_ca_system_score_gemma":0.00009177882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002840227,"about_ca_topic_score_gemma":9.859745e-7,"domain_scores_codex":[0.9971334,0.0007453979,0.0008645142,0.0004307782,0.0004000336,0.0004258363],"domain_scores_gemma":[0.9976938,0.001066475,0.0004985523,0.0002061808,0.0002893403,0.0002455891],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003448565,0.0002106315,0.004319536,0.00002695959,0.00003154152,0.00004763672,0.001251274,0.00007871421,0.0001010335,0.6769594,0.00005076862,0.3168881],"study_design_scores_gemma":[0.0009636687,0.001070555,0.04254831,0.00005376089,0.00002226106,0.001102144,0.0002018803,0.01547201,0.0001099266,0.9352306,0.002915642,0.0003092926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07462881,0.001294476,0.9214539,0.0004246056,0.0003801614,0.0001659667,2.385526e-7,0.00005100487,0.001600846],"genre_scores_gemma":[0.393245,0.00002414659,0.6062609,0.0001946065,0.0002472969,0.000004636221,7.1299e-7,0.000005194497,0.00001750196],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3186162,"threshold_uncertainty_score":0.6298467,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}