{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":55,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":55,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"7900f94e49c1","filters":{"venue":"Logical Methods in Computer Science"}},"results":[{"id":"W2128992690","doi":"10.2168/lmcs-1(2:1)2005","title":"General Recursion via Coinductive Types","year":2005,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Coinduction; Monad (category theory); Finitary; Domain theory; Type theory; Recursion (computer science); Partial function; Type (biology); Computer science; μ operator; Simple (philosophy); Domain (mathematical analysis); Partial evaluation; Theoretical computer science; Computability theory; Algebra over a field; Functional programming; Element (criminal law); Representation (politics); Primitive recursive function; Mathematics; Discrete mathematics; Programming language; Algorithm; Pure mathematics; Recursive functions; Functor","authors":[{"name":"Venanzio Capretta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0759905153646028,"gpt":0.3791849483817478,"spread":0.303194433017145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00433099,0.0007012559,0.0009438306,0.002253439,0.001721956,0.004692992,0.001347452,0.001428691,0.003975845],"category_scores_gemma":[0.004632773,0.0007372663,0.001984176,0.002164614,0.007855919,0.01179657,0.004970094,0.003453824,0.0009073624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002716874,"about_ca_system_score_gemma":0.001623368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001793581,"about_ca_topic_score_gemma":0.002144977,"domain_scores_codex":[0.99713,0.0008171825,0.0002390157,0.0005556687,0.0008526793,0.0004055728],"domain_scores_gemma":[0.9975237,0.001047385,0.0001955572,0.0007386365,0.0003557134,0.0001390098],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003656956,0.000002460478,0.0000480386,0.0000110435,0.000001985708,0.00002087759,0.00009684409,0.0004079569,0.000173316,0.9973776,0.0001143697,0.001741749],"study_design_scores_gemma":[0.000008475512,0.00001143105,0.00005731928,0.00001689835,0.00001247264,0.00008944044,0.00002968622,0.006117408,0.0008078394,0.983847,0.008988569,0.00001343001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04561505,0.002055241,0.914053,0.00112423,0.0003472438,0.00008362133,0.0001561077,0.0009627231,0.03560275],"genre_scores_gemma":[0.7339051,0.002310526,0.2382824,0.0008897267,0.0005100041,0.0003144451,0.0002669088,0.0004565051,0.02306446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004692992,"threshold_uncertainty_score":0.02290475,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102459557","doi":"10.2168/lmcs-8(1:7)2012","title":"Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Fundacja na rzecz Nauki Polskiej; Grantová Agentura České Republiky","keywords":"Unanimity; Mathematics; Conjecture; Constraint satisfaction problem; Variety (cybernetics); Characterization (materials science); Constraint (computer-aided design); Pure mathematics; Universal algebra; Combinatorics; Discrete mathematics; Algebra over a field","authors":[{"name":"Libor Barto","is_ca":true},{"name":"Marcin Kozik","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05866841925032519,"gpt":0.3937555524694554,"spread":0.3350871332191303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001297537,0.0002438261,0.0004722567,0.0008619681,0.001862204,0.002173283,0.0009476263,0.0008182228,0.002481448],"category_scores_gemma":[0.004272551,0.0003253167,0.0008561972,0.00118466,0.004006889,0.006446777,0.002348409,0.002682263,0.000314506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001562445,"about_ca_system_score_gemma":0.001352669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002085814,"about_ca_topic_score_gemma":0.001437686,"domain_scores_codex":[0.9983212,0.000531459,0.0001171673,0.0003203799,0.000456563,0.0002531573],"domain_scores_gemma":[0.9959449,0.002658616,0.0004003011,0.0003951362,0.0003549817,0.0002459426],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002368919,0.00002502808,0.0003060907,0.00002297717,0.000005350048,0.00006116818,0.0002469827,0.002250501,0.0009094941,0.9905691,0.0004466967,0.005132891],"study_design_scores_gemma":[0.000007847594,0.00001118207,0.0001220371,0.000006871098,0.000005532816,0.0000595625,0.0001039937,0.00976914,0.001037103,0.9872728,0.001593327,0.00001072249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5817603,0.001128717,0.3627631,0.004775602,0.00008718084,0.0000965666,0.0003510061,0.0003600595,0.04867727],"genre_scores_gemma":[0.9593247,0.0004496077,0.03388168,0.0003321557,0.0001362752,0.0000991691,0.0003328994,0.00004558254,0.005397853],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002481448,"threshold_uncertainty_score":0.01133639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976808588","doi":"10.2168/lmcs-2(3:2)2006","title":"Logics for Unranked Trees: An Overview","year":2006,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Pennsylvania","keywords":"Computer science; Automaton; Tree automaton; XML; Tree (set theory); Theoretical computer science; Mathematics; Combinatorics; World Wide Web","authors":[{"name":"Leonid Libkin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1651178444744818,"gpt":0.4470196305774615,"spread":0.2819017861029797,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003575119,0.0009253439,0.0008695812,0.004996594,0.001138871,0.005425214,0.002604565,0.001356637,0.003561753],"category_scores_gemma":[0.003544042,0.0009357236,0.001557337,0.006195283,0.003370176,0.01171357,0.002146435,0.002563103,0.001071229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003329126,"about_ca_system_score_gemma":0.001994345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00308141,"about_ca_topic_score_gemma":0.002375582,"domain_scores_codex":[0.996712,0.0009397167,0.0004044771,0.0005090817,0.001255966,0.0001787844],"domain_scores_gemma":[0.9968431,0.00212807,0.0002842825,0.0002790257,0.0003350465,0.0001305812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004698684,0.00006749009,0.0005308025,0.001005527,0.00004080672,0.0002274263,0.0005429115,0.005918942,0.001228699,0.8555257,0.005952252,0.1289123],"study_design_scores_gemma":[0.00002391215,0.00006166328,0.0003730554,0.0004791223,0.00004475344,0.0007153731,0.0002046803,0.02245067,0.001718547,0.8357043,0.1381642,0.00005979997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.006113023,0.1085646,0.8538967,0.002413242,0.0003990918,0.0001485955,0.0005516839,0.0008710198,0.02704193],"genre_scores_gemma":[0.1895575,0.1464625,0.6403632,0.003233495,0.002476939,0.0005992062,0.001716077,0.0005074709,0.01508358],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.005425214,"threshold_uncertainty_score":0.0241546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165528704","doi":"10.2168/lmcs-3(4:6)2007","title":"A Characterisation of First-Order Constraint Satisfaction Problems","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada; University of the Fraser Valley; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Constraint satisfaction problem; Decidability; Simple (philosophy); Algebraic number; Constraint satisfaction; Mathematics; Time complexity; Order (exchange); Constraint (computer-aided design); Backtracking; Discrete mathematics; Computer science; Combinatorics; Algorithm","authors":[{"name":"Benoît Larose","is_ca":true},{"name":"Cynthia Loten","is_ca":true},{"name":"Claude Tardif","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08219768287444364,"gpt":0.4122412629926573,"spread":0.3300435801182137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001685085,0.000793433,0.0008187122,0.001584715,0.001265309,0.00367792,0.00181038,0.001235477,0.005053286],"category_scores_gemma":[0.006709483,0.0005039164,0.00145912,0.002435685,0.004686796,0.007907329,0.002329062,0.005050889,0.000551955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002078081,"about_ca_system_score_gemma":0.001824954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001724586,"about_ca_topic_score_gemma":0.001744479,"domain_scores_codex":[0.9974383,0.0006552838,0.000175203,0.000691396,0.0007110271,0.0003288263],"domain_scores_gemma":[0.9914698,0.006150888,0.0007442897,0.000715073,0.0005498499,0.0003701016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002824676,0.00006514513,0.0004868527,0.0001942495,0.00001759134,0.0001407377,0.0004253374,0.009674511,0.002078787,0.9659587,0.001372347,0.01955752],"study_design_scores_gemma":[0.00002477807,0.00003864093,0.0003988173,0.0000464673,0.00001427496,0.0003257379,0.0001934958,0.04984912,0.002974163,0.9315295,0.01457489,0.00003010088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05468134,0.0009651224,0.9107187,0.002630507,0.00008809124,0.0002478757,0.0006400687,0.0007160405,0.02931228],"genre_scores_gemma":[0.6091107,0.001255711,0.3758525,0.0009806174,0.0003011526,0.000518898,0.001331582,0.000187809,0.01046107],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005053286,"threshold_uncertainty_score":0.01690489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1819959283","doi":"10.2168/lmcs-11(2:10)2015","title":"Generators and relations for n-qubit Clifford operators","year":2015,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clifford algebra; Clifford analysis; Algebra over a field; Mathematics; Operator (biology); Presentation (obstetrics); Computer science; Pure mathematics; Dirac operator; Chemistry","authors":[{"name":"Peter Selinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07838646274783868,"gpt":0.3848738116636884,"spread":0.3064873489158498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115267,0.0005624869,0.0004271193,0.0009425886,0.00126961,0.002210667,0.001290666,0.001213729,0.008520329],"category_scores_gemma":[0.002131669,0.0003239732,0.0006904168,0.0006040276,0.003227277,0.003342133,0.001822093,0.002291764,0.00155436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001255229,"about_ca_system_score_gemma":0.001069796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008785713,"about_ca_topic_score_gemma":0.001043081,"domain_scores_codex":[0.9988601,0.0002872176,0.0001010661,0.0002353332,0.0003255762,0.0001906509],"domain_scores_gemma":[0.9992872,0.0002191744,0.00007538447,0.0001455157,0.0001797542,0.00009302075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008628605,0.00001299402,0.00003720123,0.00001210931,0.000001259344,0.00004901415,0.0001517498,0.0003644598,0.00132758,0.994749,0.0005859573,0.002700087],"study_design_scores_gemma":[0.00001426512,0.00001724,0.00004031757,0.000009616741,0.000002429935,0.00006849276,0.00005578914,0.006304195,0.001861339,0.9871974,0.004417504,0.00001158117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1332767,0.0006761393,0.7326784,0.001708823,0.0009140613,0.0004282444,0.0005473465,0.0005828151,0.1291875],"genre_scores_gemma":[0.8024265,0.0005047164,0.1576912,0.0008431995,0.0004202782,0.0005735768,0.0004664712,0.0003385224,0.03673546],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008520329,"threshold_uncertainty_score":0.02850336,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015360324","doi":"10.2168/lmcs-3(1:4)2007","title":"Logic Meets Algebra: the Case of Regular Languages","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Regular language; Automaton; Complement (music); Computer science; Algebraic number; Monoid; Formalism (music); Mathematics; Formal language; Discrete mathematics; Automata theory; Algebra over a field; Algebraic theory; Theoretical computer science; Algorithm; Pure mathematics","authors":[{"name":"Pascal Tesson","is_ca":true},{"name":"Denis Thérien","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04414340357003216,"gpt":0.3956531001013638,"spread":0.3515096965313316,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001767649,0.0003365799,0.0006740331,0.001272958,0.002026925,0.00515999,0.001100041,0.001705685,0.00604596],"category_scores_gemma":[0.00576418,0.0004544218,0.001179886,0.001344873,0.006757367,0.01332671,0.002317221,0.002199505,0.0009175941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001250419,"about_ca_system_score_gemma":0.0007536451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001001426,"about_ca_topic_score_gemma":0.0005859109,"domain_scores_codex":[0.9977444,0.0005906092,0.0001664545,0.0005446909,0.0006875137,0.0002664234],"domain_scores_gemma":[0.996866,0.001894068,0.0003124291,0.0004146492,0.0002680612,0.0002446584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007296448,0.000002970677,0.00005738761,0.00001574814,0.000001889535,0.00005912984,0.0001408784,0.0002679847,0.0002104484,0.9978739,0.0001723372,0.001189967],"study_design_scores_gemma":[0.00000566221,0.000006494505,0.00003298842,0.000006034949,0.00000311819,0.0001228468,0.00007584809,0.002693558,0.0002281206,0.993687,0.003133942,0.000004381864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.261099,0.007164527,0.4561683,0.01363293,0.0004897428,0.0001443346,0.0005929868,0.0006079889,0.2601001],"genre_scores_gemma":[0.9264912,0.001668588,0.05516498,0.0006327475,0.0006288121,0.0001624717,0.0001947451,0.0000984923,0.01495806],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00604596,"threshold_uncertainty_score":0.02022576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164124713","doi":"10.2168/lmcs-8(3:6)2012","title":"Finite dimensional Hilbert spaces are complete for dagger compact closed categories","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dagger; Axiom; Hilbert space; Mathematics; Pure mathematics; Hilbert manifold; Algebra over a field; Mathematical analysis; Geometry","authors":[{"name":"Peter Selinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1704927727894412,"gpt":0.4197456512859538,"spread":0.2492528784965126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003491481,0.0006604163,0.0008541719,0.001672393,0.002080952,0.003539897,0.00120816,0.001597799,0.005941526],"category_scores_gemma":[0.00774848,0.0007293796,0.001626422,0.001392151,0.006388832,0.01684743,0.005474031,0.004688453,0.001034298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001516254,"about_ca_system_score_gemma":0.001205734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001683553,"about_ca_topic_score_gemma":0.001707011,"domain_scores_codex":[0.9970953,0.0006561283,0.0002959699,0.0006870462,0.0007304619,0.0005351354],"domain_scores_gemma":[0.9926845,0.00383514,0.0005276226,0.0009838777,0.001474748,0.000494085],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007931262,0.000009350018,0.0001622797,0.00002465651,0.000004553099,0.00004335416,0.000228915,0.0002100704,0.0003369427,0.9970169,0.0002868098,0.001668119],"study_design_scores_gemma":[0.000009619916,0.00001140918,0.0002432941,0.000007509087,0.000005280019,0.00006701182,0.0001328242,0.001334004,0.0006288916,0.9943995,0.003149338,0.00001137528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3021189,0.001137667,0.5972813,0.003689071,0.0003625031,0.0001747377,0.00160446,0.000493087,0.09313829],"genre_scores_gemma":[0.9274366,0.0005530384,0.05674915,0.0007689389,0.0001684384,0.000232175,0.001114097,0.0001107112,0.01286668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005941526,"threshold_uncertainty_score":0.01987642,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2754485517","doi":"10.2168/lmcs-8(1:25)2012","title":"Formal Theories for Linear Algebra","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Algebra over a field; Mathematics; Linear algebra; Universal algebra; Discrete mathematics; Pure mathematics","authors":[{"name":"Stephen Cook","is_ca":true},{"name":"Lila Fontes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06168111032428622,"gpt":0.3851971348274723,"spread":0.3235160245031861,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003402053,0.001226515,0.0007670248,0.003264357,0.002063345,0.005162799,0.001817549,0.00141267,0.0109851],"category_scores_gemma":[0.003104842,0.0005692627,0.001691082,0.002870939,0.00709361,0.01013415,0.00258447,0.006239254,0.002824628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003872986,"about_ca_system_score_gemma":0.001469346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001878542,"about_ca_topic_score_gemma":0.00180317,"domain_scores_codex":[0.9982026,0.0006756272,0.000133757,0.0001790406,0.0006167793,0.0001922719],"domain_scores_gemma":[0.9982865,0.0007588759,0.0001376883,0.0003173352,0.0003847997,0.0001147559],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001212757,0.000003686829,0.00001472105,0.00001312768,0.000001516322,0.000007772749,0.00006652441,0.0001037103,0.00005496024,0.9977446,0.0008048288,0.001183422],"study_design_scores_gemma":[0.000007377224,0.000003875974,0.00002606489,0.00001593973,0.000002254819,0.00002298907,0.00004125499,0.0009324615,0.00008550058,0.9814768,0.01738151,0.000004016155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.011436,0.0118178,0.7854148,0.01354112,0.001555879,0.000192406,0.001363572,0.001390603,0.1732878],"genre_scores_gemma":[0.5267086,0.009367802,0.3898097,0.006128896,0.004161322,0.001141033,0.003093143,0.0005617709,0.0590277],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0109851,"threshold_uncertainty_score":0.03674883,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950924851","doi":"10.2168/lmcs-2(1:4)2006","title":"Approximate reasoning for real-time probabilistic processes","year":2006,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Bisimulation; Probabilistic logic; Metric (unit); Computer science; Characterization (materials science); Coinduction; Algorithm; Kernel (algebra); Class (philosophy); Theoretical computer science; Mathematics; Discrete mathematics; Artificial intelligence; Mathematical proof","authors":[{"name":"Vineet Gupta","is_ca":true},{"name":"Radha Jagadeesan","is_ca":false},{"name":"Prakash Panangaden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0542199564321787,"gpt":0.3756684191022505,"spread":0.3214484626700718,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005730931,0.0007479734,0.0008304023,0.001482607,0.000982233,0.00323614,0.001950425,0.001398664,0.001941233],"category_scores_gemma":[0.02525635,0.0005718471,0.002002517,0.001284622,0.004584427,0.007986022,0.003951627,0.002906211,0.000230275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00301977,"about_ca_system_score_gemma":0.0011897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002272162,"about_ca_topic_score_gemma":0.001612824,"domain_scores_codex":[0.9934035,0.002267847,0.0005342657,0.001078551,0.002392855,0.0003228978],"domain_scores_gemma":[0.9857334,0.008434758,0.001780328,0.002088949,0.001484543,0.0004780716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004937273,0.00002206692,0.0004359687,0.00007563084,0.00004888411,0.0001206015,0.0003269567,0.07226823,0.001731995,0.914692,0.0001632376,0.01006506],"study_design_scores_gemma":[0.00001607976,0.00003348918,0.0001414741,0.00001579682,0.00001970404,0.00006358828,0.00006175689,0.3663639,0.002064919,0.629576,0.001624701,0.00001861239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01732823,0.0001347707,0.9807509,0.0002465772,0.00002219279,0.00002280521,0.00003079219,0.0001483083,0.001315488],"genre_scores_gemma":[0.7140114,0.0002720658,0.2835965,0.000162853,0.00007055434,0.0001541816,0.000140875,0.00006453778,0.00152714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005730931,"threshold_uncertainty_score":0.03030843,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121804749","doi":"10.2168/lmcs-6(4:4)2010","title":"The complexity of global cardinality constraints","year":2010,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Cardinality (data modeling); Constraint satisfaction problem; Constraint satisfaction dual problem; Constraint (computer-aided design); Set (abstract data type); Constraint satisfaction; Mathematics; Time complexity; Complexity of constraint satisfaction; Constraint logic programming; Computational complexity theory; Local consistency; Computer science; Mathematical optimization; Constraint programming; Discrete mathematics; Algorithm","authors":[{"name":"Andreĭ A. Bulatov","is_ca":true},{"name":"Dániel Marx","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1631823224161655,"gpt":0.4693948801379104,"spread":0.3062125577217448,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003089745,0.001224309,0.002017954,0.001338329,0.001836199,0.005944607,0.00263394,0.002560743,0.008680145],"category_scores_gemma":[0.03032333,0.00096591,0.002304868,0.003473376,0.002888556,0.01408092,0.004232522,0.005048088,0.0006767197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002665831,"about_ca_system_score_gemma":0.002404742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003810599,"about_ca_topic_score_gemma":0.003161954,"domain_scores_codex":[0.9928109,0.002390409,0.0003572496,0.001393344,0.002099776,0.0009482573],"domain_scores_gemma":[0.9500422,0.04166757,0.002565023,0.003185743,0.001589077,0.0009504449],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007739178,0.0003035342,0.006033728,0.001308091,0.0003845425,0.0006919586,0.001400045,0.3683406,0.005358354,0.4959425,0.02201019,0.09745255],"study_design_scores_gemma":[0.00009859611,0.00005757398,0.001397372,0.00007838608,0.0001097045,0.0003378951,0.0004678721,0.2556702,0.002586096,0.7309642,0.008182933,0.00004915367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.450982,0.003614247,0.4751422,0.01453624,0.0002455735,0.0003983418,0.005662211,0.001130499,0.04828867],"genre_scores_gemma":[0.8727579,0.00310448,0.1093886,0.0008342149,0.0005328144,0.0006081659,0.004212799,0.0005834104,0.007977629],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008680145,"threshold_uncertainty_score":0.02903795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051749751","doi":"10.2168/lmcs-3(3:1)2007","title":"A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Toronto; Deutsche Forschungsgemeinschaft","keywords":"Decidability; Recursion (computer science); Semantics (computer science); Infinite set; Set (abstract data type); Büchi automaton; Deterministic automaton; Base (topology); Pushdown automaton","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.08777243278367756,"gpt":0.4268065595087113,"spread":0.3390341267250337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003509513,0.00133639,0.001087502,0.001574407,0.002290808,0.005775718,0.003198192,0.002526799,0.006419645],"category_scores_gemma":[0.005878304,0.001179923,0.002520128,0.0009515492,0.007426524,0.008488642,0.00303484,0.004812821,0.001955498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001981525,"about_ca_system_score_gemma":0.002904376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001430469,"about_ca_topic_score_gemma":0.001243472,"domain_scores_codex":[0.9963388,0.0009335065,0.000481187,0.0009174527,0.0009918843,0.0003372355],"domain_scores_gemma":[0.9962422,0.00158218,0.0003413346,0.0007373514,0.0008513255,0.000245766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002509689,0.00001805692,0.00007241342,0.00006381722,0.00001118844,0.0001121177,0.0006710563,0.001263523,0.002019562,0.9912366,0.0006308272,0.003875721],"study_design_scores_gemma":[0.00005097664,0.00005106101,0.00007838136,0.0000900486,0.00004668017,0.0002209982,0.0001846751,0.01503022,0.005225444,0.9404285,0.03853398,0.00005914758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01254362,0.0006520875,0.9685248,0.000905062,0.0003792477,0.0001686246,0.0004235353,0.002162168,0.01424095],"genre_scores_gemma":[0.4224904,0.0006136155,0.560437,0.000742836,0.0003907157,0.0007581774,0.0007619251,0.001138841,0.01266658],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006419645,"threshold_uncertainty_score":0.02147591,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1791050365","doi":"10.2168/lmcs-11(4:18)2015","title":"A finer reduction of constraint problems to digraphs","year":2015,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Grantová Agentura České Republiky; Grantová Agentura, Univerzita Karlova","keywords":"Digraph; Constraint satisfaction problem; Nondeterministic algorithm; Combinatorics; Mathematics; Complexity of constraint satisfaction; Discrete mathematics; Conjecture; Constraint (computer-aided design); Algebraic number; Local consistency","authors":[{"name":"Jakub Bulín","is_ca":false},{"name":"Dejan Delić","is_ca":true},{"name":"Marcel Jackson","is_ca":true},{"name":"Todd Niven","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1612916454676848,"gpt":0.4418393829298686,"spread":0.2805477374621838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001085731,0.00050326,0.0008167276,0.00111216,0.001201973,0.003836002,0.001508894,0.00101755,0.01231339],"category_scores_gemma":[0.00496232,0.0004867836,0.001730457,0.001956603,0.002367305,0.006022274,0.004097087,0.005221701,0.0009351157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001978209,"about_ca_system_score_gemma":0.00119876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003001919,"about_ca_topic_score_gemma":0.003415857,"domain_scores_codex":[0.9979864,0.0005540253,0.0001296253,0.0006201121,0.0004670756,0.0002426931],"domain_scores_gemma":[0.9971387,0.001713217,0.0001523422,0.000600884,0.0002013079,0.00019342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000164983,0.00004307749,0.0001075962,0.00005484835,0.000009238815,0.00006008789,0.0001394894,0.004748685,0.000704161,0.9830905,0.001370612,0.009655093],"study_design_scores_gemma":[0.00002078823,0.00001273291,0.0001232162,0.00001375472,0.000007458605,0.00005552666,0.00005008548,0.01901359,0.0004673039,0.97168,0.008547074,0.000008492695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08197344,0.0008979085,0.8431943,0.004475545,0.0002792972,0.0002279762,0.001126936,0.0007296969,0.06709495],"genre_scores_gemma":[0.6536421,0.001221584,0.306798,0.001741287,0.0005776305,0.0003407936,0.001942032,0.0004101752,0.0333265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01231339,"threshold_uncertainty_score":0.04119241,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2936689511","doi":"10.46298/lmcs-17(3:22)2021","title":"The Shapley Value of Tuples in Query Answering","year":2021,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Technion Hiroshi Fujiwara Cyber Security Research Center; Instituto Millenium; Agencia Nacional de Investigación y Desarrollo; Israel Science Foundation; Deutsche Forschungsgemeinschaft","keywords":"Shapley value; Tuple; Measure (data warehouse); Aggregate (composite); Context (archaeology); Conjunctive query; Computation","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.1006995774279524,"gpt":0.351477435107062,"spread":0.2507778576791097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01207688,0.001337973,0.002705117,0.003192217,0.002245741,0.007780367,0.003719895,0.002601085,0.004879484],"category_scores_gemma":[0.05331205,0.0007158018,0.001784479,0.004680447,0.004812469,0.01825892,0.005321183,0.003566514,0.0006757994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003598703,"about_ca_system_score_gemma":0.001893893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001397316,"about_ca_topic_score_gemma":0.00093643,"domain_scores_codex":[0.9899406,0.004638797,0.0004786122,0.001532631,0.002658955,0.000750383],"domain_scores_gemma":[0.9690979,0.02478171,0.001288856,0.002158929,0.001404435,0.001268243],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003560412,0.0001351125,0.001716019,0.0002917825,0.000136273,0.0001312582,0.001123331,0.08748928,0.001392895,0.8588289,0.002065603,0.04633347],"study_design_scores_gemma":[0.00002667843,0.00005887421,0.0001826793,0.00003305635,0.00003499277,0.00006836892,0.000135188,0.1833752,0.0007875026,0.8137019,0.001573386,0.00002213131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1320477,0.001471722,0.8460195,0.002380745,0.0002099769,0.000302754,0.0004450555,0.0002244951,0.01689799],"genre_scores_gemma":[0.8044799,0.0008859237,0.1891314,0.0003815567,0.0004446936,0.0002442627,0.0004493369,0.0001190411,0.003863774],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01207688,"threshold_uncertainty_score":0.06386942,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156285174","doi":"10.2168/lmcs-3(2:6)2007","title":"On tractability and congruence distributivity","year":2007,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Division of Mathematical Sciences; Hungarian Scientific Research Fund; Natural Sciences and Engineering Research Council of Canada; Isaac Newton Institute for Mathematical Sciences","keywords":"Distributivity; Distributive property; Congruence (geometry); Mathematics; Bounded function; Variety (cybernetics); Term (time); Conjecture; Sequence (biology); Pure mathematics; Class (philosophy); Discrete mathematics; Invariant (physics); Computer science","authors":[{"name":"Emil W. Kiss","is_ca":false},{"name":"Matthew Valeriote","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03957083179911924,"gpt":0.3852755727943883,"spread":0.3457047409952691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01052884,0.001262285,0.002295732,0.002287268,0.00315306,0.007888192,0.003503297,0.002511386,0.01575883],"category_scores_gemma":[0.07381305,0.00152071,0.004456345,0.003521604,0.01054215,0.02563619,0.00785799,0.008763256,0.002350388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005667296,"about_ca_system_score_gemma":0.002541216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002929247,"about_ca_topic_score_gemma":0.003545688,"domain_scores_codex":[0.9872568,0.005534227,0.0007157766,0.002897997,0.002340849,0.001254345],"domain_scores_gemma":[0.849464,0.130123,0.003772517,0.01269814,0.002710373,0.001232052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001470308,0.0001330195,0.0013984,0.0002773512,0.00006112828,0.0002483156,0.0006979208,0.01911561,0.001471011,0.9631313,0.002863047,0.01045578],"study_design_scores_gemma":[0.00002460153,0.0000166559,0.0001685787,0.00003079382,0.00001611071,0.00006257944,0.00004294522,0.02021834,0.0005432909,0.9770965,0.00176743,0.00001217208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1740486,0.003256146,0.6775802,0.0169645,0.0002165427,0.0003732787,0.001948024,0.002784438,0.1228283],"genre_scores_gemma":[0.8362867,0.002337496,0.1367891,0.002830337,0.0008868892,0.00119337,0.002952122,0.001896789,0.01482721],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01575883,"threshold_uncertainty_score":0.05568254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2951424111","doi":"10.2168/lmcs-2(1:3)2006","title":"Theories for TC0 and Other Small Complexity Classes","year":2006,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Complexity class; Natural number; Mathematical proof; Discrete mathematics; Bounded function; Polynomial; Isomorphism (crystallography); Boolean function; Function (biology); Class (philosophy); Binary number; Multiplication (music); Algebraic number; Time complexity; Combinatorics; Computer science; Arithmetic","authors":[{"name":"Phuong Nguyen","is_ca":true},{"name":"Stephen Cook","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.136707778184027,"gpt":0.3898902504278553,"spread":0.2531824722438283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001797051,0.0005349317,0.0005369541,0.00263176,0.002135168,0.003859099,0.001896407,0.001423265,0.006404683],"category_scores_gemma":[0.006189701,0.0003693386,0.00238311,0.00160731,0.005606614,0.01047119,0.003351436,0.005244816,0.0004869736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004135319,"about_ca_system_score_gemma":0.001971644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00266661,"about_ca_topic_score_gemma":0.002243512,"domain_scores_codex":[0.9980994,0.0002796834,0.00014885,0.0003886706,0.000845022,0.000238398],"domain_scores_gemma":[0.9937973,0.003567217,0.0003958792,0.0009766142,0.0008768251,0.0003862148],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002747901,0.000006509292,0.0000761397,0.0000176586,0.000002471697,0.00001421611,0.0000627039,0.0003842679,0.0001546057,0.9972829,0.0003745544,0.001621193],"study_design_scores_gemma":[0.000008638599,0.00001035227,0.0001499756,0.0000160329,0.000008571259,0.00006033323,0.00007022653,0.007641167,0.000749841,0.9840471,0.007228371,0.000009447547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08154143,0.0008979195,0.8158193,0.003952749,0.0002902689,0.0002425066,0.0005863801,0.0007278993,0.09594163],"genre_scores_gemma":[0.7462301,0.0006734118,0.2317659,0.001389521,0.0006228837,0.0007310805,0.001526454,0.0002883625,0.01677226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006404683,"threshold_uncertainty_score":0.03000402,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2889124254","doi":"10.46298/lmcs-17(3:1)2021","title":"Affine Extensions of Integer Vector Addition Systems with States","year":2021,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Fonds de recherche du Québec – Nature et technologies; European Commission","keywords":"Monoid; Reachability; Undecidable problem; Mathematics; Affine transformation; Combinatorics; Decidability; Integer (computer science); Discrete mathematics; Conjecture; Rewriting; Reachability problem; Pure mathematics; Computer science","authors":[{"name":"Michael Blondin","is_ca":false},{"name":"Christoph Haase","is_ca":false},{"name":"Filip Mazowiecki","is_ca":false},{"name":"Mikhail Raskin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06018076838320194,"gpt":0.3714641031173124,"spread":0.3112833347341105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005331752,0.0006749883,0.0004516076,0.0006620226,0.0006903869,0.001709495,0.00100185,0.0005522959,0.004810159],"category_scores_gemma":[0.002269783,0.0003405334,0.001077759,0.0006799326,0.001430121,0.003127925,0.001604383,0.001494884,0.0005461851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00114773,"about_ca_system_score_gemma":0.0007704683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002687428,"about_ca_topic_score_gemma":0.002478161,"domain_scores_codex":[0.9993224,0.0001191162,0.00006151563,0.0002127397,0.0001339922,0.0001502116],"domain_scores_gemma":[0.998301,0.0009572219,0.0002845147,0.0001541588,0.0001639742,0.0001390895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000442853,0.0002307761,0.001964051,0.0003583696,0.00005320896,0.000951845,0.00085179,0.1993242,0.02575796,0.7356899,0.0009454596,0.03342963],"study_design_scores_gemma":[0.00008067218,0.0002591502,0.000812241,0.00005868572,0.00007463185,0.0002881272,0.0002636059,0.4638598,0.02043991,0.5064095,0.00738764,0.00006600593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5122638,0.0005488507,0.4666102,0.0004281632,0.00009174669,0.0001912315,0.0006920993,0.001353557,0.0178204],"genre_scores_gemma":[0.9321264,0.0003027896,0.05906812,0.0001296752,0.00005486318,0.0001662455,0.000654838,0.00009056189,0.007406476],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004810159,"threshold_uncertainty_score":0.01609159,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2726753079","doi":"10.2168/lmcs-4(2:2)2008","title":"Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems","year":2008,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada); York University","funders":"","keywords":"Probabilistic logic; Duality (order theory); Interval (graph theory); Dual (grammatical number); Discounting; Order (exchange); Zero (linguistics); Decision theory; Degree (music)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.1758177199586406,"gpt":0.4064235178591127,"spread":0.2306057979004721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006021723,0.0008187449,0.001068797,0.001834082,0.0009251786,0.002819031,0.001972157,0.001393964,0.002287665],"category_scores_gemma":[0.02853676,0.0009273889,0.001694424,0.001190662,0.002925588,0.006774155,0.004038383,0.003145139,0.0004031336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003839541,"about_ca_system_score_gemma":0.001806387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00268374,"about_ca_topic_score_gemma":0.00179754,"domain_scores_codex":[0.9947582,0.001652142,0.000347108,0.0009887893,0.001829613,0.0004241349],"domain_scores_gemma":[0.9889007,0.007055511,0.001022951,0.001517246,0.001010192,0.000493456],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002060459,0.00005225548,0.001699569,0.0001269392,0.00003842201,0.00009119064,0.0003605353,0.3074369,0.003188382,0.6465677,0.0005110619,0.03972103],"study_design_scores_gemma":[0.00001026387,0.00003280922,0.0001345457,0.00001102546,0.000006938028,0.0000391849,0.00001770141,0.8016347,0.001206609,0.1961659,0.0007235714,0.00001680657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04353116,0.00018427,0.9541913,0.0002149827,0.00002464123,0.00004006309,0.0000455278,0.0003035752,0.001464495],"genre_scores_gemma":[0.6259863,0.0002592212,0.3709308,0.00008697392,0.00003757452,0.0001135675,0.0001635355,0.0001343446,0.002287647],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006021723,"threshold_uncertainty_score":0.03184628,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3020955609","doi":"10.46298/lmcs-18(3:28)2022","title":"Linear Dependent Type Theory for Quantum Programming Languages","year":2022,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Air Force Office of Scientific Research; U.S. Department of Defense","keywords":"Computer science; Programming language; Type theory; Semantics (computer science); Theoretical computer science; Categorical quantum mechanics; Dependent type; Type (biology); Algebra over a field; Quantum; Mathematics; Quantum operation; Pure mathematics; Open quantum system; Lambda calculus; Quantum mechanics","authors":[{"name":"Peng Fu","is_ca":true},{"name":"Kohei Kishida","is_ca":false},{"name":"Peter Selinger","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0839479400754821,"gpt":0.4028615210096469,"spread":0.3189135809341648,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005818324,0.0005847859,0.0007567746,0.00189956,0.00250402,0.006276489,0.002653944,0.002068023,0.006934178],"category_scores_gemma":[0.007731875,0.001028039,0.002082489,0.002293374,0.006044485,0.01367529,0.005001288,0.006917013,0.001732736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004064656,"about_ca_system_score_gemma":0.002200529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002074715,"about_ca_topic_score_gemma":0.001361557,"domain_scores_codex":[0.9945856,0.001887774,0.0006072685,0.0009817386,0.00150428,0.0004333586],"domain_scores_gemma":[0.9941505,0.002494473,0.0003865527,0.001444722,0.001212013,0.0003117123],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006462596,0.000006285328,0.00008255777,0.00002126291,0.000003191218,0.00001926462,0.0002257541,0.0003841846,0.0002312715,0.9955094,0.0005856191,0.002924741],"study_design_scores_gemma":[0.00001376405,0.00001203322,0.00005568459,0.00003235804,0.00001129337,0.00006910518,0.00008153093,0.00735598,0.0008081325,0.9729171,0.01862502,0.00001801518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008144803,0.0005326801,0.9723076,0.002211526,0.000254117,0.00006828977,0.0002840197,0.0007452661,0.01545172],"genre_scores_gemma":[0.385032,0.0013326,0.5890093,0.002487504,0.001012408,0.0007014962,0.0009515767,0.0008445068,0.01862857],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006934178,"threshold_uncertainty_score":0.0307706,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2921402294","doi":"10.23638/lmcs-16(2:11)2020","title":"Completeness of the ZX-Calculus","year":2020,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Future Earth","funders":"Agence Nationale de la Recherche","keywords":"Completeness (order theory); Calculus (dental); Mathematics; Computer science; Medicine; Mathematical analysis; Dentistry","authors":[{"name":"Emmanuel Jeandel","is_ca":true},{"name":"Simon Perdrix","is_ca":false},{"name":"Renaud Vilmart","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07030176109592952,"gpt":0.3545956035740337,"spread":0.2842938424781042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004899229,0.0005347573,0.001078681,0.001179048,0.002647871,0.004666549,0.001725784,0.001470929,0.005056133],"category_scores_gemma":[0.007389827,0.0006856367,0.002621189,0.0007733451,0.004875585,0.00894016,0.005501982,0.004193794,0.001165413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001856889,"about_ca_system_score_gemma":0.003425301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00323067,"about_ca_topic_score_gemma":0.001718806,"domain_scores_codex":[0.9944034,0.00139324,0.0005318854,0.00133633,0.001656849,0.0006782887],"domain_scores_gemma":[0.9949682,0.001966651,0.0002221973,0.001299628,0.00133266,0.0002106809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001849161,0.00001014222,0.0001128174,0.00003880589,0.000009680696,0.00004461898,0.0003193805,0.0009461134,0.001064844,0.9931647,0.0005529232,0.003717409],"study_design_scores_gemma":[0.00003024189,0.00002902566,0.0001909526,0.0000313436,0.00003023197,0.0001104585,0.0001205475,0.01083748,0.005685064,0.9675286,0.01537091,0.00003516307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08770458,0.0005636252,0.8674409,0.002222071,0.0002185974,0.0001622071,0.0008402049,0.001247486,0.03960026],"genre_scores_gemma":[0.7814317,0.0007307423,0.1926625,0.001051367,0.0002974414,0.00037659,0.001198629,0.0006002856,0.02165084],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005056133,"threshold_uncertainty_score":0.02590996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2395626435","doi":"10.2168/lmcs-11(3:11)2015","title":"Abstract Model Repair","year":2015,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"European Social Fund; Natural Sciences and Engineering Research Council of Canada; European Commission; Athens University of Economics and Business","keywords":"Kripke structure; Model checking; Soundness; Computer science; Abstraction; Theoretical computer science; Semantics (computer science); Kripke semantics; State (computer science); Abstraction model checking; Modal logic; Algorithm; Discrete mathematics; Programming language; Modal; Mathematics; Intermediate logic; Description logic","authors":[{"name":"George Chatzieleftheriou","is_ca":true},{"name":"Borzoo Bonakdarpour","is_ca":false},{"name":"Panagiotis Katsaros","is_ca":false},{"name":"Scott A. Smolka","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2222698639982402,"gpt":0.4436221654901364,"spread":0.2213523014918962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003198033,0.00107538,0.001156964,0.0009817703,0.0009833837,0.002198529,0.002747779,0.001653563,0.008033906],"category_scores_gemma":[0.01468089,0.0006589172,0.002176793,0.0007094929,0.00187202,0.005345562,0.005113959,0.003017312,0.001626026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00152807,"about_ca_system_score_gemma":0.002084354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002176393,"about_ca_topic_score_gemma":0.001612734,"domain_scores_codex":[0.9955314,0.001131707,0.0003620963,0.0008377679,0.001686082,0.0004510338],"domain_scores_gemma":[0.9897383,0.003118819,0.0005944559,0.005277742,0.00110127,0.00016947],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008452788,0.0003413975,0.00374966,0.001075277,0.0002526365,0.001391844,0.001851919,0.2870034,0.04575725,0.4266694,0.01286239,0.2181996],"study_design_scores_gemma":[0.0001012383,0.0002482631,0.0004666892,0.0001718338,0.0001196192,0.0006655882,0.0005270094,0.5889522,0.0573019,0.3088368,0.04253216,0.00007669444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0172843,0.00009771324,0.9754827,0.0003881573,0.00006859267,0.0001498962,0.0002429218,0.00339757,0.002888153],"genre_scores_gemma":[0.4361396,0.000235505,0.5538952,0.0003485638,0.00004304382,0.0002712021,0.001498005,0.0009598505,0.006608974],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008033906,"threshold_uncertainty_score":0.02687609,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3098573930","doi":"10.46298/lmcs-19(2:5)2023","title":"Inferring Symbolic Automata","year":2023,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"Israel Science Foundation; Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Learnability; Computer science; Theoretical computer science; Model checking; Identifiability; Regular language; Kleene algebra; Bounded function; Boolean function; Limit (mathematics); Probably approximately correct learning; Polynomial; Discrete mathematics; Automaton; Mathematics; Algorithm; Artificial intelligence; Computational learning theory; Machine learning","authors":[{"name":"Dana Fisman","is_ca":false},{"name":"Hadar Frenkel","is_ca":false},{"name":"Sandra Zilles","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06941551654696516,"gpt":0.4283480724184977,"spread":0.3589325558715326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003164786,0.001135147,0.001131687,0.002239309,0.0009529206,0.003184396,0.002386328,0.002068753,0.004420653],"category_scores_gemma":[0.06160843,0.0009732354,0.002691329,0.001575207,0.003181077,0.008920721,0.003633324,0.003287846,0.000920639],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002702997,"about_ca_system_score_gemma":0.002221185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003187487,"about_ca_topic_score_gemma":0.003608657,"domain_scores_codex":[0.9943433,0.001512611,0.0004172112,0.001845503,0.00144577,0.0004356482],"domain_scores_gemma":[0.9303887,0.05746767,0.003058782,0.005929335,0.002454016,0.0007014477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003551646,0.0002128719,0.01179151,0.000711737,0.0002166212,0.0005336726,0.001188876,0.4420391,0.01026465,0.4017788,0.002303869,0.1286032],"study_design_scores_gemma":[0.00001532224,0.00004437203,0.0003945273,0.00003678675,0.00003063719,0.0001001238,0.0001004136,0.5681276,0.004104075,0.4252979,0.001726795,0.00002145263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06826145,0.0003612472,0.9252071,0.0008739011,0.00004248788,0.0001010661,0.0007612142,0.001339263,0.003052225],"genre_scores_gemma":[0.6687236,0.0005588766,0.3230404,0.000363982,0.0001441503,0.0003045844,0.00246184,0.0004366419,0.00396597],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004420653,"threshold_uncertainty_score":0.01961172,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3130346675","doi":"10.46298/lmcs-20(3:12)2024","title":"Decidability for Sturmian words","year":2024,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Decidability; Mathematics; Computer science; Calculus (dental); Discrete mathematics; Medicine","authors":[{"name":"Philipp Hieronymi","is_ca":false},{"name":"Dun Ma","is_ca":false},{"name":"Reed Oei","is_ca":false},{"name":"Luke Schaeffer","is_ca":true},{"name":"Christian Schulz","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07095395759748904,"gpt":0.4281744339669295,"spread":0.3572204763694404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002436614,0.0004939954,0.0006089912,0.001214511,0.001656823,0.003526247,0.001452293,0.0009786376,0.004396697],"category_scores_gemma":[0.006403254,0.0006734318,0.001838284,0.0008342739,0.003486831,0.006350053,0.001526143,0.002884453,0.0005029991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002886351,"about_ca_system_score_gemma":0.001730578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00141895,"about_ca_topic_score_gemma":0.001655637,"domain_scores_codex":[0.9975088,0.0004519732,0.000187781,0.000772447,0.000686348,0.0003926148],"domain_scores_gemma":[0.9941759,0.004464108,0.0002846917,0.000332793,0.0005704515,0.0001720786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007383618,0.00005490944,0.0009046032,0.000149432,0.00002420703,0.0001861483,0.0008365099,0.00559884,0.003992933,0.9718736,0.001424592,0.0148803],"study_design_scores_gemma":[0.00003189736,0.00004039987,0.0002506752,0.00003055629,0.00003238036,0.0001524655,0.0001594658,0.03379982,0.009989534,0.9495978,0.005890102,0.00002494926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3787821,0.001209196,0.5687947,0.003011098,0.0002600872,0.0001867679,0.000895748,0.002717642,0.04414273],"genre_scores_gemma":[0.9108582,0.0003349021,0.07962755,0.0004694026,0.0002020098,0.0001763753,0.0008335621,0.0002208768,0.007277086],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004396697,"threshold_uncertainty_score":0.02094209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980738047","doi":"10.2168/lmcs-8(3:5)2012","title":"Formalizing Randomized Matching Algorithms","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Correctness; 3-dimensional matching; Blossom algorithm; Lemma (botany); Perfect graph theorem; Algorithm; Matching (statistics); Factor-critical graph; Computer science; Discrete mathematics; Mathematics; Theoretical computer science; Graph; Voltage graph; Line graph","authors":[{"name":"Dai Le","is_ca":true},{"name":"Stephen Cook","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08537728207017845,"gpt":0.3975713719226918,"spread":0.3121940898525133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01152825,0.001468442,0.00156954,0.002498942,0.00193955,0.007112833,0.00684275,0.003745958,0.009845927],"category_scores_gemma":[0.04004193,0.001421412,0.003002209,0.002877635,0.007599775,0.01683847,0.007191394,0.006080611,0.00216334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005875064,"about_ca_system_score_gemma":0.005593563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003917004,"about_ca_topic_score_gemma":0.002996496,"domain_scores_codex":[0.9808087,0.006780409,0.001519783,0.003841303,0.00524371,0.001806058],"domain_scores_gemma":[0.9770048,0.01537024,0.001147927,0.004188354,0.001945643,0.0003431461],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001559623,0.00002117067,0.00006913023,0.00004930823,0.00001014043,0.00002137607,0.00006212066,0.00956394,0.0002290518,0.9832504,0.0006008709,0.00610684],"study_design_scores_gemma":[0.00003606428,0.00001919586,0.00003672407,0.00003445261,0.00001539107,0.00003322971,0.00002954711,0.08366531,0.0008629771,0.9091195,0.006130344,0.00001725316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003885423,0.0002940015,0.984519,0.0009067827,0.0001205726,0.0001495125,0.0001886133,0.0007838762,0.009152249],"genre_scores_gemma":[0.2739037,0.001155956,0.710121,0.001390999,0.0005283694,0.001067074,0.0009500904,0.0006647817,0.01021803],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01152825,"threshold_uncertainty_score":0.06096798,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2751513393","doi":"10.2168/lmcs-8(1:27)2012","title":"On the Parameterized Intractability of Monadic Second-Order Logic","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Deutsche Forschungsgemeinschaft","keywords":"Parameterized complexity; Bounded function; Class (philosophy); Hierarchy; Complexity class; Second-order logic; Order (exchange)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.1114300046363616,"gpt":0.4035080027453709,"spread":0.2920779981090093,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00395696,0.001213757,0.001307839,0.001716391,0.002172012,0.004566118,0.002712812,0.001330672,0.003689798],"category_scores_gemma":[0.02130507,0.001129024,0.003016501,0.002593335,0.007208198,0.01353032,0.003335263,0.006819962,0.0003991345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005398101,"about_ca_system_score_gemma":0.002526583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008637867,"about_ca_topic_score_gemma":0.007941498,"domain_scores_codex":[0.9957485,0.001110031,0.0001883844,0.001094853,0.001060173,0.0007981347],"domain_scores_gemma":[0.954884,0.03696315,0.001685806,0.004930132,0.001061126,0.0004758176],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005281833,0.00009850025,0.001694557,0.0003007515,0.0001113368,0.000284097,0.0006793439,0.08049385,0.005438282,0.8899063,0.001747203,0.01871745],"study_design_scores_gemma":[0.00006266055,0.00004614583,0.000485522,0.00003886914,0.00006976949,0.00008081995,0.00006412778,0.173567,0.003607199,0.8195518,0.002385781,0.00004030104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2195215,0.002424702,0.7427453,0.006052517,0.0001679465,0.0001326351,0.0008245007,0.003711592,0.02441938],"genre_scores_gemma":[0.8956671,0.001199184,0.09579303,0.0008038279,0.0002531323,0.0002362031,0.0006707199,0.0006526075,0.004724116],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008637867,"threshold_uncertainty_score":0.03916609,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974090329","doi":"10.2168/lmcs-7(1:1)2011","title":"Algebraic Notions of Termination","year":2011,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Idempotence; Kleene algebra; Divergence (linguistics); Rewriting; Algebraic number; Algebra over a field; Modal","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.1249770218027673,"gpt":0.3774357172780239,"spread":0.2524586954752567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005512386,0.001028575,0.001103135,0.003814755,0.002466501,0.008566645,0.001584018,0.001739985,0.005182141],"category_scores_gemma":[0.01576012,0.0005674097,0.001555206,0.002769823,0.01168339,0.01522299,0.00520634,0.004753275,0.001155052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002941266,"about_ca_system_score_gemma":0.00213964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006909746,"about_ca_topic_score_gemma":0.0004694719,"domain_scores_codex":[0.9920921,0.001893276,0.0009887092,0.001143252,0.003114732,0.000767827],"domain_scores_gemma":[0.9892063,0.004897264,0.001463712,0.001746797,0.002101154,0.000584863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001186385,0.000009249769,0.000169482,0.00004150491,0.000004175628,0.00003464464,0.0002269479,0.0004978701,0.0003131621,0.9952336,0.0002493631,0.003208135],"study_design_scores_gemma":[0.000009713687,0.00003320663,0.000218881,0.00006420408,0.0000163663,0.0002785424,0.0002538533,0.004886271,0.0006270391,0.9788984,0.01469482,0.00001866408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06975424,0.005266281,0.7213572,0.003205071,0.0008056945,0.0002785617,0.0004540043,0.0005615581,0.1983174],"genre_scores_gemma":[0.821461,0.003361692,0.1557363,0.0007030517,0.001067243,0.0005009637,0.0006321892,0.0002461709,0.01629141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008566645,"threshold_uncertainty_score":0.02915263,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014379452","doi":"10.2168/lmcs-8(4:2)2012","title":"Linear-use CPS translations in the Enriched Effect Calculus","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Danish Agency for Science and Higher Education; Engineering and Physical Sciences Research Council; Forsknings- og Innovationsstyrelsen","keywords":"Linear logic; Metalanguage; Equivalence (formal languages); Lambda calculus; Translation (biology); Calculus (dental); Intuitionistic logic; Mathematics; Isomorphism (crystallography); Computer science; Discrete mathematics; Algebra over a field; Programming language; Pure mathematics","authors":[{"name":"Jeff Egger","is_ca":true},{"name":"Rasmus Ejlers Møgelberg","is_ca":false},{"name":"Alex Simpson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1038552551256379,"gpt":0.4012062757632336,"spread":0.2973510206375957,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002341376,0.0005359105,0.0005528945,0.0008131814,0.001046642,0.002293058,0.0009935384,0.0007482807,0.002854069],"category_scores_gemma":[0.002889569,0.0005478206,0.001500171,0.0008112894,0.004114307,0.004625106,0.003402137,0.002564026,0.0005729874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001322001,"about_ca_system_score_gemma":0.001694139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002056108,"about_ca_topic_score_gemma":0.001703957,"domain_scores_codex":[0.9975978,0.0004962702,0.0002160018,0.0005043643,0.0008080035,0.0003776909],"domain_scores_gemma":[0.9981779,0.0005425112,0.0001269507,0.0006965722,0.0003818982,0.00007419538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002883342,0.00001992532,0.0001669549,0.00004191291,0.000009080975,0.0001144681,0.0004565853,0.002116399,0.002267831,0.9862015,0.0003902775,0.00818635],"study_design_scores_gemma":[0.00006539015,0.00006765012,0.0003879457,0.00003657924,0.00009176677,0.0003066729,0.000229623,0.02580893,0.01951605,0.9166603,0.0367714,0.00005772708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06688598,0.00016056,0.9043798,0.0005380198,0.00009005532,0.0001188016,0.0002669274,0.002152517,0.02540729],"genre_scores_gemma":[0.7414856,0.0002870446,0.2448948,0.0004502278,0.0001062424,0.0002832457,0.0003374138,0.0005904125,0.01156503],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002854069,"threshold_uncertainty_score":0.01238251,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2954304163","doi":"10.23638/lmcs-17(1:9)2021","title":"Computing Probabilistic Bisimilarity Distances for Probabilistic Automata","year":2021,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Probabilistic logic; Computer science; Probabilistic automaton; Probabilistic CTL; Theoretical computer science; Automaton; Probabilistic analysis of algorithms; Programming language; Artificial intelligence","authors":[{"name":"Giorgio Bacci","is_ca":false},{"name":"Giovanni Bacci","is_ca":false},{"name":"Kim G. Larsen","is_ca":false},{"name":"Radu Mardare","is_ca":false},{"name":"Qiyi Tang","is_ca":false},{"name":"Franck van Breugel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06591931980726415,"gpt":0.4080842784368488,"spread":0.3421649586295846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003401936,0.001021037,0.001243901,0.002388854,0.0009323579,0.002458204,0.002277505,0.002055653,0.002760303],"category_scores_gemma":[0.02526865,0.0007592881,0.0015794,0.001575578,0.0027549,0.006382733,0.004424976,0.003039153,0.0005748834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002929367,"about_ca_system_score_gemma":0.0018735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001225939,"about_ca_topic_score_gemma":0.001402433,"domain_scores_codex":[0.9944928,0.001403484,0.000568112,0.001622818,0.001550094,0.0003627829],"domain_scores_gemma":[0.9876004,0.008257122,0.001017046,0.001599187,0.0011097,0.0004164182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002988845,0.0001459473,0.002162309,0.000252703,0.0001332141,0.0001183721,0.0005475153,0.2216354,0.009571524,0.663274,0.0009210689,0.100939],"study_design_scores_gemma":[0.0000249112,0.00008217118,0.0002335314,0.00001936526,0.00002095982,0.0000491518,0.00004771094,0.5448928,0.00620814,0.4470643,0.00132346,0.00003338386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05206842,0.0001065537,0.9455405,0.0001537374,0.00003003261,0.00008848592,0.0001171784,0.0005368445,0.0013582],"genre_scores_gemma":[0.5223726,0.0001299593,0.4748079,0.0001671152,0.00004038369,0.000300604,0.0004759135,0.0002078875,0.001497627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003401936,"threshold_uncertainty_score":0.02125418,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2969568901","doi":"10.23638/lmcs-17(2:9)2021","title":"LNL-FPC: The Linear/Non-linear Fixpoint Calculus","year":2021,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Future Earth","funders":"Air Force Office of Scientific Research; Multidisciplinary University Research Initiative; Agence Nationale de la Recherche","keywords":"Recursion (computer science); Linear programming; Linear logic; Categorical variable; Type theory; Type (biology); Computer science; Mathematics; Algorithm; Theoretical computer science; Algebra over a field; Pure mathematics","authors":[{"name":"Bert Lindenhovius","is_ca":false},{"name":"Michael Mislove","is_ca":false},{"name":"Vladimir Zamdzhiev","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1071441326577812,"gpt":0.3993179498776132,"spread":0.2921738172198319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00329328,0.0006257712,0.000835581,0.001605919,0.001716928,0.003919862,0.002842759,0.001706168,0.007624533],"category_scores_gemma":[0.003670629,0.0008232103,0.001718316,0.001325072,0.004631439,0.005839629,0.004395409,0.004157,0.002493769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003112352,"about_ca_system_score_gemma":0.003280389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003976685,"about_ca_topic_score_gemma":0.002719657,"domain_scores_codex":[0.9972172,0.000530209,0.0001751917,0.0005650147,0.001083854,0.0004285158],"domain_scores_gemma":[0.9983786,0.0004141164,0.0001205116,0.0005539403,0.0004006732,0.0001319812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002068604,0.00001612907,0.0002313288,0.00006715205,0.00001211413,0.0001035397,0.0002225588,0.002031423,0.001733629,0.9788775,0.001998666,0.01468537],"study_design_scores_gemma":[0.00005120537,0.0000459759,0.0003152923,0.00008842342,0.00005978311,0.0004716014,0.0001028212,0.04118188,0.007950344,0.8205525,0.1290957,0.00008437985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008292149,0.0004254326,0.9750373,0.0006688611,0.0002489602,0.00009466404,0.0004717398,0.002841567,0.01191926],"genre_scores_gemma":[0.2709385,0.0006318939,0.7036126,0.001321146,0.0003454151,0.0005003051,0.0009682808,0.001306054,0.02037587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007624533,"threshold_uncertainty_score":0.02550662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083734106","doi":"10.2168/lmcs-8(2:8)2012","title":"Width and size of regular resolution proofs","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Resolution (logic); Mathematical proof; Set (abstract data type); Mathematics; Contrast (vision); Discrete mathematics; Computer science; Combinatorics; Geometry; Programming language; Artificial intelligence","authors":[{"name":"Alasdair Urquhart","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04588101883095425,"gpt":0.3607944482569391,"spread":0.3149134294259848,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00702414,0.000511301,0.001715861,0.002737444,0.001192071,0.004701239,0.003006603,0.001798448,0.004789647],"category_scores_gemma":[0.05273736,0.001394906,0.001481938,0.002195383,0.003127278,0.01330826,0.003676495,0.002387604,0.0005962075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009106506,"about_ca_system_score_gemma":0.000708837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002216046,"about_ca_topic_score_gemma":0.0002301277,"domain_scores_codex":[0.9917924,0.00245713,0.001030188,0.001694372,0.002283225,0.000742703],"domain_scores_gemma":[0.9125918,0.06902482,0.005498871,0.007704333,0.003010901,0.002169237],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002210838,0.0003179685,0.01079047,0.002428206,0.0004398099,0.001052562,0.003134258,0.04993739,0.03057557,0.7565325,0.004527701,0.1380526],"study_design_scores_gemma":[0.0001288924,0.0001184583,0.00154775,0.0001549775,0.0001829413,0.0007610749,0.0003260705,0.04563584,0.01638361,0.9302818,0.004421795,0.000056765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5455222,0.004440057,0.4269903,0.003794003,0.000151454,0.0001538187,0.0014839,0.001712903,0.01575132],"genre_scores_gemma":[0.8954797,0.001280275,0.09906697,0.000258762,0.0002386996,0.0001616955,0.0008947391,0.0005308312,0.002088377],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00702414,"threshold_uncertainty_score":0.03714764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2791126244","doi":"10.23638/lmcs-15(1:11)2019","title":"The Subpower Membership Problem for Finite Algebras with Cube Terms","year":2019,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; Austrian Science Fund; National Science Foundation","keywords":"Mathematics; Subalgebra; Variety (cybernetics); Tuple; Constraint satisfaction problem; Finite set; Cube (algebra); Combinatorics; Set (abstract data type); Discrete mathematics; Direct product; Product (mathematics); Algebra over a field; Pure mathematics; Computer science","authors":[{"name":"Andreĭ A. Bulatov","is_ca":false},{"name":"Peter Mayr","is_ca":false},{"name":"Ágnes Szendrei","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06249495354962712,"gpt":0.36465759795694,"spread":0.3021626444073128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003053973,0.0005404202,0.001045374,0.000885753,0.00172184,0.003234963,0.002069886,0.00159825,0.005222915],"category_scores_gemma":[0.01554625,0.0006177315,0.002226492,0.001430133,0.003940678,0.01333461,0.0034182,0.003984311,0.0008018796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001910269,"about_ca_system_score_gemma":0.001959648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002479509,"about_ca_topic_score_gemma":0.001783541,"domain_scores_codex":[0.9967996,0.001008445,0.0002526205,0.0008067482,0.0008461348,0.000286369],"domain_scores_gemma":[0.9862798,0.01090095,0.000645962,0.001042678,0.0005789174,0.0005516703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003528258,0.0002364008,0.002756797,0.0004402069,0.00006770553,0.0004565839,0.001713725,0.02656177,0.00489005,0.8970118,0.00645194,0.05906016],"study_design_scores_gemma":[0.00003390812,0.00003618718,0.0002736105,0.00002770004,0.00002185533,0.0002023495,0.0002922471,0.04977718,0.002839432,0.9433057,0.003168321,0.00002150749],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2498404,0.00100218,0.7253652,0.005994358,0.0001336469,0.000371221,0.001269851,0.000978747,0.01504447],"genre_scores_gemma":[0.7474244,0.0009190498,0.2381439,0.0008198881,0.0004850642,0.0003374798,0.002934132,0.0002271374,0.008708986],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005222915,"threshold_uncertainty_score":0.01747239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2891275543","doi":"10.46298/lmcs-17(4:8)2021","title":"Dagger linear logic for categorical quantum mechanics","year":2021,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Mathematical and Theoretical Analysis","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Categorical quantum mechanics; Categorical variable; Mathematics; Hilbert space; Linear logic; Cartesian closed category; Pure mathematics; Algebra over a field; Quantum process; Quantum; Discrete mathematics; Quantum mechanics; Physics; Quantum dynamics","authors":[{"name":"Robin Cockett","is_ca":true},{"name":"Cole Comfort","is_ca":true},{"name":"Priyaa Varshinee Srinivasan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.22944892524853,"gpt":0.4759483359231271,"spread":0.246499410674597,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001867034,0.0005127303,0.0004333811,0.001686283,0.001539374,0.003026547,0.001223536,0.0009950512,0.0052774],"category_scores_gemma":[0.00215016,0.0003249603,0.00102087,0.001664472,0.004086385,0.005892001,0.002652816,0.003409122,0.0009051973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003888469,"about_ca_system_score_gemma":0.001248813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002516039,"about_ca_topic_score_gemma":0.002028659,"domain_scores_codex":[0.998391,0.0006192494,0.00009609748,0.0002225317,0.0004939106,0.0001773036],"domain_scores_gemma":[0.9988115,0.000613523,0.0000755095,0.0001609053,0.0002180939,0.0001204395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002660164,0.000003879532,0.00002826637,0.00001019786,0.000001352844,0.00001068928,0.00007914047,0.0002372088,0.0001730799,0.9969674,0.0003667851,0.002119352],"study_design_scores_gemma":[0.000003374832,0.000006219218,0.00005042568,0.000006397866,0.000002376197,0.00002089826,0.00003791335,0.002835326,0.0001851913,0.98959,0.007255566,0.000006307488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0400156,0.002715978,0.8639563,0.005485084,0.000403077,0.00007959129,0.0006180844,0.0009630989,0.08576331],"genre_scores_gemma":[0.7914791,0.001444311,0.1774435,0.00182646,0.000596686,0.0002919027,0.0006465027,0.0001965711,0.026075],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0052774,"threshold_uncertainty_score":0.02821296,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3129914072","doi":"10.46298/lmcs-18(1:33)2022","title":"A tier-based typed programming language characterizing Feasible Functionals","year":2022,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Type inference; Computer science; Oracle; Decidability; Programming language; Characterization (materials science); Class (philosophy); Type (biology); Theoretical computer science; Complexity class; Inference; Time complexity; Discrete mathematics; Mathematics; Algorithm; Artificial intelligence","authors":[{"name":"Emmanuel Hainry","is_ca":false},{"name":"Bruce M. Kapron","is_ca":true},{"name":"Jean-Yves Marion","is_ca":false},{"name":"Romain Péchoux","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08669493134337099,"gpt":0.3739833435503497,"spread":0.2872884122069788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002088124,0.0006649291,0.0006245003,0.001487879,0.0009548308,0.00455273,0.001681702,0.001306812,0.00775251],"category_scores_gemma":[0.004680614,0.0007815373,0.001507213,0.001728448,0.002408137,0.007356394,0.001980729,0.002365786,0.001328476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00177457,"about_ca_system_score_gemma":0.001532401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002519029,"about_ca_topic_score_gemma":0.001979525,"domain_scores_codex":[0.9981138,0.0003148809,0.0001884469,0.0005124114,0.0005038326,0.0003667691],"domain_scores_gemma":[0.9965379,0.001491831,0.0004065155,0.0007085861,0.0006366462,0.0002184774],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001185306,0.00002711916,0.0008458806,0.0001041747,0.00001492031,0.0001641229,0.000436266,0.005439291,0.01138741,0.9675673,0.00173376,0.01216125],"study_design_scores_gemma":[0.00003230502,0.0001087527,0.001150948,0.00007426645,0.00005920919,0.0009547689,0.0003059703,0.07024756,0.01177927,0.8778286,0.03733679,0.0001216658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04011874,0.0001865706,0.9439121,0.0005880982,0.00006845645,0.0001244965,0.001569134,0.001873899,0.01155857],"genre_scores_gemma":[0.6026112,0.0002930227,0.3838891,0.000578745,0.0001298945,0.0003144103,0.001442025,0.0007230455,0.01001853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00775251,"threshold_uncertainty_score":0.0259347,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389935239","doi":"10.46298/lmcs-19(4:30)2023","title":"Categorical composable cryptography: extended version","year":2023,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Computer science; Theoretical computer science; Correctness; Cryptography; String (physics); Set (abstract data type); Bipartite graph; Computer security; Mathematics; Programming language","authors":[{"name":"Anne Broadbent","is_ca":true},{"name":"Martti Karvonen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07016060689756048,"gpt":0.4156168826556735,"spread":0.3454562757581131,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001916077,0.000687028,0.0007705285,0.001574822,0.001607388,0.004201641,0.001914577,0.001442745,0.02574108],"category_scores_gemma":[0.00370695,0.0004934883,0.00176136,0.002225644,0.003904178,0.007491833,0.004349839,0.004845902,0.005704192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003761909,"about_ca_system_score_gemma":0.001689866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002244455,"about_ca_topic_score_gemma":0.001592415,"domain_scores_codex":[0.9978797,0.0004873647,0.0001363373,0.0004867864,0.0007709894,0.0002388106],"domain_scores_gemma":[0.997507,0.0007776104,0.0001743149,0.0009082892,0.0004556155,0.0001771113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009313748,0.000008852238,0.00006715715,0.00003429633,0.000003979945,0.00002399065,0.00009093506,0.0007995939,0.0003923413,0.993803,0.001241874,0.003524535],"study_design_scores_gemma":[0.000009882666,0.00001552444,0.0001017063,0.00001713594,0.000006731736,0.00007232041,0.00002957611,0.00564487,0.0007510138,0.9538142,0.03952112,0.00001587754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01402396,0.00168949,0.8741407,0.004794557,0.001337286,0.0001278276,0.001083239,0.001844022,0.100959],"genre_scores_gemma":[0.5915911,0.002165499,0.3270019,0.003157572,0.001669196,0.0005491173,0.00254519,0.0009537091,0.07036674],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02574108,"threshold_uncertainty_score":0.08611244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2571030091","doi":"10.23638/lmcs-13(3:12)2017","title":"A Note on the Topologicity of Quantale-Valued Topological Spaces","year":2017,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monad (category theory); Distributivity; Ultrafilter; Topological space; Closure (psychology); Subcategory; Distributive property; Functor; Category of topological spaces; Pure mathematics; Joins; Closed set; Axiom of choice; Generalization; Combinatorics; Discrete mathematics; Set (abstract data type); Set theory; Topological tensor product; Functional analysis; Mathematical analysis; Computer science","authors":[{"name":"Hongliang Lai","is_ca":false},{"name":"Walter Tholen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4273946473904031,"gpt":0.5560023223505905,"spread":0.1286076749601874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003959856,0.0004666841,0.0007917496,0.001312796,0.00308214,0.00613389,0.001168518,0.001079928,0.005397748],"category_scores_gemma":[0.004037939,0.0004992275,0.001268654,0.001009455,0.01886798,0.01155905,0.004618676,0.004411852,0.0005575141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001578081,"about_ca_system_score_gemma":0.0009342488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00170499,"about_ca_topic_score_gemma":0.001466596,"domain_scores_codex":[0.9983867,0.0005091915,0.0001000636,0.0003341117,0.0004785916,0.000191273],"domain_scores_gemma":[0.9967561,0.001979113,0.0001697205,0.0004459056,0.0003398615,0.0003093281],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005648085,0.000002102293,0.00007264208,0.00001533164,0.000002330077,0.00003945804,0.0002331807,0.00008466075,0.0001418894,0.9980292,0.0003261677,0.001047231],"study_design_scores_gemma":[0.000006003726,0.00002038185,0.0001776669,0.00001859299,0.00000716985,0.000100909,0.0001600674,0.0008446155,0.0003227205,0.9809924,0.01733826,0.00001123982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1061867,0.017498,0.5571071,0.02918083,0.003511684,0.00007421561,0.0005585771,0.0005960258,0.2852868],"genre_scores_gemma":[0.90477,0.005579907,0.06245482,0.002297619,0.002233526,0.0001161112,0.0001403796,0.0002143399,0.02219331],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00613389,"threshold_uncertainty_score":0.02094191,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2526743241","doi":"10.23638/lmcs-13(3:24)2017","title":"Well Behaved Transition Systems","year":2017,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Undecidable problem; Decidability; Mathematical proof; Monotone polygon; Monotonic function; Class (philosophy); Mathematics; Discrete mathematics; Computer science","authors":[{"name":"Michael Blondin","is_ca":false},{"name":"Alain Finkel","is_ca":false},{"name":"Pierre McKenzie","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.143999148359379,"gpt":0.4313153526342025,"spread":0.2873162042748235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001881691,0.0004118503,0.0003079861,0.000705653,0.001141592,0.002960815,0.0009614913,0.00163547,0.01014472],"category_scores_gemma":[0.006161116,0.0004047791,0.0007278999,0.0007399699,0.003982089,0.006571847,0.001470307,0.002608928,0.002502276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001579628,"about_ca_system_score_gemma":0.001552672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001901859,"about_ca_topic_score_gemma":0.001705446,"domain_scores_codex":[0.9979944,0.0003870658,0.0001582473,0.0006272615,0.0006480779,0.0001849573],"domain_scores_gemma":[0.9959713,0.00161111,0.0003071457,0.001049028,0.0008394787,0.0002218889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001406955,0.000004811005,0.0001375932,0.00004540073,0.000004713194,0.00007026246,0.0001388722,0.001639259,0.000946275,0.9883022,0.002881247,0.005815283],"study_design_scores_gemma":[0.0000191885,0.00002003204,0.0001633209,0.00004384582,0.00000988495,0.0001452297,0.00008714727,0.00994772,0.002333387,0.9096206,0.07759458,0.00001510105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03045461,0.001822182,0.8113536,0.01269147,0.001219712,0.000219351,0.001802055,0.002409038,0.1380281],"genre_scores_gemma":[0.6430317,0.002999839,0.2891383,0.003852669,0.0007780152,0.0005420927,0.002091395,0.0005208339,0.05704504],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01014472,"threshold_uncertainty_score":0.03393745,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2626008201","doi":"10.23638/lmcs-17(2:3)2021","title":"Semipullbacks of labelled Markov processes","year":2021,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Markov chain; Computer science; Mathematics; Statistics","authors":[{"name":"Jan Pachl","is_ca":true},{"name":"Pedro Sánchez Terraf","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06453886262054401,"gpt":0.398004675370218,"spread":0.333465812749674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002355574,0.0006288131,0.0006420277,0.001510911,0.001559625,0.003339631,0.001429132,0.001352401,0.006532304],"category_scores_gemma":[0.007797081,0.000723609,0.001996605,0.000871232,0.004401801,0.006463517,0.004300538,0.002382727,0.0009776116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001616539,"about_ca_system_score_gemma":0.000913418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001614909,"about_ca_topic_score_gemma":0.001138258,"domain_scores_codex":[0.9961239,0.0009984028,0.0002887585,0.001200339,0.0009062153,0.0004823931],"domain_scores_gemma":[0.9932041,0.003396164,0.001014514,0.0009289795,0.0008877701,0.0005684336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000478926,0.00001808328,0.0003131224,0.00002933359,0.00001144434,0.0001583812,0.0003994855,0.003236571,0.001503406,0.9910113,0.0001316143,0.003139402],"study_design_scores_gemma":[0.00002368126,0.00005979084,0.0003079447,0.00002979823,0.00001806909,0.0001163666,0.0001184045,0.04451189,0.002332715,0.9489694,0.003485248,0.00002657457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1581759,0.0004695721,0.8178777,0.0004049006,0.0001173798,0.0001195388,0.0003774923,0.0007502793,0.02170731],"genre_scores_gemma":[0.8855492,0.0003561038,0.09667742,0.0003288744,0.0001558491,0.0004202442,0.0006322092,0.0002119119,0.0156683],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006532304,"threshold_uncertainty_score":0.02185273,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2788097449","doi":"10.23638/lmcs-14(3:19)2018","title":"Free complete Wasserstein algebras","year":2018,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Algebra over a field; Mathematics; Pure mathematics","authors":[{"name":"Radu Mardare","is_ca":false},{"name":"Prakash Panangaden","is_ca":true},{"name":"Gordon Plotkin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1406983269864013,"gpt":0.4210002686829048,"spread":0.2803019416965035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001666156,0.0007300802,0.0006895426,0.002053836,0.001584666,0.002672395,0.001193855,0.0008675014,0.006948854],"category_scores_gemma":[0.003634037,0.0003927295,0.001151611,0.001238363,0.003242998,0.007658362,0.002924882,0.001722776,0.0008620511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001560723,"about_ca_system_score_gemma":0.0009615101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001651138,"about_ca_topic_score_gemma":0.001456319,"domain_scores_codex":[0.9977969,0.000427424,0.0001378685,0.0004107397,0.0009700503,0.0002570946],"domain_scores_gemma":[0.9980093,0.0004439667,0.0003662236,0.0002594451,0.0005726077,0.0003484813],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002188854,0.000003004771,0.00003135471,0.000007338715,0.000002792641,0.00001306848,0.0000327934,0.0004598775,0.0001532212,0.9982658,0.0001380996,0.000890426],"study_design_scores_gemma":[0.000004066513,0.00001196515,0.00008786932,0.000006114395,0.000004285307,0.00005532301,0.00003180789,0.005457822,0.0002978134,0.989186,0.004846108,0.00001086408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1346132,0.00169412,0.7757643,0.001726004,0.0003140467,0.00009507146,0.0007779805,0.000382117,0.08463314],"genre_scores_gemma":[0.8574345,0.001204586,0.1111128,0.0006988404,0.0006246628,0.000193639,0.0007386362,0.0001890152,0.02780322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006948854,"threshold_uncertainty_score":0.02324623,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2785025127","doi":"10.23638/lmcs-16(4:14)2020","title":"Theory of higher order interpretations and application to Basic Feasible Functions","year":2020,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Future Earth","funders":"Agence Nationale de la Recherche","keywords":"Abstract interpretation; Interpretation (philosophy); Bounding overwatch; Computer science; Order (exchange); Domain theory; Domain (mathematical analysis); Mathematics; Functional programming; Algebra over a field; Algorithm; Theoretical computer science; Programming language; Discrete mathematics; Pure mathematics; Artificial intelligence","authors":[{"name":"Emmanuel Hainry","is_ca":true},{"name":"Romain Péchoux","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08470821163239607,"gpt":0.3855110188118949,"spread":0.3008028071794988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003111997,0.0009876663,0.0008174894,0.00234593,0.00109606,0.004072825,0.001569264,0.001128812,0.003839096],"category_scores_gemma":[0.006194625,0.0006927433,0.002059083,0.001934266,0.005445472,0.007280236,0.002456531,0.005016628,0.0006612316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003171035,"about_ca_system_score_gemma":0.001228014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00129101,"about_ca_topic_score_gemma":0.001111992,"domain_scores_codex":[0.9972145,0.0008550773,0.0001561418,0.0004799185,0.0009554236,0.0003390218],"domain_scores_gemma":[0.9946879,0.003206204,0.0005122969,0.0006338459,0.0007107767,0.0002490817],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009341118,0.00000812602,0.000102784,0.00002982492,0.000005315196,0.00002903439,0.0001273595,0.00365639,0.0005122059,0.9916719,0.0001954145,0.003652167],"study_design_scores_gemma":[0.000007628991,0.00001615447,0.0001088177,0.00002244388,0.000008732038,0.00005931865,0.00005037574,0.02514401,0.0009919946,0.9691437,0.004432799,0.00001401106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02878373,0.0007766114,0.952529,0.0007127049,0.0000585987,0.00003040252,0.0001316157,0.0002034491,0.01677401],"genre_scores_gemma":[0.7059572,0.001435258,0.2797912,0.0002517135,0.0004311901,0.0002118807,0.0002599943,0.0002763661,0.01138523],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004072825,"threshold_uncertainty_score":0.02300763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3082202956","doi":"10.23638/lmcs-17(1:3)2021","title":"2-adjoint equivalences in homotopy type theory","year":2021,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Homotopy; Type (biology); Pure mathematics; Cofibration; Type theory; Homotopy category; Algebra over a field; n-connected; Regular homotopy","authors":[{"name":"Daniel Carranza","is_ca":false},{"name":"Jonathan Chang","is_ca":false},{"name":"Chris Kapulkin","is_ca":false},{"name":"Ryan Sandford","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1724431189938663,"gpt":0.4691749533310873,"spread":0.2967318343372209,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003040926,0.0005303783,0.0005186101,0.002170986,0.001319185,0.002846454,0.0009835341,0.00123001,0.007894889],"category_scores_gemma":[0.003660693,0.0004244065,0.0007710084,0.001304668,0.003863696,0.009425483,0.003388959,0.002950456,0.001094852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009398346,"about_ca_system_score_gemma":0.0005358559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005178378,"about_ca_topic_score_gemma":0.0004055771,"domain_scores_codex":[0.9981756,0.0005144195,0.0001110344,0.00026344,0.0006994411,0.0002360277],"domain_scores_gemma":[0.9979558,0.001083404,0.0001176788,0.0002385397,0.0004393736,0.0001652528],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001368576,0.00001547083,0.0001876112,0.00002461132,0.000003931189,0.00006821155,0.0001935148,0.0003154503,0.0007661069,0.9936032,0.000578314,0.004229821],"study_design_scores_gemma":[0.0000125816,0.00001905228,0.0002023025,0.00001692037,0.000005629567,0.0001050938,0.0001133735,0.002937408,0.001852515,0.9876267,0.007097628,0.00001074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.16633,0.001452476,0.7271483,0.00225816,0.001047365,0.00008981685,0.0006067088,0.001113224,0.09995401],"genre_scores_gemma":[0.9219819,0.0006478948,0.06154748,0.001131623,0.0003764134,0.0001152674,0.0004012613,0.0002540408,0.01354404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007894889,"threshold_uncertainty_score":0.02641106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3121836531","doi":"10.46298/lmcs-18(3:14)2022","title":"Tameness and the power of programs over monoids in DA","year":2022,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Morphism; Monoid; Class (philosophy); Regular language; Mathematics; Characterization (materials science); Hierarchy; Expressive power; Complexity class; Pure mathematics; Discrete mathematics; Algebra over a field; Computer science; Time complexity; Automaton; Programming language; Physics; Artificial intelligence","authors":[{"name":"Nathan Grosshans","is_ca":false},{"name":"Pierre McKenzie","is_ca":true},{"name":"Luc Segoufin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04480822537424823,"gpt":0.3572987186146682,"spread":0.31249049324042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00162486,0.0003514585,0.0004506035,0.001308617,0.001644684,0.003492665,0.0009795532,0.0009570591,0.003417476],"category_scores_gemma":[0.005222553,0.0004494557,0.0009776345,0.0006102537,0.005316457,0.007902468,0.002383079,0.002119585,0.0003931876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001810402,"about_ca_system_score_gemma":0.0007040016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001253841,"about_ca_topic_score_gemma":0.0008451637,"domain_scores_codex":[0.9983707,0.0003305151,0.0001289648,0.0005700641,0.0003661017,0.0002335777],"domain_scores_gemma":[0.9940972,0.003420881,0.0004464003,0.0009808878,0.0006572859,0.0003973189],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005639547,0.00001673042,0.0009687502,0.00005356446,0.000008873958,0.0001102002,0.001027563,0.001096763,0.002788327,0.9891781,0.0001832817,0.004511475],"study_design_scores_gemma":[0.00002735788,0.00008587977,0.0009921105,0.00003224044,0.00004064841,0.0003905413,0.0003589786,0.01954198,0.009055967,0.9597428,0.009693759,0.00003764968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5481691,0.001075204,0.3998949,0.002376275,0.0001141293,0.00007217754,0.0003346,0.0007949321,0.04716857],"genre_scores_gemma":[0.9693179,0.000189496,0.02429694,0.0002110685,0.00007023761,0.00006328124,0.00009418866,0.00006426013,0.005692616],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.003492665,"threshold_uncertainty_score":0.01313543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2796695740","doi":"10.23638/lmcs-14(4:12)2018","title":"Reasoning with Finite Sets and Cardinality Constraints in SMT","year":2018,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"York University; National Science Foundation","keywords":"Cardinality (data modeling); Computer science; Venn diagram; Theoretical computer science; Satisfiability; DPLL algorithm; Automated reasoning; Boolean satisfiability problem; Intersection (aeronautics); Answer set programming; Satisfiability modulo theories; Propositional calculus; Modular design; Algorithm; Mathematics; Programming language; Logic programming; Data mining","authors":[{"name":"Kshitij Bansal","is_ca":false},{"name":"Clark Barrett","is_ca":false},{"name":"Andrew Reynolds","is_ca":false},{"name":"Cesare Tinelli","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1017787013046702,"gpt":0.4146159754084892,"spread":0.3128372741038189,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005978151,0.001168604,0.001332615,0.001963099,0.001789128,0.004468316,0.003118919,0.001968593,0.005039737],"category_scores_gemma":[0.02184421,0.001101505,0.004243344,0.002452202,0.003755896,0.00764404,0.005563949,0.003456502,0.0009668318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003003826,"about_ca_system_score_gemma":0.004250946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008148252,"about_ca_topic_score_gemma":0.01206907,"domain_scores_codex":[0.9927164,0.002257395,0.0005899561,0.001308081,0.00248422,0.0006440747],"domain_scores_gemma":[0.9859807,0.01083827,0.0008811182,0.001249092,0.0007588419,0.0002919501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003629062,0.0002207243,0.002436611,0.0008016814,0.0002075945,0.0011244,0.001150788,0.3597584,0.01130036,0.5041411,0.007534397,0.110961],"study_design_scores_gemma":[0.00006557319,0.00004044643,0.0002026229,0.00007360677,0.00007668769,0.0002130835,0.00021244,0.6205233,0.013661,0.3556287,0.009258819,0.00004378088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01531927,0.0001303251,0.9787433,0.000600621,0.00006066754,0.000115436,0.0002852759,0.001913901,0.002831177],"genre_scores_gemma":[0.1964819,0.000227336,0.7992312,0.0003632135,0.0001066233,0.0002338815,0.0009282416,0.0004312165,0.001996357],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008148252,"threshold_uncertainty_score":0.03161585,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2766389817","doi":"10.23638/lmcs-15(2:10)2019","title":"A Denotational Semantics for SPARC TSO","year":2019,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Scheme for Promotion of Academic and Research Collaboration","keywords":"Denotational semantics of the Actor model; Normalisation by evaluation; Denotational semantics; Programming language; Computer science; Modular design; Semantics (computer science); Axiom; Principle of compositionality; Operational semantics; Theoretical computer science; Mathematics; Artificial intelligence","authors":[{"name":"Ryan Kavanagh","is_ca":false},{"name":"Stephen Brookes","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1115958262895373,"gpt":0.4331970286915267,"spread":0.3216012024019893,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001023116,0.0006806675,0.0005223884,0.0008755257,0.0009983139,0.002182508,0.001301035,0.0007962943,0.00475395],"category_scores_gemma":[0.001808501,0.000490511,0.001141381,0.0007683332,0.003922101,0.004427163,0.002635255,0.001801487,0.0007825258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001275227,"about_ca_system_score_gemma":0.001600718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002056309,"about_ca_topic_score_gemma":0.001921196,"domain_scores_codex":[0.9989122,0.0001917245,0.0001289979,0.0001923038,0.0004068188,0.0001680748],"domain_scores_gemma":[0.9990171,0.0003018252,0.00009213193,0.0002232571,0.0002818635,0.00008369466],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002254347,0.00001823312,0.0001609771,0.00005670851,0.000007676683,0.00009563455,0.0002730865,0.00686744,0.002719134,0.9820049,0.0006329177,0.007140783],"study_design_scores_gemma":[0.00003417713,0.00006048715,0.0001430433,0.00003308397,0.00003338163,0.0001520255,0.0002010718,0.08723833,0.00761062,0.8783339,0.02613197,0.00002788496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0199693,0.0001349625,0.9652073,0.0005894012,0.0001015071,0.00009739794,0.0001873304,0.000880351,0.01283249],"genre_scores_gemma":[0.4961831,0.0003534458,0.488623,0.0006256286,0.0001658508,0.0006004556,0.0005613144,0.0005022045,0.01238493],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00475395,"threshold_uncertainty_score":0.01590353,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2972042414","doi":"10.46298/lmcs-17(3:3)2021","title":"The Complexity of Reachability in Affine Vector Addition Systems with States","year":2021,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; European Commission","keywords":"Undecidable problem; Reachability; Decidability; Parameterized complexity; Affine transformation; Reachability problem; Computational complexity theory","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.1152495549883317,"gpt":0.3819331628623088,"spread":0.2666836078739772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001890515,0.0008169202,0.0008273492,0.0009426739,0.001133133,0.004109215,0.001499965,0.001243704,0.004762327],"category_scores_gemma":[0.01133568,0.0006391552,0.002338241,0.001006897,0.002779754,0.007053599,0.002596863,0.003053396,0.0002643177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00327454,"about_ca_system_score_gemma":0.00231902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005341442,"about_ca_topic_score_gemma":0.004782613,"domain_scores_codex":[0.9970409,0.0006878046,0.000252004,0.0008268498,0.0006511829,0.0005411792],"domain_scores_gemma":[0.9821298,0.01522638,0.001082802,0.0008131466,0.000425581,0.0003223585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007794223,0.0002600507,0.004774522,0.0007130546,0.000171712,0.0005374868,0.001011962,0.5730455,0.01326766,0.3686392,0.002057484,0.03474196],"study_design_scores_gemma":[0.00007960775,0.00007777611,0.001031175,0.00004143994,0.00008027553,0.000148549,0.0001669894,0.559716,0.006301358,0.4306581,0.001653776,0.00004491109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6003006,0.0007834894,0.377665,0.003601691,0.00006934071,0.0003211558,0.001536411,0.001011871,0.01471059],"genre_scores_gemma":[0.9548159,0.0004497188,0.03955318,0.0002345369,0.00009372556,0.0002078695,0.0009880947,0.000135295,0.00352174],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005341442,"threshold_uncertainty_score":0.02375859,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078894142","doi":"10.2168/lmcs-9(3:7)2013","title":"Universal codes of the natural numbers","year":2013,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Natural number; Set (abstract data type); Code (set theory); Sequence (biology); Construct (python library); Binary code; Code word; Linear code","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02978916721921781,"gpt":0.3276873502673526,"spread":0.2978981830481348,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008087214,0.000219611,0.0004079121,0.000935237,0.000910688,0.001315633,0.0004346496,0.0004160869,0.001933569],"category_scores_gemma":[0.004584214,0.0001951939,0.000450695,0.0006286582,0.003178725,0.002420834,0.001699215,0.001529243,0.0002393569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00120323,"about_ca_system_score_gemma":0.0009499508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001576572,"about_ca_topic_score_gemma":0.001552281,"domain_scores_codex":[0.9985637,0.0002426909,0.00006849015,0.0003370695,0.0005677841,0.0002203341],"domain_scores_gemma":[0.9975445,0.0008696112,0.0002862927,0.0004785441,0.0005691487,0.0002518266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003079889,0.000007515021,0.0002635202,0.00002520543,0.000003902685,0.00002939067,0.000178053,0.0021566,0.002859641,0.9857706,0.0005396131,0.008135155],"study_design_scores_gemma":[0.00001547154,0.00004425514,0.0006501785,0.00002894591,0.000007819226,0.0001089798,0.00009800929,0.01568939,0.003927029,0.9697173,0.009683531,0.0000290113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4813015,0.00154469,0.4498909,0.001530786,0.000271534,0.00009240919,0.0005778567,0.0005912308,0.06419907],"genre_scores_gemma":[0.8981006,0.0004335719,0.09121215,0.0003532065,0.0001744186,0.0001268401,0.0002577233,0.00009167314,0.009249789],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001933569,"threshold_uncertainty_score":0.008730054,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2766112195","doi":"10.23638/lmcs-16(2:13)2020","title":"Forward Analysis for WSTS, Part III: Karp-Miller Trees","year":2020,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Miller; Computer science; Geology","authors":[{"name":"Michael Blondin","is_ca":true},{"name":"Alain Finkel","is_ca":false},{"name":"Jean Goubault-Larrecq","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1480144954118037,"gpt":0.4090043323672111,"spread":0.2609898369554073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002042476,0.0005659029,0.0006081203,0.001579175,0.001252828,0.002026292,0.001160467,0.0007903953,0.005806233],"category_scores_gemma":[0.005182792,0.0005078756,0.002705236,0.0013269,0.002708139,0.005920114,0.00248224,0.00353265,0.001015504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002036708,"about_ca_system_score_gemma":0.001704693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002815736,"about_ca_topic_score_gemma":0.003270086,"domain_scores_codex":[0.9982558,0.0003218121,0.0001270377,0.0003676005,0.0007073611,0.0002203304],"domain_scores_gemma":[0.9970015,0.001672395,0.0002382378,0.0004679855,0.0005118554,0.0001080177],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007036549,0.00004468674,0.0007803799,0.0001335535,0.00002602843,0.0001172011,0.0004787427,0.01929524,0.007150022,0.9254057,0.00163485,0.04486333],"study_design_scores_gemma":[0.00001312228,0.00003868065,0.0002794337,0.0000478265,0.00002844424,0.00008380711,0.0001324608,0.08019548,0.008649822,0.9006708,0.009832434,0.00002769736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02071905,0.0001609192,0.9706228,0.0004664884,0.00003545807,0.0001096648,0.0002366144,0.0004659064,0.007182971],"genre_scores_gemma":[0.4130447,0.0005098055,0.5654015,0.0004544187,0.0001698398,0.0003856668,0.001036568,0.000376445,0.01862115],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005806233,"threshold_uncertainty_score":0.01942378,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2765883112","doi":"10.23638/lmcs-14(1:12)2018","title":"Automated Synthesis of Distributed Self-Stabilizing Protocols","year":2018,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Computer science; Token ring; Dijkstra's algorithm; Distributed computing; Monotonic function; Protocol (science); Ideal (ethics); Self-stabilization; State (computer science); Set (abstract data type); Security token; Leader election; Theoretical computer science; Distributed algorithm; Topology (electrical circuits); Algorithm; Computer network; Mathematics; Graph; Programming language","authors":[{"name":"Fathiyeh Faghih","is_ca":false},{"name":"Borzoo Bonakdarpour","is_ca":false},{"name":"Sébastien Tixeuil","is_ca":false},{"name":"Sandeep S. Kulkarni","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07643261077141357,"gpt":0.4151600025821575,"spread":0.338727391810744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044396,0.000562634,0.0004154654,0.0004961504,0.0004806183,0.0007010812,0.000942224,0.000488267,0.002498369],"category_scores_gemma":[0.00298903,0.0004058726,0.0006457899,0.0002792157,0.0008967001,0.0008223648,0.001101056,0.0007511037,0.0005146139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006110904,"about_ca_system_score_gemma":0.0010971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004531272,"about_ca_topic_score_gemma":0.0008101484,"domain_scores_codex":[0.998996,0.0002701711,0.00007636867,0.0001575759,0.0004384152,0.00006162163],"domain_scores_gemma":[0.998692,0.0006790087,0.00008834006,0.000284478,0.0002203817,0.00003589572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000133169,0.0001224029,0.0009842792,0.0006427204,0.00007907781,0.0004983228,0.0005229634,0.4892825,0.1082363,0.2136446,0.002784715,0.1830691],"study_design_scores_gemma":[0.00005252434,0.00005746854,0.00008827239,0.0000452811,0.00002608003,0.00009090083,0.00006404761,0.8804877,0.05515043,0.05062761,0.0132963,0.00001343366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009801869,0.0000485429,0.9864306,0.00006506324,0.00002622359,0.00006349757,0.00005597777,0.001227685,0.002280612],"genre_scores_gemma":[0.253391,0.0001534241,0.7431851,0.00004572315,0.00001535534,0.0002602529,0.0002910333,0.00042709,0.002231052],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002498369,"threshold_uncertainty_score":0.008357823,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403876945","doi":"10.46298/lmcs-20(4:9)2024","title":"Sum and Tensor of Quantitative Effects","year":2024,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; UK Research and Innovation","keywords":"Monad (category theory); Algebraic number; Mathematics; Algebra over a field; Tensor product; Distributive property; Tensor (intrinsic definition); Algebraic theory; Categorical variable; Computer science; Pure mathematics","authors":[{"name":"Giorgio Bacci","is_ca":false},{"name":"Radu Mardare","is_ca":false},{"name":"Prakash Panangaden","is_ca":true},{"name":"Gordon Plotkin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0814397467822359,"gpt":0.4078122885297696,"spread":0.3263725417475337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004242097,0.0008531115,0.0009319054,0.003863639,0.001748573,0.005759296,0.001245228,0.001121018,0.008119741],"category_scores_gemma":[0.00729072,0.0008521415,0.002526144,0.001722419,0.008872651,0.01729851,0.005672118,0.003409829,0.0010605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00249636,"about_ca_system_score_gemma":0.001413967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001546987,"about_ca_topic_score_gemma":0.001066804,"domain_scores_codex":[0.9939621,0.001313662,0.000588545,0.001642303,0.001977494,0.0005159294],"domain_scores_gemma":[0.9938083,0.002136488,0.0005475707,0.001628374,0.001521643,0.0003575528],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009037733,0.000005076477,0.00008812286,0.00002398078,0.00000703866,0.00001968022,0.000118672,0.0003713941,0.0004178302,0.9964141,0.0001466874,0.002378334],"study_design_scores_gemma":[0.00001082384,0.00002509171,0.0001542619,0.0000221596,0.00003621955,0.0001108814,0.00007294618,0.005410725,0.001601313,0.9811996,0.01133253,0.00002338903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03167717,0.001122289,0.9192455,0.001445389,0.0004306643,0.00009238998,0.0003864248,0.0007188371,0.04488145],"genre_scores_gemma":[0.7487184,0.001303844,0.2238782,0.0009155733,0.0006504943,0.0003577427,0.0004345194,0.0005246889,0.02321655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008119741,"threshold_uncertainty_score":0.02716321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2521832422","doi":"10.23638/lmcs-13(1:1)2017","title":"Logical compactness and constraint satisfaction problems","year":2017,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compact space; Constraint satisfaction problem; Constraint (computer-aided design); Mathematics; Axiom; Hierarchy; Ultrafilter; Local consistency; Constraint satisfaction; Constraint logic programming; Discrete mathematics; Pure mathematics; Probabilistic logic; Statistics","authors":[{"name":"Danny Rorabaugh","is_ca":false},{"name":"Claude Tardif","is_ca":false},{"name":"David L. Wehlau","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1790849006281343,"gpt":0.4639551405760599,"spread":0.2848702399479256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005690157,0.0009091014,0.0009444489,0.002293998,0.001904535,0.003959488,0.00219006,0.001923608,0.008246223],"category_scores_gemma":[0.02956921,0.000708451,0.002010641,0.002762887,0.006514465,0.01383322,0.004723448,0.005604214,0.0007238315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00291123,"about_ca_system_score_gemma":0.001267514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001871834,"about_ca_topic_score_gemma":0.00148425,"domain_scores_codex":[0.9908164,0.00340005,0.000560647,0.001377988,0.002995093,0.0008497557],"domain_scores_gemma":[0.9390371,0.05192039,0.002743376,0.002329068,0.002901776,0.00106837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006339611,0.00007166115,0.001368683,0.000292902,0.00005044613,0.0001841654,0.0004958119,0.0149228,0.001169238,0.9593806,0.002284875,0.01971539],"study_design_scores_gemma":[0.00002210148,0.00002366186,0.0006007939,0.00003760129,0.00001276217,0.0001045201,0.0001727795,0.03252643,0.0009676543,0.9628503,0.002660804,0.00002057345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1303271,0.002495519,0.8185641,0.01175378,0.0001381595,0.0002003084,0.0006006356,0.0003832445,0.03553727],"genre_scores_gemma":[0.7953168,0.001746559,0.1928479,0.001616207,0.000633554,0.0002644891,0.001270118,0.0001295897,0.006174923],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008246223,"threshold_uncertainty_score":0.03009278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4417316699","doi":"10.46298/lmcs-21(4:30)2025","title":"Approximating Queries on Probabilistic Graphs","year":2025,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; Ministry of Education, India; Agence Nationale de la Recherche; National Research Foundation; Deutsche Forschungsgemeinschaft; National Research Foundation Singapore","keywords":"Probabilistic logic; Conjunctive query; Hyperbolic tree; Probabilistic database; Bounded function; Time complexity; Probabilistic analysis of algorithms; Focus (optics); Binary number; Treewidth","authors":[{"name":"Antoine Amarilli","is_ca":false},{"name":"Timothy van Bremen","is_ca":false},{"name":"Octave Gaspard","is_ca":false},{"name":"Kuldeep S. Meel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07204387294373597,"gpt":0.3981254690196539,"spread":0.3260815960759179,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004984409,0.001202841,0.001564817,0.001781187,0.0007894954,0.004446368,0.003770755,0.002027118,0.004656683],"category_scores_gemma":[0.04164277,0.001000552,0.002912929,0.003257321,0.002044111,0.01150546,0.003590398,0.003413132,0.000773106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004718455,"about_ca_system_score_gemma":0.001577024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004991746,"about_ca_topic_score_gemma":0.005383621,"domain_scores_codex":[0.9891677,0.00282507,0.0008068566,0.002901042,0.00339091,0.0009083351],"domain_scores_gemma":[0.9612752,0.02869667,0.001800046,0.005956654,0.001812399,0.00045908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006637249,0.0001737479,0.004436175,0.000638293,0.0002338525,0.0002512999,0.0007112597,0.5771458,0.006095926,0.3095517,0.005298122,0.09480001],"study_design_scores_gemma":[0.00003542191,0.00003649666,0.0003110143,0.00002337439,0.0000493482,0.0001172541,0.00009365803,0.7304218,0.00199251,0.2651776,0.001726735,0.00001480535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1031669,0.0007268771,0.8835396,0.002048612,0.00005676724,0.0001865326,0.001365318,0.00255592,0.006353409],"genre_scores_gemma":[0.6648721,0.0006060911,0.3263057,0.0006624712,0.0001902395,0.0003110167,0.002103454,0.0005337423,0.004415285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004991746,"threshold_uncertainty_score":0.03423494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2989637082","doi":"10.46298/lmcs-19(4:10)2023","title":"A categorical characterization of relative entropy on standard Borel spaces","year":2023,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Categorical variable; Functor; Convexity; Kullback–Leibler divergence; Borel set; Pure mathematics; Uniqueness; Entropy (arrow of time); Discrete mathematics; Statistics; Mathematical analysis","authors":[{"name":"Nicolas Gagné","is_ca":true},{"name":"Prakash Panangaden","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06528314090497818,"gpt":0.3759013701157279,"spread":0.3106182292107498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003017158,0.0005660696,0.0008754819,0.004928737,0.001608047,0.003882031,0.001311933,0.001205125,0.003852727],"category_scores_gemma":[0.005929714,0.0004487859,0.001152753,0.002506615,0.00625206,0.007810289,0.003645514,0.003017404,0.0003876754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001752823,"about_ca_system_score_gemma":0.0006654185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007742561,"about_ca_topic_score_gemma":0.0006072373,"domain_scores_codex":[0.9968643,0.0006375919,0.0001777723,0.0005536199,0.001429139,0.0003375488],"domain_scores_gemma":[0.9952601,0.002528246,0.0004715387,0.0005500335,0.0008030333,0.0003872258],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004678277,0.000007969675,0.0002260934,0.00002144539,0.000007380339,0.00002835537,0.0001307822,0.0006874203,0.0006346718,0.9957134,0.0001961318,0.002341816],"study_design_scores_gemma":[0.000004992455,0.00002330153,0.0007659213,0.00001918381,0.00001189168,0.000136543,0.00006486625,0.008013895,0.0007179691,0.9855173,0.004702417,0.00002175513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09180707,0.00226608,0.8515622,0.002401423,0.0002472371,0.00005465122,0.0004863365,0.0002785279,0.05089648],"genre_scores_gemma":[0.9178068,0.0009581516,0.07193691,0.0005924085,0.0006525956,0.0001688852,0.0003855158,0.0001112145,0.007387539],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004928737,"threshold_uncertainty_score":0.01595646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}