{"meta":{"query_hash":"7900f94e49c1","filters":{"venue":"Logical Methods in Computer Science"},"cohort_total":55,"direct_labels_cover":0,"predictions_cover":55,"exported":55,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/7900f94e49c1","api":"https://metacan.xera.ac/api/v1/cohort?venue=Logical+Methods+in+Computer+Science"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.16129164546768482,"score_gpt":0.4418393829298686,"score_spread":0.28054773746218375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791050365","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01520986,0.000043652817,0.98225564,0.0006111681,0.0006336632,0.00035401812,5.765275e-7,0.000085592,0.00080584525],"genre_scores_gemma":[0.22161329,0.000001853993,0.7781966,0.000120064695,0.000030786276,0.000023307588,8.4101394e-8,0.0000032239375,0.000010812363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968041,0.00059676834,0.00042354717,0.0008513865,0.00075692084,0.0005672693],"domain_scores_gemma":[0.9978698,0.00040087732,0.000098022494,0.0008223769,0.0003826788,0.0004262367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076709185,0.00015103804,0.00029137972,0.0006542836,0.00007627837,0.00012336785,0.00249739,0.00005791674,0.0000040777354],"category_scores_gemma":[0.00083615154,0.00011699464,0.000058484206,0.005079174,0.0011359088,0.00064307876,0.0013814183,0.00025898163,0.000009550178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014983902,0.0001445272,0.00033765074,0.000009877818,0.0000025161924,0.000011668121,0.0014046057,0.019818872,0.026863988,0.25442383,0.000033253593,0.6969342],"study_design_scores_gemma":[0.00045071807,0.00094852346,0.0025206262,0.000071931594,0.0000012157928,0.00010732596,0.00004121512,0.23791,0.026538672,0.7306441,0.00044116826,0.00032448888],"about_ca_topic_score_codex":0.000012456704,"about_ca_topic_score_gemma":0.0000012186619,"teacher_disagreement_score":0.69660974,"about_ca_system_score_codex":0.0000871358,"about_ca_system_score_gemma":0.00021604773,"threshold_uncertainty_score":0.4770903},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07838646274783868,"score_gpt":0.38487381166368845,"score_spread":0.3064873489158498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1819959283","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05336129,0.00013379658,0.9437238,0.0010839457,0.0011952181,0.0002496012,9.777249e-7,0.00013371896,0.00011765459],"genre_scores_gemma":[0.061017513,0.0000024681365,0.9379702,0.00079412956,0.0001782524,0.00002061251,3.225238e-7,0.0000058965084,0.00001061503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976856,0.00027683508,0.00033913035,0.0008698633,0.00032483978,0.0005037042],"domain_scores_gemma":[0.9982746,0.00064544403,0.000075060525,0.00047698308,0.00016731769,0.00036059797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004184337,0.00018133299,0.00025836998,0.00026015862,0.0003191087,0.00045068577,0.001313836,0.00008099837,0.0000010428392],"category_scores_gemma":[0.00049752166,0.00013712166,0.00004901918,0.0014953415,0.00039470644,0.0004387871,0.0009903471,0.00023686264,0.0000034007044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043258187,0.00006155273,0.0012570199,0.000005508764,0.0000029641128,0.000010105418,0.0009661687,0.031024816,0.00044672162,0.09094933,0.00015394788,0.87511754],"study_design_scores_gemma":[0.00033396875,0.0002495949,0.0024719157,0.000013711482,0.0000014314315,0.00003483442,0.000006089864,0.9224094,0.00058310054,0.07225288,0.0014422595,0.00020082302],"about_ca_topic_score_codex":0.000007781769,"about_ca_topic_score_gemma":0.0000015389384,"teacher_disagreement_score":0.8913846,"about_ca_system_score_codex":0.000062363055,"about_ca_system_score_gemma":0.00020277532,"threshold_uncertainty_score":0.55916595},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.12497702180276728,"score_gpt":0.37743571727802394,"score_spread":0.2524586954752567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974090329","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030694846,0.00003490069,0.9908699,0.000053317362,0.0010580175,0.00016957946,1.17851805e-7,0.00009826876,0.004646419],"genre_scores_gemma":[0.47915003,0.0000013243281,0.52073985,0.000064533066,0.000024944626,0.000007720833,8.593611e-8,0.0000015473954,0.000009956841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979486,0.00034454587,0.0004058451,0.0005791071,0.00035926787,0.00036262648],"domain_scores_gemma":[0.99870145,0.00025329785,0.00016178044,0.000621758,0.00015222533,0.000109477565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003378814,0.00012512678,0.00023688942,0.00030794184,0.00011074477,0.000088781286,0.001992403,0.00007391456,0.000015341546],"category_scores_gemma":[0.0002030908,0.000093379866,0.00006590293,0.0017920281,0.0004977733,0.00059821724,0.00066637906,0.00014435845,0.000014985097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.834288e-7,0.00011398953,0.0011532482,0.000007496112,0.0000012644294,0.000008289569,0.00097245374,0.000018790708,0.001187549,0.540207,0.0000039036267,0.456325],"study_design_scores_gemma":[0.00029706847,0.00052174303,0.116752125,0.000013767289,0.000003500753,0.00005703696,0.000016230659,0.21088451,0.021589406,0.6491762,0.00035959008,0.00032885684],"about_ca_topic_score_codex":0.000047725895,"about_ca_topic_score_gemma":0.00000361556,"teacher_disagreement_score":0.47608054,"about_ca_system_score_codex":0.000040049355,"about_ca_system_score_gemma":0.00007828458,"threshold_uncertainty_score":0.38079202},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.16511784447448183,"score_gpt":0.4470196305774615,"score_spread":0.28190178610297967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976808588","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012422537,0.00044352523,0.9962875,0.00022130183,0.0009467931,0.0003741146,0.000006678581,0.00020197283,0.00027585373],"genre_scores_gemma":[0.007738225,0.000017660741,0.99128455,0.00064628903,0.00022856257,0.000052837127,0.0000033113336,0.0000066719085,0.000021886248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694616,0.00037612318,0.0005156544,0.0011170022,0.00039170342,0.0006533806],"domain_scores_gemma":[0.9977937,0.0007203287,0.00014392719,0.0010345886,0.00015185906,0.00015563861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003747248,0.00022877195,0.00039006228,0.0001988222,0.00028734223,0.00022437678,0.0018153635,0.00008063786,0.0000051052566],"category_scores_gemma":[0.00018629499,0.00016927668,0.00008723946,0.0015935694,0.0004584022,0.0016774898,0.0007017678,0.0001531232,0.0000049268065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039628985,0.00009842367,0.0001265547,0.00001413536,7.393645e-7,0.000010284097,0.00006523333,0.0030583995,0.0023455662,0.7437157,0.000028722485,0.25053227],"study_design_scores_gemma":[0.0004794946,0.00045101714,0.008362839,0.00005380847,0.0000022451038,0.000037661295,0.000008511197,0.7229289,0.002643634,0.24549456,0.019086746,0.00045058993],"about_ca_topic_score_codex":0.00006168259,"about_ca_topic_score_gemma":0.000043904452,"teacher_disagreement_score":0.7198705,"about_ca_system_score_codex":0.00007801124,"about_ca_system_score_gemma":0.00009983086,"threshold_uncertainty_score":0.6902903},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08537728207017845,"score_gpt":0.39757137192269176,"score_spread":0.3121940898525133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980738047","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026891073,0.00034460245,0.9911976,0.00033176498,0.0031798808,0.0003187245,3.723139e-7,0.0002657817,0.001672176],"genre_scores_gemma":[0.07836675,0.000018357025,0.9203317,0.00094004563,0.00029419613,0.000034087938,2.4675518e-7,0.0000063849106,0.000008228095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954978,0.0011390148,0.00065356196,0.0007605749,0.0007125865,0.001236458],"domain_scores_gemma":[0.9962791,0.0022727645,0.00016682186,0.0008216684,0.000091290814,0.00036834014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018292543,0.00027255117,0.0006553273,0.00049531227,0.00043714448,0.0005033664,0.0031437008,0.00009293151,0.000019216386],"category_scores_gemma":[0.00041716883,0.00020650717,0.00021103275,0.002655964,0.0009771669,0.00265409,0.0023354974,0.0004703832,0.000023050343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050026658,0.00010721099,0.0001413629,0.0000070494466,0.0000044114263,0.000007840616,0.0013600236,0.00041491352,0.0002819039,0.38003942,0.00000568315,0.6175802],"study_design_scores_gemma":[0.0057213865,0.000040439947,0.0015801565,0.000036024547,0.0000034001018,0.00009050344,0.000012906778,0.71756065,0.0013482913,0.27292988,0.00032674617,0.0003496291],"about_ca_topic_score_codex":0.000032740103,"about_ca_topic_score_gemma":6.8988686e-7,"teacher_disagreement_score":0.71714574,"about_ca_system_score_codex":0.000093424125,"about_ca_system_score_gemma":0.00006770107,"threshold_uncertainty_score":0.8421118},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10385525512563785,"score_gpt":0.4012062757632336,"score_spread":0.2973510206375957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014379452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0095353285,0.00020568846,0.9872652,0.00039603724,0.0013770197,0.00046075467,1.4294984e-7,0.00010556468,0.00065426005],"genre_scores_gemma":[0.53745425,0.0000022215509,0.46202412,0.00035408497,0.0001227305,0.00003299828,2.2091243e-7,0.0000026766518,0.0000067097985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954697,0.002094868,0.000421965,0.00060822914,0.0005656881,0.0008395453],"domain_scores_gemma":[0.9963294,0.002551393,0.00008887123,0.0008038612,0.00005529364,0.00017115448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012542394,0.00020670827,0.00030995623,0.00024223397,0.00022452677,0.0004033261,0.002496842,0.000112699905,0.0000043568602],"category_scores_gemma":[0.0004994887,0.000118286815,0.000097576165,0.003064995,0.0003728585,0.0011788601,0.00039627668,0.00041882796,0.00002792001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050370695,0.00028621356,0.022537446,0.000015278225,0.000003292024,0.000028982186,0.0051077222,0.000748734,0.00086724164,0.3878786,0.00001807718,0.5825034],"study_design_scores_gemma":[0.00085411733,0.000560238,0.22936738,0.000013331218,0.000008401556,0.00015825071,0.00002886282,0.72323966,0.0010728218,0.038492795,0.0055848877,0.0006192751],"about_ca_topic_score_codex":0.00008924236,"about_ca_topic_score_gemma":0.000013198806,"teacher_disagreement_score":0.7224909,"about_ca_system_score_codex":0.000065813874,"about_ca_system_score_gemma":0.00005744404,"threshold_uncertainty_score":0.48235965},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04414340357003216,"score_gpt":0.3956531001013638,"score_spread":0.35150969653133163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015360324","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050672013,0.0003745923,0.9466478,0.0007578526,0.00048848114,0.00014157117,4.0852362e-7,0.00010478844,0.0008124617],"genre_scores_gemma":[0.4096119,0.0000037226378,0.5896401,0.0006847001,0.00004993792,0.000002222941,5.349799e-8,0.000002428144,0.000004935421],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974781,0.0005197633,0.00044365195,0.0006688889,0.0003383188,0.00055125915],"domain_scores_gemma":[0.9964061,0.0021371958,0.00015413215,0.0010847764,0.000093050265,0.00012474925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014010745,0.0001632119,0.00026899195,0.00022069493,0.00020568966,0.00014375002,0.002927926,0.00007724176,0.000011084674],"category_scores_gemma":[0.0004058112,0.00009457077,0.00008142734,0.0021495074,0.0010059193,0.00039164608,0.001407548,0.00023946841,0.0000052212745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020216219,0.00004611862,0.000050472278,0.0000045639176,0.0000017364996,0.0008022348,0.0003877362,0.00013846629,0.0043079113,0.433153,0.000012361636,0.5610934],"study_design_scores_gemma":[0.00037645095,0.00032908807,0.014312971,0.00005789703,0.0000059883296,0.003426988,0.0002006044,0.40397203,0.05858261,0.51788205,0.0004167466,0.00043657844],"about_ca_topic_score_codex":0.00004544073,"about_ca_topic_score_gemma":0.000009237301,"teacher_disagreement_score":0.5606568,"about_ca_system_score_codex":0.00004153529,"about_ca_system_score_gemma":0.000042464973,"threshold_uncertainty_score":0.54408634},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08777243278367756,"score_gpt":0.42680655950871127,"score_spread":0.3390341267250337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051749751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00975434,0.000012629338,0.98814523,0.000128177,0.0009195513,0.00041189056,0.0000034545453,0.00009155002,0.0005331984],"genre_scores_gemma":[0.11549487,0.0000074675418,0.8841896,0.0002389877,0.000044774526,0.000010158229,5.7204136e-7,0.0000072273756,0.000006335542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966886,0.00034263384,0.0010361386,0.0007207024,0.00059781753,0.00061409775],"domain_scores_gemma":[0.994631,0.003237633,0.00050941913,0.001189635,0.00028532677,0.00014699294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014364216,0.00020778165,0.00049473665,0.0005000515,0.00010244611,0.00007322334,0.003016062,0.00014512624,0.0000049197083],"category_scores_gemma":[0.0023653088,0.00017415664,0.000120055214,0.0030001805,0.0008574051,0.00065576873,0.0012443532,0.00021959336,0.000002738284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000405368,0.00024107011,0.0018584094,0.00010157243,0.0000064242718,0.0000058897117,0.0008566893,0.004765077,0.019923573,0.18897745,0.000014934787,0.7832084],"study_design_scores_gemma":[0.00039637313,0.0004676651,0.027436037,0.00005471528,0.0000045003017,0.000011213209,0.0000059054264,0.84949565,0.07153967,0.050008222,0.00037291597,0.00020713356],"about_ca_topic_score_codex":0.000013568642,"about_ca_topic_score_gemma":0.0000030052045,"teacher_disagreement_score":0.84473056,"about_ca_system_score_codex":0.00006276395,"about_ca_system_score_gemma":0.00010687007,"threshold_uncertainty_score":0.7101901},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029789167219217805,"score_gpt":0.32768735026735263,"score_spread":0.2978981830481348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078894142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06934281,0.000030712225,0.9276736,0.00050633977,0.0011038921,0.0001331892,1.5856136e-7,0.00005454331,0.0011547715],"genre_scores_gemma":[0.4695355,9.770644e-7,0.5301699,0.00027041664,0.000014111082,0.0000024115136,1.4218481e-8,0.0000010443754,0.0000056295335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812144,0.0005407784,0.00021966916,0.00044368184,0.00034399307,0.0003304535],"domain_scores_gemma":[0.99834603,0.0007048439,0.00009246371,0.00067508785,0.000104200524,0.000077359335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019298706,0.00011179093,0.00017313649,0.00014563423,0.0001656703,0.00015179918,0.0035584627,0.000041312156,0.00001743572],"category_scores_gemma":[0.00014831981,0.00006728566,0.00010060943,0.0025741942,0.0011188142,0.0006295598,0.0014433941,0.00024094056,0.0000061307865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022083912,0.000052454958,0.0024378162,0.0000043417017,0.0000027524811,0.0000020770983,0.00046895223,0.00030840893,0.008032018,0.54888016,0.000035670662,0.43977314],"study_design_scores_gemma":[0.0002222197,0.000110217894,0.09606051,0.000042786873,0.0000022265076,0.000021003207,0.000025284615,0.38469568,0.011997949,0.50637096,0.00022010742,0.00023105809],"about_ca_topic_score_codex":0.0000404377,"about_ca_topic_score_gemma":0.0000022136562,"teacher_disagreement_score":0.43954208,"about_ca_system_score_codex":0.000030984567,"about_ca_system_score_gemma":0.00006453163,"threshold_uncertainty_score":0.66125685},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.045881018830954245,"score_gpt":0.36079444825693907,"score_spread":0.3149134294259848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083734106","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05960877,0.0004175795,0.93879044,0.0002169525,0.0004896184,0.00011552641,2.4823024e-7,0.00006920421,0.00029168208],"genre_scores_gemma":[0.3725104,0.000006591537,0.6272467,0.00017955853,0.000046611825,0.0000037477132,3.3524387e-8,0.0000018112127,0.0000045540455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979984,0.00044157132,0.0002963246,0.00045887943,0.00033574374,0.0004690776],"domain_scores_gemma":[0.9982251,0.00090176566,0.00010825678,0.0005496114,0.00005492057,0.00016035412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065520187,0.00011863941,0.00022753874,0.000100844896,0.00010004055,0.00008583034,0.0011439222,0.000062355226,0.0000048909865],"category_scores_gemma":[0.0004461749,0.00008876089,0.00003425078,0.0011648491,0.00064507924,0.0009377563,0.0011022544,0.0001373968,0.0000020268062],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037385691,0.000103817314,0.0022700902,0.00001447763,0.0000014809493,0.0000027359238,0.00053744804,0.00009430807,0.014213135,0.24954444,0.000013444869,0.7332009],"study_design_scores_gemma":[0.00027146933,0.0002079538,0.2103188,0.00006204665,0.0000026486437,0.0000685896,0.000007371647,0.5319167,0.021530012,0.23499338,0.00035876135,0.00026228165],"about_ca_topic_score_codex":0.0000059410813,"about_ca_topic_score_gemma":1.8560844e-7,"teacher_disagreement_score":0.7329386,"about_ca_system_score_codex":0.00003429247,"about_ca_system_score_gemma":0.000032336608,"threshold_uncertainty_score":0.36195642},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05866841925032519,"score_gpt":0.3937555524694554,"score_spread":0.33508713321913025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102459557","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031442482,0.00024252741,0.96586514,0.00077502336,0.00045911968,0.00037425154,2.6914012e-7,0.00010117999,0.00073999004],"genre_scores_gemma":[0.44802943,0.0000173803,0.5515796,0.00029846004,0.000048175854,0.000021452644,4.0572438e-8,0.0000027989154,0.0000026948533],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963645,0.0012809193,0.00034697462,0.00064539834,0.00052382075,0.000838403],"domain_scores_gemma":[0.99657226,0.0023689282,0.00010670647,0.0006431303,0.000061032715,0.00024794394],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.012218337,0.00017730567,0.00026721798,0.00024004103,0.00041091515,0.0003754753,0.0014967878,0.00006489796,0.000007680923],"category_scores_gemma":[0.0004407375,0.000106917214,0.00005128875,0.0016357749,0.002864116,0.0013969474,0.0014672644,0.0004663989,0.0000087717135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061281094,0.000017484559,0.0060924217,0.00000437159,0.0000015677925,0.0000023396,0.00045304856,0.00007758597,0.0013462495,0.4777658,0.000001549928,0.51423144],"study_design_scores_gemma":[0.0007206462,0.000081002356,0.14196827,0.0000322415,0.0000023863809,0.00019141647,0.000022635937,0.13948996,0.002143741,0.71496,0.00011588426,0.0002718612],"about_ca_topic_score_codex":0.000018691844,"about_ca_topic_score_gemma":0.0000025635866,"teacher_disagreement_score":0.5139596,"about_ca_system_score_codex":0.00007915953,"about_ca_system_score_gemma":0.000048286245,"threshold_uncertainty_score":0.9998495},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.16318232241616554,"score_gpt":0.46939488013791036,"score_spread":0.3062125577217448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121804749","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028937789,0.000026932905,0.9671247,0.0007425809,0.0011707393,0.00019526579,0.000002617685,0.000062131185,0.0017372298],"genre_scores_gemma":[0.4470786,0.0000013205818,0.5528181,0.00007088612,0.000023929137,0.0000047999947,3.6739607e-8,0.0000011521424,0.0000011413051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964453,0.0009347856,0.00042819817,0.00073920586,0.0007681262,0.00068439805],"domain_scores_gemma":[0.9963362,0.0016754317,0.00013235479,0.0013466954,0.0002924481,0.00021683109],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01198497,0.00015139974,0.0002862338,0.000068839596,0.00040929703,0.00022859509,0.005312382,0.00007143544,0.000008654303],"category_scores_gemma":[0.0012807013,0.00009626892,0.000097717675,0.0027386977,0.01591628,0.0004296328,0.0022435514,0.00057417655,0.000005117524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040156974,0.000029712839,0.0025590556,0.0000020021973,0.0000013767637,0.000004896521,0.00002746908,0.000049595103,0.002669058,0.6078993,0.0000016842824,0.38675183],"study_design_scores_gemma":[0.00014042793,0.00009353759,0.09682214,0.0000058546366,6.308954e-7,0.000044809185,0.0000048145002,0.08293665,0.0029000905,0.8168164,0.00011798306,0.00011664142],"about_ca_topic_score_codex":0.000018388004,"about_ca_topic_score_gemma":0.00002290475,"teacher_disagreement_score":0.4181408,"about_ca_system_score_codex":0.00006456799,"about_ca_system_score_gemma":0.00023207373,"threshold_uncertainty_score":0.9871816},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0759905153646028,"score_gpt":0.3791849483817478,"score_spread":0.303194433017145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128992690","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003528548,0.0001485954,0.9906104,0.00069198315,0.0018165928,0.00022101791,1.1139613e-7,0.00019229353,0.0027904457],"genre_scores_gemma":[0.28381932,0.0000052820965,0.71518075,0.00052981434,0.00037191773,0.000011557761,1.949933e-7,0.00000398835,0.00007713479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969155,0.0005384841,0.0003836439,0.0010011601,0.0005141429,0.000647035],"domain_scores_gemma":[0.99853826,0.00028478072,0.00012695209,0.00069541135,0.00014575396,0.00020883622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038109904,0.00020392108,0.00030219267,0.00024459578,0.00023447371,0.00032166755,0.0022317455,0.000116564115,0.00001857904],"category_scores_gemma":[0.0001481662,0.00014827568,0.00007585841,0.0017234856,0.00045216767,0.0009018916,0.0009622258,0.00029867093,0.00009149892],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025673976,0.00008448264,0.0003062436,0.0000032803619,0.0000019951958,0.000014734972,0.0003758827,0.00073812326,0.0018050913,0.19773601,0.000037982565,0.7988936],"study_design_scores_gemma":[0.00033079053,0.0003771603,0.0066660373,0.00000782354,0.0000024441827,0.00013956291,0.0000046887376,0.7771939,0.0091163935,0.19352293,0.012203512,0.00043474638],"about_ca_topic_score_codex":0.0000419581,"about_ca_topic_score_gemma":0.000007384283,"teacher_disagreement_score":0.7984589,"about_ca_system_score_codex":0.00015431992,"about_ca_system_score_gemma":0.00009640722,"threshold_uncertainty_score":0.6046507},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03957083179911924,"score_gpt":0.38527557279438834,"score_spread":0.3457047409952691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156285174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25006816,0.000026306474,0.74857575,0.00024265621,0.0004617447,0.0001037178,8.103537e-7,0.00010604396,0.00041483794],"genre_scores_gemma":[0.50386494,0.0000016080569,0.4956225,0.00048531362,0.000021269057,0.0000017803694,7.956126e-8,0.0000013339574,0.00000116758],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9973172,0.00034903537,0.00032594943,0.0009895894,0.00041298306,0.0006052287],"domain_scores_gemma":[0.9954185,0.0034850717,0.000080288424,0.0007101987,0.000062492516,0.00024346892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013254837,0.00016913415,0.000248298,0.00015315344,0.00020191414,0.0002604575,0.0015790873,0.000075365366,0.0000064052974],"category_scores_gemma":[0.00087129866,0.0001269938,0.00004008412,0.0013669676,0.0009972388,0.00064596004,0.0008949476,0.0003164301,0.000005258863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061308447,0.00010391337,0.00157033,0.0000035920655,5.662178e-7,0.000029462575,0.00010798494,0.000044689616,0.002236109,0.25926426,0.000002970886,0.73663],"study_design_scores_gemma":[0.00022073807,0.00024357083,0.38236985,0.000024513838,8.4050095e-7,0.00004617741,0.000005930067,0.23733361,0.011464298,0.3679362,0.00009585829,0.0002584362],"about_ca_topic_score_codex":0.00001561941,"about_ca_topic_score_gemma":0.0000030211013,"teacher_disagreement_score":0.7363716,"about_ca_system_score_codex":0.00009540899,"about_ca_system_score_gemma":0.000052141895,"threshold_uncertainty_score":0.51786566},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.1704927727894412,"score_gpt":0.41974565128595376,"score_spread":0.24925287849651256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164124713","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09937117,0.000108008026,0.8967074,0.00046476178,0.0027713678,0.00036156215,0.000005321933,0.00006600873,0.00014441443],"genre_scores_gemma":[0.47749323,7.6448725e-7,0.5218516,0.000344012,0.00027868073,0.000010498489,8.4048486e-7,0.0000078059575,0.000012562173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775255,0.0002925913,0.00038475174,0.0004632484,0.0003981559,0.0007087241],"domain_scores_gemma":[0.9942923,0.0047475947,0.00019158288,0.00040637676,0.0001347385,0.00022738686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023742642,0.00024058628,0.000491363,0.000121263954,0.00028452856,0.00013008477,0.0006710471,0.000108943044,0.000037700804],"category_scores_gemma":[0.0010274418,0.00016818377,0.00011519652,0.0005240716,0.0005132868,0.00031411258,0.00032715884,0.00022653512,0.0000033726294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051300398,0.00020259806,0.0029815568,0.000041460677,0.000013803005,0.0000022416164,0.0007105572,0.0006985408,0.0006487343,0.98633224,0.0003524315,0.00796451],"study_design_scores_gemma":[0.00043743255,0.00011222925,0.009296299,0.000031490406,0.00001025119,0.000009840331,0.000019132758,0.07441601,0.0007436969,0.9136799,0.0009743767,0.0002693419],"about_ca_topic_score_codex":0.000014548415,"about_ca_topic_score_gemma":0.0000020007344,"teacher_disagreement_score":0.37812206,"about_ca_system_score_codex":0.00007658167,"about_ca_system_score_gemma":0.000051853258,"threshold_uncertainty_score":0.6858335},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08219768287444364,"score_gpt":0.41224126299265734,"score_spread":0.3300435801182137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165528704","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05715748,0.000022114078,0.94144344,0.00021318074,0.000473254,0.0003016923,4.6363988e-7,0.00007941431,0.00030898227],"genre_scores_gemma":[0.3951235,0.0000053967665,0.6047651,0.000070896385,0.000023309172,0.0000069773846,1.3081817e-7,0.000002589307,0.0000020800655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972093,0.00032186747,0.00053698773,0.00071024225,0.0006369874,0.0005845814],"domain_scores_gemma":[0.99747163,0.0012644618,0.0001907478,0.000610988,0.0003034238,0.00015873485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010292725,0.00014753084,0.00025688973,0.00054231327,0.00015711827,0.00010529536,0.0013166766,0.00008133452,0.000015052912],"category_scores_gemma":[0.00058548,0.00012208952,0.000050308045,0.0034030012,0.001041097,0.0009030349,0.0006636084,0.00030115613,0.0000049038213],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104231485,0.00007323693,0.012729086,0.000018648569,0.000002133089,0.000009738396,0.0005825463,0.001232449,0.028605256,0.0878105,7.680421e-7,0.8689252],"study_design_scores_gemma":[0.0003911846,0.0003595966,0.36996332,0.00006852454,0.0000011915693,0.00005430674,0.00001825433,0.41668624,0.020350704,0.1917091,0.00012364717,0.00027393672],"about_ca_topic_score_codex":0.000021701802,"about_ca_topic_score_gemma":0.000019783998,"teacher_disagreement_score":0.8686513,"about_ca_system_score_codex":0.00011596626,"about_ca_system_score_gemma":0.000085964486,"threshold_uncertainty_score":0.4978666},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.22226986399824017,"score_gpt":0.4436221654901364,"score_spread":0.22135230149189622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395626435","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037913704,0.00005899824,0.98888206,0.000240451,0.0013938701,0.00019231297,3.4581848e-7,0.000532905,0.0049077063],"genre_scores_gemma":[0.0397356,0.0000040450686,0.9593649,0.00076619466,0.000083485276,0.00002177561,1.7740702e-7,0.0000065715135,0.000017239323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636084,0.0004572345,0.00055558205,0.0011162896,0.0008427352,0.0006673476],"domain_scores_gemma":[0.9973966,0.00035113076,0.00015177362,0.0014148016,0.00026483962,0.00042085882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014519916,0.00021401596,0.0002957256,0.00035916307,0.00014096977,0.00029281265,0.0035521926,0.00012025633,0.0000037396055],"category_scores_gemma":[0.0014280716,0.00017587961,0.00009148429,0.0024674654,0.00057406735,0.0018335282,0.0014537649,0.00039711478,0.00004398807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083318655,0.00014674597,0.0003118053,0.000009099659,0.000001993228,0.00002360254,0.0007366003,0.0691528,0.0018696226,0.35731822,0.00013510996,0.5702861],"study_design_scores_gemma":[0.00016874401,0.00009013025,0.0055707237,0.000013109852,8.0716364e-7,0.00002164219,0.000004555681,0.86194766,0.0024071105,0.12932271,0.00023884636,0.000213956],"about_ca_topic_score_codex":0.00001168501,"about_ca_topic_score_gemma":7.4768303e-7,"teacher_disagreement_score":0.7927949,"about_ca_system_score_codex":0.00024325415,"about_ca_system_score_gemma":0.00036837623,"threshold_uncertainty_score":0.71721625},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.1790849006281343,"score_gpt":0.4639551405760599,"score_spread":0.2848702399479256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521832422","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016022667,0.000310453,0.9792175,0.00083643524,0.0018478938,0.00082303653,0.0000047715703,0.00023896227,0.00069826207],"genre_scores_gemma":[0.32129094,0.00007662131,0.6783199,0.0001506272,0.0000917353,0.000053866515,7.3649346e-7,0.000008600442,0.0000070312503],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928744,0.0015294931,0.00070495455,0.0026692264,0.0010903911,0.0011315289],"domain_scores_gemma":[0.9946309,0.0016422998,0.0004587317,0.002429613,0.0003078025,0.00053067197],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.010213622,0.000536696,0.0009189717,0.0006489702,0.0006960686,0.0020501628,0.005725055,0.00042970033,0.000013830608],"category_scores_gemma":[0.0010700162,0.0004242634,0.00013733242,0.0008206278,0.005080994,0.0010062362,0.013189898,0.0021741479,0.000008929011],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009567154,0.00008199122,0.003290958,0.00008233535,0.000008056617,0.00008414413,0.0003276451,0.0071222167,0.0010937677,0.14069952,0.000005385978,0.84719443],"study_design_scores_gemma":[0.00023913907,0.00014432157,0.06161649,0.00017945767,0.000002582379,0.00010760495,0.0000037503844,0.37528655,0.00034221137,0.56158704,0.0000636735,0.0004271979],"about_ca_topic_score_codex":0.00006564135,"about_ca_topic_score_gemma":0.000012539849,"teacher_disagreement_score":0.8467672,"about_ca_system_score_codex":0.00024063274,"about_ca_system_score_gemma":0.0004090697,"threshold_uncertainty_score":0.99982095},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.14399914835937896,"score_gpt":0.43131535263420245,"score_spread":0.2873162042748235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526743241","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018198651,0.00029480606,0.9812293,0.00040730476,0.012613951,0.00089686166,0.0000044395574,0.00039440556,0.0023390807],"genre_scores_gemma":[0.036230788,0.00005936862,0.9628463,0.0002657572,0.0003943046,0.00015497349,0.0000033705905,0.000017363847,0.000027817858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919754,0.002160673,0.0010682936,0.0026022384,0.0012138984,0.0009794472],"domain_scores_gemma":[0.99360853,0.00054034457,0.0007880929,0.004349056,0.00037829505,0.00033570584],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.016320083,0.00056107587,0.000905949,0.00073262624,0.0005740361,0.0026370005,0.0115120895,0.0006226815,0.00000801684],"category_scores_gemma":[0.0006581072,0.00049842487,0.00022162347,0.00094149745,0.0012434759,0.0014315802,0.005637602,0.0016337106,0.00004524587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016374386,0.00031104303,0.00011822846,0.000269058,0.0000139313015,0.00010710593,0.0015311271,0.09003322,0.0017168476,0.17128015,0.000062013,0.7345409],"study_design_scores_gemma":[0.00020066806,0.00012252745,0.004414124,0.00027777482,0.000008024163,0.00005058588,0.0000047513763,0.9361137,0.0018484988,0.05590095,0.00047205668,0.0005862967],"about_ca_topic_score_codex":0.00012308573,"about_ca_topic_score_gemma":0.0000018412962,"teacher_disagreement_score":0.84608054,"about_ca_system_score_codex":0.00042947644,"about_ca_system_score_gemma":0.00046949633,"threshold_uncertainty_score":0.99974674},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.4273946473904031,"score_gpt":0.5560023223505905,"score_spread":0.12860767496018743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571030091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29011598,0.000107504886,0.6938164,0.0040370505,0.0034907772,0.00046126594,0.00001295947,0.00004918506,0.007908847],"genre_scores_gemma":[0.5791457,0.00001736733,0.41971704,0.0009004407,0.00015465435,0.000018044118,2.9050642e-7,0.000004294123,0.00004215062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9878547,0.0055217445,0.001259423,0.0020911573,0.0025534313,0.0007195228],"domain_scores_gemma":[0.9696857,0.025446832,0.0008174494,0.0034502007,0.00039180604,0.00020803777],"candidate_categories":["metaresearch","sts","open_science"],"consensus_categories":["metaresearch","open_science"],"category_scores_codex":[0.055219274,0.00044309162,0.0012516123,0.00045881694,0.0007216804,0.00094694627,0.012286335,0.0005873051,0.00027229358],"category_scores_gemma":[0.047092535,0.00020789373,0.00043031524,0.0009672629,0.009234551,0.00020033642,0.008848672,0.0018070332,0.000055159137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018622229,0.00044050263,0.0023691591,0.000019728795,0.000010430096,0.00009091481,0.0014012664,0.0067579136,0.001090606,0.74665534,0.00019136276,0.24078657],"study_design_scores_gemma":[0.00013666238,0.0003731465,0.024169065,0.00009767343,0.0000053534714,0.000010625296,0.00006952617,0.046542116,0.0028312872,0.9252303,0.00024034808,0.00029389822],"about_ca_topic_score_codex":0.000069413494,"about_ca_topic_score_gemma":0.000010716976,"teacher_disagreement_score":0.28902975,"about_ca_system_score_codex":0.00010720181,"about_ca_system_score_gemma":0.00037836694,"threshold_uncertainty_score":0.99916756},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Markov chain; Computer science; Mathematics; Statistics","score_opus":0.06453886262054401,"score_gpt":0.398004675370218,"score_spread":0.333465812749674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626008201","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007265506,0.00027139173,0.9888969,0.00024867462,0.0009675933,0.00014475234,7.4152996e-7,0.0001031281,0.0021013357],"genre_scores_gemma":[0.026796384,0.000045347788,0.972647,0.0004081391,0.000050052662,0.000016061456,4.1433512e-7,0.000005419405,0.000031189873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963196,0.0009192659,0.0006233116,0.0009881919,0.0006447386,0.0005049198],"domain_scores_gemma":[0.9967234,0.0010929217,0.00021890708,0.001148693,0.0006666067,0.00014943349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005986946,0.00018425008,0.00039380192,0.0002535449,0.00013105062,0.0001836372,0.0027406064,0.000105621075,0.000026088952],"category_scores_gemma":[0.0031186787,0.00015644175,0.00006290827,0.005944808,0.00061372196,0.0008943342,0.0016409486,0.00027982297,0.000007995674],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008102811,0.00027102474,0.0012522131,0.00011833971,0.0000045856054,0.00004041098,0.000622464,0.00089281355,0.040010933,0.098654844,0.000023279581,0.858101],"study_design_scores_gemma":[0.00038220768,0.00019132934,0.011283341,0.00012046585,0.0000037783886,0.000109003864,0.000017317785,0.49181613,0.4345991,0.060438875,0.0006590522,0.00037939657],"about_ca_topic_score_codex":0.000004494084,"about_ca_topic_score_gemma":0.0000015125147,"teacher_disagreement_score":0.85772157,"about_ca_system_score_codex":0.0000755337,"about_ca_system_score_gemma":0.0005408921,"threshold_uncertainty_score":0.63795096},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.17581771995864062,"score_gpt":0.40642351785911274,"score_spread":0.23060579790047211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726753079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02974012,0.000098270975,0.9664374,0.00007444112,0.002024019,0.0011978167,0.0000018063765,0.00024626302,0.00017987507],"genre_scores_gemma":[0.21134168,0.0000040488053,0.78813475,0.00009475528,0.000099407946,0.00030071312,6.072744e-7,0.000009917406,0.000014139359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952751,0.0007549061,0.0009358759,0.0013164409,0.0008331485,0.00088452635],"domain_scores_gemma":[0.9966384,0.0013103466,0.00036386863,0.001131347,0.0003227341,0.00023326297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010646169,0.00029446222,0.00053992146,0.00071224925,0.0005667075,0.00043028066,0.0032596458,0.00012316855,0.0000014659315],"category_scores_gemma":[0.002840805,0.00023052462,0.00010902218,0.0046746866,0.0009250112,0.0013822858,0.00089061214,0.00034142888,0.0000060188895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003088266,0.0006068644,0.013260644,0.00020268362,0.0000090708,0.000035300174,0.0021940586,0.020759717,0.003579323,0.510959,0.000024797766,0.4483376],"study_design_scores_gemma":[0.00034494387,0.00030467712,0.01674887,0.000047974318,0.000003836648,0.00024371904,0.00001061841,0.97046524,0.0008032387,0.010642345,0.000049215905,0.0003353372],"about_ca_topic_score_codex":0.000031348467,"about_ca_topic_score_gemma":5.523906e-7,"teacher_disagreement_score":0.9497055,"about_ca_system_score_codex":0.00032816836,"about_ca_system_score_gemma":0.00021884916,"threshold_uncertainty_score":0.9400521},"labels":[],"label_agreement":null},{"id":"W2741405093","doi":"10.23638/lmcs-15(3:3)2019","title":"Subspace-Invariant AC$^0$ Formulas","year":2019,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Combinatorics; Mathematics; Invariant (physics); Parity function; Omega; Subspace topology; Hamming weight; Upper and lower bounds; Discrete mathematics; Boolean function; Hamming code; Mathematical analysis; Physics; Pure mathematics; Algorithm; Mathematical physics; Quantum mechanics","score_opus":0.11226766053009571,"score_gpt":0.402389845439322,"score_spread":0.29012218490922626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741405093","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018112743,0.00028340588,0.9842668,0.001304455,0.009126912,0.00073945924,0.000005617266,0.00041771817,0.002044366],"genre_scores_gemma":[0.0305225,0.000058680453,0.9677388,0.0012094354,0.00034918627,0.00005234648,0.0000022480647,0.000017547307,0.000049251463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99212426,0.001017383,0.0009518294,0.0031337573,0.0013475323,0.0014252325],"domain_scores_gemma":[0.9936832,0.0016008642,0.00041789882,0.0035998472,0.00028970803,0.00040848475],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.008532467,0.0006910733,0.0010849276,0.0010112426,0.00033854373,0.0015921675,0.0119870305,0.0005148023,0.00003220235],"category_scores_gemma":[0.00043317064,0.0005831478,0.0003784048,0.0031398118,0.0010375123,0.00089751475,0.021533476,0.002168383,0.00007677163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001096739,0.00031048918,0.00044637415,0.00012476428,0.000018826631,0.00015254538,0.0009007981,0.029817278,0.00042014627,0.31450602,0.00013982833,0.6531519],"study_design_scores_gemma":[0.00021652509,0.00015445266,0.003929472,0.00015360565,0.00000401649,0.00004180177,0.0000029647426,0.67200136,0.0007156731,0.32154283,0.0006546417,0.00058267027],"about_ca_topic_score_codex":0.0000684118,"about_ca_topic_score_gemma":0.000008925913,"teacher_disagreement_score":0.6525693,"about_ca_system_score_codex":0.00031389704,"about_ca_system_score_gemma":0.0007571205,"threshold_uncertainty_score":0.999662},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.11143000463636157,"score_gpt":0.40350800274537085,"score_spread":0.29207799810900925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751513393","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113540456,0.000050854018,0.88319033,0.00041110592,0.0013369101,0.00033776535,7.823456e-7,0.00007287017,0.0010589366],"genre_scores_gemma":[0.38164166,0.000001987585,0.6174213,0.00086226425,0.00003862309,0.000027703962,1.005818e-7,0.0000032739003,0.000003066557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950721,0.00219651,0.0006471486,0.00070109963,0.00064110226,0.00074202934],"domain_scores_gemma":[0.9937294,0.004024334,0.0002804821,0.001589408,0.00018023705,0.00019615146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018681526,0.000224277,0.00037144183,0.00023180818,0.00020304795,0.00013502508,0.003453142,0.00011900338,0.00009498687],"category_scores_gemma":[0.0037275038,0.00013621988,0.00008920599,0.0028970325,0.0012632402,0.001026084,0.0009849694,0.0004991594,0.000021456335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013103658,0.0002820083,0.0006648534,0.000013546159,0.0000026337195,0.0000010596996,0.0005701203,0.00035556595,0.008127069,0.7198038,0.000009225982,0.270157],"study_design_scores_gemma":[0.0002612078,0.00040690062,0.10054443,0.000025709009,0.0000034718248,0.000028404469,0.00001406857,0.53100616,0.043882016,0.32321522,0.0002560262,0.00035638845],"about_ca_topic_score_codex":0.000008289697,"about_ca_topic_score_gemma":5.856356e-7,"teacher_disagreement_score":0.53065056,"about_ca_system_score_codex":0.00011951532,"about_ca_system_score_gemma":0.00009814843,"threshold_uncertainty_score":0.64746815},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06168111032428622,"score_gpt":0.3851971348274723,"score_spread":0.32351602450318606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754485517","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012274584,0.000106824285,0.98402804,0.00049635064,0.0023357687,0.0002524569,7.503693e-7,0.00015663175,0.00034861063],"genre_scores_gemma":[0.29847685,0.000001793992,0.70037067,0.0007414981,0.00037139392,0.000025322915,3.6232103e-7,0.000003436111,0.000008661926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976522,0.00021852805,0.00035047784,0.00052352296,0.00031307514,0.0009422481],"domain_scores_gemma":[0.9980022,0.0011428036,0.00009228804,0.00042908097,0.00009045623,0.00024321124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053932974,0.00017267591,0.00024117017,0.00020847561,0.00029962516,0.00020287909,0.0017257356,0.00006810208,0.000005494835],"category_scores_gemma":[0.00034587967,0.0001298828,0.00008836619,0.0012379232,0.00035627728,0.0022814148,0.0010774961,0.00016406918,0.0000142633435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004279718,0.00005491893,0.00024777532,0.000005174398,0.0000011548261,6.3835154e-7,0.00041618655,0.0003268169,0.0005811406,0.4515234,0.000010751435,0.5468278],"study_design_scores_gemma":[0.00029261678,0.0001774758,0.011020802,0.000013269228,0.0000017833898,0.000021819751,0.000005399177,0.6929476,0.0073553575,0.28660074,0.0013142296,0.00024887253],"about_ca_topic_score_codex":0.0000044113513,"about_ca_topic_score_gemma":5.181128e-7,"teacher_disagreement_score":0.6926208,"about_ca_system_score_codex":0.00006476824,"about_ca_system_score_gemma":0.000088074914,"threshold_uncertainty_score":0.5296467},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07643261077141357,"score_gpt":0.4151600025821575,"score_spread":0.33872739181074396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765883112","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028167374,0.00004716446,0.98815495,0.00017345803,0.0015111679,0.0055448464,0.000065999964,0.0013010198,0.0003846422],"genre_scores_gemma":[0.10011224,0.000004230708,0.8970812,0.00006942101,0.00014314707,0.0025704508,0.0000039681345,0.000013966548,0.0000013701607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99217945,0.0015518743,0.0016512319,0.002366311,0.0012119384,0.0010392066],"domain_scores_gemma":[0.99370015,0.0014228229,0.00097345206,0.0027927489,0.0007912607,0.00031954062],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.009663428,0.0005901433,0.0014061199,0.0004811847,0.00022347351,0.0007591104,0.00827292,0.0005072672,0.000009470324],"category_scores_gemma":[0.0013076273,0.00048233775,0.00026554515,0.0033687584,0.0010558406,0.0005718092,0.00776829,0.0008125947,0.00001228119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090543654,0.004081894,0.007998783,0.003866244,0.00019068149,0.0003223276,0.0034034795,0.05142085,0.009219136,0.055994794,0.0014483494,0.8619629],"study_design_scores_gemma":[0.00021770824,0.00016915415,0.009463785,0.0011539285,0.0000077983605,0.000022367001,0.0000039764286,0.9666253,0.009374866,0.011830205,0.00055044045,0.00058047025],"about_ca_topic_score_codex":0.000041515763,"about_ca_topic_score_gemma":0.0000017980478,"teacher_disagreement_score":0.91520447,"about_ca_system_score_codex":0.00036532764,"about_ca_system_score_gemma":0.0007715753,"threshold_uncertainty_score":0.99976283},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.1480144954118037,"score_gpt":0.40900433236721107,"score_spread":0.26098983695540734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766112195","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001353323,0.00007861744,0.9945264,0.0018321103,0.0010323125,0.00047685686,0.000002978037,0.00026187953,0.00043552587],"genre_scores_gemma":[0.03597959,0.00001447984,0.9606092,0.0030339023,0.0002412144,0.000096075266,0.0000016906072,0.000008686414,0.000015158389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537855,0.0007044001,0.0007816001,0.001630967,0.00069293875,0.00081154826],"domain_scores_gemma":[0.99681693,0.001161535,0.00025248367,0.0010938761,0.00024459494,0.00043057912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066364924,0.00029583625,0.00066113425,0.00048515774,0.00030317315,0.00045078498,0.004140629,0.00013914908,0.000023378338],"category_scores_gemma":[0.0013907691,0.0002397041,0.0003074142,0.007872328,0.0005510654,0.0011157715,0.0012532551,0.00030491716,0.000014510908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003714447,0.00012269158,0.0017112701,0.000022272385,0.00005493243,0.00000890349,0.001454034,0.027272953,0.0018512169,0.15941674,0.00020831109,0.8078395],"study_design_scores_gemma":[0.0003639007,0.00031623268,0.011030564,0.000009415189,0.000027608743,0.0000037352452,0.000011277854,0.9643423,0.004817542,0.014016497,0.004719356,0.00034159838],"about_ca_topic_score_codex":0.000008946207,"about_ca_topic_score_gemma":0.0000033921297,"teacher_disagreement_score":0.9370693,"about_ca_system_score_codex":0.00010705945,"about_ca_system_score_gemma":0.00012396753,"threshold_uncertainty_score":0.97748494},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.11159582628953735,"score_gpt":0.43319702869152665,"score_spread":0.3216012024019893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766389817","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037795442,0.000118486976,0.99377084,0.0010218224,0.0029364126,0.00088158174,0.0000044415283,0.00048473774,0.0004036971],"genre_scores_gemma":[0.018062826,0.000025715935,0.98053974,0.0010058584,0.00021518685,0.00009015177,0.0000052844725,0.000013536093,0.00004170478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955815,0.00048524336,0.00071007875,0.0018221573,0.00069503987,0.00070599886],"domain_scores_gemma":[0.995829,0.0017641044,0.00037190362,0.0013769852,0.0004891377,0.00016887773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005800433,0.00037878682,0.00062136835,0.0006085263,0.0002202161,0.00086527114,0.0053092134,0.00031771688,0.0000042888933],"category_scores_gemma":[0.000632976,0.0003381685,0.00019504692,0.001203326,0.00038017918,0.00034119407,0.0057441974,0.0007054634,0.000010250838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008007434,0.00015261068,0.0003610267,0.00011941658,0.000009643109,0.000009248195,0.00037343748,0.66053134,0.00017118112,0.11524832,0.0003805415,0.22263522],"study_design_scores_gemma":[0.00017359089,0.00010510301,0.0012711162,0.000108648965,0.0000030865685,0.000010065297,7.4354875e-7,0.7942411,0.0008054601,0.20255709,0.00036859766,0.0003553976],"about_ca_topic_score_codex":0.000008077063,"about_ca_topic_score_gemma":7.248535e-7,"teacher_disagreement_score":0.22227982,"about_ca_system_score_codex":0.00018595034,"about_ca_system_score_gemma":0.0006377338,"threshold_uncertainty_score":0.999907},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08470821163239607,"score_gpt":0.38551101881189487,"score_spread":0.3008028071794988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785025127","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029599576,0.00017800528,0.9943387,0.0010683612,0.0017407567,0.0007041553,0.0000016286691,0.00016023047,0.0015121553],"genre_scores_gemma":[0.3640795,0.0000041330436,0.6351774,0.00049916725,0.00008489881,0.000109539564,0.0000012084663,0.0000054981406,0.000038661496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663556,0.0006710252,0.0005461485,0.0013815415,0.00041090258,0.00035483483],"domain_scores_gemma":[0.99755687,0.00069275894,0.00023933261,0.0009829259,0.00027934968,0.00024874418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026978261,0.00025447103,0.00047705893,0.00036093983,0.00014765783,0.0003463747,0.0022005432,0.00017390042,0.000009511065],"category_scores_gemma":[0.00033361575,0.00020447417,0.000079856996,0.0022321949,0.00049829006,0.0002526538,0.0040557813,0.00047322435,0.000019297266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057934917,0.00007284324,0.00033938032,0.00006188902,0.000008427183,0.0000025836657,0.0009833821,0.0029596863,0.00089793536,0.50949126,0.000026176036,0.48515067],"study_design_scores_gemma":[0.00014719009,0.00023344978,0.011976841,0.000034234858,0.000011289743,0.000008755349,0.00001748532,0.3029465,0.0004041683,0.6821086,0.0017660075,0.00034549294],"about_ca_topic_score_codex":0.00003965885,"about_ca_topic_score_gemma":0.000004335468,"teacher_disagreement_score":0.48480517,"about_ca_system_score_codex":0.00007778057,"about_ca_system_score_gemma":0.0002041468,"threshold_uncertainty_score":0.8338215},"labels":[],"label_agreement":null},{"id":"W2785157853","doi":"10.23638/lmcs-15(3:24)2019","title":"Approximability in the GPAC","year":2019,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Computation; Ordinary differential equation; Algebraic number; Computability; Applied mathematics; Discrete mathematics; Differential equation; Algebra over a field; Pure mathematics; Algorithm; Mathematical analysis","score_opus":0.1078568643603079,"score_gpt":0.4167622207046719,"score_spread":0.308905356344364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785157853","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015033505,0.00020760715,0.97291815,0.0025895182,0.0053865365,0.001879725,0.0000032489534,0.00025953574,0.001722168],"genre_scores_gemma":[0.15987433,0.0000128137735,0.8382617,0.001453304,0.00024052926,0.00013772438,0.0000013022318,0.000011428911,0.0000068586055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9858827,0.0050600152,0.0014107177,0.004256766,0.0018696121,0.0015201963],"domain_scores_gemma":[0.987645,0.0055149207,0.00041092496,0.005908449,0.00028897167,0.00023179245],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.02945703,0.0007544759,0.0012394106,0.00074573804,0.00021684465,0.0015473091,0.019974375,0.00054525613,0.00001465616],"category_scores_gemma":[0.0015786681,0.00050607196,0.0003477771,0.0047568195,0.001707828,0.00068944396,0.021310573,0.003262408,0.000036964168],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100991765,0.0010398566,0.006786965,0.00016837985,0.00000635539,0.00012207437,0.0028123327,0.07975657,0.00007786985,0.045001473,0.000042403266,0.8641756],"study_design_scores_gemma":[0.00020336462,0.0001312009,0.05691426,0.000059502032,0.0000023459456,0.000032079464,0.00001113083,0.6463261,0.00008919065,0.29561433,0.00015980455,0.00045667996],"about_ca_topic_score_codex":0.00015343426,"about_ca_topic_score_gemma":0.000017526938,"teacher_disagreement_score":0.8637189,"about_ca_system_score_codex":0.0006781953,"about_ca_system_score_gemma":0.000851405,"threshold_uncertainty_score":0.9997391},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.14069832698640133,"score_gpt":0.4210002686829048,"score_spread":0.28030194169650346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788097449","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15340422,0.000016478562,0.84247494,0.00024690127,0.0020534226,0.00015813728,0.0000010004926,0.00009156873,0.0015533478],"genre_scores_gemma":[0.34047773,7.507268e-7,0.6587326,0.00039645124,0.00036843613,0.000005668564,9.225511e-8,0.0000069111675,0.000011359428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758226,0.00034390032,0.00038835828,0.0006487987,0.00049999595,0.00053669384],"domain_scores_gemma":[0.99759966,0.0010931179,0.000106385516,0.0008925966,0.00014498382,0.00016323717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025476757,0.0001902651,0.00035069414,0.00014480163,0.00024074063,0.00013263951,0.0018324442,0.000103739774,0.00011884017],"category_scores_gemma":[0.0011043053,0.00014024106,0.00007330378,0.0010462517,0.0011223728,0.00019191175,0.00112882,0.00024721207,0.000012358005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009125929,0.00004363895,0.00013504877,0.000006890561,0.0000033469732,0.0000062938966,0.00025912837,0.000007937004,0.0012009939,0.960816,0.00015069517,0.03736085],"study_design_scores_gemma":[0.00033029704,0.00023866764,0.0018412096,0.000022212114,0.0000038711746,0.0000124673625,0.00000835098,0.026729425,0.0022917895,0.96803284,0.00029375678,0.00019511045],"about_ca_topic_score_codex":0.000016126114,"about_ca_topic_score_gemma":0.0000058279365,"teacher_disagreement_score":0.18707351,"about_ca_system_score_codex":0.00007872599,"about_ca_system_score_gemma":0.00006370453,"threshold_uncertainty_score":0.5718865},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06249495354962712,"score_gpt":0.36465759795693997,"score_spread":0.30216264440731283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791126244","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018273267,0.00021364886,0.9905211,0.0016373107,0.0028711366,0.0014536637,0.0000044008893,0.0002700402,0.0012013871],"genre_scores_gemma":[0.04728418,0.000024439216,0.9509834,0.0011231115,0.00020405606,0.00025557406,0.000002081751,0.000021899323,0.000101236205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941374,0.0008417609,0.0006931431,0.0022414734,0.0008752542,0.0012109444],"domain_scores_gemma":[0.9898961,0.006554465,0.0004408443,0.0026383987,0.00024308052,0.00022709588],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.011836331,0.00054951175,0.00068874675,0.00027200405,0.00049751264,0.0019819106,0.0093461145,0.00030160873,0.000007850077],"category_scores_gemma":[0.000410211,0.00030317294,0.0002132075,0.0013035317,0.0012121727,0.0005587667,0.0063846144,0.0010508909,0.000016115475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056035184,0.00017099394,0.00066204974,0.0001674961,0.000032542153,0.000033809654,0.0011561671,0.030911187,0.00027965233,0.35739338,0.00014649723,0.6089902],"study_design_scores_gemma":[0.00027819874,0.0002575231,0.0016515772,0.00019225656,0.0000061219703,0.00002043958,0.0000065610384,0.5879402,0.00075248623,0.40705022,0.0013896876,0.0004547358],"about_ca_topic_score_codex":0.000012079537,"about_ca_topic_score_gemma":0.0000062593017,"teacher_disagreement_score":0.60853547,"about_ca_system_score_codex":0.00015869751,"about_ca_system_score_gemma":0.00044734255,"threshold_uncertainty_score":0.99994206},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.10177870130467023,"score_gpt":0.41461597540848916,"score_spread":0.3128372741038189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796695740","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038598087,0.00011106258,0.9580728,0.0001509088,0.0013214544,0.0005103347,0.0000034416441,0.0001426487,0.001089293],"genre_scores_gemma":[0.112861186,0.000021299058,0.88667923,0.00028861017,0.00008230814,0.000054291268,0.0000010174582,0.000009725367,0.0000023230014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930615,0.0021726305,0.0007654615,0.0023708036,0.0007860521,0.00084354053],"domain_scores_gemma":[0.9961041,0.001229458,0.00039452378,0.0017320525,0.00026740675,0.00027245015],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.01728413,0.0004569063,0.0007746341,0.0006181016,0.00019155962,0.0007348629,0.0034855173,0.00035604887,0.0000064884075],"category_scores_gemma":[0.0015518034,0.00036879707,0.000067099674,0.002096783,0.0033865408,0.000737913,0.0058770264,0.0013319509,0.0000043920154],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023197714,0.000098218,0.013191678,0.00010210945,0.000008347682,0.000099509714,0.0014546047,0.0059841606,0.00010699051,0.040517315,0.000003948996,0.9384099],"study_design_scores_gemma":[0.00027715502,0.00024145244,0.15090975,0.00047835716,0.0000043784607,0.00009261349,0.000009319635,0.78558385,0.0006390175,0.061211545,0.000044755627,0.0005077809],"about_ca_topic_score_codex":0.00006978351,"about_ca_topic_score_gemma":0.000009249893,"teacher_disagreement_score":0.93790215,"about_ca_system_score_codex":0.00028067623,"about_ca_system_score_gemma":0.0004540589,"threshold_uncertainty_score":0.9998764},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.060180768383201945,"score_gpt":0.3714641031173124,"score_spread":0.31128333473411046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889124254","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006481701,0.00015899386,0.9913995,0.00021666322,0.001152239,0.0001835086,0.0000032492637,0.00010277184,0.000301367],"genre_scores_gemma":[0.08419129,0.000017575978,0.91552246,0.000161391,0.00005629261,0.000025958785,0.0000020411899,0.000005720116,0.00001728221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660033,0.0009864335,0.0005280774,0.0008518176,0.00061248994,0.00042087713],"domain_scores_gemma":[0.9970278,0.00095436466,0.00021928088,0.0010250646,0.0006300945,0.00014339412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038388728,0.0001789578,0.00037681058,0.00025991612,0.0001276569,0.00021371804,0.00141069,0.000077371595,0.000020962669],"category_scores_gemma":[0.0007710416,0.00013009222,0.000050476527,0.003345025,0.0005989146,0.0008592409,0.00074280926,0.00027156473,0.0000059915565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026363241,0.00035865032,0.00036763764,0.00007971267,0.0000122154115,0.00011362328,0.0011022575,0.03904534,0.035890963,0.5131468,0.00006683295,0.40978962],"study_design_scores_gemma":[0.00021806253,0.0003036287,0.010823011,0.00015393787,0.0000036066483,0.00014395785,0.000041787087,0.9432083,0.03631449,0.008236547,0.00033145977,0.00022122603],"about_ca_topic_score_codex":0.000018218156,"about_ca_topic_score_gemma":0.0000022866552,"teacher_disagreement_score":0.90416294,"about_ca_system_score_codex":0.00010114228,"about_ca_system_score_gemma":0.00025165686,"threshold_uncertainty_score":0.53050065},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.22944892524853003,"score_gpt":0.4759483359231271,"score_spread":0.24649941067459705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891275543","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013396848,0.00009628714,0.99500346,0.00093495817,0.0014692723,0.0006227226,0.0000068069676,0.00013690635,0.0003898811],"genre_scores_gemma":[0.023933675,0.000022706787,0.9748563,0.00053856213,0.00044419194,0.00014473239,0.00000638347,0.000026028356,0.000027393802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99452513,0.00087323616,0.0011737589,0.0017131023,0.00082581135,0.0008889658],"domain_scores_gemma":[0.9907311,0.0069038696,0.00030852895,0.001237731,0.00045269157,0.00036604612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008605105,0.0005119652,0.0015156167,0.0002685765,0.00018794583,0.00030641712,0.0020353145,0.0005726601,0.0002562357],"category_scores_gemma":[0.007712417,0.00034836415,0.0005934804,0.0012509912,0.00066288246,0.00009378171,0.003986972,0.0011560514,0.0000108111835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000114529075,0.00048783424,0.0000021157905,0.00039493048,0.00002603202,0.000040343864,0.00015756061,0.00048545634,0.00020638735,0.98266727,0.000029459812,0.015491162],"study_design_scores_gemma":[0.00009752048,0.000070471804,0.0000029926473,0.00007443406,0.00004515851,0.000009899232,0.000013956125,0.4669925,0.00040297667,0.5320015,0.000029560226,0.0002590349],"about_ca_topic_score_codex":0.0000064481032,"about_ca_topic_score_gemma":0.0000021066874,"teacher_disagreement_score":0.46650705,"about_ca_system_score_codex":0.00015581315,"about_ca_system_score_gemma":0.00022230658,"threshold_uncertainty_score":0.9998968},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07030176109592952,"score_gpt":0.35459560357403375,"score_spread":0.28429384247810424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921402294","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024707468,0.000050525476,0.9691081,0.00484487,0.0008665881,0.00014946159,6.9759034e-7,0.00009240515,0.00017988781],"genre_scores_gemma":[0.3378366,9.016194e-7,0.6600814,0.0019953053,0.0000800015,0.0000019720922,3.4788176e-8,0.0000028400823,9.800411e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721164,0.00056471885,0.0004320178,0.00076532573,0.00057561765,0.000450709],"domain_scores_gemma":[0.9982324,0.00059558364,0.0001575416,0.0007300984,0.00010134512,0.00018298288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019229143,0.00016950464,0.00033693505,0.00008729205,0.00021028979,0.00014409672,0.004943383,0.00005320094,0.000004384062],"category_scores_gemma":[0.00037532,0.00010058046,0.00012055739,0.0033196171,0.00076361716,0.00019315124,0.0031786854,0.00037957227,0.00000404936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038029352,0.00007274429,0.0008350402,0.000021187225,0.000003115738,0.000014410597,0.0011604954,0.05441526,0.008681919,0.05949003,0.000023231401,0.8752788],"study_design_scores_gemma":[0.00016043693,0.00012091679,0.019333666,0.00002772219,0.000001139261,0.000018711651,0.0000028101256,0.96146506,0.0060254894,0.012376568,0.00032477247,0.00014272855],"about_ca_topic_score_codex":0.00000996537,"about_ca_topic_score_gemma":4.72309e-7,"teacher_disagreement_score":0.9070498,"about_ca_system_score_codex":0.000024577103,"about_ca_system_score_gemma":0.00012336805,"threshold_uncertainty_score":0.9186118},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.10069957742795237,"score_gpt":0.35147743510706203,"score_spread":0.25077785767910965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2936689511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35370618,0.00077113125,0.64246917,0.0001852325,0.00066063734,0.00005731746,0.0000014674724,0.000009693036,0.0021391916],"genre_scores_gemma":[0.6676004,0.000026822261,0.33222777,0.000082446175,0.000034736877,0.0000036009878,8.266774e-8,0.0000024084438,0.000021727707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984773,0.0002482965,0.0005674024,0.000387137,0.00004729938,0.0002725573],"domain_scores_gemma":[0.99835914,0.0011120737,0.00014897189,0.00031512734,0.000026070118,0.00003859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009305538,0.00007401939,0.00028567488,0.000120524244,0.00008624717,0.00008160323,0.0005652932,0.000046299192,0.000014009546],"category_scores_gemma":[0.0010256806,0.000059270173,0.000050887564,0.0009827235,0.00032608485,0.00012004236,0.00027969366,0.00015945366,0.000007723896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035763699,0.000043803997,0.0404475,0.000014465401,0.0000019394968,0.000009103943,0.00041768447,0.0041348157,0.0009003668,0.91965926,0.0000015602518,0.03436591],"study_design_scores_gemma":[0.00021858295,0.000058244284,0.22290668,0.000087224056,5.468982e-7,0.000015130534,0.00007296828,0.26252687,0.004116824,0.5088435,0.0009715941,0.00018185377],"about_ca_topic_score_codex":0.000054036045,"about_ca_topic_score_gemma":0.000013699958,"teacher_disagreement_score":0.4108158,"about_ca_system_score_codex":0.000043862834,"about_ca_system_score_gemma":0.00003005261,"threshold_uncertainty_score":0.32251322},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0542199564321787,"score_gpt":0.3756684191022505,"score_spread":0.3214484626700718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950924851","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028362651,0.00004128168,0.99300086,0.00013882374,0.00056435534,0.00076013635,0.0000015027211,0.00040699108,0.0022497794],"genre_scores_gemma":[0.005437191,0.000004655284,0.99401337,0.00011207244,0.00016717927,0.00021248072,0.0000015272149,0.000011567044,0.00003996326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622804,0.0004890299,0.00063726754,0.0013070835,0.00051894377,0.00081961346],"domain_scores_gemma":[0.9968424,0.0014313081,0.00025075642,0.00093836617,0.00040547733,0.00013170402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008596239,0.00025842272,0.00038200457,0.00030698086,0.00033597258,0.00052874535,0.0028827486,0.00011313295,0.000004233098],"category_scores_gemma":[0.0024129231,0.0002123792,0.00006794524,0.0032112026,0.00062500185,0.0012271437,0.0005690174,0.00019236964,0.000010331164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019064102,0.00026222726,0.00026170493,0.00017487079,0.0000022939018,0.0000074362956,0.00029183066,0.010667779,0.013966389,0.66611123,0.000051929568,0.30818322],"study_design_scores_gemma":[0.00019660154,0.00016767798,0.0028844206,0.000052898777,0.0000025046622,0.000024482122,0.0000019517825,0.8180525,0.009872158,0.16829522,0.00017906651,0.00027053544],"about_ca_topic_score_codex":0.000026635998,"about_ca_topic_score_gemma":0.0000016510113,"teacher_disagreement_score":0.8073847,"about_ca_system_score_codex":0.00017924327,"about_ca_system_score_gemma":0.00027785578,"threshold_uncertainty_score":0.8660572},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.13670777818402702,"score_gpt":0.3898902504278553,"score_spread":0.2531824722438283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951424111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076152966,0.00014424337,0.98925406,0.0006176208,0.00074074464,0.0002917043,0.0000043931327,0.00017055328,0.0011614081],"genre_scores_gemma":[0.045489464,0.0000031798959,0.95326173,0.0010124176,0.0001807527,0.00002984926,3.4527042e-7,0.0000057676302,0.000016495416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974381,0.00032455137,0.0003797204,0.000972368,0.0002815941,0.0006036711],"domain_scores_gemma":[0.9973901,0.0016849887,0.000101317266,0.0005916973,0.00011304449,0.00011886125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034282126,0.00021983568,0.00033341558,0.0002456983,0.000421317,0.0005747312,0.0019085697,0.00007748901,0.0000061427263],"category_scores_gemma":[0.00017910256,0.00017339729,0.00008127017,0.0012956006,0.0019585586,0.00041250215,0.0011289428,0.00019813467,0.0000018665356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004697639,0.000071744944,0.00085029315,0.00000994532,0.0000013988401,0.0000030634742,0.00009273279,0.00013599069,0.00032333322,0.80551964,0.000012914969,0.19297425],"study_design_scores_gemma":[0.00023290701,0.00011958641,0.012436963,0.000014090989,0.000001311101,0.000020028647,0.000003940998,0.30455488,0.0009988982,0.67966974,0.001758277,0.00018940722],"about_ca_topic_score_codex":0.00008039413,"about_ca_topic_score_gemma":0.00004187601,"teacher_disagreement_score":0.3044189,"about_ca_system_score_codex":0.00003900874,"about_ca_system_score_gemma":0.000065699416,"threshold_uncertainty_score":0.7216391},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06591931980726415,"score_gpt":0.4080842784368488,"score_spread":0.3421649586295846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954304163","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033216279,0.000116526215,0.99211586,0.0015705923,0.0016972633,0.000395661,0.0000029936532,0.00036963954,0.00040982157],"genre_scores_gemma":[0.069803365,0.0000033039435,0.9293717,0.0005656652,0.00018920141,0.000030081448,0.000001950945,0.000008235625,0.000026495032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954943,0.00081185595,0.0005992987,0.0016598518,0.0005843406,0.00085037254],"domain_scores_gemma":[0.9953909,0.0027811537,0.0001740226,0.0010621626,0.00035732603,0.00023443293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062506627,0.00027545766,0.0004836993,0.00017048964,0.0005144781,0.00080737704,0.0025717218,0.000095253745,0.0000070498672],"category_scores_gemma":[0.0034637498,0.0002244393,0.00012456252,0.0026056238,0.0006035753,0.00049156795,0.0016734377,0.00043924586,0.00000456791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004150894,0.00025499085,0.000482855,0.000095308744,0.0000038310063,0.00004991794,0.00032304594,0.017819393,0.00031689313,0.13933626,0.000029496041,0.84128386],"study_design_scores_gemma":[0.0003202851,0.00014357716,0.0055853585,0.00006800153,0.0000032352764,0.00005272023,0.0000048451084,0.8507817,0.00036240043,0.14134872,0.0010473226,0.00028185628],"about_ca_topic_score_codex":0.000010380317,"about_ca_topic_score_gemma":0.0000064409755,"teacher_disagreement_score":0.841002,"about_ca_system_score_codex":0.00013491564,"about_ca_system_score_gemma":0.00040083003,"threshold_uncertainty_score":0.9152369},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10714413265778122,"score_gpt":0.39931794987761315,"score_spread":0.29217381721983193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969568901","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011071648,0.0006419927,0.9849673,0.0013939904,0.0093713375,0.00083234697,9.634069e-7,0.00030689006,0.0013780004],"genre_scores_gemma":[0.16825831,0.000044829645,0.8293273,0.0013190324,0.00083454844,0.00011031077,0.0000030084486,0.000017397284,0.000085299325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99136615,0.0019169014,0.0011577561,0.002837895,0.0013961215,0.0013251549],"domain_scores_gemma":[0.99386305,0.001316809,0.000496962,0.0034231131,0.0005023734,0.00039766985],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.012095362,0.0006672509,0.001050668,0.00033738455,0.0005488953,0.0017106442,0.009717641,0.00053453026,0.000023243352],"category_scores_gemma":[0.00085552386,0.00041844562,0.00043371908,0.0027283211,0.0012630861,0.00048503667,0.015488565,0.002174351,0.00005106272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083266605,0.00043270568,0.00050894613,0.0001771262,0.000040764302,0.0005510313,0.0034661551,0.038211446,0.00045309332,0.12297457,0.00014776624,0.8330281],"study_design_scores_gemma":[0.00023629885,0.00016918525,0.0017872849,0.0000638435,0.000009985445,0.00011887959,0.000030640214,0.945077,0.0014651987,0.047539815,0.0028582248,0.00064361445],"about_ca_topic_score_codex":0.0002916193,"about_ca_topic_score_gemma":0.00002431873,"teacher_disagreement_score":0.9068656,"about_ca_system_score_codex":0.00026613535,"about_ca_system_score_gemma":0.00090757676,"threshold_uncertainty_score":0.9998267},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.11524955498833166,"score_gpt":0.38193316286230883,"score_spread":0.26668360787397716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972042414","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020447217,0.0001316286,0.9775636,0.00054854277,0.0007138683,0.00026861488,0.0000030134943,0.000055302786,0.00026818953],"genre_scores_gemma":[0.18126854,0.000015875785,0.81858873,0.00005587604,0.00002949612,0.000032098178,0.0000011675672,0.000003167306,0.00000505124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953266,0.0021915748,0.00063158385,0.00078848406,0.00061070593,0.00045106738],"domain_scores_gemma":[0.9963428,0.0017919625,0.00023098837,0.0011727784,0.00036919193,0.000092312184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0101191355,0.0001583273,0.0003434607,0.000140706,0.00018484917,0.000250711,0.0018304444,0.00006387172,0.0000041199132],"category_scores_gemma":[0.0011100374,0.00010021441,0.00004078619,0.003269182,0.002026584,0.00062513485,0.00074388797,0.00031706112,0.0000016219459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003336709,0.0002829077,0.001596778,0.000052860356,0.0000040340665,0.000022860984,0.00067307526,0.0112825455,0.0042461804,0.60208935,0.000008340553,0.37970772],"study_design_scores_gemma":[0.00022555201,0.00021805616,0.10270319,0.00007714293,0.0000012318027,0.00003756217,0.000039866663,0.8348071,0.011183304,0.050358422,0.00019244148,0.00015613298],"about_ca_topic_score_codex":0.00009244152,"about_ca_topic_score_gemma":0.000048683713,"teacher_disagreement_score":0.82352453,"about_ca_system_score_codex":0.00018610193,"about_ca_system_score_gemma":0.0002170474,"threshold_uncertainty_score":0.74670327},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06528314090497818,"score_gpt":0.37590137011572794,"score_spread":0.3106182292107498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989637082","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044831805,0.000008052377,0.95234126,0.0011227903,0.0008214262,0.00018536777,0.0000022617753,0.00016296886,0.0005240558],"genre_scores_gemma":[0.25698608,0.000023958688,0.74264896,0.00026264283,0.000056445293,0.000010103679,0.0000013033144,0.00000383891,0.000006645625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971599,0.0004750469,0.00040180894,0.00078833825,0.00068663806,0.0004882878],"domain_scores_gemma":[0.99830014,0.00071286317,0.00016908432,0.0005612392,0.00012081904,0.00013583286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030298722,0.00017085699,0.00034753917,0.00044143724,0.0001489418,0.00019275538,0.0015428873,0.00008861229,0.000006227273],"category_scores_gemma":[0.00029020596,0.00012070519,0.00006942013,0.0043681264,0.00035085544,0.0005979812,0.0007993744,0.00025490846,0.000025344116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002674294,0.00010664159,0.0008909161,0.000010069292,0.0000041381145,0.000060060353,0.0009492758,0.0011822832,0.015498743,0.5025999,0.000026060416,0.47864518],"study_design_scores_gemma":[0.00031536794,0.0008813678,0.07593266,0.00003146528,0.000001967064,0.000008432399,0.0000068330323,0.77234334,0.0061526895,0.1435916,0.0004984819,0.00023577701],"about_ca_topic_score_codex":0.0000063051907,"about_ca_topic_score_gemma":2.955229e-7,"teacher_disagreement_score":0.7711611,"about_ca_system_score_codex":0.00009105285,"about_ca_system_score_gemma":0.000101992766,"threshold_uncertainty_score":0.49222147},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0839479400754821,"score_gpt":0.4028615210096469,"score_spread":0.3189135809341648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020955609","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010415483,0.00030972084,0.9949613,0.00019448041,0.0023434598,0.0006009412,6.137234e-7,0.00024584346,0.00030209788],"genre_scores_gemma":[0.29117945,0.0000020354573,0.7081098,0.00036860377,0.00013585118,0.00013105485,9.102477e-7,0.000006856704,0.000065451495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638987,0.0009450914,0.00038443672,0.0009646884,0.00060518883,0.0007107504],"domain_scores_gemma":[0.99789906,0.000988461,0.00014776277,0.0006878487,0.000129721,0.0001471283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010698522,0.00018833288,0.00029927256,0.0002434166,0.0005929409,0.00030005912,0.002883409,0.000056222267,0.000017397278],"category_scores_gemma":[0.00044668408,0.00014713297,0.0000939867,0.0017695995,0.00026048208,0.00031821476,0.0019991272,0.00033357198,0.00000830169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010237202,0.000102889746,0.00020815834,0.000010983757,0.0000031711993,0.000025701987,0.0005106363,0.0008808351,0.00034020035,0.48302096,0.000013067794,0.51487315],"study_design_scores_gemma":[0.0005769541,0.0015710031,0.00073491834,0.000005660798,0.000006312078,0.00014330156,0.00020594016,0.5914151,0.0017342812,0.38180467,0.021265388,0.00053649006],"about_ca_topic_score_codex":0.000021519201,"about_ca_topic_score_gemma":0.000002241027,"teacher_disagreement_score":0.59053427,"about_ca_system_score_codex":0.0001311625,"about_ca_system_score_gemma":0.00016048511,"threshold_uncertainty_score":0.59999084},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.17244311899386633,"score_gpt":0.4691749533310873,"score_spread":0.29673183433722095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082202956","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2529974,0.00044967022,0.740123,0.0004070616,0.0037000682,0.00035789475,0.0000012656276,0.00008659644,0.0018770741],"genre_scores_gemma":[0.19009283,0.000084370644,0.80902,0.00051821937,0.00016875539,0.0000510883,0.0000012688882,0.000012525914,0.000050949693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924911,0.0037329986,0.0009145936,0.0015650948,0.00045136383,0.0008448489],"domain_scores_gemma":[0.9934923,0.0047347303,0.00026615546,0.0011950958,0.0001610995,0.00015058953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.013284906,0.00039928878,0.0010482694,0.00047834776,0.00011250155,0.00016035998,0.00235819,0.0006972966,0.0005062601],"category_scores_gemma":[0.004189171,0.000326079,0.00015602705,0.0013555416,0.0021978687,0.00012979055,0.0048178583,0.0019401911,0.000011538962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051915147,0.00070969574,0.0029865399,0.00026686297,0.000026803966,0.0010340306,0.0033183314,0.00065911846,0.0009775861,0.6737481,0.000028070039,0.31619295],"study_design_scores_gemma":[0.00018381848,0.00016568594,0.005049803,0.0002688433,0.000011035188,0.00008958187,0.000082698134,0.008865394,0.0016700228,0.9832027,0.000028719027,0.00038171688],"about_ca_topic_score_codex":0.000028614944,"about_ca_topic_score_gemma":0.000033681026,"teacher_disagreement_score":0.31581122,"about_ca_system_score_codex":0.00019082507,"about_ca_system_score_gemma":0.00057741016,"threshold_uncertainty_score":0.9999191},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06941551654696516,"score_gpt":0.4283480724184977,"score_spread":0.35893255587153255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098573930","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013149537,0.000017364246,0.98154557,0.0011105082,0.0014888922,0.00009513173,2.1629877e-7,0.0011303778,0.0014623989],"genre_scores_gemma":[0.083690844,0.000008060159,0.91556317,0.00052837527,0.00013887457,0.000012159567,3.0449166e-7,0.000005563867,0.000052657324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970028,0.00045673185,0.00032370735,0.0009238541,0.00054949627,0.0007434372],"domain_scores_gemma":[0.9980335,0.00078022963,0.000070596965,0.00086102705,0.00005540892,0.00019923331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059946417,0.000172231,0.00025909673,0.00059216295,0.00027596415,0.00046934094,0.0031886678,0.00006448481,0.000008564993],"category_scores_gemma":[0.0005458482,0.00013697242,0.0000605373,0.005714627,0.00028569586,0.0005942404,0.0025793905,0.00040362056,0.00016352846],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.0267545e-7,0.000029826264,0.0012919017,0.0000061824394,0.0000011682703,0.000057980444,0.00035787545,0.009154502,0.00068363885,0.039874706,0.00004047338,0.9485012],"study_design_scores_gemma":[0.00014456721,0.00006722099,0.060114183,0.000023050361,5.0312076e-7,0.000026632932,0.0000023829361,0.9072665,0.00042557478,0.030925052,0.000822338,0.00018202316],"about_ca_topic_score_codex":0.000023564486,"about_ca_topic_score_gemma":6.9143766e-7,"teacher_disagreement_score":0.9483192,"about_ca_system_score_codex":0.000051245108,"about_ca_system_score_gemma":0.00009242882,"threshold_uncertainty_score":0.59253913},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04480822537424823,"score_gpt":0.3572987186146682,"score_spread":0.31249049324042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121836531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25359046,0.00015882832,0.7451154,0.00036689694,0.00038722655,0.00019577511,3.1343774e-7,0.000031023043,0.00015409221],"genre_scores_gemma":[0.52878773,0.0000030362137,0.47073483,0.00042925004,0.000007430709,0.00003315474,6.1813e-8,0.000001793387,0.000002703927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717134,0.0011020801,0.00033737,0.0005824114,0.00046076404,0.00034602146],"domain_scores_gemma":[0.9983,0.0009172079,0.00010464085,0.00059421454,0.0000261926,0.00005770696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009294976,0.00011587777,0.00027349437,0.00018449973,0.00016736836,0.00017638312,0.0023881942,0.00002762264,0.000013881303],"category_scores_gemma":[0.00010232148,0.00007287782,0.00004369805,0.0022082834,0.0010919591,0.00032474042,0.0034244563,0.00028751013,3.600538e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019170662,0.00015416698,0.0030645472,0.000005325603,0.0000016321794,0.000018287485,0.0022117153,0.0013893867,0.00071724784,0.35367227,0.0000036956117,0.63874257],"study_design_scores_gemma":[0.0008090852,0.00020847582,0.03536131,0.000015344209,9.5157117e-7,0.000030486994,0.000067833724,0.7540573,0.0004299418,0.20867658,0.00018905706,0.00015362752],"about_ca_topic_score_codex":0.000044399167,"about_ca_topic_score_gemma":0.000001132528,"teacher_disagreement_score":0.7526679,"about_ca_system_score_codex":0.00004999264,"about_ca_system_score_gemma":0.00005833371,"threshold_uncertainty_score":0.44378987},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08669493134337099,"score_gpt":0.37398334355034973,"score_spread":0.28728841220697876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129914072","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055419407,0.0001565752,0.99031496,0.00048145084,0.0021304407,0.00040416903,6.0587246e-7,0.0003317239,0.0006381162],"genre_scores_gemma":[0.3818722,5.350475e-7,0.6169214,0.000917376,0.00010887801,0.00011817772,0.0000015871404,0.000006256653,0.000053575888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961285,0.0008656106,0.0004168281,0.0010160202,0.0008399308,0.000733127],"domain_scores_gemma":[0.99837905,0.0004328107,0.00018894042,0.00072589424,0.00009020244,0.00018310228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062498106,0.00020953885,0.00032081208,0.00039994746,0.0006494742,0.0005108446,0.0023266734,0.000055405577,0.00006405859],"category_scores_gemma":[0.00018328971,0.00017571897,0.000106259824,0.0029868586,0.00024404969,0.0004746525,0.0015311455,0.00043270554,0.000021277901],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012955631,0.00030117773,0.0017480244,0.0000218258,0.0000051770653,0.000114054266,0.0009354066,0.0013522967,0.007032583,0.08129447,0.000029990062,0.90715206],"study_design_scores_gemma":[0.0012714198,0.0015016379,0.016545398,0.000018818635,0.000008622222,0.00023568675,0.00017498327,0.89541113,0.0051143453,0.02985466,0.04875693,0.0011063452],"about_ca_topic_score_codex":0.000040917053,"about_ca_topic_score_gemma":0.0000018753462,"teacher_disagreement_score":0.9060457,"about_ca_system_score_codex":0.0002124218,"about_ca_system_score_gemma":0.00025983146,"threshold_uncertainty_score":0.7165612},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Decidability; Mathematics; Computer science; Calculus (dental); Discrete mathematics; Medicine","score_opus":0.07095395759748904,"score_gpt":0.4281744339669295,"score_spread":0.35722047636944043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130346675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060089133,0.0002967145,0.9888331,0.00088504987,0.002791293,0.00031906928,0.0000014025223,0.0004474691,0.0004169569],"genre_scores_gemma":[0.17700467,0.0000037581706,0.822115,0.0006559174,0.00015298888,0.00004818148,1.9785348e-7,0.000005112893,0.0000141486025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971454,0.0003139353,0.00036159426,0.0012172249,0.000362651,0.0005991552],"domain_scores_gemma":[0.99630624,0.0026090052,0.000035898407,0.00080921984,0.000067957175,0.0001716993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008576192,0.0001781185,0.00025630044,0.00027814662,0.00017128671,0.0008978748,0.0027401121,0.00008094511,0.000010308306],"category_scores_gemma":[0.000439634,0.00012877287,0.00011659126,0.0024076952,0.00047502184,0.0008714931,0.0010562949,0.0002400287,0.000014725253],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019686872,0.000038370476,0.000077604884,0.000017899787,0.0000015649686,0.000013704231,0.00024450652,0.00018655854,0.0010952922,0.26646164,0.000034582394,0.7318263],"study_design_scores_gemma":[0.00007476374,0.000103108505,0.003722271,0.00003669238,0.0000011247487,0.000016336904,0.000003435525,0.64198154,0.0018785194,0.35032746,0.0017079092,0.00014685084],"about_ca_topic_score_codex":0.000005110448,"about_ca_topic_score_gemma":0.00000192861,"teacher_disagreement_score":0.73167944,"about_ca_system_score_codex":0.00012811444,"about_ca_system_score_gemma":0.00017036188,"threshold_uncertainty_score":0.8658228},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07016060689756048,"score_gpt":0.41561688265567354,"score_spread":0.34545627575811305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389935239","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026495311,0.000026975345,0.9703931,0.0008404068,0.0011702507,0.00019695733,0.0000012621846,0.0004210039,0.0004547271],"genre_scores_gemma":[0.24469638,0.000022782686,0.7548372,0.00037124116,0.000045885674,0.000017573055,0.0000022370323,0.000003842703,0.0000028265067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967033,0.00042411574,0.0004169763,0.00097027904,0.0006795202,0.000805755],"domain_scores_gemma":[0.9980733,0.0007389427,0.00008043486,0.0007457826,0.00012426138,0.00023731164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042203167,0.00019602933,0.00028076276,0.0010004478,0.00045750276,0.00039716126,0.0023269071,0.000074507225,0.00003702299],"category_scores_gemma":[0.000093217954,0.00015740188,0.00012271512,0.01068775,0.0005054451,0.00073634903,0.0015389888,0.00029119686,0.00007128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008378418,0.00021037528,0.0033698955,0.000010645126,0.0000053572817,0.000097727636,0.00068585825,0.0011977552,0.0030586123,0.5604648,0.00063918135,0.43025142],"study_design_scores_gemma":[0.00036004555,0.00018041262,0.078418545,0.000008005289,0.0000018060953,0.000021896043,0.000024735446,0.64486444,0.00087182625,0.273449,0.0015486589,0.00025061087],"about_ca_topic_score_codex":0.000042274183,"about_ca_topic_score_gemma":0.0000036846202,"teacher_disagreement_score":0.6436667,"about_ca_system_score_codex":0.00006587981,"about_ca_system_score_gemma":0.000097047356,"threshold_uncertainty_score":0.64186627},"labels":[],"label_agreement":null},{"id":"W4392239214","doi":"10.46298/lmcs-20(1:15)2024","title":"Separators in Continuous Petri Nets","year":2024,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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":"Petri net; Computer science; Programming language; Process architecture; Stochastic Petri net","score_opus":0.07653531456358181,"score_gpt":0.41212407015097124,"score_spread":0.33558875558738943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392239214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020011285,0.0010429521,0.9718336,0.00047497445,0.0042431895,0.00023051989,4.7877415e-7,0.00038116553,0.0017818213],"genre_scores_gemma":[0.34377167,0.000011282899,0.655698,0.0003806445,0.00009327574,0.000016863534,9.485872e-8,0.000006349699,0.00002178551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99525577,0.00075077574,0.00072785927,0.0016147676,0.00075421314,0.0008966433],"domain_scores_gemma":[0.99717724,0.0015445127,0.00006990217,0.0009128679,0.000082684135,0.00021277468],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009455647,0.00026507376,0.00046177034,0.0011490866,0.00010761799,0.0010611862,0.0035614932,0.00013395218,0.000008715461],"category_scores_gemma":[0.00040401047,0.00021515558,0.00008999567,0.0080266455,0.0003628141,0.0012363736,0.0016437665,0.0005803648,0.000058235528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029973585,0.00007623055,0.0017000269,0.000029955074,0.0000030529234,0.0006389251,0.0010506768,0.015944274,0.0016059682,0.08628994,0.000103645856,0.8925543],"study_design_scores_gemma":[0.00015255109,0.00009432072,0.002858067,0.00018112939,8.875279e-7,0.00011582871,0.000005920519,0.96875435,0.00085457286,0.024746945,0.0019466404,0.00028875662],"about_ca_topic_score_codex":0.00002479302,"about_ca_topic_score_gemma":0.0000051531547,"teacher_disagreement_score":0.9528101,"about_ca_system_score_codex":0.00030820403,"about_ca_system_score_gemma":0.00028508715,"threshold_uncertainty_score":0.9999758},"labels":[],"label_agreement":null},{"id":"W4398213997","doi":"10.46298/lmcs-20(2:6)2024","title":"Executable First-Order Queries in the Logic of Information Flows","year":2024,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Bijzonder Onderzoeksfonds UGent; Vlaamse regering; Universiteit Hasselt; Fonds Wetenschappelijk Onderzoek","keywords":"Executable; Computer science; Programming language; Description logic; Order (exchange); First-order logic; Theoretical computer science","score_opus":0.04447146521058413,"score_gpt":0.3685387176116963,"score_spread":0.32406725240111217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398213997","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010304217,0.00032164936,0.9957809,0.00087793317,0.00094084896,0.00022490612,0.0000028221368,0.000076713884,0.0007438482],"genre_scores_gemma":[0.032776304,0.00002788017,0.9666297,0.00048580582,0.000038895967,0.000033761255,8.9902045e-7,0.0000020195728,0.000004768461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794644,0.00032513007,0.0005116979,0.00040816085,0.0004469235,0.00036161806],"domain_scores_gemma":[0.9981779,0.0009942801,0.00007600571,0.00061622175,0.00009030227,0.00004531737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047236583,0.00014148462,0.00023679418,0.00033368386,0.000120458346,0.00028291784,0.0014518728,0.000053490563,0.0000075650996],"category_scores_gemma":[0.00038628778,0.00008289814,0.000042387677,0.0037200346,0.00036777015,0.0032075527,0.0007184538,0.00024272324,0.000011119032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028637414,0.000030487181,0.00013687956,0.00007343029,0.000001208216,0.000021446642,0.0029608894,0.009933155,0.00024682138,0.772068,0.00004296283,0.21448182],"study_design_scores_gemma":[0.00009680707,0.000121767946,0.0022186069,0.00014256439,9.617544e-7,0.00004899285,0.000084620435,0.920941,0.00051679043,0.05263071,0.023031428,0.00016573428],"about_ca_topic_score_codex":0.0000840975,"about_ca_topic_score_gemma":0.000027815948,"teacher_disagreement_score":0.9110079,"about_ca_system_score_codex":0.000051918323,"about_ca_system_score_gemma":0.00012382148,"threshold_uncertainty_score":0.33804882},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0814397467822359,"score_gpt":0.40781228852976964,"score_spread":0.3263725417475337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403876945","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053001978,0.0013006328,0.9907152,0.00017774334,0.001555119,0.00020854535,1.5347553e-7,0.00013521069,0.0006071792],"genre_scores_gemma":[0.41366956,0.000009713309,0.58620095,0.00007045062,0.000028309625,0.0000075099706,4.4280416e-8,0.00000233292,0.000011122223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978311,0.0004333833,0.00030172028,0.00074807636,0.00032981823,0.0003559046],"domain_scores_gemma":[0.9975721,0.0018057072,0.000058877362,0.00036758368,0.0000807786,0.000114947245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036535184,0.00014152627,0.00030026183,0.00027820913,0.000079622514,0.00034103123,0.0010211188,0.00006525359,0.0000016863613],"category_scores_gemma":[0.00034002773,0.00009473774,0.00005262936,0.0017426431,0.00065104,0.0004889002,0.00071199896,0.00018557263,0.0000087543585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013181523,0.000026821705,0.00045203938,0.00008004411,0.000003159043,0.00004201458,0.000633933,0.000032386262,0.0022864265,0.6180715,0.000007790661,0.37836257],"study_design_scores_gemma":[0.00016393617,0.0006923083,0.013332139,0.000059528316,0.0000039835195,0.00006389283,0.0000125464,0.67266995,0.0066491235,0.3052403,0.0008783321,0.00023394485],"about_ca_topic_score_codex":0.000028435119,"about_ca_topic_score_gemma":0.0000018532273,"teacher_disagreement_score":0.6726376,"about_ca_system_score_codex":0.000029885223,"about_ca_system_score_gemma":0.000074948315,"threshold_uncertainty_score":0.3863293},"labels":[],"label_agreement":null},{"id":"W4406691577","doi":"10.46298/lmcs-21(1:5)2025","title":"Complete and tractable machine-independent characterizations of second-order polytime","year":2025,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Order (exchange); Computer science; Finance; Business","score_opus":0.033764576946367635,"score_gpt":0.3425569021045388,"score_spread":0.3087923251581712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406691577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033548687,0.000103385864,0.96375924,0.0008376428,0.0006303894,0.00016701556,0.000003919778,0.00006111242,0.00088857935],"genre_scores_gemma":[0.3368652,0.000004892606,0.66246706,0.0005903562,0.000018027256,0.000005549776,8.0668434e-7,0.0000019035349,0.00004617145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980829,0.00024694868,0.00043929912,0.000641024,0.00025218882,0.00033766538],"domain_scores_gemma":[0.9986961,0.0005683399,0.0001221578,0.00039926672,0.000109520566,0.000104643004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015737617,0.00014983346,0.00030662018,0.00041077158,0.00016917386,0.00020007008,0.0011814217,0.000058395777,0.000021035243],"category_scores_gemma":[0.0001302809,0.00012602651,0.000040068542,0.002156515,0.0003387204,0.0005995554,0.0010441871,0.00019359597,0.0000025350223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068047802,0.00015537524,0.0014018177,0.0000316932,0.000007105417,0.0000065253253,0.00036418447,0.00083551265,0.06348951,0.15032896,0.00001174586,0.7833608],"study_design_scores_gemma":[0.00032701125,0.0000791021,0.13936506,0.000041179366,0.0000025720926,0.000015543332,0.0000025892132,0.81173986,0.004281867,0.04352349,0.00046359605,0.00015812207],"about_ca_topic_score_codex":0.000029255305,"about_ca_topic_score_gemma":0.00000844928,"teacher_disagreement_score":0.8109044,"about_ca_system_score_codex":0.000043307,"about_ca_system_score_gemma":0.00016582916,"threshold_uncertainty_score":0.51392126},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07204387294373597,"score_gpt":0.3981254690196539,"score_spread":0.3260815960759179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417316699","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039696465,0.000053993834,0.9900711,0.0008446729,0.0009384276,0.0001909604,2.4126544e-7,0.00024443798,0.0036864972],"genre_scores_gemma":[0.21866009,0.0000037464097,0.77991176,0.0013565947,0.000017931881,0.000027793114,9.69286e-8,0.0000024309973,0.000019537107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710834,0.00044411435,0.00046527747,0.0010443392,0.00038639334,0.00055155554],"domain_scores_gemma":[0.99784666,0.0010066282,0.00008798416,0.00081433804,0.00012759306,0.000116773124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041016247,0.0002043189,0.00030242273,0.00042131986,0.00028780065,0.00049292314,0.0024958707,0.00007029985,0.0000031015013],"category_scores_gemma":[0.0008186786,0.00015800937,0.00006273116,0.0032059052,0.0006249158,0.0004323804,0.0009721711,0.00039134565,0.000008508208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020728214,0.000054762077,0.000088932946,0.000011321556,9.923052e-7,0.0000053686786,0.00010287496,0.0034602538,0.0003271067,0.57194245,0.000007513438,0.42399633],"study_design_scores_gemma":[0.00007307974,0.00008627222,0.0012345251,0.000080086924,8.2123677e-7,0.000004342998,0.0000026866367,0.5627656,0.0010845019,0.43450797,0.000038151393,0.000121953104],"about_ca_topic_score_codex":0.000010783614,"about_ca_topic_score_gemma":0.0000013470157,"teacher_disagreement_score":0.55930537,"about_ca_system_score_codex":0.00008780656,"about_ca_system_score_gemma":0.00020103811,"threshold_uncertainty_score":0.6443435},"labels":[],"label_agreement":null}]}