{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":55,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":55,"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":"7900f94e49c1","filters":{"venue":"Logical Methods in Computer Science"}},"results":[{"id":"W2128992690","doi":"10.2168/lmcs-1(2:1)2005","title":"General Recursion via Coinductive Types","year":2005,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Coinduction; Monad (category theory); Finitary; Domain theory; Type theory; Recursion (computer science); Partial function; Type (biology); Computer science; μ operator; Simple (philosophy); Domain (mathematical analysis); Partial evaluation; Theoretical computer science; Computability theory; Algebra over a field; Functional programming; Element (criminal law); Representation (politics); Primitive recursive function; Mathematics; Discrete mathematics; Programming language; Algorithm; Pure mathematics; Recursive functions; Functor","retraction":null,"screen_n_in":null,"score":{"opus":0.0759905153646028,"gpt":0.3791849483817478,"spread":0.303194433017145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00381099,0.0002039211,0.0003021927,0.0002445958,0.0002344737,0.0003216676,0.002231746,0.0001165641,0.00001857904],"category_scores_gemma":[0.0001481662,0.0001482757,0.00007585841,0.001723486,0.0004521677,0.0009018916,0.0009622258,0.0002986709,0.00009149892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001543199,"about_ca_system_score_gemma":0.00009640722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000419581,"about_ca_topic_score_gemma":0.000007384283,"domain_scores_codex":[0.9969155,0.0005384841,0.0003836439,0.00100116,0.0005141429,0.000647035],"domain_scores_gemma":[0.9985383,0.0002847807,0.0001269521,0.0006954113,0.000145754,0.0002088362],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002567398,0.00008448264,0.0003062436,0.000003280362,0.000001995196,0.00001473497,0.0003758827,0.0007381233,0.001805091,0.197736,0.00003798257,0.7988936],"study_design_scores_gemma":[0.0003307905,0.0003771603,0.006666037,0.00000782354,0.000002444183,0.0001395629,0.000004688738,0.7771939,0.009116394,0.1935229,0.01220351,0.0004347464],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003528548,0.0001485954,0.9906104,0.0006919832,0.001816593,0.0002210179,1.113961e-7,0.0001922935,0.002790446],"genre_scores_gemma":[0.2838193,0.000005282096,0.7151808,0.0005298143,0.0003719177,0.00001155776,1.949933e-7,0.00000398835,0.00007713479],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7984589,"threshold_uncertainty_score":0.6046507,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102459557","doi":"10.2168/lmcs-8(1:7)2012","title":"Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Fundacja na rzecz Nauki Polskiej; Grantová Agentura České Republiky","keywords":"Unanimity; Mathematics; Conjecture; Constraint satisfaction problem; Variety (cybernetics); Characterization (materials science); Constraint (computer-aided design); Pure mathematics; Universal algebra; Combinatorics; Discrete mathematics; Algebra over a field","retraction":null,"screen_n_in":null,"score":{"opus":0.05866841925032519,"gpt":0.3937555524694554,"spread":0.3350871332191303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01221834,0.0001773057,0.000267218,0.000240041,0.0004109151,0.0003754753,0.001496788,0.00006489796,0.000007680923],"category_scores_gemma":[0.0004407375,0.0001069172,0.00005128875,0.001635775,0.002864116,0.001396947,0.001467264,0.0004663989,0.000008771714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007915953,"about_ca_system_score_gemma":0.00004828625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001869184,"about_ca_topic_score_gemma":0.000002563587,"domain_scores_codex":[0.9963645,0.001280919,0.0003469746,0.0006453983,0.0005238208,0.000838403],"domain_scores_gemma":[0.9965723,0.002368928,0.0001067065,0.0006431303,0.00006103272,0.0002479439],"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.000006128109,0.00001748456,0.006092422,0.00000437159,0.000001567793,0.0000023396,0.0004530486,0.00007758597,0.001346249,0.4777658,0.000001549928,0.5142314],"study_design_scores_gemma":[0.0007206462,0.00008100236,0.1419683,0.0000322415,0.000002386381,0.0001914165,0.00002263594,0.13949,0.002143741,0.71496,0.0001158843,0.0002718612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03144248,0.0002425274,0.9658651,0.0007750234,0.0004591197,0.0003742515,2.691401e-7,0.00010118,0.00073999],"genre_scores_gemma":[0.4480294,0.0000173803,0.5515796,0.00029846,0.00004817585,0.00002145264,4.057244e-8,0.000002798915,0.000002694853],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5139596,"threshold_uncertainty_score":0.9998495,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976808588","doi":"10.2168/lmcs-2(3:2)2006","title":"Logics for Unranked Trees: An Overview","year":2006,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Pennsylvania","keywords":"Computer science; Automaton; Tree automaton; XML; Tree (set theory); Theoretical computer science; Mathematics; Combinatorics; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.1651178444744818,"gpt":0.4470196305774615,"spread":0.2819017861029797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003747248,0.000228772,0.0003900623,0.0001988222,0.0002873422,0.0002243768,0.001815364,0.00008063786,0.000005105257],"category_scores_gemma":[0.000186295,0.0001692767,0.00008723946,0.001593569,0.0004584022,0.00167749,0.0007017678,0.0001531232,0.000004926806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007801124,"about_ca_system_score_gemma":0.00009983086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006168259,"about_ca_topic_score_gemma":0.00004390445,"domain_scores_codex":[0.9969462,0.0003761232,0.0005156544,0.001117002,0.0003917034,0.0006533806],"domain_scores_gemma":[0.9977937,0.0007203287,0.0001439272,0.001034589,0.0001518591,0.0001556386],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003962899,0.00009842367,0.0001265547,0.00001413536,7.393645e-7,0.0000102841,0.00006523333,0.0030584,0.002345566,0.7437157,0.00002872248,0.2505323],"study_design_scores_gemma":[0.0004794946,0.0004510171,0.008362839,0.00005380847,0.000002245104,0.0000376613,0.000008511197,0.7229289,0.002643634,0.2454946,0.01908675,0.0004505899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001242254,0.0004435252,0.9962875,0.0002213018,0.0009467931,0.0003741146,0.000006678581,0.0002019728,0.0002758537],"genre_scores_gemma":[0.007738225,0.00001766074,0.9912845,0.000646289,0.0002285626,0.00005283713,0.000003311334,0.000006671909,0.00002188625],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7198705,"threshold_uncertainty_score":0.6902903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165528704","doi":"10.2168/lmcs-3(4:6)2007","title":"A Characterisation of First-Order Constraint Satisfaction Problems","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada; University of the Fraser Valley; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Constraint satisfaction problem; Decidability; Simple (philosophy); Algebraic number; Constraint satisfaction; Mathematics; Time complexity; Order (exchange); Constraint (computer-aided design); Backtracking; Discrete mathematics; Computer science; Combinatorics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.08219768287444364,"gpt":0.4122412629926573,"spread":0.3300435801182137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01029272,0.0001475308,0.0002568897,0.0005423133,0.0001571183,0.0001052954,0.001316677,0.00008133452,0.00001505291],"category_scores_gemma":[0.00058548,0.0001220895,0.00005030804,0.003403001,0.001041097,0.0009030349,0.0006636084,0.0003011561,0.000004903821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001159663,"about_ca_system_score_gemma":0.00008596449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000217018,"about_ca_topic_score_gemma":0.000019784,"domain_scores_codex":[0.9972093,0.0003218675,0.0005369877,0.0007102423,0.0006369874,0.0005845814],"domain_scores_gemma":[0.9974716,0.001264462,0.0001907478,0.000610988,0.0003034238,0.0001587349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001042315,0.00007323693,0.01272909,0.00001864857,0.000002133089,0.000009738396,0.0005825463,0.001232449,0.02860526,0.0878105,7.680421e-7,0.8689252],"study_design_scores_gemma":[0.0003911846,0.0003595966,0.3699633,0.00006852454,0.000001191569,0.00005430674,0.00001825433,0.4166862,0.0203507,0.1917091,0.0001236472,0.0002739367],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05715748,0.00002211408,0.9414434,0.0002131807,0.000473254,0.0003016923,4.636399e-7,0.00007941431,0.0003089823],"genre_scores_gemma":[0.3951235,0.000005396766,0.6047651,0.00007089639,0.00002330917,0.000006977385,1.308182e-7,0.000002589307,0.000002080066],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8686513,"threshold_uncertainty_score":0.4978666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1819959283","doi":"10.2168/lmcs-11(2:10)2015","title":"Generators and relations for n-qubit Clifford operators","year":2015,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clifford algebra; Clifford analysis; Algebra over a field; Mathematics; Operator (biology); Presentation (obstetrics); Computer science; Pure mathematics; Dirac operator; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.07838646274783868,"gpt":0.3848738116636884,"spread":0.3064873489158498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004184337,0.000181333,0.00025837,0.0002601586,0.0003191087,0.0004506858,0.001313836,0.00008099837,0.000001042839],"category_scores_gemma":[0.0004975217,0.0001371217,0.00004901918,0.001495342,0.0003947064,0.0004387871,0.0009903471,0.0002368626,0.000003400704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006236305,"about_ca_system_score_gemma":0.0002027753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007781769,"about_ca_topic_score_gemma":0.000001538938,"domain_scores_codex":[0.9976856,0.0002768351,0.0003391303,0.0008698633,0.0003248398,0.0005037042],"domain_scores_gemma":[0.9982746,0.000645444,0.00007506052,0.0004769831,0.0001673177,0.000360598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004325819,0.00006155273,0.00125702,0.000005508764,0.000002964113,0.00001010542,0.0009661687,0.03102482,0.0004467216,0.09094933,0.0001539479,0.8751175],"study_design_scores_gemma":[0.0003339688,0.0002495949,0.002471916,0.00001371148,0.000001431432,0.00003483442,0.000006089864,0.9224094,0.0005831005,0.07225288,0.00144226,0.000200823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05336129,0.0001337966,0.9437238,0.001083946,0.001195218,0.0002496012,9.777249e-7,0.000133719,0.0001176546],"genre_scores_gemma":[0.06101751,0.000002468136,0.9379702,0.0007941296,0.0001782524,0.00002061251,3.225238e-7,0.000005896508,0.00001061503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8913846,"threshold_uncertainty_score":0.559166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015360324","doi":"10.2168/lmcs-3(1:4)2007","title":"Logic Meets Algebra: the Case of Regular Languages","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Regular language; Automaton; Complement (music); Computer science; Algebraic number; Monoid; Formalism (music); Mathematics; Formal language; Discrete mathematics; Automata theory; Algebra over a field; Algebraic theory; Theoretical computer science; Algorithm; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04414340357003216,"gpt":0.3956531001013638,"spread":0.3515096965313316,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01401075,0.0001632119,0.0002689919,0.0002206949,0.0002056897,0.00014375,0.002927926,0.00007724176,0.00001108467],"category_scores_gemma":[0.0004058112,0.00009457077,0.00008142734,0.002149507,0.001005919,0.0003916461,0.001407548,0.0002394684,0.000005221274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004153529,"about_ca_system_score_gemma":0.00004246497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004544073,"about_ca_topic_score_gemma":0.000009237301,"domain_scores_codex":[0.9974781,0.0005197633,0.000443652,0.0006688889,0.0003383188,0.0005512591],"domain_scores_gemma":[0.9964061,0.002137196,0.0001541322,0.001084776,0.00009305026,0.0001247492],"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.000002021622,0.00004611862,0.00005047228,0.000004563918,0.0000017365,0.0008022348,0.0003877362,0.0001384663,0.004307911,0.433153,0.00001236164,0.5610934],"study_design_scores_gemma":[0.0003764509,0.0003290881,0.01431297,0.00005789703,0.00000598833,0.003426988,0.0002006044,0.403972,0.05858261,0.517882,0.0004167466,0.0004365784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05067201,0.0003745923,0.9466478,0.0007578526,0.0004884811,0.0001415712,4.085236e-7,0.0001047884,0.0008124617],"genre_scores_gemma":[0.4096119,0.000003722638,0.5896401,0.0006847001,0.00004993792,0.000002222941,5.349799e-8,0.000002428144,0.000004935421],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5606568,"threshold_uncertainty_score":0.5440863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164124713","doi":"10.2168/lmcs-8(3:6)2012","title":"Finite dimensional Hilbert spaces are complete for dagger compact closed categories","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dagger; Axiom; Hilbert space; Mathematics; Pure mathematics; Hilbert manifold; Algebra over a field; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.1704927727894412,"gpt":0.4197456512859538,"spread":0.2492528784965126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002374264,0.0002405863,0.000491363,0.000121264,0.0002845286,0.0001300848,0.0006710471,0.000108943,0.0000377008],"category_scores_gemma":[0.001027442,0.0001681838,0.0001151965,0.0005240716,0.0005132868,0.0003141126,0.0003271588,0.0002265351,0.000003372629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007658167,"about_ca_system_score_gemma":0.00005185326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001454841,"about_ca_topic_score_gemma":0.000002000734,"domain_scores_codex":[0.9977525,0.0002925913,0.0003847517,0.0004632484,0.0003981559,0.0007087241],"domain_scores_gemma":[0.9942923,0.004747595,0.0001915829,0.0004063768,0.0001347385,0.0002273869],"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.0000513004,0.0002025981,0.002981557,0.00004146068,0.000013803,0.000002241616,0.0007105572,0.0006985408,0.0006487343,0.9863322,0.0003524315,0.00796451],"study_design_scores_gemma":[0.0004374326,0.0001122293,0.009296299,0.00003149041,0.00001025119,0.000009840331,0.00001913276,0.07441601,0.0007436969,0.9136799,0.0009743767,0.0002693419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09937117,0.000108008,0.8967074,0.0004647618,0.002771368,0.0003615622,0.000005321933,0.00006600873,0.0001444144],"genre_scores_gemma":[0.4774932,7.644873e-7,0.5218516,0.000344012,0.0002786807,0.00001049849,8.404849e-7,0.000007805957,0.00001256217],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3781221,"threshold_uncertainty_score":0.6858335,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2754485517","doi":"10.2168/lmcs-8(1:25)2012","title":"Formal Theories for Linear Algebra","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Algebra over a field; Mathematics; Linear algebra; Universal algebra; Discrete mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06168111032428622,"gpt":0.3851971348274723,"spread":0.3235160245031861,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005393297,0.0001726759,0.0002411702,0.0002084756,0.0002996252,0.0002028791,0.001725736,0.00006810208,0.000005494835],"category_scores_gemma":[0.0003458797,0.0001298828,0.00008836619,0.001237923,0.0003562773,0.002281415,0.001077496,0.0001640692,0.00001426334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006476824,"about_ca_system_score_gemma":0.00008807491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004411351,"about_ca_topic_score_gemma":5.181128e-7,"domain_scores_codex":[0.9976522,0.000218528,0.0003504778,0.000523523,0.0003130751,0.0009422481],"domain_scores_gemma":[0.9980022,0.001142804,0.00009228804,0.000429081,0.00009045623,0.0002432112],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004279718,0.00005491893,0.0002477753,0.000005174398,0.000001154826,6.383515e-7,0.0004161866,0.0003268169,0.0005811406,0.4515234,0.00001075144,0.5468278],"study_design_scores_gemma":[0.0002926168,0.0001774758,0.0110208,0.00001326923,0.00000178339,0.00002181975,0.000005399177,0.6929476,0.007355358,0.2866007,0.00131423,0.0002488725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01227458,0.0001068243,0.984028,0.0004963506,0.002335769,0.0002524569,7.503693e-7,0.0001566318,0.0003486106],"genre_scores_gemma":[0.2984768,0.000001793992,0.7003707,0.0007414981,0.0003713939,0.00002532292,3.62321e-7,0.000003436111,0.000008661926],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6926208,"threshold_uncertainty_score":0.5296467,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950924851","doi":"10.2168/lmcs-2(1:4)2006","title":"Approximate reasoning for real-time probabilistic processes","year":2006,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Bisimulation; Probabilistic logic; Metric (unit); Computer science; Characterization (materials science); Coinduction; Algorithm; Kernel (algebra); Class (philosophy); Theoretical computer science; Mathematics; Discrete mathematics; Artificial intelligence; Mathematical proof","retraction":null,"screen_n_in":null,"score":{"opus":0.0542199564321787,"gpt":0.3756684191022505,"spread":0.3214484626700718,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008596239,0.0002584227,0.0003820046,0.0003069809,0.0003359726,0.0005287454,0.002882749,0.0001131329,0.000004233098],"category_scores_gemma":[0.002412923,0.0002123792,0.00006794524,0.003211203,0.0006250018,0.001227144,0.0005690174,0.0001923696,0.00001033116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001792433,"about_ca_system_score_gemma":0.0002778558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000026636,"about_ca_topic_score_gemma":0.000001651011,"domain_scores_codex":[0.996228,0.0004890299,0.0006372675,0.001307084,0.0005189438,0.0008196135],"domain_scores_gemma":[0.9968424,0.001431308,0.0002507564,0.0009383662,0.0004054773,0.000131704],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000190641,0.0002622273,0.0002617049,0.0001748708,0.000002293902,0.000007436296,0.0002918307,0.01066778,0.01396639,0.6661112,0.00005192957,0.3081832],"study_design_scores_gemma":[0.0001966015,0.000167678,0.002884421,0.00005289878,0.000002504662,0.00002448212,0.000001951782,0.8180525,0.009872158,0.1682952,0.0001790665,0.0002705354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002836265,0.00004128168,0.9930009,0.0001388237,0.0005643553,0.0007601363,0.000001502721,0.0004069911,0.002249779],"genre_scores_gemma":[0.005437191,0.000004655284,0.9940134,0.0001120724,0.0001671793,0.0002124807,0.000001527215,0.00001156704,0.00003996326],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8073847,"threshold_uncertainty_score":0.8660572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121804749","doi":"10.2168/lmcs-6(4:4)2010","title":"The complexity of global cardinality constraints","year":2010,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cardinality (data modeling); Constraint satisfaction problem; Constraint satisfaction dual problem; Constraint (computer-aided design); Set (abstract data type); Constraint satisfaction; Mathematics; Time complexity; Complexity of constraint satisfaction; Constraint logic programming; Computational complexity theory; Local consistency; Computer science; Mathematical optimization; Constraint programming; Discrete mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1631823224161655,"gpt":0.4693948801379104,"spread":0.3062125577217448,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01198497,0.0001513997,0.0002862338,0.0000688396,0.000409297,0.0002285951,0.005312382,0.00007143544,0.000008654303],"category_scores_gemma":[0.001280701,0.00009626892,0.00009771768,0.002738698,0.01591628,0.0004296328,0.002243551,0.0005741765,0.000005117524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006456799,"about_ca_system_score_gemma":0.0002320737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000018388,"about_ca_topic_score_gemma":0.00002290475,"domain_scores_codex":[0.9964453,0.0009347856,0.0004281982,0.0007392059,0.0007681262,0.0006843981],"domain_scores_gemma":[0.9963362,0.001675432,0.0001323548,0.001346695,0.0002924481,0.0002168311],"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.000004015697,0.00002971284,0.002559056,0.000002002197,0.000001376764,0.000004896521,0.00002746908,0.0000495951,0.002669058,0.6078993,0.000001684282,0.3867518],"study_design_scores_gemma":[0.0001404279,0.00009353759,0.09682214,0.000005854637,6.308954e-7,0.00004480919,0.0000048145,0.08293665,0.002900091,0.8168164,0.0001179831,0.0001166414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02893779,0.0000269329,0.9671247,0.0007425809,0.001170739,0.0001952658,0.000002617685,0.00006213118,0.00173723],"genre_scores_gemma":[0.4470786,0.000001320582,0.5528181,0.00007088612,0.00002392914,0.000004799995,3.673961e-8,0.000001152142,0.000001141305],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4181408,"threshold_uncertainty_score":0.9871816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051749751","doi":"10.2168/lmcs-3(3:1)2007","title":"A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Toronto; Deutsche Forschungsgemeinschaft","keywords":"Decidability; Recursion (computer science); Semantics (computer science); Infinite set; Set (abstract data type); Büchi automaton; Deterministic automaton; Base (topology); Pushdown automaton","retraction":null,"screen_n_in":null,"score":{"opus":0.08777243278367756,"gpt":0.4268065595087113,"spread":0.3390341267250337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01436422,0.0002077816,0.0004947367,0.0005000515,0.0001024461,0.00007322334,0.003016062,0.0001451262,0.000004919708],"category_scores_gemma":[0.002365309,0.0001741566,0.0001200552,0.00300018,0.0008574051,0.0006557687,0.001244353,0.0002195934,0.000002738284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006276395,"about_ca_system_score_gemma":0.0001068701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001356864,"about_ca_topic_score_gemma":0.000003005204,"domain_scores_codex":[0.9966886,0.0003426338,0.001036139,0.0007207024,0.0005978175,0.0006140977],"domain_scores_gemma":[0.994631,0.003237633,0.0005094191,0.001189635,0.0002853268,0.0001469929],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000405368,0.0002410701,0.001858409,0.0001015724,0.000006424272,0.000005889712,0.0008566893,0.004765077,0.01992357,0.1889775,0.00001493479,0.7832084],"study_design_scores_gemma":[0.0003963731,0.0004676651,0.02743604,0.00005471528,0.000004500302,0.00001121321,0.000005905426,0.8494956,0.07153967,0.05000822,0.000372916,0.0002071336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00975434,0.00001262934,0.9881452,0.000128177,0.0009195513,0.0004118906,0.000003454545,0.00009155002,0.0005331984],"genre_scores_gemma":[0.1154949,0.000007467542,0.8841896,0.0002389877,0.00004477453,0.00001015823,5.720414e-7,0.000007227376,0.000006335542],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8447306,"threshold_uncertainty_score":0.7101901,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1791050365","doi":"10.2168/lmcs-11(4:18)2015","title":"A finer reduction of constraint problems to digraphs","year":2015,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Grantová Agentura České Republiky; Grantová Agentura, Univerzita Karlova","keywords":"Digraph; Constraint satisfaction problem; Nondeterministic algorithm; Combinatorics; Mathematics; Complexity of constraint satisfaction; Discrete mathematics; Conjecture; Constraint (computer-aided design); Algebraic number; Local consistency","retraction":null,"screen_n_in":null,"score":{"opus":0.1612916454676848,"gpt":0.4418393829298686,"spread":0.2805477374621838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007670918,0.000151038,0.0002913797,0.0006542836,0.00007627837,0.0001233678,0.00249739,0.00005791674,0.000004077735],"category_scores_gemma":[0.0008361515,0.0001169946,0.00005848421,0.005079174,0.001135909,0.0006430788,0.001381418,0.0002589816,0.000009550178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000871358,"about_ca_system_score_gemma":0.0002160477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000124567,"about_ca_topic_score_gemma":0.000001218662,"domain_scores_codex":[0.9968041,0.0005967683,0.0004235472,0.0008513865,0.0007569208,0.0005672693],"domain_scores_gemma":[0.9978698,0.0004008773,0.00009802249,0.0008223769,0.0003826788,0.0004262367],"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.0000149839,0.0001445272,0.0003376507,0.000009877818,0.000002516192,0.00001166812,0.001404606,0.01981887,0.02686399,0.2544238,0.00003325359,0.6969342],"study_design_scores_gemma":[0.0004507181,0.0009485235,0.002520626,0.00007193159,0.000001215793,0.000107326,0.00004121512,0.23791,0.02653867,0.7306441,0.0004411683,0.0003244889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01520986,0.00004365282,0.9822556,0.0006111681,0.0006336632,0.0003540181,5.765275e-7,0.000085592,0.0008058453],"genre_scores_gemma":[0.2216133,0.000001853993,0.7781966,0.0001200647,0.00003078628,0.00002330759,8.410139e-8,0.000003223937,0.00001081236],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6966097,"threshold_uncertainty_score":0.4770903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2936689511","doi":"10.46298/lmcs-17(3:22)2021","title":"The Shapley Value of Tuples in Query Answering","year":2021,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Technion Hiroshi Fujiwara Cyber Security Research Center; Instituto Millenium; Agencia Nacional de Investigación y Desarrollo; Israel Science Foundation; Deutsche Forschungsgemeinschaft","keywords":"Shapley value; Tuple; Measure (data warehouse); Aggregate (composite); Context (archaeology); Conjunctive query; Computation","retraction":null,"screen_n_in":null,"score":{"opus":0.1006995774279524,"gpt":0.351477435107062,"spread":0.2507778576791097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009305538,0.00007401939,0.0002856749,0.0001205242,0.00008624717,0.00008160323,0.0005652932,0.00004629919,0.00001400955],"category_scores_gemma":[0.001025681,0.00005927017,0.00005088756,0.0009827235,0.0003260848,0.0001200424,0.0002796937,0.0001594537,0.000007723896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004386283,"about_ca_system_score_gemma":0.00003005261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005403605,"about_ca_topic_score_gemma":0.00001369996,"domain_scores_codex":[0.9984773,0.0002482965,0.0005674024,0.000387137,0.00004729938,0.0002725573],"domain_scores_gemma":[0.9983591,0.001112074,0.0001489719,0.0003151273,0.00002607012,0.00003859],"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.00000357637,0.000043804,0.0404475,0.0000144654,0.000001939497,0.000009103943,0.0004176845,0.004134816,0.0009003668,0.9196593,0.000001560252,0.03436591],"study_design_scores_gemma":[0.000218583,0.00005824428,0.2229067,0.00008722406,5.468982e-7,0.00001513053,0.00007296828,0.2625269,0.004116824,0.5088435,0.0009715941,0.0001818538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3537062,0.0007711313,0.6424692,0.0001852325,0.0006606373,0.00005731746,0.000001467472,0.000009693036,0.002139192],"genre_scores_gemma":[0.6676004,0.00002682226,0.3322278,0.00008244617,0.00003473688,0.000003600988,8.266774e-8,0.000002408444,0.00002172771],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4108158,"threshold_uncertainty_score":0.3225132,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156285174","doi":"10.2168/lmcs-3(2:6)2007","title":"On tractability and congruence distributivity","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Division of Mathematical Sciences; Hungarian Scientific Research Fund; Natural Sciences and Engineering Research Council of Canada; Isaac Newton Institute for Mathematical Sciences","keywords":"Distributivity; Distributive property; Congruence (geometry); Mathematics; Bounded function; Variety (cybernetics); Term (time); Conjecture; Sequence (biology); Pure mathematics; Class (philosophy); Discrete mathematics; Invariant (physics); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03957083179911924,"gpt":0.3852755727943883,"spread":0.3457047409952691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01325484,0.0001691341,0.000248298,0.0001531534,0.0002019141,0.0002604575,0.001579087,0.00007536537,0.000006405297],"category_scores_gemma":[0.0008712987,0.0001269938,0.00004008412,0.001366968,0.0009972388,0.00064596,0.0008949476,0.0003164301,0.000005258863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009540899,"about_ca_system_score_gemma":0.0000521419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001561941,"about_ca_topic_score_gemma":0.000003021101,"domain_scores_codex":[0.9973172,0.0003490354,0.0003259494,0.0009895894,0.0004129831,0.0006052287],"domain_scores_gemma":[0.9954185,0.003485072,0.00008028842,0.0007101987,0.00006249252,0.0002434689],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000006130845,0.0001039134,0.00157033,0.000003592065,5.662178e-7,0.00002946258,0.0001079849,0.00004468962,0.002236109,0.2592643,0.000002970886,0.73663],"study_design_scores_gemma":[0.0002207381,0.0002435708,0.3823698,0.00002451384,8.405009e-7,0.00004617741,0.000005930067,0.2373336,0.0114643,0.3679362,0.00009585829,0.0002584362],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2500682,0.00002630647,0.7485757,0.0002426562,0.0004617447,0.0001037178,8.103537e-7,0.000106044,0.0004148379],"genre_scores_gemma":[0.5038649,0.000001608057,0.4956225,0.0004853136,0.00002126906,0.000001780369,7.956126e-8,0.000001333957,0.00000116758],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7363716,"threshold_uncertainty_score":0.5178657,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2951424111","doi":"10.2168/lmcs-2(1:3)2006","title":"Theories for TC0 and Other Small Complexity Classes","year":2006,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Complexity class; Natural number; Mathematical proof; Discrete mathematics; Bounded function; Polynomial; Isomorphism (crystallography); Boolean function; Function (biology); Class (philosophy); Binary number; Multiplication (music); Algebraic number; Time complexity; Combinatorics; Computer science; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.136707778184027,"gpt":0.3898902504278553,"spread":0.2531824722438283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003428213,0.0002198357,0.0003334156,0.0002456983,0.000421317,0.0005747312,0.00190857,0.00007748901,0.000006142726],"category_scores_gemma":[0.0001791026,0.0001733973,0.00008127017,0.001295601,0.001958559,0.0004125022,0.001128943,0.0001981347,0.000001866536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003900874,"about_ca_system_score_gemma":0.00006569942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008039413,"about_ca_topic_score_gemma":0.00004187601,"domain_scores_codex":[0.9974381,0.0003245514,0.0003797204,0.000972368,0.0002815941,0.0006036711],"domain_scores_gemma":[0.9973901,0.001684989,0.0001013173,0.0005916973,0.0001130445,0.0001188613],"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.000004697639,0.00007174494,0.0008502931,0.00000994532,0.00000139884,0.000003063474,0.00009273279,0.0001359907,0.0003233332,0.8055196,0.00001291497,0.1929743],"study_design_scores_gemma":[0.000232907,0.0001195864,0.01243696,0.00001409099,0.000001311101,0.00002002865,0.000003940998,0.3045549,0.0009988982,0.6796697,0.001758277,0.0001894072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007615297,0.0001442434,0.9892541,0.0006176208,0.0007407446,0.0002917043,0.000004393133,0.0001705533,0.001161408],"genre_scores_gemma":[0.04548946,0.000003179896,0.9532617,0.001012418,0.0001807527,0.00002984926,3.452704e-7,0.00000576763,0.00001649542],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3044189,"threshold_uncertainty_score":0.7216391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2889124254","doi":"10.46298/lmcs-17(3:1)2021","title":"Affine Extensions of Integer Vector Addition Systems with States","year":2021,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Fonds de recherche du Québec – Nature et technologies; European Commission","keywords":"Monoid; Reachability; Undecidable problem; Mathematics; Affine transformation; Combinatorics; Decidability; Integer (computer science); Discrete mathematics; Conjecture; Rewriting; Reachability problem; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06018076838320194,"gpt":0.3714641031173124,"spread":0.3112833347341105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003838873,0.0001789578,0.0003768106,0.0002599161,0.0001276569,0.000213718,0.00141069,0.00007737159,0.00002096267],"category_scores_gemma":[0.0007710416,0.0001300922,0.00005047653,0.003345025,0.0005989146,0.0008592409,0.0007428093,0.0002715647,0.000005991556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001011423,"about_ca_system_score_gemma":0.0002516569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001821816,"about_ca_topic_score_gemma":0.000002286655,"domain_scores_codex":[0.9966003,0.0009864335,0.0005280774,0.0008518176,0.0006124899,0.0004208771],"domain_scores_gemma":[0.9970278,0.0009543647,0.0002192809,0.001025065,0.0006300945,0.0001433941],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002636324,0.0003586503,0.0003676376,0.00007971267,0.00001221541,0.0001136233,0.001102258,0.03904534,0.03589096,0.5131468,0.00006683295,0.4097896],"study_design_scores_gemma":[0.0002180625,0.0003036287,0.01082301,0.0001539379,0.000003606648,0.0001439578,0.00004178709,0.9432083,0.03631449,0.008236547,0.0003314598,0.000221226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006481701,0.0001589939,0.9913995,0.0002166632,0.001152239,0.0001835086,0.000003249264,0.0001027718,0.000301367],"genre_scores_gemma":[0.08419129,0.00001757598,0.9155225,0.000161391,0.00005629261,0.00002595879,0.00000204119,0.000005720116,0.00001728221],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9041629,"threshold_uncertainty_score":0.5305007,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2726753079","doi":"10.2168/lmcs-4(2:2)2008","title":"Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems","year":2008,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada); York University","funders":"","keywords":"Probabilistic logic; Duality (order theory); Interval (graph theory); Dual (grammatical number); Discounting; Order (exchange); Zero (linguistics); Decision theory; Degree (music)","retraction":null,"screen_n_in":null,"score":{"opus":0.1758177199586406,"gpt":0.4064235178591127,"spread":0.2306057979004721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01064617,0.0002944622,0.0005399215,0.0007122493,0.0005667075,0.0004302807,0.003259646,0.0001231685,0.000001465932],"category_scores_gemma":[0.002840805,0.0002305246,0.0001090222,0.004674687,0.0009250112,0.001382286,0.0008906121,0.0003414289,0.00000601889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003281684,"about_ca_system_score_gemma":0.0002188492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003134847,"about_ca_topic_score_gemma":5.523906e-7,"domain_scores_codex":[0.9952751,0.0007549061,0.0009358759,0.001316441,0.0008331485,0.0008845264],"domain_scores_gemma":[0.9966384,0.001310347,0.0003638686,0.001131347,0.0003227341,0.000233263],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003088266,0.0006068644,0.01326064,0.0002026836,0.0000090708,0.00003530017,0.002194059,0.02075972,0.003579323,0.510959,0.00002479777,0.4483376],"study_design_scores_gemma":[0.0003449439,0.0003046771,0.01674887,0.00004797432,0.000003836648,0.000243719,0.00001061841,0.9704652,0.0008032387,0.01064235,0.00004921591,0.0003353372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02974012,0.00009827098,0.9664374,0.00007444112,0.002024019,0.001197817,0.000001806377,0.000246263,0.0001798751],"genre_scores_gemma":[0.2113417,0.000004048805,0.7881348,0.00009475528,0.00009940795,0.0003007131,6.072744e-7,0.000009917406,0.00001413936],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9497055,"threshold_uncertainty_score":0.9400521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3020955609","doi":"10.46298/lmcs-18(3:28)2022","title":"Linear Dependent Type Theory for Quantum Programming Languages","year":2022,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Air Force Office of Scientific Research; U.S. Department of Defense","keywords":"Computer science; Programming language; Type theory; Semantics (computer science); Theoretical computer science; Categorical quantum mechanics; Dependent type; Type (biology); Algebra over a field; Quantum; Mathematics; Quantum operation; Pure mathematics; Open quantum system; Lambda calculus; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.0839479400754821,"gpt":0.4028615210096469,"spread":0.3189135809341648,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01069852,0.0001883329,0.0002992726,0.0002434166,0.0005929409,0.0003000591,0.002883409,0.00005622227,0.00001739728],"category_scores_gemma":[0.0004466841,0.000147133,0.0000939867,0.0017696,0.0002604821,0.0003182148,0.001999127,0.000333572,0.00000830169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001311625,"about_ca_system_score_gemma":0.0001604851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000215192,"about_ca_topic_score_gemma":0.000002241027,"domain_scores_codex":[0.9963899,0.0009450914,0.0003844367,0.0009646884,0.0006051888,0.0007107504],"domain_scores_gemma":[0.9978991,0.000988461,0.0001477628,0.0006878487,0.000129721,0.0001471283],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000102372,0.0001028897,0.0002081583,0.00001098376,0.000003171199,0.00002570199,0.0005106363,0.0008808351,0.0003402003,0.483021,0.00001306779,0.5148731],"study_design_scores_gemma":[0.0005769541,0.001571003,0.0007349183,0.000005660798,0.000006312078,0.0001433016,0.0002059402,0.5914151,0.001734281,0.3818047,0.02126539,0.0005364901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001041548,0.0003097208,0.9949613,0.0001944804,0.00234346,0.0006009412,6.137234e-7,0.0002458435,0.0003020979],"genre_scores_gemma":[0.2911794,0.000002035457,0.7081098,0.0003686038,0.0001358512,0.0001310549,9.102477e-7,0.000006856704,0.0000654515],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5905343,"threshold_uncertainty_score":0.5999908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2921402294","doi":"10.23638/lmcs-16(2:11)2020","title":"Completeness of the ZX-Calculus","year":2020,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Future Earth","funders":"Agence Nationale de la Recherche","keywords":"Completeness (order theory); Calculus (dental); Mathematics; Computer science; Medicine; Mathematical analysis; Dentistry","retraction":null,"screen_n_in":null,"score":{"opus":0.07030176109592952,"gpt":0.3545956035740337,"spread":0.2842938424781042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001922914,0.0001695046,0.000336935,0.00008729205,0.0002102898,0.0001440967,0.004943383,0.00005320094,0.000004384062],"category_scores_gemma":[0.00037532,0.0001005805,0.0001205574,0.003319617,0.0007636172,0.0001931512,0.003178685,0.0003795723,0.00000404936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000245771,"about_ca_system_score_gemma":0.0001233681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000996537,"about_ca_topic_score_gemma":4.72309e-7,"domain_scores_codex":[0.9972116,0.0005647189,0.0004320178,0.0007653257,0.0005756177,0.000450709],"domain_scores_gemma":[0.9982324,0.0005955836,0.0001575416,0.0007300984,0.0001013451,0.0001829829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003802935,0.00007274429,0.0008350402,0.00002118722,0.000003115738,0.0000144106,0.001160495,0.05441526,0.008681919,0.05949003,0.0000232314,0.8752788],"study_design_scores_gemma":[0.0001604369,0.0001209168,0.01933367,0.00002772219,0.000001139261,0.00001871165,0.000002810126,0.9614651,0.006025489,0.01237657,0.0003247725,0.0001427285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02470747,0.00005052548,0.9691081,0.00484487,0.0008665881,0.0001494616,6.975903e-7,0.00009240515,0.0001798878],"genre_scores_gemma":[0.3378366,9.016194e-7,0.6600814,0.001995305,0.0000800015,0.000001972092,3.478818e-8,0.000002840082,9.800411e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9070498,"threshold_uncertainty_score":0.9186118,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2395626435","doi":"10.2168/lmcs-11(3:11)2015","title":"Abstract Model Repair","year":2015,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"European Social Fund; Natural Sciences and Engineering Research Council of Canada; European Commission; Athens University of Economics and Business","keywords":"Kripke structure; Model checking; Soundness; Computer science; Abstraction; Theoretical computer science; Semantics (computer science); Kripke semantics; State (computer science); Abstraction model checking; Modal logic; Algorithm; Discrete mathematics; Programming language; Modal; Mathematics; Intermediate logic; Description logic","retraction":null,"screen_n_in":null,"score":{"opus":0.2222698639982402,"gpt":0.4436221654901364,"spread":0.2213523014918962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01451992,0.000214016,0.0002957256,0.0003591631,0.0001409698,0.0002928126,0.003552193,0.0001202563,0.000003739606],"category_scores_gemma":[0.001428072,0.0001758796,0.00009148429,0.002467465,0.0005740674,0.001833528,0.001453765,0.0003971148,0.00004398807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002432542,"about_ca_system_score_gemma":0.0003683762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001168501,"about_ca_topic_score_gemma":7.47683e-7,"domain_scores_codex":[0.9963608,0.0004572345,0.0005555821,0.00111629,0.0008427352,0.0006673476],"domain_scores_gemma":[0.9973966,0.0003511308,0.0001517736,0.001414802,0.0002648396,0.0004208588],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008331866,0.000146746,0.0003118053,0.000009099659,0.000001993228,0.00002360254,0.0007366003,0.0691528,0.001869623,0.3573182,0.00013511,0.5702861],"study_design_scores_gemma":[0.000168744,0.00009013025,0.005570724,0.00001310985,8.071636e-7,0.00002164219,0.000004555681,0.8619477,0.002407111,0.1293227,0.0002388464,0.000213956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00379137,0.00005899824,0.9888821,0.000240451,0.00139387,0.000192313,3.458185e-7,0.000532905,0.004907706],"genre_scores_gemma":[0.0397356,0.000004045069,0.9593649,0.0007661947,0.00008348528,0.00002177561,1.77407e-7,0.000006571513,0.00001723932],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7927949,"threshold_uncertainty_score":0.7172163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3098573930","doi":"10.46298/lmcs-19(2:5)2023","title":"Inferring Symbolic Automata","year":2023,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"Israel Science Foundation; Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Learnability; Computer science; Theoretical computer science; Model checking; Identifiability; Regular language; Kleene algebra; Bounded function; Boolean function; Limit (mathematics); Probably approximately correct learning; Polynomial; Discrete mathematics; Automaton; Mathematics; Algorithm; Artificial intelligence; Computational learning theory; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.06941551654696516,"gpt":0.4283480724184977,"spread":0.3589325558715326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005994642,0.000172231,0.0002590967,0.0005921629,0.0002759642,0.0004693409,0.003188668,0.00006448481,0.000008564993],"category_scores_gemma":[0.0005458482,0.0001369724,0.0000605373,0.005714627,0.0002856959,0.0005942404,0.002579391,0.0004036206,0.0001635285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005124511,"about_ca_system_score_gemma":0.00009242882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002356449,"about_ca_topic_score_gemma":6.914377e-7,"domain_scores_codex":[0.9970028,0.0004567319,0.0003237074,0.0009238541,0.0005494963,0.0007434372],"domain_scores_gemma":[0.9980335,0.0007802296,0.00007059697,0.000861027,0.00005540892,0.0001992333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[5.026754e-7,0.00002982626,0.001291902,0.000006182439,0.00000116827,0.00005798044,0.0003578755,0.009154502,0.0006836388,0.03987471,0.00004047338,0.9485012],"study_design_scores_gemma":[0.0001445672,0.00006722099,0.06011418,0.00002305036,5.031208e-7,0.00002663293,0.000002382936,0.9072665,0.0004255748,0.03092505,0.000822338,0.0001820232],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01314954,0.00001736425,0.9815456,0.001110508,0.001488892,0.00009513173,2.162988e-7,0.001130378,0.001462399],"genre_scores_gemma":[0.08369084,0.000008060159,0.9155632,0.0005283753,0.0001388746,0.00001215957,3.044917e-7,0.000005563867,0.00005265732],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9483192,"threshold_uncertainty_score":0.5925391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3130346675","doi":"10.46298/lmcs-20(3:12)2024","title":"Decidability for Sturmian words","year":2024,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Decidability; Mathematics; Computer science; Calculus (dental); Discrete mathematics; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.07095395759748904,"gpt":0.4281744339669295,"spread":0.3572204763694404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008576192,0.0001781185,0.0002563004,0.0002781466,0.0001712867,0.0008978748,0.002740112,0.00008094511,0.00001030831],"category_scores_gemma":[0.000439634,0.0001287729,0.0001165913,0.002407695,0.0004750218,0.0008714931,0.001056295,0.0002400287,0.00001472525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001281144,"about_ca_system_score_gemma":0.0001703619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005110448,"about_ca_topic_score_gemma":0.00000192861,"domain_scores_codex":[0.9971454,0.0003139353,0.0003615943,0.001217225,0.000362651,0.0005991552],"domain_scores_gemma":[0.9963062,0.002609005,0.00003589841,0.0008092198,0.00006795717,0.0001716993],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001968687,0.00003837048,0.00007760488,0.00001789979,0.000001564969,0.00001370423,0.0002445065,0.0001865585,0.001095292,0.2664616,0.00003458239,0.7318263],"study_design_scores_gemma":[0.00007476374,0.0001031085,0.003722271,0.00003669238,0.000001124749,0.0000163369,0.000003435525,0.6419815,0.001878519,0.3503275,0.001707909,0.0001468508],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006008913,0.0002967145,0.9888331,0.0008850499,0.002791293,0.0003190693,0.000001402522,0.0004474691,0.0004169569],"genre_scores_gemma":[0.1770047,0.000003758171,0.822115,0.0006559174,0.0001529889,0.00004818148,1.978535e-7,0.000005112893,0.0000141486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7316794,"threshold_uncertainty_score":0.8658228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980738047","doi":"10.2168/lmcs-8(3:5)2012","title":"Formalizing Randomized Matching Algorithms","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Correctness; 3-dimensional matching; Blossom algorithm; Lemma (botany); Perfect graph theorem; Algorithm; Matching (statistics); Factor-critical graph; Computer science; Discrete mathematics; Mathematics; Theoretical computer science; Graph; Voltage graph; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.08537728207017845,"gpt":0.3975713719226918,"spread":0.3121940898525133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01829254,0.0002725512,0.0006553273,0.0004953123,0.0004371445,0.0005033664,0.003143701,0.00009293151,0.00001921639],"category_scores_gemma":[0.0004171688,0.0002065072,0.0002110327,0.002655964,0.0009771669,0.00265409,0.002335497,0.0004703832,0.00002305034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009342413,"about_ca_system_score_gemma":0.00006770107,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000327401,"about_ca_topic_score_gemma":6.898869e-7,"domain_scores_codex":[0.9954978,0.001139015,0.000653562,0.0007605749,0.0007125865,0.001236458],"domain_scores_gemma":[0.9962791,0.002272764,0.0001668219,0.0008216684,0.00009129081,0.0003683401],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005002666,0.000107211,0.0001413629,0.000007049447,0.000004411426,0.000007840616,0.001360024,0.0004149135,0.0002819039,0.3800394,0.00000568315,0.6175802],"study_design_scores_gemma":[0.005721387,0.00004043995,0.001580157,0.00003602455,0.000003400102,0.00009050344,0.00001290678,0.7175606,0.001348291,0.2729299,0.0003267462,0.0003496291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002689107,0.0003446024,0.9911976,0.000331765,0.003179881,0.0003187245,3.723139e-7,0.0002657817,0.001672176],"genre_scores_gemma":[0.07836675,0.00001835702,0.9203317,0.0009400456,0.0002941961,0.00003408794,2.467552e-7,0.000006384911,0.000008228095],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7171457,"threshold_uncertainty_score":0.8421118,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2751513393","doi":"10.2168/lmcs-8(1:27)2012","title":"On the Parameterized Intractability of Monadic Second-Order Logic","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","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":"Banff International Research Station for Mathematical Innovation and Discovery; Deutsche Forschungsgemeinschaft","keywords":"Parameterized complexity; Bounded function; Class (philosophy); Hierarchy; Complexity class; Second-order logic; Order (exchange)","retraction":null,"screen_n_in":null,"score":{"opus":0.1114300046363616,"gpt":0.4035080027453709,"spread":0.2920779981090093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01868153,0.000224277,0.0003714418,0.0002318082,0.000203048,0.0001350251,0.003453142,0.0001190034,0.00009498687],"category_scores_gemma":[0.003727504,0.0001362199,0.00008920599,0.002897033,0.00126324,0.001026084,0.0009849694,0.0004991594,0.00002145634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001195153,"about_ca_system_score_gemma":0.00009814843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008289697,"about_ca_topic_score_gemma":5.856356e-7,"domain_scores_codex":[0.9950721,0.00219651,0.0006471486,0.0007010996,0.0006411023,0.0007420293],"domain_scores_gemma":[0.9937294,0.004024334,0.0002804821,0.001589408,0.0001802371,0.0001961515],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001310366,0.0002820083,0.0006648534,0.00001354616,0.00000263372,0.0000010597,0.0005701203,0.0003555659,0.008127069,0.7198038,0.000009225982,0.270157],"study_design_scores_gemma":[0.0002612078,0.0004069006,0.1005444,0.00002570901,0.000003471825,0.00002840447,0.00001406857,0.5310062,0.04388202,0.3232152,0.0002560262,0.0003563885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1135405,0.00005085402,0.8831903,0.0004111059,0.00133691,0.0003377653,7.823456e-7,0.00007287017,0.001058937],"genre_scores_gemma":[0.3816417,0.000001987585,0.6174213,0.0008622642,0.00003862309,0.00002770396,1.005818e-7,0.0000032739,0.000003066557],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5306506,"threshold_uncertainty_score":0.6474681,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974090329","doi":"10.2168/lmcs-7(1:1)2011","title":"Algebraic Notions of Termination","year":2011,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Idempotence; Kleene algebra; Divergence (linguistics); Rewriting; Algebraic number; Algebra over a field; Modal","retraction":null,"screen_n_in":null,"score":{"opus":0.1249770218027673,"gpt":0.3774357172780239,"spread":0.2524586954752567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003378814,0.0001251268,0.0002368894,0.0003079418,0.0001107448,0.00008878129,0.001992403,0.00007391456,0.00001534155],"category_scores_gemma":[0.0002030908,0.00009337987,0.00006590293,0.001792028,0.0004977733,0.0005982172,0.0006663791,0.0001443584,0.0000149851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004004936,"about_ca_system_score_gemma":0.00007828458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004772589,"about_ca_topic_score_gemma":0.00000361556,"domain_scores_codex":[0.9979486,0.0003445459,0.0004058451,0.0005791071,0.0003592679,0.0003626265],"domain_scores_gemma":[0.9987015,0.0002532979,0.0001617804,0.000621758,0.0001522253,0.0001094776],"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":[9.834288e-7,0.0001139895,0.001153248,0.000007496112,0.000001264429,0.000008289569,0.0009724537,0.00001879071,0.001187549,0.540207,0.000003903627,0.456325],"study_design_scores_gemma":[0.0002970685,0.000521743,0.1167521,0.00001376729,0.000003500753,0.00005703696,0.00001623066,0.2108845,0.02158941,0.6491762,0.0003595901,0.0003288568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003069485,0.00003490069,0.9908699,0.00005331736,0.001058017,0.0001695795,1.178518e-7,0.00009826876,0.004646419],"genre_scores_gemma":[0.47915,0.000001324328,0.5207399,0.00006453307,0.00002494463,0.000007720833,8.593611e-8,0.000001547395,0.000009956841],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4760805,"threshold_uncertainty_score":0.380792,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014379452","doi":"10.2168/lmcs-8(4:2)2012","title":"Linear-use CPS translations in the Enriched Effect Calculus","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Danish Agency for Science and Higher Education; Engineering and Physical Sciences Research Council; Forsknings- og Innovationsstyrelsen","keywords":"Linear logic; Metalanguage; Equivalence (formal languages); Lambda calculus; Translation (biology); Calculus (dental); Intuitionistic logic; Mathematics; Isomorphism (crystallography); Computer science; Discrete mathematics; Algebra over a field; Programming language; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1038552551256379,"gpt":0.4012062757632336,"spread":0.2973510206375957,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01254239,0.0002067083,0.0003099562,0.000242234,0.0002245268,0.0004033261,0.002496842,0.0001126999,0.00000435686],"category_scores_gemma":[0.0004994887,0.0001182868,0.00009757616,0.003064995,0.0003728585,0.00117886,0.0003962767,0.000418828,0.00002792001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006581387,"about_ca_system_score_gemma":0.00005744404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008924236,"about_ca_topic_score_gemma":0.00001319881,"domain_scores_codex":[0.9954697,0.002094868,0.000421965,0.0006082291,0.0005656881,0.0008395453],"domain_scores_gemma":[0.9963294,0.002551393,0.00008887123,0.0008038612,0.00005529364,0.0001711545],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000503707,0.0002862136,0.02253745,0.00001527822,0.000003292024,0.00002898219,0.005107722,0.000748734,0.0008672416,0.3878786,0.00001807718,0.5825034],"study_design_scores_gemma":[0.0008541173,0.000560238,0.2293674,0.00001333122,0.000008401556,0.0001582507,0.00002886282,0.7232397,0.001072822,0.0384928,0.005584888,0.0006192751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009535328,0.0002056885,0.9872652,0.0003960372,0.00137702,0.0004607547,1.429498e-7,0.0001055647,0.00065426],"genre_scores_gemma":[0.5374542,0.000002221551,0.4620241,0.000354085,0.0001227305,0.00003299828,2.209124e-7,0.000002676652,0.000006709799],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7224909,"threshold_uncertainty_score":0.4823596,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2954304163","doi":"10.23638/lmcs-17(1:9)2021","title":"Computing Probabilistic Bisimilarity Distances for Probabilistic Automata","year":2021,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Probabilistic logic; Computer science; Probabilistic automaton; Probabilistic CTL; Theoretical computer science; Automaton; Probabilistic analysis of algorithms; Programming language; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06591931980726415,"gpt":0.4080842784368488,"spread":0.3421649586295846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006250663,0.0002754577,0.0004836993,0.0001704896,0.0005144781,0.000807377,0.002571722,0.00009525374,0.000007049867],"category_scores_gemma":[0.00346375,0.0002244393,0.0001245625,0.002605624,0.0006035753,0.0004915679,0.001673438,0.0004392459,0.00000456791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001349156,"about_ca_system_score_gemma":0.00040083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001038032,"about_ca_topic_score_gemma":0.000006440976,"domain_scores_codex":[0.9954943,0.0008118559,0.0005992987,0.001659852,0.0005843406,0.0008503725],"domain_scores_gemma":[0.9953909,0.002781154,0.0001740226,0.001062163,0.000357326,0.0002344329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004150894,0.0002549909,0.000482855,0.00009530874,0.000003831006,0.00004991794,0.0003230459,0.01781939,0.0003168931,0.1393363,0.00002949604,0.8412839],"study_design_scores_gemma":[0.0003202851,0.0001435772,0.005585358,0.00006800153,0.000003235276,0.00005272023,0.000004845108,0.8507817,0.0003624004,0.1413487,0.001047323,0.0002818563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003321628,0.0001165262,0.9921159,0.001570592,0.001697263,0.000395661,0.000002993653,0.0003696395,0.0004098216],"genre_scores_gemma":[0.06980336,0.000003303943,0.9293717,0.0005656652,0.0001892014,0.00003008145,0.000001950945,0.000008235625,0.00002649503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.841002,"threshold_uncertainty_score":0.9152369,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2969568901","doi":"10.23638/lmcs-17(2:9)2021","title":"LNL-FPC: The Linear/Non-linear Fixpoint Calculus","year":2021,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Future Earth","funders":"Air Force Office of Scientific Research; Multidisciplinary University Research Initiative; Agence Nationale de la Recherche","keywords":"Recursion (computer science); Linear programming; Linear logic; Categorical variable; Type theory; Type (biology); Computer science; Mathematics; Algorithm; Theoretical computer science; Algebra over a field; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1071441326577812,"gpt":0.3993179498776132,"spread":0.2921738172198319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.01209536,0.0006672509,0.001050668,0.0003373846,0.0005488953,0.001710644,0.009717641,0.0005345303,0.00002324335],"category_scores_gemma":[0.0008555239,0.0004184456,0.0004337191,0.002728321,0.001263086,0.0004850367,0.01548856,0.002174351,0.00005106272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002661354,"about_ca_system_score_gemma":0.0009075768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002916193,"about_ca_topic_score_gemma":0.00002431873,"domain_scores_codex":[0.9913661,0.001916901,0.001157756,0.002837895,0.001396121,0.001325155],"domain_scores_gemma":[0.993863,0.001316809,0.000496962,0.003423113,0.0005023734,0.0003976698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000832666,0.0004327057,0.0005089461,0.0001771262,0.0000407643,0.0005510313,0.003466155,0.03821145,0.0004530933,0.1229746,0.0001477662,0.8330281],"study_design_scores_gemma":[0.0002362988,0.0001691853,0.001787285,0.0000638435,0.000009985445,0.0001188796,0.00003064021,0.945077,0.001465199,0.04753982,0.002858225,0.0006436144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001107165,0.0006419927,0.9849673,0.00139399,0.009371337,0.000832347,9.634069e-7,0.0003068901,0.001378],"genre_scores_gemma":[0.1682583,0.00004482965,0.8293273,0.001319032,0.0008345484,0.0001103108,0.000003008449,0.00001739728,0.00008529933],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9068656,"threshold_uncertainty_score":0.9998267,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083734106","doi":"10.2168/lmcs-8(2:8)2012","title":"Width and size of regular resolution proofs","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Resolution (logic); Mathematical proof; Set (abstract data type); Mathematics; Contrast (vision); Discrete mathematics; Computer science; Combinatorics; Geometry; Programming language; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04588101883095425,"gpt":0.3607944482569391,"spread":0.3149134294259848,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006552019,0.0001186394,0.0002275387,0.0001008449,0.0001000405,0.00008583034,0.001143922,0.00006235523,0.000004890986],"category_scores_gemma":[0.0004461749,0.00008876089,0.00003425078,0.001164849,0.0006450792,0.0009377563,0.001102254,0.0001373968,0.000002026806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003429247,"about_ca_system_score_gemma":0.00003233661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005941081,"about_ca_topic_score_gemma":1.856084e-7,"domain_scores_codex":[0.9979984,0.0004415713,0.0002963246,0.0004588794,0.0003357437,0.0004690776],"domain_scores_gemma":[0.9982251,0.0009017657,0.0001082568,0.0005496114,0.00005492057,0.0001603541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003738569,0.0001038173,0.00227009,0.00001447763,0.000001480949,0.000002735924,0.000537448,0.00009430807,0.01421313,0.2495444,0.00001344487,0.7332009],"study_design_scores_gemma":[0.0002714693,0.0002079538,0.2103188,0.00006204665,0.000002648644,0.0000685896,0.000007371647,0.5319167,0.02153001,0.2349934,0.0003587613,0.0002622817],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05960877,0.0004175795,0.9387904,0.0002169525,0.0004896184,0.0001155264,2.482302e-7,0.00006920421,0.0002916821],"genre_scores_gemma":[0.3725104,0.000006591537,0.6272467,0.0001795585,0.00004661183,0.000003747713,3.352439e-8,0.000001811213,0.000004554046],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7329386,"threshold_uncertainty_score":0.3619564,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2791126244","doi":"10.23638/lmcs-15(1:11)2019","title":"The Subpower Membership Problem for Finite Algebras with Cube Terms","year":2019,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; Austrian Science Fund; National Science Foundation","keywords":"Mathematics; Subalgebra; Variety (cybernetics); Tuple; Constraint satisfaction problem; Finite set; Cube (algebra); Combinatorics; Set (abstract data type); Discrete mathematics; Direct product; Product (mathematics); Algebra over a field; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06249495354962712,"gpt":0.36465759795694,"spread":0.3021626444073128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.01183633,0.0005495118,0.0006887467,0.0002720041,0.0004975126,0.001981911,0.009346114,0.0003016087,0.000007850077],"category_scores_gemma":[0.000410211,0.0003031729,0.0002132075,0.001303532,0.001212173,0.0005587667,0.006384614,0.001050891,0.00001611547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001586975,"about_ca_system_score_gemma":0.0004473426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001207954,"about_ca_topic_score_gemma":0.000006259302,"domain_scores_codex":[0.9941374,0.0008417609,0.0006931431,0.002241473,0.0008752542,0.001210944],"domain_scores_gemma":[0.9898961,0.006554465,0.0004408443,0.002638399,0.0002430805,0.0002270959],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005603518,0.0001709939,0.0006620497,0.0001674961,0.00003254215,0.00003380965,0.001156167,0.03091119,0.0002796523,0.3573934,0.0001464972,0.6089902],"study_design_scores_gemma":[0.0002781987,0.0002575231,0.001651577,0.0001922566,0.00000612197,0.00002043958,0.000006561038,0.5879402,0.0007524862,0.4070502,0.001389688,0.0004547358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001827327,0.0002136489,0.9905211,0.001637311,0.002871137,0.001453664,0.000004400889,0.0002700402,0.001201387],"genre_scores_gemma":[0.04728418,0.00002443922,0.9509834,0.001123111,0.0002040561,0.0002555741,0.000002081751,0.00002189932,0.0001012362],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6085355,"threshold_uncertainty_score":0.9999421,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2891275543","doi":"10.46298/lmcs-17(4:8)2021","title":"Dagger linear logic for categorical quantum mechanics","year":2021,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Mathematical and Theoretical Analysis","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Categorical quantum mechanics; Categorical variable; Mathematics; Hilbert space; Linear logic; Cartesian closed category; Pure mathematics; Algebra over a field; Quantum process; Quantum; Discrete mathematics; Quantum mechanics; Physics; Quantum dynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.22944892524853,"gpt":0.4759483359231271,"spread":0.246499410674597,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008605105,0.0005119652,0.001515617,0.0002685765,0.0001879458,0.0003064171,0.002035314,0.0005726601,0.0002562357],"category_scores_gemma":[0.007712417,0.0003483641,0.0005934804,0.001250991,0.0006628825,0.00009378171,0.003986972,0.001156051,0.00001081118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001558131,"about_ca_system_score_gemma":0.0002223066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006448103,"about_ca_topic_score_gemma":0.000002106687,"domain_scores_codex":[0.9945251,0.0008732362,0.001173759,0.001713102,0.0008258114,0.0008889658],"domain_scores_gemma":[0.9907311,0.00690387,0.0003085289,0.001237731,0.0004526916,0.0003660461],"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.00001145291,0.0004878342,0.00000211579,0.0003949305,0.00002603202,0.00004034386,0.0001575606,0.0004854563,0.0002063874,0.9826673,0.00002945981,0.01549116],"study_design_scores_gemma":[0.00009752048,0.0000704718,0.000002992647,0.00007443406,0.00004515851,0.000009899232,0.00001395613,0.4669925,0.0004029767,0.5320015,0.00002956023,0.0002590349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001339685,0.00009628714,0.9950035,0.0009349582,0.001469272,0.0006227226,0.000006806968,0.0001369064,0.0003898811],"genre_scores_gemma":[0.02393368,0.00002270679,0.9748563,0.0005385621,0.0004441919,0.0001447324,0.00000638347,0.00002602836,0.0000273938],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.466507,"threshold_uncertainty_score":0.9998968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3129914072","doi":"10.46298/lmcs-18(1:33)2022","title":"A tier-based typed programming language characterizing Feasible Functionals","year":2022,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Type inference; Computer science; Oracle; Decidability; Programming language; Characterization (materials science); Class (philosophy); Type (biology); Theoretical computer science; Complexity class; Inference; Time complexity; Discrete mathematics; Mathematics; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.08669493134337099,"gpt":0.3739833435503497,"spread":0.2872884122069788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006249811,0.0002095388,0.0003208121,0.0003999475,0.0006494742,0.0005108446,0.002326673,0.00005540558,0.00006405859],"category_scores_gemma":[0.0001832897,0.000175719,0.0001062598,0.002986859,0.0002440497,0.0004746525,0.001531146,0.0004327055,0.0000212779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002124218,"about_ca_system_score_gemma":0.0002598315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004091705,"about_ca_topic_score_gemma":0.000001875346,"domain_scores_codex":[0.9961285,0.0008656106,0.0004168281,0.00101602,0.0008399308,0.000733127],"domain_scores_gemma":[0.9983791,0.0004328107,0.0001889404,0.0007258942,0.00009020244,0.0001831023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001295563,0.0003011777,0.001748024,0.0000218258,0.000005177065,0.0001140543,0.0009354066,0.001352297,0.007032583,0.08129447,0.00002999006,0.9071521],"study_design_scores_gemma":[0.00127142,0.001501638,0.0165454,0.00001881863,0.000008622222,0.0002356867,0.0001749833,0.8954111,0.005114345,0.02985466,0.04875693,0.001106345],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005541941,0.0001565752,0.990315,0.0004814508,0.002130441,0.000404169,6.058725e-7,0.0003317239,0.0006381162],"genre_scores_gemma":[0.3818722,5.350475e-7,0.6169214,0.000917376,0.000108878,0.0001181777,0.00000158714,0.000006256653,0.00005357589],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9060457,"threshold_uncertainty_score":0.7165612,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389935239","doi":"10.46298/lmcs-19(4:30)2023","title":"Categorical composable cryptography: extended version","year":2023,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Computer science; Theoretical computer science; Correctness; Cryptography; String (physics); Set (abstract data type); Bipartite graph; Computer security; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.07016060689756048,"gpt":0.4156168826556735,"spread":0.3454562757581131,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004220317,0.0001960293,0.0002807628,0.001000448,0.0004575028,0.0003971613,0.002326907,0.00007450722,0.00003702299],"category_scores_gemma":[0.00009321795,0.0001574019,0.0001227151,0.01068775,0.0005054451,0.000736349,0.001538989,0.0002911969,0.00007128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006587981,"about_ca_system_score_gemma":0.00009704736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004227418,"about_ca_topic_score_gemma":0.00000368462,"domain_scores_codex":[0.9967033,0.0004241157,0.0004169763,0.000970279,0.0006795202,0.000805755],"domain_scores_gemma":[0.9980733,0.0007389427,0.00008043486,0.0007457826,0.0001242614,0.0002373116],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008378418,0.0002103753,0.003369896,0.00001064513,0.000005357282,0.00009772764,0.0006858582,0.001197755,0.003058612,0.5604648,0.0006391814,0.4302514],"study_design_scores_gemma":[0.0003600456,0.0001804126,0.07841855,0.000008005289,0.000001806095,0.00002189604,0.00002473545,0.6448644,0.0008718263,0.273449,0.001548659,0.0002506109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02649531,0.00002697535,0.9703931,0.0008404068,0.001170251,0.0001969573,0.000001262185,0.0004210039,0.0004547271],"genre_scores_gemma":[0.2446964,0.00002278269,0.7548372,0.0003712412,0.00004588567,0.00001757305,0.000002237032,0.000003842703,0.000002826507],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6436667,"threshold_uncertainty_score":0.6418663,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2571030091","doi":"10.23638/lmcs-13(3:12)2017","title":"A Note on the Topologicity of Quantale-Valued Topological Spaces","year":2017,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"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":"Mathematics; Monad (category theory); Distributivity; Ultrafilter; Topological space; Closure (psychology); Subcategory; Distributive property; Functor; Category of topological spaces; Pure mathematics; Joins; Closed set; Axiom of choice; Generalization; Combinatorics; Discrete mathematics; Set (abstract data type); Set theory; Topological tensor product; Functional analysis; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.4273946473904031,"gpt":0.5560023223505905,"spread":0.1286076749601874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts","open_science"],"consensus_categories":["metaresearch","open_science"],"category_scores_codex":[0.05521927,0.0004430916,0.001251612,0.0004588169,0.0007216804,0.0009469463,0.01228634,0.0005873051,0.0002722936],"category_scores_gemma":[0.04709253,0.0002078937,0.0004303152,0.0009672629,0.009234551,0.0002003364,0.008848672,0.001807033,0.00005515914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001072018,"about_ca_system_score_gemma":0.0003783669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006941349,"about_ca_topic_score_gemma":0.00001071698,"domain_scores_codex":[0.9878547,0.005521744,0.001259423,0.002091157,0.002553431,0.0007195228],"domain_scores_gemma":[0.9696857,0.02544683,0.0008174494,0.003450201,0.000391806,0.0002080378],"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.0001862223,0.0004405026,0.002369159,0.0000197288,0.0000104301,0.00009091481,0.001401266,0.006757914,0.001090606,0.7466553,0.0001913628,0.2407866],"study_design_scores_gemma":[0.0001366624,0.0003731465,0.02416907,0.00009767343,0.000005353471,0.0000106253,0.00006952617,0.04654212,0.002831287,0.9252303,0.0002403481,0.0002938982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.290116,0.0001075049,0.6938164,0.004037051,0.003490777,0.0004612659,0.00001295947,0.00004918506,0.007908847],"genre_scores_gemma":[0.5791457,0.00001736733,0.419717,0.0009004407,0.0001546543,0.00001804412,2.905064e-7,0.000004294123,0.00004215062],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2890297,"threshold_uncertainty_score":0.9991676,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2526743241","doi":"10.23638/lmcs-13(3:24)2017","title":"Well Behaved Transition Systems","year":2017,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Undecidable problem; Decidability; Mathematical proof; Monotone polygon; Monotonic function; Class (philosophy); Mathematics; Discrete mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.143999148359379,"gpt":0.4313153526342025,"spread":0.2873162042748235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.01632008,0.0005610759,0.000905949,0.0007326262,0.0005740361,0.002637001,0.01151209,0.0006226815,0.00000801684],"category_scores_gemma":[0.0006581072,0.0004984249,0.0002216235,0.0009414974,0.001243476,0.00143158,0.005637602,0.001633711,0.00004524587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004294764,"about_ca_system_score_gemma":0.0004694963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001230857,"about_ca_topic_score_gemma":0.000001841296,"domain_scores_codex":[0.9919754,0.002160673,0.001068294,0.002602238,0.001213898,0.0009794472],"domain_scores_gemma":[0.9936085,0.0005403446,0.0007880929,0.004349056,0.0003782951,0.0003357058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001637439,0.000311043,0.0001182285,0.000269058,0.0000139313,0.0001071059,0.001531127,0.09003322,0.001716848,0.1712801,0.000062013,0.7345409],"study_design_scores_gemma":[0.0002006681,0.0001225274,0.004414124,0.0002777748,0.000008024163,0.00005058588,0.000004751376,0.9361137,0.001848499,0.05590095,0.0004720567,0.0005862967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001819865,0.0002948061,0.9812293,0.0004073048,0.01261395,0.0008968617,0.000004439557,0.0003944056,0.002339081],"genre_scores_gemma":[0.03623079,0.00005936862,0.9628463,0.0002657572,0.0003943046,0.0001549735,0.000003370591,0.00001736385,0.00002781786],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8460805,"threshold_uncertainty_score":0.9997467,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2626008201","doi":"10.23638/lmcs-17(2:3)2021","title":"Semipullbacks of labelled Markov processes","year":2021,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Markov chain; Computer science; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.06453886262054401,"gpt":0.398004675370218,"spread":0.333465812749674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005986946,0.0001842501,0.0003938019,0.0002535449,0.0001310506,0.0001836372,0.002740606,0.0001056211,0.00002608895],"category_scores_gemma":[0.003118679,0.0001564417,0.00006290827,0.005944808,0.000613722,0.0008943342,0.001640949,0.000279823,0.000007995674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000755337,"about_ca_system_score_gemma":0.0005408921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004494084,"about_ca_topic_score_gemma":0.000001512515,"domain_scores_codex":[0.9963196,0.0009192659,0.0006233116,0.0009881919,0.0006447386,0.0005049198],"domain_scores_gemma":[0.9967234,0.001092922,0.0002189071,0.001148693,0.0006666067,0.0001494335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008102811,0.0002710247,0.001252213,0.0001183397,0.000004585605,0.00004041098,0.000622464,0.0008928136,0.04001093,0.09865484,0.00002327958,0.858101],"study_design_scores_gemma":[0.0003822077,0.0001913293,0.01128334,0.0001204658,0.000003778389,0.0001090039,0.00001731779,0.4918161,0.4345991,0.06043888,0.0006590522,0.0003793966],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007265506,0.0002713917,0.9888969,0.0002486746,0.0009675933,0.0001447523,7.4153e-7,0.0001031281,0.002101336],"genre_scores_gemma":[0.02679638,0.00004534779,0.972647,0.0004081391,0.00005005266,0.00001606146,4.143351e-7,0.000005419405,0.00003118987],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8577216,"threshold_uncertainty_score":0.637951,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2788097449","doi":"10.23638/lmcs-14(3:19)2018","title":"Free complete Wasserstein algebras","year":2018,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Algebra over a field; Mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1406983269864013,"gpt":0.4210002686829048,"spread":0.2803019416965035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002547676,0.0001902651,0.0003506941,0.0001448016,0.0002407406,0.0001326395,0.001832444,0.0001037398,0.0001188402],"category_scores_gemma":[0.001104305,0.0001402411,0.00007330378,0.001046252,0.001122373,0.0001919117,0.00112882,0.0002472121,0.000012358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007872599,"about_ca_system_score_gemma":0.00006370453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001612611,"about_ca_topic_score_gemma":0.000005827937,"domain_scores_codex":[0.9975823,0.0003439003,0.0003883583,0.0006487987,0.0004999959,0.0005366938],"domain_scores_gemma":[0.9975997,0.001093118,0.0001063855,0.0008925966,0.0001449838,0.0001632372],"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.000009125929,0.00004363895,0.0001350488,0.000006890561,0.000003346973,0.000006293897,0.0002591284,0.000007937004,0.001200994,0.960816,0.0001506952,0.03736085],"study_design_scores_gemma":[0.000330297,0.0002386676,0.00184121,0.00002221211,0.000003871175,0.00001246736,0.00000835098,0.02672943,0.00229179,0.9680328,0.0002937568,0.0001951104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1534042,0.00001647856,0.8424749,0.0002469013,0.002053423,0.0001581373,0.000001000493,0.00009156873,0.001553348],"genre_scores_gemma":[0.3404777,7.507268e-7,0.6587326,0.0003964512,0.0003684361,0.000005668564,9.225511e-8,0.000006911167,0.00001135943],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1870735,"threshold_uncertainty_score":0.5718865,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2785025127","doi":"10.23638/lmcs-16(4:14)2020","title":"Theory of higher order interpretations and application to Basic Feasible Functions","year":2020,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Future Earth","funders":"Agence Nationale de la Recherche","keywords":"Abstract interpretation; Interpretation (philosophy); Bounding overwatch; Computer science; Order (exchange); Domain theory; Domain (mathematical analysis); Mathematics; Functional programming; Algebra over a field; Algorithm; Theoretical computer science; Programming language; Discrete mathematics; Pure mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.08470821163239607,"gpt":0.3855110188118949,"spread":0.3008028071794988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002697826,0.000254471,0.0004770589,0.0003609398,0.0001476578,0.0003463747,0.002200543,0.0001739004,0.000009511065],"category_scores_gemma":[0.0003336158,0.0002044742,0.000079857,0.002232195,0.0004982901,0.0002526538,0.004055781,0.0004732244,0.00001929727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007778057,"about_ca_system_score_gemma":0.0002041468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003965885,"about_ca_topic_score_gemma":0.000004335468,"domain_scores_codex":[0.9966356,0.0006710252,0.0005461485,0.001381541,0.0004109026,0.0003548348],"domain_scores_gemma":[0.9975569,0.0006927589,0.0002393326,0.0009829259,0.0002793497,0.0002487442],"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.000005793492,0.00007284324,0.0003393803,0.00006188902,0.000008427183,0.000002583666,0.0009833821,0.002959686,0.0008979354,0.5094913,0.00002617604,0.4851507],"study_design_scores_gemma":[0.0001471901,0.0002334498,0.01197684,0.00003423486,0.00001128974,0.000008755349,0.00001748532,0.3029465,0.0004041683,0.6821086,0.001766008,0.0003454929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002959958,0.0001780053,0.9943387,0.001068361,0.001740757,0.0007041553,0.000001628669,0.0001602305,0.001512155],"genre_scores_gemma":[0.3640795,0.000004133044,0.6351774,0.0004991672,0.00008489881,0.0001095396,0.000001208466,0.000005498141,0.0000386615],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4848052,"threshold_uncertainty_score":0.8338215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3082202956","doi":"10.23638/lmcs-17(1:3)2021","title":"2-adjoint equivalences in homotopy type theory","year":2021,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"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":"Mathematics; Homotopy; Type (biology); Pure mathematics; Cofibration; Type theory; Homotopy category; Algebra over a field; n-connected; Regular homotopy","retraction":null,"screen_n_in":null,"score":{"opus":0.1724431189938663,"gpt":0.4691749533310873,"spread":0.2967318343372209,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01328491,0.0003992888,0.001048269,0.0004783478,0.0001125015,0.00016036,0.00235819,0.0006972966,0.0005062601],"category_scores_gemma":[0.004189171,0.000326079,0.000156027,0.001355542,0.002197869,0.0001297906,0.004817858,0.001940191,0.00001153896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001908251,"about_ca_system_score_gemma":0.0005774102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002861494,"about_ca_topic_score_gemma":0.00003368103,"domain_scores_codex":[0.9924911,0.003732999,0.0009145936,0.001565095,0.0004513638,0.0008448489],"domain_scores_gemma":[0.9934923,0.00473473,0.0002661555,0.001195096,0.0001610995,0.0001505895],"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.00005191515,0.0007096957,0.00298654,0.000266863,0.00002680397,0.001034031,0.003318331,0.0006591185,0.0009775861,0.6737481,0.00002807004,0.316193],"study_design_scores_gemma":[0.0001838185,0.0001656859,0.005049803,0.0002688433,0.00001103519,0.00008958187,0.00008269813,0.008865394,0.001670023,0.9832027,0.00002871903,0.0003817169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2529974,0.0004496702,0.740123,0.0004070616,0.003700068,0.0003578948,0.000001265628,0.00008659644,0.001877074],"genre_scores_gemma":[0.1900928,0.00008437064,0.80902,0.0005182194,0.0001687554,0.0000510883,0.000001268888,0.00001252591,0.00005094969],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3158112,"threshold_uncertainty_score":0.9999191,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3121836531","doi":"10.46298/lmcs-18(3:14)2022","title":"Tameness and the power of programs over monoids in DA","year":2022,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Morphism; Monoid; Class (philosophy); Regular language; Mathematics; Characterization (materials science); Hierarchy; Expressive power; Complexity class; Pure mathematics; Discrete mathematics; Algebra over a field; Computer science; Time complexity; Automaton; Programming language; Physics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04480822537424823,"gpt":0.3572987186146682,"spread":0.31249049324042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009294976,0.0001158778,0.0002734944,0.0001844997,0.0001673684,0.0001763831,0.002388194,0.00002762264,0.0000138813],"category_scores_gemma":[0.0001023215,0.00007287782,0.00004369805,0.002208283,0.001091959,0.0003247404,0.003424456,0.0002875101,3.600538e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004999264,"about_ca_system_score_gemma":0.00005833371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004439917,"about_ca_topic_score_gemma":0.000001132528,"domain_scores_codex":[0.9971713,0.00110208,0.00033737,0.0005824114,0.000460764,0.0003460215],"domain_scores_gemma":[0.9983,0.0009172079,0.0001046409,0.0005942145,0.0000261926,0.00005770696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001917066,0.000154167,0.003064547,0.000005325603,0.000001632179,0.00001828748,0.002211715,0.001389387,0.0007172478,0.3536723,0.000003695612,0.6387426],"study_design_scores_gemma":[0.0008090852,0.0002084758,0.03536131,0.00001534421,9.515712e-7,0.00003048699,0.00006783372,0.7540573,0.0004299418,0.2086766,0.0001890571,0.0001536275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2535905,0.0001588283,0.7451154,0.0003668969,0.0003872266,0.0001957751,3.134377e-7,0.00003102304,0.0001540922],"genre_scores_gemma":[0.5287877,0.000003036214,0.4707348,0.00042925,0.000007430709,0.00003315474,6.1813e-8,0.000001793387,0.000002703927],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7526679,"threshold_uncertainty_score":0.4437899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2796695740","doi":"10.23638/lmcs-14(4:12)2018","title":"Reasoning with Finite Sets and Cardinality Constraints in SMT","year":2018,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"York University; National Science Foundation","keywords":"Cardinality (data modeling); Computer science; Venn diagram; Theoretical computer science; Satisfiability; DPLL algorithm; Automated reasoning; Boolean satisfiability problem; Intersection (aeronautics); Answer set programming; Satisfiability modulo theories; Propositional calculus; Modular design; Algorithm; Mathematics; Programming language; Logic programming; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.1017787013046702,"gpt":0.4146159754084892,"spread":0.3128372741038189,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.01728413,0.0004569063,0.0007746341,0.0006181016,0.0001915596,0.0007348629,0.003485517,0.0003560489,0.000006488408],"category_scores_gemma":[0.001551803,0.0003687971,0.00006709967,0.002096783,0.003386541,0.000737913,0.005877026,0.001331951,0.000004392015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002806762,"about_ca_system_score_gemma":0.0004540589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006978351,"about_ca_topic_score_gemma":0.000009249893,"domain_scores_codex":[0.9930615,0.002172631,0.0007654615,0.002370804,0.0007860521,0.0008435405],"domain_scores_gemma":[0.9961041,0.001229458,0.0003945238,0.001732053,0.0002674068,0.0002724502],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002319771,0.000098218,0.01319168,0.0001021095,0.000008347682,0.00009950971,0.001454605,0.005984161,0.0001069905,0.04051732,0.000003948996,0.9384099],"study_design_scores_gemma":[0.000277155,0.0002414524,0.1509098,0.0004783572,0.000004378461,0.00009261349,0.000009319635,0.7855839,0.0006390175,0.06121155,0.00004475563,0.0005077809],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03859809,0.0001110626,0.9580728,0.0001509088,0.001321454,0.0005103347,0.000003441644,0.0001426487,0.001089293],"genre_scores_gemma":[0.1128612,0.00002129906,0.8866792,0.0002886102,0.00008230814,0.00005429127,0.000001017458,0.000009725367,0.000002323001],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9379022,"threshold_uncertainty_score":0.9998764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2766389817","doi":"10.23638/lmcs-15(2:10)2019","title":"A Denotational Semantics for SPARC TSO","year":2019,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Scheme for Promotion of Academic and Research Collaboration","keywords":"Denotational semantics of the Actor model; Normalisation by evaluation; Denotational semantics; Programming language; Computer science; Modular design; Semantics (computer science); Axiom; Principle of compositionality; Operational semantics; Theoretical computer science; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1115958262895373,"gpt":0.4331970286915267,"spread":0.3216012024019893,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005800433,0.0003787868,0.0006213684,0.0006085263,0.0002202161,0.0008652711,0.005309213,0.0003177169,0.000004288893],"category_scores_gemma":[0.000632976,0.0003381685,0.0001950469,0.001203326,0.0003801792,0.0003411941,0.005744197,0.0007054634,0.00001025084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001859503,"about_ca_system_score_gemma":0.0006377338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008077063,"about_ca_topic_score_gemma":7.248535e-7,"domain_scores_codex":[0.9955815,0.0004852434,0.0007100787,0.001822157,0.0006950399,0.0007059989],"domain_scores_gemma":[0.995829,0.001764104,0.0003719036,0.001376985,0.0004891377,0.0001688777],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008007434,0.0001526107,0.0003610267,0.0001194166,0.000009643109,0.000009248195,0.0003734375,0.6605313,0.0001711811,0.1152483,0.0003805415,0.2226352],"study_design_scores_gemma":[0.0001735909,0.000105103,0.001271116,0.000108649,0.000003086569,0.0000100653,7.435488e-7,0.7942411,0.0008054601,0.2025571,0.0003685977,0.0003553976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003779544,0.000118487,0.9937708,0.001021822,0.002936413,0.0008815817,0.000004441528,0.0004847377,0.0004036971],"genre_scores_gemma":[0.01806283,0.00002571594,0.9805397,0.001005858,0.0002151869,0.00009015177,0.000005284473,0.00001353609,0.00004170478],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2222798,"threshold_uncertainty_score":0.999907,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2972042414","doi":"10.46298/lmcs-17(3:3)2021","title":"The Complexity of Reachability in Affine Vector Addition Systems with States","year":2021,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; European Commission","keywords":"Undecidable problem; Reachability; Decidability; Parameterized complexity; Affine transformation; Reachability problem; Computational complexity theory","retraction":null,"screen_n_in":null,"score":{"opus":0.1152495549883317,"gpt":0.3819331628623088,"spread":0.2666836078739772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01011914,0.0001583273,0.0003434607,0.000140706,0.0001848492,0.000250711,0.001830444,0.00006387172,0.000004119913],"category_scores_gemma":[0.001110037,0.0001002144,0.00004078619,0.003269182,0.002026584,0.0006251349,0.000743888,0.0003170611,0.000001621946],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001861019,"about_ca_system_score_gemma":0.0002170474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009244152,"about_ca_topic_score_gemma":0.00004868371,"domain_scores_codex":[0.9953266,0.002191575,0.0006315839,0.0007884841,0.0006107059,0.0004510674],"domain_scores_gemma":[0.9963428,0.001791963,0.0002309884,0.001172778,0.0003691919,0.00009231218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003336709,0.0002829077,0.001596778,0.00005286036,0.000004034066,0.00002286098,0.0006730753,0.01128255,0.00424618,0.6020893,0.000008340553,0.3797077],"study_design_scores_gemma":[0.000225552,0.0002180562,0.1027032,0.00007714293,0.000001231803,0.00003756217,0.00003986666,0.8348071,0.0111833,0.05035842,0.0001924415,0.000156133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02044722,0.0001316286,0.9775636,0.0005485428,0.0007138683,0.0002686149,0.000003013494,0.00005530279,0.0002681895],"genre_scores_gemma":[0.1812685,0.00001587578,0.8185887,0.00005587604,0.00002949612,0.00003209818,0.000001167567,0.000003167306,0.00000505124],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8235245,"threshold_uncertainty_score":0.7467033,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078894142","doi":"10.2168/lmcs-9(3:7)2013","title":"Universal codes of the natural numbers","year":2013,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Natural number; Set (abstract data type); Code (set theory); Sequence (biology); Construct (python library); Binary code; Code word; Linear code","retraction":null,"screen_n_in":null,"score":{"opus":0.02978916721921781,"gpt":0.3276873502673526,"spread":0.2978981830481348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001929871,0.0001117909,0.0001731365,0.0001456342,0.0001656703,0.0001517992,0.003558463,0.00004131216,0.00001743572],"category_scores_gemma":[0.0001483198,0.00006728566,0.0001006094,0.002574194,0.001118814,0.0006295598,0.001443394,0.0002409406,0.000006130786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003098457,"about_ca_system_score_gemma":0.00006453163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000404377,"about_ca_topic_score_gemma":0.000002213656,"domain_scores_codex":[0.9981214,0.0005407784,0.0002196692,0.0004436818,0.0003439931,0.0003304535],"domain_scores_gemma":[0.998346,0.0007048439,0.00009246371,0.0006750879,0.0001042005,0.00007735933],"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.000002208391,0.00005245496,0.002437816,0.000004341702,0.000002752481,0.000002077098,0.0004689522,0.0003084089,0.008032018,0.5488802,0.00003567066,0.4397731],"study_design_scores_gemma":[0.0002222197,0.0001102179,0.09606051,0.00004278687,0.000002226508,0.00002100321,0.00002528461,0.3846957,0.01199795,0.506371,0.0002201074,0.0002310581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06934281,0.00003071222,0.9276736,0.0005063398,0.001103892,0.0001331892,1.585614e-7,0.00005454331,0.001154772],"genre_scores_gemma":[0.4695355,9.770644e-7,0.5301699,0.0002704166,0.00001411108,0.000002411514,1.421848e-8,0.000001044375,0.000005629533],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4395421,"threshold_uncertainty_score":0.6612568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2766112195","doi":"10.23638/lmcs-16(2:13)2020","title":"Forward Analysis for WSTS, Part III: Karp-Miller Trees","year":2020,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Miller; Computer science; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.1480144954118037,"gpt":0.4090043323672111,"spread":0.2609898369554073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006636492,0.0002958362,0.0006611343,0.0004851577,0.0003031731,0.000450785,0.004140629,0.0001391491,0.00002337834],"category_scores_gemma":[0.001390769,0.0002397041,0.0003074142,0.007872328,0.0005510654,0.001115771,0.001253255,0.0003049172,0.00001451091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001070595,"about_ca_system_score_gemma":0.0001239675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008946207,"about_ca_topic_score_gemma":0.00000339213,"domain_scores_codex":[0.9953786,0.0007044001,0.0007816001,0.001630967,0.0006929387,0.0008115483],"domain_scores_gemma":[0.9968169,0.001161535,0.0002524837,0.001093876,0.0002445949,0.0004305791],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003714447,0.0001226916,0.00171127,0.00002227238,0.00005493243,0.00000890349,0.001454034,0.02727295,0.001851217,0.1594167,0.0002083111,0.8078395],"study_design_scores_gemma":[0.0003639007,0.0003162327,0.01103056,0.000009415189,0.00002760874,0.000003735245,0.00001127785,0.9643423,0.004817542,0.0140165,0.004719356,0.0003415984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001353323,0.00007861744,0.9945264,0.00183211,0.001032313,0.0004768569,0.000002978037,0.0002618795,0.0004355259],"genre_scores_gemma":[0.03597959,0.00001447984,0.9606092,0.003033902,0.0002412144,0.00009607527,0.000001690607,0.000008686414,0.00001515839],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9370693,"threshold_uncertainty_score":0.9774849,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2765883112","doi":"10.23638/lmcs-14(1:12)2018","title":"Automated Synthesis of Distributed Self-Stabilizing Protocols","year":2018,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"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":"Mutual exclusion; Computer science; Token ring; Dijkstra's algorithm; Distributed computing; Monotonic function; Protocol (science); Ideal (ethics); Self-stabilization; State (computer science); Set (abstract data type); Security token; Leader election; Theoretical computer science; Distributed algorithm; Topology (electrical circuits); Algorithm; Computer network; Mathematics; Graph; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.07643261077141357,"gpt":0.4151600025821575,"spread":0.338727391810744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.009663428,0.0005901433,0.00140612,0.0004811847,0.0002234735,0.0007591104,0.00827292,0.0005072672,0.000009470324],"category_scores_gemma":[0.001307627,0.0004823378,0.0002655452,0.003368758,0.001055841,0.0005718092,0.00776829,0.0008125947,0.00001228119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003653276,"about_ca_system_score_gemma":0.0007715753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004151576,"about_ca_topic_score_gemma":0.000001798048,"domain_scores_codex":[0.9921795,0.001551874,0.001651232,0.002366311,0.001211938,0.001039207],"domain_scores_gemma":[0.9937001,0.001422823,0.0009734521,0.002792749,0.0007912607,0.0003195406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009054365,0.004081894,0.007998783,0.003866244,0.0001906815,0.0003223276,0.003403479,0.05142085,0.009219136,0.05599479,0.001448349,0.8619629],"study_design_scores_gemma":[0.0002177082,0.0001691542,0.009463785,0.001153928,0.00000779836,0.000022367,0.000003976429,0.9666253,0.009374866,0.01183021,0.0005504405,0.0005804703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002816737,0.00004716446,0.9881549,0.000173458,0.001511168,0.005544846,0.00006599996,0.00130102,0.0003846422],"genre_scores_gemma":[0.1001122,0.000004230708,0.8970812,0.00006942101,0.0001431471,0.002570451,0.000003968134,0.00001396655,0.000001370161],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9152045,"threshold_uncertainty_score":0.9997628,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403876945","doi":"10.46298/lmcs-20(4:9)2024","title":"Sum and Tensor of Quantitative Effects","year":2024,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; UK Research and Innovation","keywords":"Monad (category theory); Algebraic number; Mathematics; Algebra over a field; Tensor product; Distributive property; Tensor (intrinsic definition); Algebraic theory; Categorical variable; Computer science; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0814397467822359,"gpt":0.4078122885297696,"spread":0.3263725417475337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003653518,0.0001415263,0.0003002618,0.0002782091,0.00007962251,0.0003410312,0.001021119,0.00006525359,0.000001686361],"category_scores_gemma":[0.0003400277,0.00009473774,0.00005262936,0.001742643,0.00065104,0.0004889002,0.000711999,0.0001855726,0.000008754359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002988522,"about_ca_system_score_gemma":0.00007494832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002843512,"about_ca_topic_score_gemma":0.000001853227,"domain_scores_codex":[0.9978311,0.0004333833,0.0003017203,0.0007480764,0.0003298182,0.0003559046],"domain_scores_gemma":[0.9975721,0.001805707,0.00005887736,0.0003675837,0.0000807786,0.0001149472],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001318152,0.0000268217,0.0004520394,0.00008004411,0.000003159043,0.00004201458,0.000633933,0.00003238626,0.002286426,0.6180715,0.000007790661,0.3783626],"study_design_scores_gemma":[0.0001639362,0.0006923083,0.01333214,0.00005952832,0.000003983519,0.00006389283,0.0000125464,0.6726699,0.006649124,0.3052403,0.0008783321,0.0002339449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005300198,0.001300633,0.9907152,0.0001777433,0.001555119,0.0002085453,1.534755e-7,0.0001352107,0.0006071792],"genre_scores_gemma":[0.4136696,0.000009713309,0.586201,0.00007045062,0.00002830963,0.000007509971,4.428042e-8,0.00000233292,0.00001112222],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6726376,"threshold_uncertainty_score":0.3863293,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2521832422","doi":"10.23638/lmcs-13(1:1)2017","title":"Logical compactness and constraint satisfaction problems","year":2017,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"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":"Compact space; Constraint satisfaction problem; Constraint (computer-aided design); Mathematics; Axiom; Hierarchy; Ultrafilter; Local consistency; Constraint satisfaction; Constraint logic programming; Discrete mathematics; Pure mathematics; Probabilistic logic; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1790849006281343,"gpt":0.4639551405760599,"spread":0.2848702399479256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.01021362,0.000536696,0.0009189717,0.0006489702,0.0006960686,0.002050163,0.005725055,0.0004297003,0.00001383061],"category_scores_gemma":[0.001070016,0.0004242634,0.0001373324,0.0008206278,0.005080994,0.001006236,0.0131899,0.002174148,0.000008929011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002406327,"about_ca_system_score_gemma":0.0004090697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006564135,"about_ca_topic_score_gemma":0.00001253985,"domain_scores_codex":[0.9928744,0.001529493,0.0007049546,0.002669226,0.001090391,0.001131529],"domain_scores_gemma":[0.9946309,0.0016423,0.0004587317,0.002429613,0.0003078025,0.000530672],"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.000009567154,0.00008199122,0.003290958,0.00008233535,0.000008056617,0.00008414413,0.0003276451,0.007122217,0.001093768,0.1406995,0.000005385978,0.8471944],"study_design_scores_gemma":[0.0002391391,0.0001443216,0.06161649,0.0001794577,0.000002582379,0.000107605,0.000003750384,0.3752865,0.0003422114,0.561587,0.0000636735,0.0004271979],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01602267,0.000310453,0.9792175,0.0008364352,0.001847894,0.0008230365,0.00000477157,0.0002389623,0.0006982621],"genre_scores_gemma":[0.3212909,0.00007662131,0.6783199,0.0001506272,0.0000917353,0.00005386652,7.364935e-7,0.000008600442,0.00000703125],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8467672,"threshold_uncertainty_score":0.9998209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4417316699","doi":"10.46298/lmcs-21(4:30)2025","title":"Approximating Queries on Probabilistic Graphs","year":2025,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Ministry of Education, India; Agence Nationale de la Recherche; National Research Foundation; Deutsche Forschungsgemeinschaft; National Research Foundation Singapore","keywords":"Probabilistic logic; Conjunctive query; Hyperbolic tree; Probabilistic database; Bounded function; Time complexity; Probabilistic analysis of algorithms; Focus (optics); Binary number; Treewidth","retraction":null,"screen_n_in":null,"score":{"opus":0.07204387294373597,"gpt":0.3981254690196539,"spread":0.3260815960759179,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004101625,0.0002043189,0.0003024227,0.0004213199,0.0002878006,0.0004929231,0.002495871,0.00007029985,0.000003101501],"category_scores_gemma":[0.0008186786,0.0001580094,0.00006273116,0.003205905,0.0006249158,0.0004323804,0.0009721711,0.0003913456,0.000008508208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008780656,"about_ca_system_score_gemma":0.0002010381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001078361,"about_ca_topic_score_gemma":0.000001347016,"domain_scores_codex":[0.9971083,0.0004441144,0.0004652775,0.001044339,0.0003863933,0.0005515555],"domain_scores_gemma":[0.9978467,0.001006628,0.00008798416,0.000814338,0.0001275931,0.0001167731],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002072821,0.00005476208,0.00008893295,0.00001132156,9.923052e-7,0.000005368679,0.000102875,0.003460254,0.0003271067,0.5719424,0.000007513438,0.4239963],"study_design_scores_gemma":[0.00007307974,0.00008627222,0.001234525,0.00008008692,8.212368e-7,0.000004342998,0.000002686637,0.5627656,0.001084502,0.434508,0.00003815139,0.0001219531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003969647,0.00005399383,0.9900711,0.0008446729,0.0009384276,0.0001909604,2.412654e-7,0.000244438,0.003686497],"genre_scores_gemma":[0.2186601,0.00000374641,0.7799118,0.001356595,0.00001793188,0.00002779311,9.69286e-8,0.000002430997,0.00001953711],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5593054,"threshold_uncertainty_score":0.6443435,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2989637082","doi":"10.46298/lmcs-19(4:10)2023","title":"A categorical characterization of relative entropy on standard Borel spaces","year":2023,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Categorical variable; Functor; Convexity; Kullback–Leibler divergence; Borel set; Pure mathematics; Uniqueness; Entropy (arrow of time); Discrete mathematics; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.06528314090497818,"gpt":0.3759013701157279,"spread":0.3106182292107498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003029872,0.000170857,0.0003475392,0.0004414372,0.0001489418,0.0001927554,0.001542887,0.00008861229,0.000006227273],"category_scores_gemma":[0.000290206,0.0001207052,0.00006942013,0.004368126,0.0003508554,0.0005979812,0.0007993744,0.0002549085,0.00002534412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009105285,"about_ca_system_score_gemma":0.0001019928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006305191,"about_ca_topic_score_gemma":2.955229e-7,"domain_scores_codex":[0.9971599,0.0004750469,0.0004018089,0.0007883382,0.0006866381,0.0004882878],"domain_scores_gemma":[0.9983001,0.0007128632,0.0001690843,0.0005612392,0.000120819,0.0001358329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002674294,0.0001066416,0.0008909161,0.00001006929,0.000004138114,0.00006006035,0.0009492758,0.001182283,0.01549874,0.5025999,0.00002606042,0.4786452],"study_design_scores_gemma":[0.0003153679,0.0008813678,0.07593266,0.00003146528,0.000001967064,0.000008432399,0.000006833032,0.7723433,0.006152689,0.1435916,0.0004984819,0.000235777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0448318,0.000008052377,0.9523413,0.00112279,0.0008214262,0.0001853678,0.000002261775,0.0001629689,0.0005240558],"genre_scores_gemma":[0.2569861,0.00002395869,0.742649,0.0002626428,0.00005644529,0.00001010368,0.000001303314,0.00000383891,0.000006645625],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7711611,"threshold_uncertainty_score":0.4922215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}