{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08197344,0.0008979085,0.8431943,0.004475545,0.00027929718,0.00022797615,0.001126936,0.00072969694,0.06709495],"genre_scores_gemma":[0.65364206,0.0012215838,0.30679798,0.0017412874,0.00057763053,0.00034079357,0.0019420324,0.00041017524,0.0333265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798644,0.00055402535,0.0001296253,0.0006201121,0.00046707565,0.0002426931],"domain_scores_gemma":[0.99713874,0.0017132168,0.00015234215,0.00060088397,0.00020130786,0.00019342003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010857313,0.00050326,0.0008167276,0.0011121597,0.0012019726,0.0038360024,0.001508894,0.0010175505,0.012313393],"category_scores_gemma":[0.0049623204,0.00048678363,0.0017304568,0.0019566035,0.002367305,0.006022274,0.0040970873,0.0052217008,0.00093511574],"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.000016498296,0.000043077493,0.00010759616,0.00005484835,0.000009238815,0.00006008789,0.00013948938,0.0047486853,0.000704161,0.9830905,0.001370612,0.009655093],"study_design_scores_gemma":[0.000020788233,0.000012732909,0.00012321619,0.000013754722,0.000007458605,0.000055526663,0.00005008548,0.019013591,0.00046730388,0.97168005,0.008547074,0.000008492695],"about_ca_topic_score_codex":0.0030019188,"about_ca_topic_score_gemma":0.0034158567,"teacher_disagreement_score":0.012313393,"about_ca_system_score_codex":0.001978209,"about_ca_system_score_gemma":0.0011987602,"threshold_uncertainty_score":0.041192412},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13327667,0.00067613926,0.73267835,0.0017088226,0.00091406127,0.00042824438,0.0005473465,0.00058281515,0.12918754],"genre_scores_gemma":[0.8024265,0.00050471636,0.15769124,0.0008431995,0.0004202782,0.00057357684,0.00046647122,0.00033852237,0.036735464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988601,0.00028721755,0.00010106612,0.00023533315,0.00032557623,0.00019065094],"domain_scores_gemma":[0.9992872,0.00021917441,0.000075384465,0.00014551567,0.00017975419,0.000093020746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011526698,0.0005624869,0.00042711932,0.0009425886,0.0012696105,0.002210667,0.0012906664,0.001213729,0.008520329],"category_scores_gemma":[0.0021316693,0.00032397316,0.0006904168,0.00060402765,0.0032272772,0.0033421332,0.0018220926,0.0022917641,0.0015543604],"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.000008628605,0.000012994024,0.000037201225,0.000012109313,0.000001259344,0.00004901415,0.0001517498,0.00036445976,0.0013275802,0.994749,0.00058595726,0.002700087],"study_design_scores_gemma":[0.00001426512,0.000017240003,0.00004031757,0.000009616741,0.0000024299354,0.00006849276,0.000055789144,0.006304195,0.0018613389,0.9871974,0.004417504,0.000011581168],"about_ca_topic_score_codex":0.0008785713,"about_ca_topic_score_gemma":0.0010430809,"teacher_disagreement_score":0.008520329,"about_ca_system_score_codex":0.0012552291,"about_ca_system_score_gemma":0.0010697963,"threshold_uncertainty_score":0.028503358},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069754235,0.005266281,0.72135717,0.0032050712,0.0008056945,0.0002785617,0.00045400433,0.00056155806,0.19831738],"genre_scores_gemma":[0.821461,0.003361692,0.15573628,0.0007030517,0.0010672432,0.0005009637,0.00063218916,0.00024617085,0.016291412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99209213,0.0018932762,0.0009887092,0.0011432524,0.0031147317,0.00076782703],"domain_scores_gemma":[0.9892063,0.0048972643,0.0014637118,0.0017467971,0.002101154,0.000584863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005512386,0.0010285749,0.001103135,0.0038147548,0.0024665007,0.008566645,0.0015840182,0.0017399854,0.005182141],"category_scores_gemma":[0.015760118,0.00056740973,0.0015552057,0.0027698234,0.011683391,0.015222986,0.0052063395,0.0047532753,0.0011550515],"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.000011863854,0.000009249769,0.00016948197,0.000041504914,0.0000041756284,0.00003464464,0.00022694792,0.00049787015,0.00031316213,0.9952336,0.00024936313,0.0032081353],"study_design_scores_gemma":[0.000009713687,0.000033206634,0.00021888099,0.00006420408,0.0000163663,0.0002785424,0.00025385333,0.0048862714,0.00062703906,0.9788984,0.01469482,0.00001866408],"about_ca_topic_score_codex":0.00069097464,"about_ca_topic_score_gemma":0.00046947185,"teacher_disagreement_score":0.008566645,"about_ca_system_score_codex":0.0029412657,"about_ca_system_score_gemma":0.00213964,"threshold_uncertainty_score":0.029152632},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006113023,0.10856461,0.85389674,0.0024132417,0.00039909178,0.00014859549,0.00055168394,0.0008710198,0.027041927],"genre_scores_gemma":[0.18955746,0.1464625,0.6403632,0.0032334954,0.0024769395,0.0005992062,0.0017160767,0.0005074709,0.015083578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671197,0.0009397167,0.00040447715,0.0005090817,0.0012559663,0.00017878435],"domain_scores_gemma":[0.9968431,0.00212807,0.00028428246,0.00027902573,0.00033504647,0.00013058119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035751194,0.0009253439,0.0008695812,0.004996594,0.0011388714,0.005425214,0.002604565,0.001356637,0.0035617526],"category_scores_gemma":[0.0035440424,0.0009357236,0.0015573365,0.006195283,0.003370176,0.01171357,0.0021464354,0.002563103,0.0010712291],"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.000046986843,0.00006749009,0.0005308025,0.001005527,0.000040806724,0.00022742631,0.0005429115,0.005918942,0.0012286991,0.85552573,0.0059522516,0.12891231],"study_design_scores_gemma":[0.000023912153,0.00006166328,0.0003730554,0.0004791223,0.000044753437,0.00071537314,0.00020468027,0.022450669,0.0017185467,0.83570427,0.13816416,0.000059799968],"about_ca_topic_score_codex":0.0030814104,"about_ca_topic_score_gemma":0.002375582,"teacher_disagreement_score":0.005425214,"about_ca_system_score_codex":0.0033291262,"about_ca_system_score_gemma":0.0019943453,"threshold_uncertainty_score":0.024154603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038854233,0.0002940015,0.984519,0.00090678275,0.00012057264,0.00014951253,0.00018861334,0.0007838762,0.009152249],"genre_scores_gemma":[0.27390373,0.0011559562,0.71012104,0.001390999,0.0005283694,0.0010670736,0.0009500904,0.00066478166,0.010218025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98080873,0.0067804093,0.0015197827,0.0038413028,0.0052437102,0.0018060582],"domain_scores_gemma":[0.97700477,0.015370242,0.0011479275,0.0041883537,0.0019456432,0.00034314606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011528247,0.001468442,0.00156954,0.0024989424,0.0019395503,0.007112833,0.00684275,0.003745958,0.009845927],"category_scores_gemma":[0.040041935,0.0014214119,0.0030022087,0.0028776352,0.007599775,0.01683847,0.007191394,0.0060806107,0.0021633396],"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.000015596228,0.000021170672,0.000069130234,0.000049308233,0.000010140435,0.000021376067,0.000062120664,0.00956394,0.00022905182,0.98325044,0.0006008709,0.0061068404],"study_design_scores_gemma":[0.000036064284,0.000019195857,0.000036724072,0.000034452612,0.000015391068,0.00003322971,0.00002954711,0.08366531,0.00086297706,0.9091195,0.006130344,0.000017253164],"about_ca_topic_score_codex":0.0039170035,"about_ca_topic_score_gemma":0.0029964964,"teacher_disagreement_score":0.011528247,"about_ca_system_score_codex":0.005875064,"about_ca_system_score_gemma":0.005593563,"threshold_uncertainty_score":0.06096798},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06688598,0.00016055995,0.90437984,0.0005380198,0.00009005532,0.00011880162,0.0002669274,0.0021525174,0.025407292],"genre_scores_gemma":[0.7414856,0.00028704456,0.2448948,0.0004502278,0.00010624237,0.0002832457,0.00033741383,0.00059041247,0.01156503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759775,0.0004962702,0.0002160018,0.00050436426,0.00080800353,0.00037769089],"domain_scores_gemma":[0.9981779,0.0005425112,0.00012695072,0.00069657224,0.0003818982,0.000074195385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023413762,0.00053591054,0.00055289455,0.0008131814,0.001046642,0.0022930577,0.0009935384,0.0007482807,0.0028540688],"category_scores_gemma":[0.002889569,0.00054782064,0.0015001713,0.00081128936,0.0041143075,0.0046251058,0.0034021372,0.002564026,0.00057298737],"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.000028833421,0.000019925317,0.00016695488,0.000041912914,0.000009080975,0.00011446814,0.00045658535,0.002116399,0.0022678312,0.98620147,0.0003902775,0.00818635],"study_design_scores_gemma":[0.00006539015,0.00006765012,0.0003879457,0.000036579244,0.00009176677,0.00030667294,0.00022962302,0.025808929,0.019516045,0.9166603,0.0367714,0.000057727084],"about_ca_topic_score_codex":0.002056108,"about_ca_topic_score_gemma":0.0017039573,"teacher_disagreement_score":0.0028540688,"about_ca_system_score_codex":0.001322001,"about_ca_system_score_gemma":0.0016941387,"threshold_uncertainty_score":0.012382507},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26109898,0.0071645267,0.45616832,0.013632934,0.0004897428,0.00014433457,0.0005929868,0.00060798886,0.26010007],"genre_scores_gemma":[0.9264912,0.0016685883,0.055164978,0.0006327475,0.0006288121,0.0001624717,0.0001947451,0.0000984923,0.014958062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774444,0.00059060915,0.00016645453,0.0005446909,0.00068751373,0.0002664234],"domain_scores_gemma":[0.99686605,0.0018940684,0.00031242907,0.00041464917,0.00026806124,0.0002446584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017676491,0.0003365799,0.0006740331,0.0012729579,0.002026925,0.0051599904,0.0011000412,0.0017056852,0.00604596],"category_scores_gemma":[0.00576418,0.0004544218,0.0011798858,0.0013448732,0.006757367,0.013326709,0.002317221,0.002199505,0.00091759406],"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.0000072964476,0.000002970677,0.000057387613,0.000015748143,0.0000018895346,0.000059129838,0.00014087837,0.0002679847,0.00021044836,0.9978739,0.00017233721,0.0011899674],"study_design_scores_gemma":[0.0000056622102,0.000006494505,0.000032988424,0.000006034949,0.0000031181903,0.00012284679,0.00007584809,0.0026935579,0.0002281206,0.993687,0.0031339421,0.000004381864],"about_ca_topic_score_codex":0.0010014261,"about_ca_topic_score_gemma":0.0005859109,"teacher_disagreement_score":0.00604596,"about_ca_system_score_codex":0.001250419,"about_ca_system_score_gemma":0.0007536451,"threshold_uncertainty_score":0.020225763},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012543619,0.0006520875,0.96852475,0.00090506196,0.00037924768,0.00016862461,0.0004235353,0.0021621683,0.014240946],"genre_scores_gemma":[0.42249036,0.0006136155,0.56043696,0.00074283604,0.00039071572,0.0007581774,0.0007619251,0.001138841,0.01266658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99633884,0.00093350647,0.00048118696,0.00091745274,0.0009918843,0.00033723545],"domain_scores_gemma":[0.99624217,0.0015821799,0.00034133458,0.00073735137,0.0008513255,0.00024576604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035095133,0.00133639,0.0010875019,0.0015744069,0.0022908081,0.005775718,0.0031981922,0.0025267992,0.006419645],"category_scores_gemma":[0.005878304,0.0011799228,0.002520128,0.00095154915,0.007426524,0.008488642,0.0030348399,0.0048128213,0.0019554985],"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.000025096893,0.00001805692,0.00007241342,0.00006381722,0.000011188437,0.0001121177,0.00067105633,0.0012635227,0.0020195616,0.99123657,0.0006308272,0.003875721],"study_design_scores_gemma":[0.000050976636,0.000051061008,0.00007838136,0.000090048605,0.00004668017,0.00022099825,0.00018467507,0.015030225,0.005225444,0.9404285,0.03853398,0.00005914758],"about_ca_topic_score_codex":0.0014304693,"about_ca_topic_score_gemma":0.0012434721,"teacher_disagreement_score":0.006419645,"about_ca_system_score_codex":0.0019815254,"about_ca_system_score_gemma":0.0029043758,"threshold_uncertainty_score":0.021475911},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48130146,0.0015446905,0.44989088,0.0015307859,0.000271534,0.000092409195,0.00057785667,0.0005912308,0.06419907],"genre_scores_gemma":[0.8981006,0.0004335719,0.09121215,0.00035320653,0.00017441856,0.00012684007,0.00025772327,0.000091673144,0.009249789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985637,0.00024269086,0.000068490146,0.00033706948,0.00056778407,0.00022033408],"domain_scores_gemma":[0.99754447,0.00086961116,0.00028629266,0.00047854413,0.0005691487,0.00025182657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008087214,0.00021961099,0.00040791207,0.000935237,0.000910688,0.0013156333,0.00043464958,0.00041608693,0.001933569],"category_scores_gemma":[0.004584214,0.00019519392,0.000450695,0.00062865816,0.0031787253,0.0024208343,0.0016992149,0.001529243,0.00023935686],"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.000030798892,0.0000075150206,0.00026352017,0.000025205425,0.000003902685,0.000029390667,0.00017805297,0.0021565997,0.0028596406,0.9857706,0.00053961313,0.008135155],"study_design_scores_gemma":[0.000015471544,0.000044255143,0.0006501785,0.000028945915,0.000007819226,0.00010897978,0.00009800929,0.015689392,0.0039270287,0.96971726,0.009683531,0.000029011304],"about_ca_topic_score_codex":0.0015765723,"about_ca_topic_score_gemma":0.0015522814,"teacher_disagreement_score":0.001933569,"about_ca_system_score_codex":0.0012032303,"about_ca_system_score_gemma":0.00094995083,"threshold_uncertainty_score":0.008730054},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54552215,0.0044400566,0.4269903,0.0037940026,0.00015145399,0.00015381866,0.0014839005,0.0017129031,0.015751317],"genre_scores_gemma":[0.8954797,0.0012802753,0.099066965,0.00025876195,0.00023869956,0.00016169547,0.00089473906,0.00053083117,0.0020883768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99179244,0.00245713,0.001030188,0.0016943723,0.0022832248,0.000742703],"domain_scores_gemma":[0.9125918,0.06902482,0.0054988707,0.0077043334,0.0030109007,0.002169237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00702414,0.00051130104,0.0017158607,0.0027374444,0.0011920705,0.0047012386,0.003006603,0.0017984478,0.004789647],"category_scores_gemma":[0.052737363,0.0013949057,0.0014819376,0.0021953834,0.003127278,0.013308264,0.0036764946,0.0023876044,0.00059620745],"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.002210838,0.0003179685,0.010790471,0.0024282057,0.00043980993,0.0010525618,0.0031342583,0.049937394,0.030575573,0.75653255,0.0045277006,0.13805257],"study_design_scores_gemma":[0.00012889238,0.000118458345,0.0015477503,0.00015497753,0.00018294126,0.0007610749,0.00032607053,0.04563584,0.016383609,0.9302818,0.0044217953,0.000056765],"about_ca_topic_score_codex":0.00022160458,"about_ca_topic_score_gemma":0.0002301277,"teacher_disagreement_score":0.00702414,"about_ca_system_score_codex":0.00091065065,"about_ca_system_score_gemma":0.000708837,"threshold_uncertainty_score":0.03714764},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58176035,0.001128717,0.36276314,0.004775602,0.000087180844,0.0000965666,0.0003510061,0.00036005946,0.048677266],"genre_scores_gemma":[0.9593247,0.00044960773,0.033881683,0.0003321557,0.00013627524,0.0000991691,0.00033289936,0.00004558254,0.0053978534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832124,0.000531459,0.000117167336,0.00032037986,0.00045656302,0.00025315725],"domain_scores_gemma":[0.9959449,0.002658616,0.0004003011,0.00039513616,0.00035498175,0.00024594262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012975365,0.0002438261,0.0004722567,0.0008619681,0.0018622042,0.0021732831,0.0009476263,0.0008182228,0.0024814478],"category_scores_gemma":[0.0042725513,0.0003253167,0.0008561972,0.0011846595,0.004006889,0.006446777,0.0023484095,0.0026822635,0.00031450603],"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.00002368919,0.000025028075,0.0003060907,0.000022977172,0.0000053500485,0.00006116818,0.00024698267,0.0022505007,0.00090949406,0.9905691,0.0004466967,0.0051328912],"study_design_scores_gemma":[0.000007847594,0.000011182075,0.000122037054,0.0000068710983,0.0000055328155,0.000059562502,0.00010399373,0.00976914,0.0010371034,0.9872728,0.0015933271,0.000010722492],"about_ca_topic_score_codex":0.0020858136,"about_ca_topic_score_gemma":0.0014376856,"teacher_disagreement_score":0.0024814478,"about_ca_system_score_codex":0.0015624446,"about_ca_system_score_gemma":0.0013526691,"threshold_uncertainty_score":0.011336386},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45098203,0.0036142473,0.47514215,0.014536242,0.00024557352,0.0003983418,0.0056622108,0.0011304992,0.04828867],"genre_scores_gemma":[0.8727579,0.0031044795,0.10938856,0.0008342149,0.00053281436,0.00060816586,0.004212799,0.0005834104,0.007977629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928109,0.002390409,0.00035724964,0.0013933443,0.002099776,0.0009482573],"domain_scores_gemma":[0.95004225,0.041667566,0.002565023,0.0031857435,0.0015890771,0.0009504449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003089745,0.0012243091,0.0020179544,0.0013383293,0.0018361991,0.0059446073,0.0026339402,0.0025607431,0.008680145],"category_scores_gemma":[0.030323327,0.00096591003,0.0023048676,0.0034733764,0.0028885563,0.014080921,0.0042325216,0.0050480883,0.0006767197],"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.00077391777,0.00030353424,0.006033728,0.001308091,0.00038454245,0.00069195864,0.0014000455,0.36834064,0.005358354,0.49594247,0.022010187,0.09745255],"study_design_scores_gemma":[0.00009859611,0.000057573976,0.0013973716,0.00007838608,0.000109704546,0.00033789512,0.00046787213,0.25567016,0.002586096,0.73096424,0.008182933,0.000049153674],"about_ca_topic_score_codex":0.0038105985,"about_ca_topic_score_gemma":0.0031619542,"teacher_disagreement_score":0.008680145,"about_ca_system_score_codex":0.002665831,"about_ca_system_score_gemma":0.002404742,"threshold_uncertainty_score":0.029037952},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045615055,0.0020552415,0.91405296,0.0011242302,0.00034724383,0.00008362133,0.00015610771,0.0009627231,0.035602752],"genre_scores_gemma":[0.7339051,0.002310526,0.23828243,0.00088972674,0.0005100041,0.00031444512,0.00026690876,0.00045650513,0.023064457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713,0.00081718253,0.00023901566,0.00055566867,0.00085267925,0.00040557285],"domain_scores_gemma":[0.9975237,0.0010473846,0.00019555724,0.0007386365,0.00035571342,0.0001390098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00433099,0.0007012559,0.0009438306,0.0022534386,0.0017219564,0.004692992,0.001347452,0.0014286913,0.003975845],"category_scores_gemma":[0.0046327733,0.00073726627,0.0019841762,0.0021646144,0.007855919,0.011796572,0.0049700937,0.003453824,0.00090736244],"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.0000036569563,0.000002460478,0.000048038597,0.000011043505,0.0000019857077,0.000020877595,0.00009684409,0.00040795695,0.00017331599,0.99737763,0.00011436973,0.0017417488],"study_design_scores_gemma":[0.000008475512,0.000011431051,0.00005731928,0.000016898348,0.000012472638,0.00008944044,0.000029686218,0.0061174077,0.0008078394,0.98384696,0.0089885695,0.0000134300135],"about_ca_topic_score_codex":0.001793581,"about_ca_topic_score_gemma":0.0021449765,"teacher_disagreement_score":0.004692992,"about_ca_system_score_codex":0.0027168738,"about_ca_system_score_gemma":0.0016233681,"threshold_uncertainty_score":0.022904754},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17404859,0.0032561456,0.6775802,0.016964504,0.0002165427,0.0003732787,0.001948024,0.0027844384,0.122828305],"genre_scores_gemma":[0.8362867,0.0023374956,0.13678913,0.0028303368,0.00088688923,0.0011933704,0.002952122,0.0018967888,0.01482721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98725677,0.0055342275,0.00071577664,0.0028979972,0.0023408488,0.0012543447],"domain_scores_gemma":[0.849464,0.13012303,0.0037725172,0.012698142,0.0027103734,0.0012320525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010528842,0.0012622854,0.0022957318,0.002287268,0.0031530603,0.007888192,0.003503297,0.0025113858,0.015758833],"category_scores_gemma":[0.07381305,0.0015207097,0.0044563455,0.0035216042,0.010542154,0.025636187,0.0078579895,0.008763256,0.0023503876],"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.00014703078,0.00013301948,0.0013984004,0.00027735118,0.00006112828,0.00024831557,0.0006979208,0.01911561,0.0014710112,0.9631313,0.0028630474,0.010455777],"study_design_scores_gemma":[0.000024601532,0.000016655898,0.00016857868,0.000030793824,0.000016110707,0.00006257944,0.000042945216,0.020218339,0.0005432909,0.9770965,0.0017674302,0.0000121720805],"about_ca_topic_score_codex":0.0029292475,"about_ca_topic_score_gemma":0.003545688,"teacher_disagreement_score":0.015758833,"about_ca_system_score_codex":0.005667296,"about_ca_system_score_gemma":0.0025412163,"threshold_uncertainty_score":0.05568254},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3021189,0.0011376666,0.5972813,0.0036890714,0.00036250314,0.00017473774,0.0016044596,0.000493087,0.09313829],"genre_scores_gemma":[0.92743665,0.00055303844,0.056749154,0.0007689389,0.00016843845,0.00023217498,0.0011140967,0.000110711204,0.012866679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709535,0.0006561283,0.00029596986,0.0006870462,0.0007304619,0.00053513545],"domain_scores_gemma":[0.9926845,0.0038351405,0.0005276226,0.0009838777,0.0014747479,0.00049408496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034914813,0.0006604163,0.00085417187,0.0016723934,0.0020809518,0.0035398973,0.0012081602,0.001597799,0.0059415256],"category_scores_gemma":[0.00774848,0.0007293796,0.001626422,0.0013921512,0.006388832,0.016847434,0.005474031,0.004688453,0.0010342977],"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.000007931262,0.000009350018,0.00016227967,0.00002465651,0.000004553099,0.000043354157,0.00022891497,0.00021007039,0.00033694273,0.9970169,0.0002868098,0.0016681186],"study_design_scores_gemma":[0.000009619916,0.000011409181,0.00024329407,0.000007509087,0.0000052800187,0.00006701182,0.00013282418,0.0013340039,0.0006288916,0.9943995,0.0031493378,0.000011375282],"about_ca_topic_score_codex":0.0016835531,"about_ca_topic_score_gemma":0.0017070108,"teacher_disagreement_score":0.0059415256,"about_ca_system_score_codex":0.001516254,"about_ca_system_score_gemma":0.0012057344,"threshold_uncertainty_score":0.01987642},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05468134,0.0009651224,0.9107187,0.002630507,0.00008809124,0.00024787572,0.0006400687,0.0007160405,0.029312277],"genre_scores_gemma":[0.6091107,0.0012557111,0.37585253,0.0009806174,0.00030115256,0.00051889796,0.0013315819,0.00018780904,0.010461071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974383,0.0006552838,0.00017520296,0.00069139595,0.0007110271,0.00032882625],"domain_scores_gemma":[0.9914698,0.006150888,0.0007442897,0.00071507297,0.00054984994,0.00037010162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016850855,0.00079343305,0.00081871223,0.0015847152,0.0012653087,0.0036779197,0.0018103799,0.0012354767,0.005053286],"category_scores_gemma":[0.006709483,0.0005039164,0.0014591202,0.0024356851,0.0046867956,0.007907329,0.002329062,0.005050889,0.00055195496],"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.000028246759,0.000065145134,0.00048685272,0.00019424946,0.000017591343,0.00014073765,0.0004253374,0.009674511,0.002078787,0.96595865,0.0013723475,0.019557523],"study_design_scores_gemma":[0.00002477807,0.00003864093,0.0003988173,0.000046467303,0.000014274965,0.0003257379,0.00019349581,0.049849115,0.0029741626,0.9315295,0.014574885,0.000030100877],"about_ca_topic_score_codex":0.0017245864,"about_ca_topic_score_gemma":0.0017444786,"teacher_disagreement_score":0.005053286,"about_ca_system_score_codex":0.0020780812,"about_ca_system_score_gemma":0.0018249541,"threshold_uncertainty_score":0.01690489},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017284304,0.00009771324,0.9754827,0.00038815726,0.00006859267,0.00014989621,0.00024292183,0.0033975695,0.0028881528],"genre_scores_gemma":[0.43613964,0.000235505,0.5538952,0.00034856383,0.000043043816,0.00027120212,0.0014980055,0.0009598505,0.006608974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955314,0.0011317073,0.00036209627,0.0008377679,0.0016860822,0.0004510338],"domain_scores_gemma":[0.9897383,0.0031188193,0.0005944559,0.005277742,0.0011012695,0.00016947002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031980325,0.0010753804,0.0011569638,0.0009817703,0.0009833837,0.002198529,0.002747779,0.0016535626,0.008033906],"category_scores_gemma":[0.0146808885,0.0006589172,0.0021767933,0.00070949295,0.0018720198,0.0053455625,0.0051139593,0.0030173124,0.0016260257],"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.00084527885,0.00034139748,0.0037496598,0.0010752773,0.00025263647,0.0013918441,0.0018519192,0.28700337,0.045757245,0.42666945,0.012862391,0.21819957],"study_design_scores_gemma":[0.00010123831,0.00024826307,0.0004666892,0.00017183385,0.000119619166,0.00066558825,0.00052700937,0.5889522,0.0573019,0.3088368,0.04253216,0.00007669444],"about_ca_topic_score_codex":0.0021763926,"about_ca_topic_score_gemma":0.0016127342,"teacher_disagreement_score":0.008033906,"about_ca_system_score_codex":0.0015280697,"about_ca_system_score_gemma":0.002084354,"threshold_uncertainty_score":0.026876092},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13032708,0.0024955187,0.8185641,0.011753775,0.00013815949,0.00020030838,0.0006006356,0.00038324454,0.035537273],"genre_scores_gemma":[0.79531676,0.0017465589,0.19284788,0.0016162074,0.000633554,0.00026448912,0.0012701182,0.00012958971,0.006174923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99081635,0.0034000503,0.000560647,0.0013779879,0.0029950931,0.00084975566],"domain_scores_gemma":[0.9390371,0.05192039,0.002743376,0.0023290678,0.002901776,0.0010683704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056901574,0.0009091014,0.0009444489,0.0022939981,0.0019045352,0.0039594877,0.0021900595,0.0019236075,0.008246223],"category_scores_gemma":[0.029569207,0.000708451,0.0020106407,0.002762887,0.0065144645,0.013833225,0.0047234483,0.005604214,0.0007238315],"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.00006339611,0.000071661154,0.0013686831,0.000292902,0.00005044613,0.00018416544,0.0004958119,0.014922796,0.0011692378,0.95938057,0.0022848747,0.01971539],"study_design_scores_gemma":[0.000022101476,0.000023661863,0.0006007939,0.00003760129,0.000012762171,0.000104520084,0.00017277949,0.03252643,0.00096765434,0.96285033,0.0026608037,0.000020573454],"about_ca_topic_score_codex":0.0018718338,"about_ca_topic_score_gemma":0.0014842496,"teacher_disagreement_score":0.008246223,"about_ca_system_score_codex":0.00291123,"about_ca_system_score_gemma":0.0012675142,"threshold_uncertainty_score":0.030092776},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030454613,0.0018221821,0.81135356,0.012691473,0.0012197118,0.00021935099,0.0018020546,0.0024090384,0.1380281],"genre_scores_gemma":[0.64303166,0.0029998391,0.28913835,0.0038526687,0.0007780152,0.00054209266,0.002091395,0.00052083394,0.057045035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979944,0.00038706584,0.00015824729,0.00062726147,0.0006480779,0.00018495727],"domain_scores_gemma":[0.99597126,0.0016111098,0.00030714573,0.0010490278,0.00083947874,0.00022188885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018816906,0.00041185025,0.00030798608,0.00070565304,0.0011415923,0.0029608153,0.0009614913,0.0016354697,0.010144719],"category_scores_gemma":[0.0061611156,0.00040477907,0.0007278999,0.0007399699,0.0039820885,0.0065718475,0.0014703072,0.0026089277,0.002502276],"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.000014069547,0.000004811005,0.0001375932,0.00004540073,0.000004713194,0.00007026246,0.0001388722,0.0016392593,0.000946275,0.9883022,0.002881247,0.005815283],"study_design_scores_gemma":[0.000019188496,0.000020032043,0.0001633209,0.000043845816,0.00000988495,0.00014522973,0.00008714727,0.00994772,0.0023333866,0.90962064,0.07759458,0.000015101049],"about_ca_topic_score_codex":0.0019018586,"about_ca_topic_score_gemma":0.0017054464,"teacher_disagreement_score":0.010144719,"about_ca_system_score_codex":0.0015796279,"about_ca_system_score_gemma":0.0015526725,"threshold_uncertainty_score":0.033937454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10618668,0.017497998,0.5571071,0.029180827,0.0035116835,0.00007421561,0.0005585771,0.00059602584,0.2852868],"genre_scores_gemma":[0.90476996,0.0055799065,0.062454816,0.002297619,0.0022335264,0.00011611115,0.00014037959,0.00021433992,0.022193309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838674,0.0005091915,0.00010006361,0.00033411174,0.0004785916,0.00019127304],"domain_scores_gemma":[0.99675614,0.0019791133,0.00016972052,0.00044590564,0.00033986146,0.00030932805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039598565,0.0004666841,0.00079174957,0.0013127964,0.00308214,0.0061338902,0.0011685181,0.0010799284,0.005397748],"category_scores_gemma":[0.0040379395,0.00049922755,0.0012686544,0.0010094552,0.018867979,0.01155905,0.004618676,0.0044118515,0.0005575141],"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.0000056480853,0.0000021022934,0.000072642084,0.000015331638,0.0000023300775,0.00003945804,0.00023318072,0.00008466075,0.00014188937,0.9980292,0.00032616773,0.0010472309],"study_design_scores_gemma":[0.0000060037255,0.000020381845,0.00017766692,0.000018592991,0.00000716985,0.00010090905,0.00016006737,0.0008446155,0.00032272053,0.9809924,0.017338261,0.000011239822],"about_ca_topic_score_codex":0.0017049896,"about_ca_topic_score_gemma":0.001466596,"teacher_disagreement_score":0.0061338902,"about_ca_system_score_codex":0.0015780808,"about_ca_system_score_gemma":0.0009342488,"threshold_uncertainty_score":0.020941913},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15817587,0.0004695721,0.81787765,0.00040490055,0.00011737977,0.000119538825,0.0003774923,0.0007502793,0.021707311],"genre_scores_gemma":[0.8855492,0.00035610382,0.09667742,0.0003288744,0.00015584912,0.0004202442,0.0006322092,0.00021191193,0.0156683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612385,0.0009984028,0.00028875849,0.0012003387,0.00090621534,0.00048239314],"domain_scores_gemma":[0.9932041,0.0033961644,0.0010145144,0.00092897954,0.00088777015,0.0005684336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023555737,0.00062881305,0.0006420277,0.0015109106,0.0015596249,0.0033396313,0.0014291322,0.0013524005,0.0065323045],"category_scores_gemma":[0.0077970815,0.000723609,0.0019966054,0.00087123195,0.0044018007,0.0064635174,0.0043005375,0.0023827269,0.0009776116],"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.0000478926,0.000018083281,0.00031312238,0.000029333592,0.000011444336,0.00015838124,0.00039948546,0.0032365713,0.0015034061,0.99101126,0.00013161433,0.0031394018],"study_design_scores_gemma":[0.00002368126,0.00005979084,0.00030794466,0.000029798226,0.000018069091,0.000116366646,0.00011840449,0.04451189,0.0023327149,0.9489694,0.0034852482,0.000026574566],"about_ca_topic_score_codex":0.0016149092,"about_ca_topic_score_gemma":0.001138258,"teacher_disagreement_score":0.0065323045,"about_ca_system_score_codex":0.0016165391,"about_ca_system_score_gemma":0.00091341796,"threshold_uncertainty_score":0.021852732},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04353116,0.00018426997,0.9541913,0.00021498272,0.000024641226,0.000040063085,0.000045527795,0.00030357522,0.0014644953],"genre_scores_gemma":[0.62598634,0.0002592212,0.37093076,0.00008697392,0.000037574522,0.00011356754,0.00016353553,0.00013434463,0.0022876475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947582,0.0016521421,0.00034710797,0.0009887893,0.001829613,0.0004241349],"domain_scores_gemma":[0.98890066,0.007055511,0.0010229509,0.0015172455,0.0010101917,0.000493456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060217227,0.00081874494,0.001068797,0.0018340818,0.0009251786,0.0028190315,0.0019721573,0.0013939636,0.0022876651],"category_scores_gemma":[0.028536761,0.0009273889,0.0016944241,0.0011906622,0.0029255883,0.006774155,0.004038383,0.0031451392,0.00040313357],"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.00020604585,0.00005225548,0.0016995687,0.00012693922,0.000038422015,0.00009119064,0.00036053528,0.3074369,0.0031883817,0.6465677,0.00051106187,0.03972103],"study_design_scores_gemma":[0.000010263867,0.000032809217,0.00013454574,0.000011025455,0.000006938028,0.000039184895,0.000017701406,0.8016347,0.0012066092,0.19616586,0.0007235714,0.00001680657],"about_ca_topic_score_codex":0.0026837396,"about_ca_topic_score_gemma":0.0017975398,"teacher_disagreement_score":0.0060217227,"about_ca_system_score_codex":0.0038395408,"about_ca_system_score_gemma":0.001806387,"threshold_uncertainty_score":0.031846285},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4481385,0.00040859007,0.45834765,0.0007995001,0.00019627507,0.00014570174,0.0010508428,0.0037142406,0.087198764],"genre_scores_gemma":[0.8910825,0.00020743888,0.09305614,0.0004497554,0.00010534721,0.00012861185,0.00097571994,0.00048816737,0.013506355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993024,0.00009783211,0.00003176983,0.00015682506,0.00020336888,0.00020782782],"domain_scores_gemma":[0.99940157,0.00017768575,0.00006187153,0.00020869875,0.00009602894,0.000054178898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038156664,0.0004695551,0.00035098608,0.00041358388,0.00058460754,0.0010176823,0.0010692659,0.0003526359,0.010773372],"category_scores_gemma":[0.0013527914,0.00023010137,0.0007490663,0.00039713265,0.0012058774,0.0021558765,0.0018431409,0.0013809142,0.0014830375],"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.00039154128,0.0001549822,0.0019541325,0.000200069,0.00003899644,0.00029060218,0.00029413035,0.015570436,0.03080643,0.84565234,0.005440024,0.0992064],"study_design_scores_gemma":[0.0000794563,0.00024319146,0.0010155423,0.000028316159,0.00007305735,0.00023572566,0.00013018404,0.15065923,0.06935303,0.758966,0.019162342,0.000053869986],"about_ca_topic_score_codex":0.0015885244,"about_ca_topic_score_gemma":0.002120764,"teacher_disagreement_score":0.010773372,"about_ca_system_score_codex":0.00083182694,"about_ca_system_score_gemma":0.00078475603,"threshold_uncertainty_score":0.036040485},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21952151,0.0024247016,0.7427453,0.006052517,0.00016794655,0.00013263512,0.0008245007,0.0037115924,0.024419377],"genre_scores_gemma":[0.89566714,0.0011991836,0.09579303,0.00080382795,0.00025313234,0.0002362031,0.0006707199,0.00065260753,0.004724116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99574846,0.001110031,0.0001883844,0.0010948527,0.0010601733,0.0007981347],"domain_scores_gemma":[0.954884,0.036963154,0.0016858062,0.004930132,0.0010611258,0.0004758176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039569596,0.0012137566,0.0013078388,0.001716391,0.0021720116,0.004566118,0.0027128123,0.0013306722,0.003689798],"category_scores_gemma":[0.021305073,0.0011290244,0.0030165005,0.0025933352,0.0072081983,0.013530323,0.0033352629,0.0068199616,0.00039913453],"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.0005281833,0.00009850025,0.0016945571,0.0003007515,0.00011133677,0.00028409698,0.00067934394,0.08049385,0.005438282,0.88990635,0.0017472031,0.018717447],"study_design_scores_gemma":[0.000062660554,0.000046145833,0.00048552197,0.00003886914,0.00006976949,0.000080819955,0.00006412778,0.17356704,0.0036071988,0.8195518,0.0023857811,0.00004030104],"about_ca_topic_score_codex":0.008637867,"about_ca_topic_score_gemma":0.007941498,"teacher_disagreement_score":0.008637867,"about_ca_system_score_codex":0.005398101,"about_ca_system_score_gemma":0.0025265827,"threshold_uncertainty_score":0.039166093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011436001,0.011817804,0.7854148,0.013541118,0.0015558786,0.00019240596,0.0013635724,0.001390603,0.17328778],"genre_scores_gemma":[0.5267086,0.009367802,0.3898097,0.0061288956,0.004161322,0.0011410331,0.0030931425,0.0005617709,0.0590277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820256,0.0006756272,0.00013375704,0.00017904064,0.00061677926,0.00019227188],"domain_scores_gemma":[0.99828655,0.0007588759,0.00013768826,0.00031733525,0.0003847997,0.00011475585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034020531,0.0012265152,0.0007670248,0.0032643573,0.0020633454,0.005162799,0.0018175495,0.0014126699,0.010985104],"category_scores_gemma":[0.003104842,0.00056926266,0.0016910818,0.0028709387,0.0070936102,0.010134151,0.00258447,0.0062392545,0.0028246283],"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.0000012127566,0.000003686829,0.000014721053,0.000013127684,0.0000015163217,0.000007772749,0.00006652441,0.00010371032,0.000054960237,0.99774456,0.0008048288,0.0011834216],"study_design_scores_gemma":[0.0000073772244,0.0000038759745,0.00002606489,0.000015939728,0.0000022548195,0.000022989072,0.000041254985,0.00093246147,0.00008550058,0.98147684,0.01738151,0.0000040161553],"about_ca_topic_score_codex":0.0018785417,"about_ca_topic_score_gemma":0.0018031698,"teacher_disagreement_score":0.010985104,"about_ca_system_score_codex":0.0038729857,"about_ca_system_score_gemma":0.0014693465,"threshold_uncertainty_score":0.036748827},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009801869,0.0000485429,0.98643064,0.000065063236,0.000026223594,0.00006349757,0.000055977765,0.0012276847,0.0022806118],"genre_scores_gemma":[0.25339103,0.00015342406,0.7431851,0.00004572315,0.000015355337,0.0002602529,0.00029103333,0.00042708998,0.0022310524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899596,0.00027017115,0.00007636867,0.00015757591,0.0004384152,0.000061621635],"domain_scores_gemma":[0.998692,0.0006790087,0.000088340064,0.000284478,0.00022038174,0.000035895722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010443964,0.000562634,0.00041546545,0.0004961504,0.00048061827,0.0007010812,0.000942224,0.000488267,0.0024983694],"category_scores_gemma":[0.0029890295,0.00040587256,0.0006457899,0.00027921572,0.0008967001,0.00082236476,0.0011010555,0.00075110374,0.0005146139],"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.00013316903,0.00012240291,0.0009842792,0.0006427204,0.000079077814,0.00049832277,0.00052296335,0.48928246,0.1082363,0.21364456,0.0027847155,0.18306907],"study_design_scores_gemma":[0.00005252434,0.000057468544,0.00008827239,0.0000452811,0.000026080033,0.00009090083,0.00006404761,0.8804877,0.05515043,0.05062761,0.013296303,0.000013433662],"about_ca_topic_score_codex":0.00045312717,"about_ca_topic_score_gemma":0.00081014837,"teacher_disagreement_score":0.0024983694,"about_ca_system_score_codex":0.0006110904,"about_ca_system_score_gemma":0.0010970995,"threshold_uncertainty_score":0.008357823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020719051,0.00016091915,0.97062284,0.0004664884,0.000035458066,0.00010966483,0.00023661436,0.00046590643,0.007182971],"genre_scores_gemma":[0.41304466,0.0005098055,0.5654015,0.00045441874,0.00016983983,0.0003856668,0.0010365683,0.00037644498,0.018621149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982558,0.0003218121,0.00012703767,0.00036760053,0.0007073611,0.00022033045],"domain_scores_gemma":[0.99700147,0.0016723952,0.0002382378,0.0004679855,0.0005118554,0.00010801765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002042476,0.0005659029,0.0006081203,0.0015791745,0.0012528277,0.0020262916,0.001160467,0.00079039525,0.0058062333],"category_scores_gemma":[0.0051827924,0.00050787564,0.002705236,0.0013268996,0.0027081387,0.0059201145,0.00248224,0.00353265,0.0010155041],"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.00007036549,0.000044686738,0.0007803799,0.00013355355,0.000026028432,0.00011720108,0.00047874273,0.01929524,0.007150022,0.9254057,0.0016348497,0.044863332],"study_design_scores_gemma":[0.000013122281,0.000038680653,0.00027943373,0.0000478265,0.000028444238,0.00008380711,0.00013246085,0.08019548,0.008649822,0.90067077,0.009832434,0.00002769736],"about_ca_topic_score_codex":0.0028157362,"about_ca_topic_score_gemma":0.003270086,"teacher_disagreement_score":0.0058062333,"about_ca_system_score_codex":0.002036708,"about_ca_system_score_gemma":0.0017046933,"threshold_uncertainty_score":0.019423783},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019969298,0.0001349625,0.9652073,0.0005894012,0.0001015071,0.00009739794,0.00018733041,0.000880351,0.01283249],"genre_scores_gemma":[0.49618313,0.00035344576,0.48862302,0.0006256286,0.00016585083,0.0006004556,0.0005613144,0.0005022045,0.012384928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989122,0.00019172445,0.0001289979,0.00019230382,0.0004068188,0.0001680748],"domain_scores_gemma":[0.9990171,0.00030182517,0.00009213193,0.00022325706,0.0002818635,0.00008369466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010231156,0.0006806675,0.0005223884,0.0008755257,0.0009983139,0.0021825077,0.0013010349,0.0007962943,0.00475395],"category_scores_gemma":[0.0018085007,0.000490511,0.0011413809,0.0007683332,0.0039221006,0.004427163,0.0026352545,0.0018014868,0.0007825258],"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.000022543474,0.000018233122,0.0001609771,0.00005670851,0.000007676683,0.00009563455,0.00027308645,0.00686744,0.002719134,0.9820049,0.0006329177,0.0071407827],"study_design_scores_gemma":[0.00003417713,0.000060487146,0.00014304335,0.00003308397,0.00003338163,0.00015202553,0.00020107177,0.087238334,0.0076106195,0.8783339,0.026131965,0.00002788496],"about_ca_topic_score_codex":0.0020563086,"about_ca_topic_score_gemma":0.0019211958,"teacher_disagreement_score":0.00475395,"about_ca_system_score_codex":0.0012752266,"about_ca_system_score_gemma":0.0016007181,"threshold_uncertainty_score":0.015903533},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028783726,0.0007766114,0.95252895,0.0007127049,0.000058598704,0.000030402522,0.00013161568,0.00020344908,0.016774006],"genre_scores_gemma":[0.7059572,0.0014352582,0.27979118,0.0002517135,0.00043119013,0.00021188075,0.0002599943,0.00027636607,0.011385234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972145,0.0008550773,0.00015614185,0.00047991847,0.00095542363,0.0003390218],"domain_scores_gemma":[0.9946879,0.0032062037,0.00051229686,0.00063384586,0.00071077666,0.0002490817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031119967,0.0009876663,0.0008174894,0.0023459296,0.00109606,0.0040728254,0.0015692636,0.0011288121,0.0038390958],"category_scores_gemma":[0.006194625,0.00069274334,0.0020590834,0.0019342657,0.005445472,0.007280236,0.002456531,0.005016628,0.0006612316],"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.000009341118,0.0000081260205,0.00010278401,0.00002982492,0.0000053151957,0.000029034394,0.00012735951,0.0036563904,0.0005122059,0.99167186,0.00019541453,0.0036521666],"study_design_scores_gemma":[0.0000076289907,0.000016154472,0.00010881772,0.000022443885,0.000008732038,0.00005931865,0.000050375744,0.025144015,0.0009919946,0.96914375,0.0044327993,0.000014011056],"about_ca_topic_score_codex":0.00129101,"about_ca_topic_score_gemma":0.0011119922,"teacher_disagreement_score":0.0040728254,"about_ca_system_score_codex":0.0031710349,"about_ca_system_score_gemma":0.0012280138,"threshold_uncertainty_score":0.023007631},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1635141,0.0007825573,0.80005586,0.0012336911,0.00011919079,0.00006361208,0.00031464192,0.0005748531,0.033341523],"genre_scores_gemma":[0.9123874,0.00050316966,0.078854986,0.0002584388,0.00014285461,0.00013721579,0.00031385018,0.00013234022,0.007269785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985965,0.00029923097,0.00006883985,0.0004275477,0.0004530485,0.00015484626],"domain_scores_gemma":[0.9964269,0.0021207777,0.00023621265,0.00059529406,0.00048273115,0.00013810433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012686375,0.00041379908,0.0007335022,0.0009425603,0.00069471286,0.0021670691,0.0010447262,0.0010829397,0.0038419743],"category_scores_gemma":[0.008694662,0.00030501373,0.0009728071,0.000551366,0.0031024858,0.0037679172,0.0022372378,0.0024907805,0.0005032351],"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.00003529281,0.00001286709,0.00049305195,0.000047552767,0.000017202983,0.00009133313,0.0001771963,0.048066236,0.0011875115,0.94208837,0.0006673793,0.007116],"study_design_scores_gemma":[0.000010754344,0.000027366803,0.00026249114,0.000019768233,0.000012146262,0.00010076219,0.000045046363,0.27458814,0.0007703232,0.72150224,0.002649396,0.000011509132],"about_ca_topic_score_codex":0.0019120459,"about_ca_topic_score_gemma":0.0007801741,"teacher_disagreement_score":0.0038419743,"about_ca_system_score_codex":0.0014478699,"about_ca_system_score_gemma":0.0008242045,"threshold_uncertainty_score":0.012852669},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1346132,0.0016941202,0.77576435,0.0017260037,0.00031404672,0.00009507146,0.00077798055,0.00038211702,0.08463314],"genre_scores_gemma":[0.85743445,0.0012045855,0.11111284,0.0006988404,0.00062466285,0.00019363902,0.00073863624,0.00018901523,0.027803224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977969,0.00042742398,0.00013786845,0.00041073968,0.00097005034,0.00025709462],"domain_scores_gemma":[0.99800926,0.0004439667,0.00036622363,0.00025944514,0.0005726077,0.00034848126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016661563,0.0007300802,0.00068954256,0.0020538364,0.0015846662,0.0026723947,0.0011938552,0.0008675014,0.0069488543],"category_scores_gemma":[0.0036340372,0.00039272947,0.0011516107,0.0012383631,0.0032429982,0.0076583624,0.002924882,0.0017227755,0.0008620511],"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.0000021888543,0.0000030047709,0.000031354713,0.0000073387155,0.0000027926408,0.000013068483,0.0000327934,0.0004598775,0.00015322125,0.9982658,0.00013809964,0.00089042605],"study_design_scores_gemma":[0.000004066513,0.000011965149,0.00008786932,0.0000061143946,0.0000042853067,0.000055323013,0.000031807893,0.005457822,0.00029781339,0.989186,0.0048461077,0.000010864075],"about_ca_topic_score_codex":0.0016511384,"about_ca_topic_score_gemma":0.0014563189,"teacher_disagreement_score":0.0069488543,"about_ca_system_score_codex":0.0015607234,"about_ca_system_score_gemma":0.0009615101,"threshold_uncertainty_score":0.023246229},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2498404,0.00100218,0.72536516,0.005994358,0.00013364693,0.00037122096,0.0012698505,0.000978747,0.015044472],"genre_scores_gemma":[0.74742436,0.00091904984,0.23814392,0.00081988814,0.00048506423,0.00033747975,0.0029341322,0.00022713743,0.008708986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967996,0.001008445,0.0002526205,0.0008067482,0.00084613485,0.00028636903],"domain_scores_gemma":[0.98627985,0.010900953,0.000645962,0.0010426785,0.0005789174,0.0005516703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030539727,0.0005404202,0.001045374,0.000885753,0.00172184,0.0032349634,0.0020698858,0.0015982502,0.0052229147],"category_scores_gemma":[0.0155462455,0.0006177315,0.0022264917,0.0014301329,0.0039406777,0.013334611,0.0034182,0.003984311,0.00080187956],"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.00035282577,0.00023640075,0.0027567972,0.0004402069,0.00006770553,0.00045658395,0.0017137254,0.026561774,0.00489005,0.8970118,0.00645194,0.05906016],"study_design_scores_gemma":[0.000033908123,0.000036187175,0.00027361047,0.000027700036,0.000021855329,0.00020234947,0.00029224707,0.049777176,0.0028394323,0.9433057,0.0031683212,0.000021507485],"about_ca_topic_score_codex":0.0024795095,"about_ca_topic_score_gemma":0.0017835406,"teacher_disagreement_score":0.0052229147,"about_ca_system_score_codex":0.0019102687,"about_ca_system_score_gemma":0.001959648,"threshold_uncertainty_score":0.017472386},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015319274,0.00013032513,0.97874326,0.000600621,0.00006066754,0.00011543602,0.0002852759,0.0019139006,0.0028311769],"genre_scores_gemma":[0.19648191,0.00022733603,0.7992312,0.00036321353,0.00010662325,0.00023388148,0.0009282416,0.0004312165,0.0019963568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927164,0.0022573946,0.00058995606,0.0013080811,0.00248422,0.0006440747],"domain_scores_gemma":[0.98598075,0.010838269,0.0008811182,0.001249092,0.00075884187,0.00029195007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059781508,0.0011686044,0.0013326153,0.0019630988,0.0017891276,0.004468316,0.0031189185,0.0019685933,0.005039737],"category_scores_gemma":[0.021844206,0.0011015047,0.0042433436,0.002452202,0.0037558957,0.00764404,0.005563949,0.0034565018,0.00096683175],"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.00036290623,0.00022072431,0.0024366113,0.00080168137,0.00020759446,0.0011244001,0.0011507877,0.35975844,0.011300357,0.5041411,0.0075343973,0.110961],"study_design_scores_gemma":[0.00006557319,0.000040446426,0.00020262288,0.00007360677,0.00007668769,0.00021308352,0.00021244002,0.6205233,0.013660999,0.35562867,0.009258819,0.000043780878],"about_ca_topic_score_codex":0.008148252,"about_ca_topic_score_gemma":0.01206907,"teacher_disagreement_score":0.008148252,"about_ca_system_score_codex":0.003003826,"about_ca_system_score_gemma":0.004250946,"threshold_uncertainty_score":0.031615853},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5122638,0.0005488507,0.4666102,0.00042816318,0.00009174669,0.00019123148,0.00069209933,0.0013535573,0.0178204],"genre_scores_gemma":[0.9321264,0.00030278956,0.059068125,0.00012967519,0.000054863176,0.00016624555,0.00065483805,0.00009056189,0.0074064764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993224,0.00011911624,0.00006151563,0.00021273966,0.00013399217,0.00015021159],"domain_scores_gemma":[0.99830097,0.0009572219,0.00028451474,0.00015415884,0.0001639742,0.00013908948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053317525,0.0006749883,0.0004516076,0.0006620226,0.00069038686,0.001709495,0.0010018502,0.00055229594,0.004810159],"category_scores_gemma":[0.0022697828,0.00034053338,0.0010777587,0.0006799326,0.0014301213,0.0031279249,0.0016043832,0.0014948843,0.0005461851],"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.00044285296,0.00023077613,0.001964051,0.00035836964,0.00005320896,0.00095184497,0.00085179,0.19932418,0.025757963,0.7356899,0.0009454596,0.033429634],"study_design_scores_gemma":[0.00008067218,0.0002591502,0.000812241,0.000058685724,0.00007463185,0.00028812722,0.0002636059,0.46385977,0.020439913,0.5064095,0.0073876404,0.00006600593],"about_ca_topic_score_codex":0.0026874281,"about_ca_topic_score_gemma":0.0024781607,"teacher_disagreement_score":0.004810159,"about_ca_system_score_codex":0.00114773,"about_ca_system_score_gemma":0.00077046826,"threshold_uncertainty_score":0.016091585},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0400156,0.0027159778,0.86395633,0.005485084,0.000403077,0.00007959129,0.0006180844,0.0009630989,0.08576331],"genre_scores_gemma":[0.79147905,0.0014443115,0.17744346,0.0018264599,0.000596686,0.00029190266,0.0006465027,0.0001965711,0.026075004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839103,0.00061924936,0.00009609748,0.0002225317,0.00049391063,0.00017730356],"domain_scores_gemma":[0.9988115,0.000613523,0.0000755095,0.0001609053,0.00021809386,0.00012043954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018670345,0.0005127303,0.0004333811,0.0016862827,0.0015393742,0.003026547,0.0012235362,0.0009950512,0.0052774],"category_scores_gemma":[0.0021501603,0.00032496027,0.0010208703,0.0016644718,0.004086385,0.005892001,0.002652816,0.0034091223,0.0009051973],"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.000002660164,0.0000038795324,0.000028266373,0.000010197859,0.0000013528437,0.000010689283,0.00007914047,0.00023720876,0.00017307987,0.9969674,0.00036678507,0.0021193523],"study_design_scores_gemma":[0.000003374832,0.000006219218,0.00005042568,0.000006397866,0.0000023761966,0.000020898262,0.000037913353,0.0028353264,0.00018519134,0.98959,0.0072555663,0.000006307488],"about_ca_topic_score_codex":0.0025160392,"about_ca_topic_score_gemma":0.0020286592,"teacher_disagreement_score":0.0052774,"about_ca_system_score_codex":0.0038884694,"about_ca_system_score_gemma":0.0012488135,"threshold_uncertainty_score":0.028212965},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087704584,0.0005636252,0.8674409,0.0022220707,0.00021859742,0.00016220707,0.0008402049,0.001247486,0.039600257],"genre_scores_gemma":[0.7814317,0.0007307423,0.19266249,0.0010513671,0.00029744135,0.00037659,0.0011986293,0.0006002856,0.02165084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99440336,0.00139324,0.00053188537,0.0013363297,0.0016568488,0.0006782887],"domain_scores_gemma":[0.99496824,0.0019666513,0.00022219727,0.001299628,0.00133266,0.00021068094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048992294,0.00053475733,0.0010786811,0.0011790481,0.0026478712,0.0046665487,0.0017257844,0.0014709291,0.0050561326],"category_scores_gemma":[0.0073898267,0.0006856367,0.0026211892,0.0007733451,0.0048755845,0.00894016,0.005501982,0.004193794,0.0011654128],"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.000018491612,0.000010142216,0.00011281741,0.000038805887,0.000009680696,0.000044618984,0.00031938046,0.0009461134,0.0010648436,0.9931647,0.00055292324,0.0037174085],"study_design_scores_gemma":[0.000030241894,0.000029025658,0.00019095263,0.000031343596,0.000030231975,0.00011045854,0.00012054746,0.010837479,0.0056850645,0.9675286,0.01537091,0.000035163073],"about_ca_topic_score_codex":0.0032306705,"about_ca_topic_score_gemma":0.0017188061,"teacher_disagreement_score":0.0050561326,"about_ca_system_score_codex":0.0018568895,"about_ca_system_score_gemma":0.0034253008,"threshold_uncertainty_score":0.02590996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1320477,0.0014717225,0.8460195,0.002380745,0.00020997689,0.000302754,0.00044505554,0.0002244951,0.01689799],"genre_scores_gemma":[0.8044799,0.0008859237,0.18913144,0.0003815567,0.00044469364,0.00024426274,0.00044933695,0.00011904109,0.0038637738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899406,0.004638797,0.00047861217,0.0015326313,0.0026589553,0.00075038295],"domain_scores_gemma":[0.96909785,0.024781706,0.0012888565,0.002158929,0.0014044346,0.0012682431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012076884,0.001337973,0.0027051175,0.0031922173,0.0022457412,0.007780367,0.0037198954,0.0026010852,0.004879484],"category_scores_gemma":[0.05331205,0.00071580184,0.0017844789,0.0046804473,0.0048124692,0.018258918,0.005321183,0.0035665145,0.00067579944],"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.00035604116,0.00013511247,0.0017160187,0.00029178255,0.00013627297,0.0001312582,0.0011233315,0.087489285,0.001392895,0.8588289,0.002065603,0.046333466],"study_design_scores_gemma":[0.000026678432,0.00005887421,0.0001826793,0.000033056353,0.00003499277,0.00006836892,0.00013518803,0.18337516,0.00078750256,0.81370187,0.001573386,0.000022131311],"about_ca_topic_score_codex":0.0013973162,"about_ca_topic_score_gemma":0.00093643,"teacher_disagreement_score":0.012076884,"about_ca_system_score_codex":0.0035987028,"about_ca_system_score_gemma":0.0018938935,"threshold_uncertainty_score":0.06386942},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017328227,0.00013477069,0.9807509,0.00024657717,0.000022192791,0.000022805214,0.00003079219,0.00014830827,0.0013154884],"genre_scores_gemma":[0.7140114,0.0002720658,0.28359646,0.00016285302,0.000070554335,0.00015418157,0.00014087504,0.00006453778,0.0015271403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934035,0.002267847,0.00053426565,0.0010785507,0.0023928555,0.00032289783],"domain_scores_gemma":[0.9857334,0.008434758,0.0017803276,0.0020889486,0.0014845433,0.00047807163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005730931,0.00074797345,0.0008304023,0.0014826067,0.000982233,0.0032361401,0.0019504246,0.0013986642,0.001941233],"category_scores_gemma":[0.025256352,0.00057184714,0.0020025165,0.0012846219,0.0045844275,0.007986022,0.0039516273,0.0029062112,0.00023027498],"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.00004937273,0.000022066915,0.0004359687,0.000075630844,0.00004888411,0.000120601464,0.0003269567,0.072268225,0.0017319951,0.91469204,0.00016323758,0.010065062],"study_design_scores_gemma":[0.000016079764,0.000033489177,0.00014147408,0.000015796824,0.000019704044,0.000063588275,0.000061756895,0.36636388,0.002064919,0.629576,0.0016247006,0.000018612393],"about_ca_topic_score_codex":0.002272162,"about_ca_topic_score_gemma":0.001612824,"teacher_disagreement_score":0.005730931,"about_ca_system_score_codex":0.0030197704,"about_ca_system_score_gemma":0.0011896997,"threshold_uncertainty_score":0.030308425},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081541434,0.00089791947,0.81581926,0.0039527486,0.00029026892,0.00024250656,0.0005863801,0.0007278993,0.095941626],"genre_scores_gemma":[0.7462301,0.00067341176,0.23176593,0.0013895213,0.0006228837,0.00073108054,0.0015264545,0.00028836247,0.016772259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980994,0.00027968342,0.00014885001,0.00038867063,0.000845022,0.00023839803],"domain_scores_gemma":[0.9937973,0.0035672174,0.00039587918,0.0009766142,0.00087682507,0.0003862148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017970513,0.00053493166,0.0005369541,0.0026317602,0.0021351683,0.0038590995,0.0018964073,0.0014232654,0.006404683],"category_scores_gemma":[0.006189701,0.00036933864,0.0023831099,0.0016073097,0.0056066136,0.010471186,0.0033514365,0.005244816,0.00048697364],"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.000002747901,0.000006509292,0.0000761397,0.000017658604,0.0000024716971,0.000014216108,0.0000627039,0.00038426789,0.0001546057,0.99728286,0.00037455442,0.0016211928],"study_design_scores_gemma":[0.000008638599,0.000010352271,0.00014997556,0.000016032902,0.000008571259,0.00006033323,0.00007022653,0.0076411674,0.000749841,0.9840471,0.0072283708,0.000009447547],"about_ca_topic_score_codex":0.0026666096,"about_ca_topic_score_gemma":0.0022435116,"teacher_disagreement_score":0.006404683,"about_ca_system_score_codex":0.004135319,"about_ca_system_score_gemma":0.0019716441,"threshold_uncertainty_score":0.030004025},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05206842,0.00010655366,0.94554055,0.00015373739,0.000030032606,0.00008848592,0.00011717841,0.0005368445,0.0013582003],"genre_scores_gemma":[0.5223726,0.0001299593,0.47480795,0.0001671152,0.000040383686,0.00030060404,0.00047591346,0.0002078875,0.0014976274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99449277,0.0014034841,0.00056811195,0.0016228176,0.0015500939,0.00036278288],"domain_scores_gemma":[0.98760045,0.008257122,0.0010170457,0.0015991871,0.0011096996,0.00041641825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034019365,0.0010210366,0.0012439005,0.0023888543,0.00093235786,0.0024582036,0.0022775051,0.0020556531,0.0027603027],"category_scores_gemma":[0.025268648,0.0007592881,0.0015793999,0.0015755781,0.0027549001,0.006382733,0.0044249757,0.0030391526,0.0005748834],"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.00029888446,0.00014594734,0.0021623094,0.00025270303,0.00013321405,0.000118372125,0.0005475153,0.22163545,0.009571524,0.66327405,0.0009210689,0.10093902],"study_design_scores_gemma":[0.0000249112,0.00008217118,0.00023353138,0.00001936526,0.000020959817,0.0000491518,0.00004771094,0.5448928,0.00620814,0.44706434,0.00132346,0.00003338386],"about_ca_topic_score_codex":0.0012259387,"about_ca_topic_score_gemma":0.0014024329,"teacher_disagreement_score":0.0034019365,"about_ca_system_score_codex":0.0029293671,"about_ca_system_score_gemma":0.0018734997,"threshold_uncertainty_score":0.021254182},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008292149,0.00042543258,0.97503734,0.0006688611,0.00024896025,0.00009466404,0.00047173983,0.0028415672,0.011919263],"genre_scores_gemma":[0.2709385,0.00063189387,0.70361257,0.0013211461,0.00034541514,0.0005003051,0.00096828083,0.0013060538,0.020375866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972172,0.000530209,0.0001751917,0.00056501466,0.0010838545,0.0004285158],"domain_scores_gemma":[0.99837863,0.0004141164,0.000120511635,0.0005539403,0.0004006732,0.00013198116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032932798,0.0006257712,0.000835581,0.0016059185,0.0017169276,0.003919862,0.0028427585,0.0017061676,0.0076245326],"category_scores_gemma":[0.0036706286,0.00082321034,0.001718316,0.0013250716,0.0046314388,0.005839629,0.004395409,0.0041569998,0.002493769],"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.000020686037,0.000016129072,0.00023132877,0.000067152054,0.000012114127,0.00010353973,0.0002225588,0.0020314227,0.0017336286,0.9788775,0.0019986662,0.014685374],"study_design_scores_gemma":[0.000051205374,0.000045975903,0.00031529227,0.00008842342,0.00005978311,0.00047160144,0.00010282124,0.041181877,0.007950344,0.8205525,0.12909572,0.00008437985],"about_ca_topic_score_codex":0.003976685,"about_ca_topic_score_gemma":0.0027196568,"teacher_disagreement_score":0.0076245326,"about_ca_system_score_codex":0.0031123515,"about_ca_system_score_gemma":0.0032803894,"threshold_uncertainty_score":0.025506616},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60030055,0.00078348943,0.37766495,0.003601691,0.000069340706,0.00032115576,0.0015364109,0.0010118706,0.014710589],"genre_scores_gemma":[0.9548159,0.00044971882,0.03955318,0.00023453693,0.00009372556,0.00020786945,0.0009880947,0.00013529498,0.00352174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970409,0.0006878046,0.00025200399,0.0008268498,0.0006511829,0.0005411792],"domain_scores_gemma":[0.98212975,0.015226376,0.0010828016,0.00081314665,0.000425581,0.00032235848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018905147,0.00081692025,0.0008273492,0.0009426739,0.0011331328,0.004109215,0.0014999649,0.0012437043,0.0047623273],"category_scores_gemma":[0.011335676,0.00063915516,0.0023382406,0.0010068973,0.0027797536,0.0070535988,0.0025968628,0.0030533965,0.00026431773],"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.0007794223,0.00026005073,0.004774522,0.0007130546,0.000171712,0.0005374868,0.0010119618,0.5730455,0.0132676605,0.3686392,0.0020574837,0.034741964],"study_design_scores_gemma":[0.00007960775,0.00007777611,0.0010311755,0.000041439936,0.00008027553,0.00014854898,0.00016698943,0.55971605,0.006301358,0.4306581,0.0016537758,0.00004491109],"about_ca_topic_score_codex":0.005341442,"about_ca_topic_score_gemma":0.0047826134,"teacher_disagreement_score":0.005341442,"about_ca_system_score_codex":0.0032745402,"about_ca_system_score_gemma":0.0023190195,"threshold_uncertainty_score":0.02375859},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091807075,0.0022660804,0.8515622,0.0024014234,0.00024723713,0.000054651216,0.00048633653,0.0002785279,0.050896484],"genre_scores_gemma":[0.9178068,0.00095815165,0.071936905,0.00059240847,0.0006525956,0.00016888518,0.00038551583,0.00011121455,0.007387539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99686426,0.0006375919,0.00017777226,0.0005536199,0.0014291387,0.00033754882],"domain_scores_gemma":[0.99526006,0.0025282458,0.00047153875,0.00055003347,0.0008030333,0.00038722577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030171575,0.00056606956,0.0008754819,0.004928737,0.0016080468,0.0038820307,0.0013119327,0.0012051245,0.0038527274],"category_scores_gemma":[0.005929714,0.00044878593,0.0011527532,0.002506615,0.00625206,0.0078102886,0.0036455141,0.0030174043,0.00038767545],"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.0000046782766,0.000007969675,0.00022609341,0.000021445394,0.0000073803385,0.000028355369,0.00013078221,0.00068742025,0.0006346718,0.99571335,0.0001961318,0.002341816],"study_design_scores_gemma":[0.000004992455,0.000023301529,0.00076592126,0.000019183812,0.000011891681,0.00013654304,0.00006486625,0.008013895,0.0007179691,0.9855173,0.004702417,0.000021755133],"about_ca_topic_score_codex":0.0007742561,"about_ca_topic_score_gemma":0.00060723734,"teacher_disagreement_score":0.004928737,"about_ca_system_score_codex":0.001752823,"about_ca_system_score_gemma":0.00066541845,"threshold_uncertainty_score":0.015956461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008144803,0.00053268013,0.97230756,0.0022115256,0.00025411695,0.00006828977,0.00028401968,0.0007452661,0.015451715],"genre_scores_gemma":[0.38503203,0.0013325998,0.5890093,0.0024875037,0.0010124084,0.0007014962,0.00095157675,0.0008445068,0.018628573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945856,0.0018877739,0.00060726854,0.0009817386,0.0015042798,0.00043335857],"domain_scores_gemma":[0.99415046,0.0024944728,0.0003865527,0.0014447217,0.0012120131,0.00031171233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058183237,0.0005847859,0.00075677456,0.0018995599,0.0025040205,0.0062764892,0.002653944,0.0020680232,0.0069341776],"category_scores_gemma":[0.007731875,0.001028039,0.0020824892,0.002293374,0.0060444847,0.013675289,0.005001288,0.006917013,0.0017327359],"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.0000064625956,0.0000062853283,0.00008255777,0.000021262911,0.0000031912177,0.000019264624,0.00022575409,0.00038418456,0.00023127151,0.9955094,0.0005856191,0.002924741],"study_design_scores_gemma":[0.000013764054,0.000012033223,0.00005568459,0.00003235804,0.00001129337,0.000069105175,0.00008153093,0.00735598,0.00080813246,0.9729171,0.018625021,0.000018015182],"about_ca_topic_score_codex":0.0020747148,"about_ca_topic_score_gemma":0.0013615568,"teacher_disagreement_score":0.0069341776,"about_ca_system_score_codex":0.004064656,"about_ca_system_score_gemma":0.0022005287,"threshold_uncertainty_score":0.0307706},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16633001,0.0014524764,0.7271483,0.0022581602,0.0010473655,0.00008981685,0.0006067088,0.0011132243,0.09995401],"genre_scores_gemma":[0.9219819,0.0006478948,0.06154748,0.0011316233,0.00037641343,0.00011526738,0.0004012613,0.00025404082,0.013544036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981756,0.00051441946,0.000111034366,0.00026344004,0.00069944107,0.0002360277],"domain_scores_gemma":[0.9979558,0.0010834044,0.00011767877,0.00023853974,0.0004393736,0.00016525277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030409258,0.0005303783,0.0005186101,0.0021709856,0.0013191855,0.0028464536,0.0009835341,0.0012300096,0.007894889],"category_scores_gemma":[0.0036606933,0.00042440652,0.00077100843,0.0013046683,0.0038636958,0.009425483,0.0033889585,0.0029504562,0.0010948516],"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.000013685755,0.000015470827,0.00018761121,0.000024611321,0.000003931189,0.00006821155,0.00019351476,0.00031545034,0.0007661069,0.99360317,0.000578314,0.0042298213],"study_design_scores_gemma":[0.000012581602,0.000019052282,0.00020230254,0.000016920372,0.0000056295667,0.00010509381,0.000113373484,0.002937408,0.0018525153,0.98762673,0.0070976284,0.000010740002],"about_ca_topic_score_codex":0.0005178378,"about_ca_topic_score_gemma":0.00040557707,"teacher_disagreement_score":0.007894889,"about_ca_system_score_codex":0.00093983463,"about_ca_system_score_gemma":0.0005358559,"threshold_uncertainty_score":0.026411057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06826145,0.00036124722,0.92520714,0.00087390107,0.000042487878,0.00010106613,0.0007612142,0.001339263,0.0030522253],"genre_scores_gemma":[0.6687236,0.0005588766,0.32304037,0.00036398196,0.00014415033,0.00030458445,0.00246184,0.00043664192,0.00396597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943433,0.0015126112,0.00041721118,0.0018455031,0.0014457697,0.00043564817],"domain_scores_gemma":[0.93038875,0.057467666,0.003058782,0.0059293355,0.0024540157,0.0007014477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003164786,0.0011351472,0.0011316867,0.002239309,0.0009529206,0.003184396,0.0023863283,0.0020687527,0.0044206525],"category_scores_gemma":[0.06160843,0.0009732354,0.0026913288,0.0015752068,0.0031810768,0.008920721,0.0036333238,0.0032878455,0.00092063897],"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.00035516458,0.00021287188,0.011791512,0.00071173697,0.00021662122,0.00053367263,0.0011888761,0.44203907,0.010264653,0.4017788,0.002303869,0.12860319],"study_design_scores_gemma":[0.000015322239,0.00004437203,0.00039452733,0.000036786754,0.00003063719,0.00010012378,0.00010041363,0.5681276,0.0041040746,0.42529795,0.0017267952,0.000021452634],"about_ca_topic_score_codex":0.003187487,"about_ca_topic_score_gemma":0.0036086573,"teacher_disagreement_score":0.0044206525,"about_ca_system_score_codex":0.0027029973,"about_ca_system_score_gemma":0.0022211845,"threshold_uncertainty_score":0.019611716},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54816914,0.0010752038,0.3998949,0.002376275,0.00011412932,0.000072177536,0.00033459996,0.00079493213,0.047168568],"genre_scores_gemma":[0.9693179,0.00018949599,0.024296945,0.00021106849,0.000070237606,0.000063281244,0.00009418866,0.00006426013,0.005692616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983707,0.00033051512,0.00012896485,0.00057006406,0.00036610165,0.00023357772],"domain_scores_gemma":[0.99409723,0.0034208805,0.00044640034,0.0009808878,0.00065728585,0.0003973189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016248595,0.00035145853,0.00045060346,0.001308617,0.0016446845,0.0034926645,0.0009795532,0.0009570591,0.0034174756],"category_scores_gemma":[0.005222553,0.00044945572,0.0009776345,0.0006102537,0.0053164572,0.007902468,0.0023830794,0.0021195847,0.00039318763],"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.000056395475,0.000016730419,0.0009687502,0.000053564458,0.000008873958,0.00011020017,0.0010275625,0.0010967631,0.0027883274,0.98917806,0.00018328174,0.004511475],"study_design_scores_gemma":[0.000027357879,0.00008587977,0.0009921105,0.000032240438,0.000040648407,0.00039054133,0.00035897864,0.01954198,0.0090559665,0.9597428,0.0096937595,0.000037649676],"about_ca_topic_score_codex":0.0012538406,"about_ca_topic_score_gemma":0.00084516365,"teacher_disagreement_score":0.0034926645,"about_ca_system_score_codex":0.0018104024,"about_ca_system_score_gemma":0.00070400164,"threshold_uncertainty_score":0.013135433},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040118735,0.00018657063,0.9439121,0.00058809825,0.00006845645,0.00012449648,0.0015691342,0.0018738991,0.011558568],"genre_scores_gemma":[0.60261124,0.00029302266,0.38388914,0.00057874504,0.00012989454,0.0003144103,0.0014420254,0.0007230455,0.0100185275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811375,0.0003148809,0.0001884469,0.00051241135,0.00050383265,0.00036676915],"domain_scores_gemma":[0.9965379,0.0014918308,0.00040651546,0.0007085861,0.00063664623,0.00021847742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020881242,0.0006649291,0.00062450033,0.0014878786,0.00095483084,0.0045527304,0.0016817021,0.0013068116,0.0077525103],"category_scores_gemma":[0.004680614,0.0007815373,0.0015072125,0.0017284482,0.0024081373,0.0073563936,0.001980729,0.0023657863,0.0013284765],"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.000118530596,0.000027119157,0.0008458806,0.00010417471,0.000014920311,0.00016412286,0.000436266,0.005439291,0.011387411,0.96756727,0.0017337599,0.01216125],"study_design_scores_gemma":[0.000032305023,0.000108752705,0.0011509476,0.00007426645,0.000059209193,0.0009547689,0.0003059703,0.07024756,0.01177927,0.8778286,0.03733679,0.000121665835],"about_ca_topic_score_codex":0.0025190292,"about_ca_topic_score_gemma":0.0019795247,"teacher_disagreement_score":0.0077525103,"about_ca_system_score_codex":0.0017745695,"about_ca_system_score_gemma":0.0015324011,"threshold_uncertainty_score":0.025934696},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37878206,0.0012091964,0.5687947,0.0030110977,0.00026008717,0.00018676792,0.000895748,0.002717642,0.044142727],"genre_scores_gemma":[0.9108582,0.0003349021,0.07962755,0.00046940258,0.00020200985,0.00017637532,0.00083356205,0.00022087681,0.007277086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750876,0.00045197317,0.000187781,0.00077244703,0.00068634795,0.00039261483],"domain_scores_gemma":[0.9941759,0.004464108,0.00028469175,0.00033279302,0.00057045155,0.00017207855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024366144,0.00049399544,0.0006089912,0.0012145108,0.0016568225,0.0035262473,0.001452293,0.0009786376,0.0043966966],"category_scores_gemma":[0.0064032543,0.0006734318,0.0018382837,0.00083427393,0.003486831,0.0063500535,0.001526143,0.002884453,0.0005029991],"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.00007383618,0.000054909437,0.0009046032,0.00014943196,0.000024207027,0.00018614833,0.0008365099,0.00559884,0.0039929333,0.97187364,0.0014245923,0.014880304],"study_design_scores_gemma":[0.000031897358,0.000040399867,0.00025067525,0.000030556293,0.00003238036,0.00015246548,0.00015946581,0.03379982,0.009989534,0.9495978,0.005890102,0.000024949264],"about_ca_topic_score_codex":0.0014189497,"about_ca_topic_score_gemma":0.0016556367,"teacher_disagreement_score":0.0043966966,"about_ca_system_score_codex":0.0028863514,"about_ca_system_score_gemma":0.0017305778,"threshold_uncertainty_score":0.020942092},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014023961,0.00168949,0.8741407,0.0047945566,0.0013372863,0.00012782763,0.0010832386,0.0018440223,0.10095899],"genre_scores_gemma":[0.59159106,0.0021654991,0.32700193,0.003157572,0.0016691961,0.0005491173,0.0025451896,0.0009537091,0.07036674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787974,0.00048736468,0.00013633726,0.00048678636,0.0007709894,0.00023881064],"domain_scores_gemma":[0.99750704,0.0007776104,0.00017431489,0.0009082892,0.00045561546,0.00017711127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019160769,0.000687028,0.0007705285,0.0015748222,0.0016073885,0.0042016413,0.0019145774,0.001442745,0.025741078],"category_scores_gemma":[0.00370695,0.00049348833,0.0017613599,0.0022256444,0.003904178,0.007491833,0.004349839,0.004845902,0.0057041924],"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.000009313748,0.000008852238,0.000067157154,0.000034296332,0.000003979945,0.000023990651,0.000090935064,0.00079959386,0.00039234132,0.993803,0.001241874,0.003524535],"study_design_scores_gemma":[0.000009882666,0.000015524443,0.00010170635,0.000017135944,0.0000067317355,0.00007232041,0.000029576113,0.0056448695,0.0007510138,0.9538142,0.03952112,0.000015877536],"about_ca_topic_score_codex":0.0022444553,"about_ca_topic_score_gemma":0.0015924149,"teacher_disagreement_score":0.025741078,"about_ca_system_score_codex":0.0037619094,"about_ca_system_score_gemma":0.0016898658,"threshold_uncertainty_score":0.08611244},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06236459,0.0008277076,0.91736317,0.000683438,0.00012449868,0.00016671303,0.00037887247,0.0032656551,0.014825269],"genre_scores_gemma":[0.733919,0.00068123254,0.25021678,0.00034764846,0.00016643468,0.0003936048,0.00093155814,0.00043478468,0.012908974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966084,0.000587665,0.00031810784,0.0010132001,0.0010733919,0.0003992718],"domain_scores_gemma":[0.9904991,0.0062026116,0.0009637033,0.0010868801,0.0008568821,0.00039078086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021519442,0.00089959166,0.0007926445,0.0015041756,0.001091505,0.002479789,0.0015316855,0.000991699,0.005182856],"category_scores_gemma":[0.007829771,0.00075510045,0.0018321894,0.0012900014,0.0041311285,0.0050555086,0.0032122936,0.0041350187,0.0008119955],"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.00036952217,0.000083293315,0.0012358081,0.00045626023,0.000075030395,0.000620553,0.0012091832,0.085038,0.01179375,0.8507145,0.0016141405,0.046789996],"study_design_scores_gemma":[0.0001033774,0.00011621494,0.0004149013,0.000119790275,0.00007013309,0.00013337586,0.00014478598,0.2251182,0.012763156,0.7454943,0.015456802,0.000064955224],"about_ca_topic_score_codex":0.0056834975,"about_ca_topic_score_gemma":0.0038044308,"teacher_disagreement_score":0.0056834975,"about_ca_system_score_codex":0.0036191326,"about_ca_system_score_gemma":0.0021399325,"threshold_uncertainty_score":0.026258767},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022930145,0.00090353907,0.95845157,0.0032649247,0.00015153836,0.00013112726,0.00039451622,0.0007247028,0.013047861],"genre_scores_gemma":[0.46217784,0.0019528847,0.5207882,0.0021173635,0.0006995326,0.00048006905,0.0010041886,0.0003394626,0.010440515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99507904,0.0017269021,0.00045722537,0.00090900465,0.0013455888,0.00048233866],"domain_scores_gemma":[0.9946437,0.0037239776,0.0004119348,0.00042397444,0.0005913671,0.00020510376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075558033,0.000874984,0.0007168722,0.0017559947,0.0015937459,0.005764126,0.0015898091,0.0016201494,0.0027863467],"category_scores_gemma":[0.008014587,0.00085124804,0.002231822,0.002109273,0.0073657664,0.010627579,0.003047964,0.0046359035,0.0004943539],"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.000034575838,0.000015862146,0.00013208431,0.000054701788,0.0000103581315,0.00010945236,0.00036042256,0.004628061,0.00055536017,0.987364,0.00066477794,0.0060703964],"study_design_scores_gemma":[0.000029459356,0.00002703466,0.00008444477,0.000032167987,0.00002387282,0.00009772,0.000098678036,0.035944607,0.0013730107,0.95365804,0.008608985,0.00002188104],"about_ca_topic_score_codex":0.0052518495,"about_ca_topic_score_gemma":0.0028899754,"teacher_disagreement_score":0.0075558033,"about_ca_system_score_codex":0.0039792014,"about_ca_system_score_gemma":0.0024413688,"threshold_uncertainty_score":0.03995937},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031677168,0.001122289,0.9192455,0.0014453892,0.00043066434,0.00009238998,0.00038642477,0.0007188371,0.04488145],"genre_scores_gemma":[0.74871844,0.0013038436,0.22387819,0.00091557327,0.0006504943,0.0003577427,0.00043451943,0.00052468886,0.023216553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939621,0.0013136618,0.000588545,0.0016423034,0.0019774938,0.0005159294],"domain_scores_gemma":[0.9938083,0.0021364882,0.0005475707,0.001628374,0.0015216434,0.0003575528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042420966,0.0008531115,0.0009319054,0.0038636387,0.001748573,0.0057592965,0.0012452275,0.0011210184,0.008119741],"category_scores_gemma":[0.0072907205,0.0008521415,0.002526144,0.0017224187,0.008872651,0.017298514,0.005672118,0.0034098288,0.0010605004],"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.0000090377325,0.000005076477,0.00008812286,0.000023980778,0.00000703866,0.000019680221,0.00011867198,0.00037139413,0.00041783016,0.9964141,0.00014668744,0.002378334],"study_design_scores_gemma":[0.000010823844,0.00002509171,0.0001542619,0.000022159598,0.00003621955,0.000110881396,0.000072946175,0.005410725,0.0016013128,0.9811996,0.011332528,0.000023389026],"about_ca_topic_score_codex":0.0015469865,"about_ca_topic_score_gemma":0.0010668036,"teacher_disagreement_score":0.008119741,"about_ca_system_score_codex":0.0024963599,"about_ca_system_score_gemma":0.0014139668,"threshold_uncertainty_score":0.027163208},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12837806,0.0009751101,0.83704776,0.0039687725,0.00011949514,0.00021497294,0.0026518656,0.0017016515,0.0249423],"genre_scores_gemma":[0.8080069,0.0008000006,0.16848698,0.0008529712,0.000527968,0.0006995887,0.003339205,0.0011163085,0.016170176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950363,0.0009536704,0.0002406127,0.0013004186,0.001587373,0.0008817343],"domain_scores_gemma":[0.9747055,0.018916517,0.0013487884,0.0030723922,0.0012063821,0.0007505348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030236433,0.0013219115,0.0017923939,0.0016953255,0.001949817,0.0059774136,0.0040823524,0.0017377258,0.00751483],"category_scores_gemma":[0.017404795,0.0010695772,0.0031742528,0.002266166,0.0045672213,0.014072384,0.0029780196,0.008306413,0.0010577731],"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.00031690794,0.00015486668,0.0012480933,0.00039153086,0.000051963456,0.0001535572,0.00064026844,0.039035812,0.0035583363,0.9382961,0.003652932,0.01249961],"study_design_scores_gemma":[0.00006821528,0.000046367837,0.0005611482,0.000039357612,0.000033480093,0.00012551631,0.000106488034,0.13020109,0.002419038,0.86139995,0.004956971,0.000042364638],"about_ca_topic_score_codex":0.0035561672,"about_ca_topic_score_gemma":0.0046438933,"teacher_disagreement_score":0.00751483,"about_ca_system_score_codex":0.0046314322,"about_ca_system_score_gemma":0.0034406013,"threshold_uncertainty_score":0.03360355},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10316687,0.00072687713,0.8835396,0.002048612,0.000056767243,0.00018653263,0.0013653176,0.00255592,0.0063534086],"genre_scores_gemma":[0.66487205,0.0006060911,0.32630572,0.0006624712,0.00019023946,0.00031101666,0.0021034537,0.0005337423,0.0044152853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9891677,0.0028250697,0.0008068566,0.002901042,0.0033909099,0.0009083351],"domain_scores_gemma":[0.96127516,0.028696675,0.0018000458,0.0059566535,0.0018123991,0.00045907995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004984409,0.0012028413,0.0015648172,0.0017811873,0.0007894954,0.0044463677,0.003770755,0.002027118,0.004656683],"category_scores_gemma":[0.041642774,0.0010005516,0.0029129288,0.003257321,0.0020441115,0.011505464,0.0035903975,0.0034131324,0.000773106],"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.0006637249,0.00017374786,0.0044361753,0.00063829304,0.00023385248,0.00025129993,0.0007112597,0.5771458,0.006095926,0.30955172,0.005298122,0.09480001],"study_design_scores_gemma":[0.000035421912,0.000036496658,0.00031101427,0.000023374392,0.000049348197,0.000117254116,0.000093658025,0.7304218,0.0019925102,0.2651776,0.0017267347,0.000014805349],"about_ca_topic_score_codex":0.004991746,"about_ca_topic_score_gemma":0.0053836205,"teacher_disagreement_score":0.004991746,"about_ca_system_score_codex":0.0047184546,"about_ca_system_score_gemma":0.0015770235,"threshold_uncertainty_score":0.03423494},"labels":[],"label_agreement":null}]}