{"meta":{"query_hash":"ff3e5a785132","filters":{"venue":"ACM Transactions on Computational Logic"},"cohort_total":42,"direct_labels_cover":0,"predictions_cover":42,"exported":42,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/ff3e5a785132","api":"https://metacan.xera.ac/api/v1/cohort?venue=ACM+Transactions+on+Computational+Logic"},"results":[{"id":"W119782208","doi":"10.1145/1227839.1227841","title":"Recycling computed answers in rewrite systems for abduction","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Negation; Domain (mathematical analysis); Computation; Computer science; Class (philosophy); Encoding (memory); Theoretical computer science; Circumscription; Logic program; Logic programming; Programming language; Algorithm; Artificial intelligence; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.04025305083435371,"score_gpt":0.2969539954423772,"score_spread":0.2567009446080235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119782208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056767054,0.00095044565,0.93058956,0.00057237217,0.00009862974,0.00039488406,0.0002075033,0.005225261,0.0051942756],"genre_scores_gemma":[0.38649377,0.00063989224,0.60531354,0.00041971062,0.000092636576,0.00030606755,0.00059313164,0.0011318643,0.0050093215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922168,0.003204951,0.00096753496,0.00102864,0.0020569689,0.00052509387],"domain_scores_gemma":[0.9815694,0.013574021,0.0005907489,0.002892465,0.0012379884,0.00013533776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065105087,0.0008559598,0.0015307923,0.0017411644,0.0015888445,0.0035690335,0.0026146525,0.002037562,0.004522557],"category_scores_gemma":[0.025689242,0.0012630594,0.002002564,0.0014382743,0.0035864334,0.0055143004,0.0032001415,0.0034952478,0.0010231775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007405947,0.0004380102,0.0021025103,0.0011598967,0.0002439792,0.0010039731,0.004083865,0.11496717,0.027907904,0.5765982,0.0037195927,0.2670343],"study_design_scores_gemma":[0.00027736422,0.0002697279,0.00056911004,0.00022601309,0.00039676164,0.00052206474,0.0005385215,0.40961328,0.039956775,0.5333414,0.014080761,0.0002082853],"about_ca_topic_score_codex":0.003659551,"about_ca_topic_score_gemma":0.004643836,"teacher_disagreement_score":0.0065105087,"about_ca_system_score_codex":0.0020681915,"about_ca_system_score_gemma":0.0015306699,"threshold_uncertainty_score":0.03443128},"labels":[],"label_agreement":null},{"id":"W1591526886","doi":"10.1145/2499937.2499942","title":"Extensional Higher-Order Logic Programming","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"European Social Fund","keywords":"Stable model semantics; Extensional definition; Logic programming; Mathematics; Semantics (computer science); Tuple; Well-founded semantics; Higher-order logic; Programming language; Operator (biology); Resolution (logic); First-order logic; Algorithm; Computer science; Algebra over a field; Discrete mathematics; Theoretical computer science; Operational semantics; Denotational semantics; Description logic; Pure mathematics","score_opus":0.03172090831785155,"score_gpt":0.2671615229607867,"score_spread":0.23544061464293517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591526886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008124014,0.0003911356,0.9773008,0.0008235613,0.00011608123,0.00007668747,0.0001408054,0.00039118392,0.012635643],"genre_scores_gemma":[0.32491308,0.0006463734,0.6635606,0.00070343725,0.00030600568,0.00020172601,0.00034312985,0.00012690974,0.009198715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732333,0.0009055228,0.00022456725,0.0004350783,0.0009138098,0.00019771759],"domain_scores_gemma":[0.9980367,0.0008338887,0.00015356755,0.00050001533,0.00034589166,0.00012994747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003933516,0.0007212754,0.00062738475,0.0014049133,0.00086288323,0.0031863826,0.0026837436,0.00081934663,0.0046333913],"category_scores_gemma":[0.0032352682,0.00042320704,0.0018407694,0.0013112675,0.0029774706,0.006940446,0.0034914732,0.0028902132,0.0006777627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000140507545,0.00003394812,0.00010510154,0.00007487217,0.000013723894,0.000084572115,0.00016232311,0.0027582285,0.0008053364,0.9809622,0.0005704876,0.014415221],"study_design_scores_gemma":[0.000026143363,0.00003305562,0.00009205905,0.000031104126,0.000020497413,0.00018599987,0.000055449684,0.025738437,0.0013638091,0.95624274,0.01619409,0.000016539676],"about_ca_topic_score_codex":0.0005341259,"about_ca_topic_score_gemma":0.0010216224,"teacher_disagreement_score":0.0046333913,"about_ca_system_score_codex":0.0013530679,"about_ca_system_score_gemma":0.0011591486,"threshold_uncertainty_score":0.020802677},"labels":[],"label_agreement":null},{"id":"W1976132254","doi":"10.1145/937555.937556","title":"A dynamic approach to characterizing termination of general logic programs","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Alberta","funders":"","keywords":"Prolog; Computer science; Dynamic logic (digital electronics); Logic program; Key (lock); Theoretical computer science; Programming language; Logic programming; Tree (set theory); Algorithm; Mathematics","score_opus":0.030589214255365874,"score_gpt":0.2715346414251692,"score_spread":0.24094542716980333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976132254","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032530617,0.00030215795,0.9600396,0.00024433306,0.00001954878,0.00009409571,0.00017289199,0.00038915506,0.0062075085],"genre_scores_gemma":[0.59720534,0.0005872936,0.39587766,0.00027232582,0.00015938203,0.0003911329,0.0007236552,0.0003774174,0.0044058003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613994,0.00079313107,0.00035162317,0.00075606536,0.0015193338,0.00043992736],"domain_scores_gemma":[0.99260783,0.0037005676,0.0009702536,0.0012278062,0.0011043551,0.00038922857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033035085,0.00094199023,0.00082230644,0.003238733,0.0013092845,0.0020399457,0.0022766471,0.0012602973,0.0023596303],"category_scores_gemma":[0.008243034,0.0006653008,0.0013553294,0.0018982955,0.0046673813,0.007413414,0.003443817,0.0035099823,0.0003602813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001742777,0.000119263976,0.004104764,0.00028962287,0.00005879783,0.0005551823,0.000952236,0.085297555,0.019529203,0.8302246,0.0013262223,0.057368282],"study_design_scores_gemma":[0.000033511325,0.00010183149,0.0009435399,0.00006227821,0.000054528722,0.00049102254,0.00013214469,0.3041022,0.008047829,0.6755745,0.010399201,0.00005740227],"about_ca_topic_score_codex":0.0015540954,"about_ca_topic_score_gemma":0.0012947287,"teacher_disagreement_score":0.0033035085,"about_ca_system_score_codex":0.0026071277,"about_ca_system_score_gemma":0.0012005852,"threshold_uncertainty_score":0.01891607},"labels":[],"label_agreement":null},{"id":"W1977208552","doi":"10.1145/383779.383780","title":"On knowledge-based programming with sensing in the situation calculus","year":2001,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Axiom; Computer science; Interpreter; Situation calculus; Modality (human–computer interaction); Artificial intelligence; Programming language; Mathematics","score_opus":0.029458100788382326,"score_gpt":0.2759510668570427,"score_spread":0.24649296606866036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977208552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010945709,0.00044993902,0.9678861,0.0015591499,0.000085733096,0.00014577321,0.00010769267,0.0008766289,0.017943293],"genre_scores_gemma":[0.3524406,0.0010907184,0.6324988,0.0010232739,0.0003144611,0.00064818375,0.0003076454,0.00042903353,0.011247322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975038,0.0009829958,0.00013901325,0.0003688802,0.00062509486,0.00038015007],"domain_scores_gemma":[0.9976265,0.0015713106,0.00018094749,0.00027278514,0.00015765731,0.00019069189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032240546,0.0012682152,0.0008777254,0.0011191815,0.0016439963,0.0040639513,0.0026520642,0.0017986901,0.0050006136],"category_scores_gemma":[0.0058759693,0.0008270426,0.0024063932,0.0015687615,0.009181267,0.008354681,0.0046421937,0.0041133035,0.0008704437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004494725,0.00004188645,0.00015736232,0.00008450749,0.00001659175,0.00017871392,0.00065224495,0.0137362685,0.0005670081,0.9735171,0.0007514671,0.0102518005],"study_design_scores_gemma":[0.00003004145,0.00003156699,0.00007121809,0.00004094409,0.000022849972,0.00008899376,0.00008458213,0.041550376,0.0007819063,0.9497699,0.0075065726,0.000021002577],"about_ca_topic_score_codex":0.005060987,"about_ca_topic_score_gemma":0.0047918796,"teacher_disagreement_score":0.005060987,"about_ca_system_score_codex":0.0023253872,"about_ca_system_score_gemma":0.002148293,"threshold_uncertainty_score":0.017050683},"labels":[],"label_agreement":null},{"id":"W1988413534","doi":"10.1145/2629680","title":"Model-Checking Linear-Time Properties of Quantum Systems","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Australian Research Council; Chinese Academy of Sciences","keywords":"Automaton; Model checking; Linear subspace; Quantum finite automata; Hilbert space; Quantum; Computer science; Automata theory; Theoretical computer science; Mathematics; Discrete mathematics; Pure mathematics; Quantum mechanics","score_opus":0.03676618893922188,"score_gpt":0.24474361605426803,"score_spread":0.20797742711504616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988413534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10738884,0.00009946693,0.88654226,0.00025996778,0.000048047947,0.00011131379,0.00018915441,0.0029911739,0.0023697815],"genre_scores_gemma":[0.9027572,0.00009322339,0.095316246,0.00014193235,0.000034045996,0.00015472222,0.00030706634,0.00028224062,0.0009133092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948218,0.0011281667,0.00040058178,0.0010607181,0.0017439793,0.0008446674],"domain_scores_gemma":[0.98111,0.012803762,0.0018315853,0.002634333,0.0013166007,0.0003038086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039151786,0.00087662885,0.0013072422,0.0011842377,0.0011498344,0.0036509477,0.003860942,0.0012445878,0.0032474818],"category_scores_gemma":[0.018016824,0.00084659836,0.0025941299,0.00095915364,0.004833415,0.0067281243,0.0028103308,0.0031337973,0.00043895663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005762305,0.00039320305,0.0038255514,0.00040807648,0.00025341028,0.0007240638,0.0008371952,0.43914643,0.03165434,0.491012,0.0011040006,0.030065496],"study_design_scores_gemma":[0.000073331554,0.000090067064,0.00017885858,0.000019981442,0.000067428686,0.00004852692,0.000060286387,0.7989248,0.030418592,0.1693656,0.000713471,0.00003906215],"about_ca_topic_score_codex":0.009989326,"about_ca_topic_score_gemma":0.008757016,"teacher_disagreement_score":0.009989326,"about_ca_system_score_codex":0.0037533003,"about_ca_system_score_gemma":0.0038700893,"threshold_uncertainty_score":0.02723223},"labels":[],"label_agreement":null},{"id":"W1990204174","doi":"10.1145/1352582.1352591","title":"Contextual modal type theory","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":263,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Science Foundation","keywords":"Sketch; Normal modal logic; Type theory; Accessibility relation; Modal logic; Modal; Multimodal logic; Categorical variable; Modal operator; Computer science; Logical framework; Algebra over a field; Mathematics; Type (biology); Calculus (dental); Theoretical computer science; Artificial intelligence; Algorithm; Programming language; Pure mathematics; Description logic","score_opus":0.04999189289866275,"score_gpt":0.2705926195485807,"score_spread":0.22060072664991798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990204174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013615959,0.0044956757,0.81697094,0.005194102,0.0006683318,0.00010374952,0.00092272466,0.0010111133,0.15701751],"genre_scores_gemma":[0.713999,0.0039145984,0.25735167,0.0026900794,0.0015716441,0.00027094976,0.00085077446,0.000267619,0.01908369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998271,0.00044606894,0.000097316326,0.0004394537,0.0005396434,0.0002064248],"domain_scores_gemma":[0.99876887,0.0004474041,0.000106913074,0.00030729466,0.00027161543,0.00009795647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019310206,0.00060713576,0.00075864076,0.001642858,0.002025982,0.004097399,0.0016388501,0.0015763186,0.011032331],"category_scores_gemma":[0.002993899,0.00052101415,0.0011218815,0.0020351375,0.0047844565,0.006691738,0.002725874,0.0033796837,0.0013181871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036130727,0.0000019453257,0.000033784454,0.000022560418,0.0000029574207,0.000012235557,0.000047898524,0.00018497556,0.00013672844,0.9967063,0.0005071326,0.002339875],"study_design_scores_gemma":[0.0000073660017,0.0000073872047,0.00009922419,0.000031798725,0.000013061426,0.00007044945,0.000045474917,0.0024977108,0.00035549325,0.9795259,0.017335963,0.000010181508],"about_ca_topic_score_codex":0.002477449,"about_ca_topic_score_gemma":0.0019657118,"teacher_disagreement_score":0.011032331,"about_ca_system_score_codex":0.0022757372,"about_ca_system_score_gemma":0.0011790926,"threshold_uncertainty_score":0.03690684},"labels":[],"label_agreement":null},{"id":"W2000222614","doi":"10.1145/371282.371388","title":"Logics capturing local properties","year":2001,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Locality; Mathematics; Characterization (materials science); Bounded function; Isomorphism (crystallography); Hierarchy; Expressive power; Discrete mathematics; Statement (logic); Pure mathematics; Theoretical computer science; Computer science; Linguistics","score_opus":0.06790359646617276,"score_gpt":0.25965123243288374,"score_spread":0.19174763596671096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000222614","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13727166,0.00066815916,0.81784797,0.0013127925,0.00008050692,0.00014397656,0.00051918655,0.0017563807,0.040399395],"genre_scores_gemma":[0.8508167,0.00027056923,0.1411841,0.0004950821,0.000103623635,0.00016154579,0.00035504083,0.0001481807,0.0064650276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976954,0.0006149486,0.00017457224,0.0005972386,0.00056051975,0.00035729792],"domain_scores_gemma":[0.9956084,0.002114292,0.00036438816,0.001135846,0.0005309381,0.00024625563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025594619,0.0005739669,0.00060632126,0.0015020545,0.0015764334,0.0026348813,0.0016199904,0.0010629497,0.0029285622],"category_scores_gemma":[0.0054312125,0.0006041382,0.001477101,0.0011061366,0.004513236,0.009289536,0.004078378,0.0025944752,0.0003948307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038143913,0.000026407914,0.0006709169,0.000082085455,0.000016089349,0.00018265565,0.00064419536,0.0029938046,0.0034075107,0.9775643,0.000583312,0.013790671],"study_design_scores_gemma":[0.000024149747,0.00004004079,0.00040352007,0.00003570136,0.000048889273,0.0003190831,0.00028851346,0.022184175,0.0059824525,0.96133894,0.009307149,0.000027492744],"about_ca_topic_score_codex":0.0018469398,"about_ca_topic_score_gemma":0.0024266648,"teacher_disagreement_score":0.0029285622,"about_ca_system_score_codex":0.0023779427,"about_ca_system_score_gemma":0.0011042394,"threshold_uncertainty_score":0.01725328},"labels":[],"label_agreement":null},{"id":"W2001560360","doi":"10.1145/2480759.2480766","title":"A Model-Theoretic Approach to Belief Change in Answer Set Programming","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund; Deutsche Forschungsgemeinschaft; Technische Universitat Wien","keywords":"Belief revision; Autoepistemic logic; Interpretation (philosophy); Zeroth-order logic; Logic programming; Stable model semantics; Non-monotonic logic; Answer set programming; Propositional calculus; Intermediate logic; Set (abstract data type); Circumscription; Mathematics; Semantics (computer science); Dynamic logic (digital electronics); Operator (biology); Computer science; Logic program; Abstract model theory; Default logic; Theoretical computer science; Discrete mathematics; Artificial intelligence; Multimodal logic; Programming language; Description logic","score_opus":0.06109427292373652,"score_gpt":0.28454418585789804,"score_spread":0.2234499129341615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001560360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005535049,0.00032309804,0.9876788,0.0018916972,0.000062574574,0.000049955976,0.000038762464,0.000116122435,0.004304032],"genre_scores_gemma":[0.4394409,0.00066714664,0.5522982,0.0012191514,0.0006492948,0.00046396148,0.00016065441,0.00013860376,0.0049620816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907403,0.0042187683,0.0003941997,0.0013842239,0.002583305,0.0006791102],"domain_scores_gemma":[0.9833408,0.011650545,0.001234889,0.002102823,0.0011533594,0.0005176094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009516712,0.00095056515,0.0011873398,0.0023637312,0.0016474137,0.0049061435,0.0045715114,0.0029874924,0.004758446],"category_scores_gemma":[0.02388286,0.0009191079,0.0033306822,0.002268821,0.006972685,0.010738009,0.0055350806,0.00741719,0.000509895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002511839,0.00005731235,0.00022370342,0.0000728384,0.000044375614,0.000064366825,0.00049655914,0.018746527,0.0007869315,0.9658424,0.00066958455,0.012970349],"study_design_scores_gemma":[0.000017256936,0.000049496706,0.000085394764,0.000028599161,0.000029473527,0.00005778088,0.00008958098,0.099339314,0.000750033,0.8961928,0.0033384145,0.000021921778],"about_ca_topic_score_codex":0.0014622193,"about_ca_topic_score_gemma":0.0012107175,"teacher_disagreement_score":0.009516712,"about_ca_system_score_codex":0.0038779317,"about_ca_system_score_gemma":0.0015216578,"threshold_uncertainty_score":0.050329804},"labels":[],"label_agreement":null},{"id":"W2013667259","doi":"10.1145/2362355.2362356","title":"Epistemic Strategies and Games on Concurrent Processes","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Agence Nationale de la Recherche","keywords":"Process calculus; Computer science; Semantics (computer science); Class (philosophy); Epistemic modal logic; Information flow; Process (computing); Scheduling (production processes); Theoretical computer science; Programming language; Artificial intelligence; Mathematics; Mathematical optimization","score_opus":0.03906599009138076,"score_gpt":0.2874935594328966,"score_spread":0.24842756934151586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013667259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016839847,0.00080388226,0.9502618,0.001514504,0.00017622359,0.00020326198,0.00013142542,0.00021025131,0.02985891],"genre_scores_gemma":[0.54563195,0.0014124722,0.4342209,0.00075841235,0.00044585418,0.001014414,0.00035029722,0.0001512515,0.016014474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613935,0.0016885285,0.00038945416,0.00048265906,0.0009012417,0.0003988191],"domain_scores_gemma":[0.99689746,0.0015554097,0.0003297364,0.0002893528,0.0005805486,0.0003474632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003299581,0.0013204664,0.0008212356,0.0017744479,0.0018753507,0.0035617,0.0019828,0.0019534754,0.0049025645],"category_scores_gemma":[0.006395047,0.0006491545,0.0020942509,0.0014933142,0.0047861417,0.008228063,0.002975652,0.003002948,0.0008629839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054039183,0.000010855575,0.000038747803,0.000016375214,0.000004833529,0.000042024694,0.00015359437,0.0025976906,0.00018247036,0.9954436,0.00012527007,0.0013792561],"study_design_scores_gemma":[0.000019153447,0.000018378245,0.000037982318,0.000019310335,0.000009767503,0.00005326205,0.000074579264,0.019576779,0.00029938412,0.9729171,0.006962938,0.000011467331],"about_ca_topic_score_codex":0.004663717,"about_ca_topic_score_gemma":0.003685045,"teacher_disagreement_score":0.0049025645,"about_ca_system_score_codex":0.0026241404,"about_ca_system_score_gemma":0.0024002325,"threshold_uncertainty_score":0.019039571},"labels":[],"label_agreement":null},{"id":"W2021405727","doi":"10.1145/505372.505375","title":"Abstract computability and algebraic specification","year":2002,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computable analysis; Computability; Computable function; Mathematics; Computable number; Bounded function; Algebra over a field; Algebraic number; Dimension of an algebraic variety; Isomorphism (crystallography); Discrete mathematics; Pure mathematics","score_opus":0.0547705234772416,"score_gpt":0.25926482882248475,"score_spread":0.20449430534524315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021405727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14477678,0.0009562142,0.81501496,0.0015921303,0.00012691057,0.00011561733,0.0005057507,0.00097555056,0.035936218],"genre_scores_gemma":[0.91864264,0.00049449946,0.07446375,0.0002674038,0.00007681741,0.00016301528,0.00054172653,0.0001349291,0.005215368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99526346,0.0012416214,0.0006085875,0.0008130058,0.0014813159,0.0005921177],"domain_scores_gemma":[0.99459887,0.0020381096,0.0004921004,0.0010751925,0.001539631,0.00025624962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023909106,0.0005624426,0.00067671196,0.0013045726,0.0010020966,0.0033906712,0.0011651291,0.000992406,0.0027313733],"category_scores_gemma":[0.0091101965,0.00038690196,0.0012565905,0.0014048156,0.007526838,0.009284429,0.0028980523,0.0024529009,0.00038819062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005886056,0.0000046531463,0.0001271664,0.000016736483,0.00000317978,0.000017707775,0.00011340439,0.0015477773,0.0003673796,0.9957942,0.00012981956,0.0018721696],"study_design_scores_gemma":[0.000014051088,0.000019597248,0.0001592597,0.000030095072,0.00001573452,0.0000865932,0.00015649259,0.019635297,0.0035674218,0.96895313,0.0073395865,0.000022651422],"about_ca_topic_score_codex":0.004357592,"about_ca_topic_score_gemma":0.0023485892,"teacher_disagreement_score":0.004357592,"about_ca_system_score_codex":0.003136575,"about_ca_system_score_gemma":0.002282422,"threshold_uncertainty_score":0.02275753},"labels":[],"label_agreement":null},{"id":"W2027450089","doi":"10.1145/937555.937557","title":"Variable independence for first-order definable constraints","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decidability; Quantifier elimination; Constraint (computer-aided design); Mathematics; Independence (probability theory); Time complexity; Variable (mathematics); Dimension (graph theory); Polynomial; Projection (relational algebra); Arity; Set (abstract data type); Algorithm; Computer science; Mathematical optimization; Discrete mathematics; Combinatorics","score_opus":0.024980196717759057,"score_gpt":0.25370818891009106,"score_spread":0.228727992192332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027450089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029403264,0.00020791884,0.95979714,0.0007948316,0.000036378122,0.00016491604,0.0007295917,0.00079670385,0.008069139],"genre_scores_gemma":[0.44549432,0.0008410464,0.5378852,0.00065423356,0.00036768644,0.0006830002,0.004020379,0.0005608913,0.009493295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99138314,0.0018554576,0.0006262065,0.0018146932,0.0032210704,0.001099445],"domain_scores_gemma":[0.9584879,0.033943634,0.0019640492,0.0038885854,0.0012553849,0.00046040505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059168693,0.00084548024,0.001190254,0.0017779396,0.0019840666,0.0043888805,0.0026264875,0.0013708188,0.0077644875],"category_scores_gemma":[0.029496253,0.0015081299,0.00449175,0.0028211435,0.003482979,0.0104693035,0.0034482006,0.007441396,0.00085938437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022142424,0.00020262103,0.0020114614,0.00037382255,0.00008783071,0.00036349834,0.0007719365,0.047309026,0.0036614009,0.8704905,0.0035774133,0.07092901],"study_design_scores_gemma":[0.000056139324,0.000045459066,0.00054268294,0.000054135136,0.00006195347,0.00030994494,0.00010102255,0.18685097,0.00667761,0.79882824,0.006432902,0.00003902109],"about_ca_topic_score_codex":0.0050631706,"about_ca_topic_score_gemma":0.008730722,"teacher_disagreement_score":0.0077644875,"about_ca_system_score_codex":0.0026581693,"about_ca_system_score_gemma":0.003099567,"threshold_uncertainty_score":0.031291723},"labels":[],"label_agreement":null},{"id":"W2032487621","doi":"10.1145/1970398.1970400","title":"Complexity of conservative constraint satisfaction problems","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Unary operation; Constraint satisfaction problem; Mathematics; Constraint satisfaction; Constraint (computer-aided design); Constraint logic programming; Set (abstract data type); Constraint programming; Time complexity; Complexity of constraint satisfaction; Mathematical proof; Constraint graph; Local consistency; Constraint satisfaction dual problem; Variable (mathematics); Discrete mathematics; Computer science; Mathematical optimization; Programming language","score_opus":0.16576442378401363,"score_gpt":0.32053909798757435,"score_spread":0.15477467420356072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032487621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3349656,0.0023194824,0.60311246,0.01176129,0.0001729506,0.0007171681,0.004504636,0.0013218585,0.041124586],"genre_scores_gemma":[0.8446661,0.0020024143,0.13244885,0.0011906174,0.00037606552,0.0007913965,0.005834777,0.0003841152,0.012305628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99461234,0.0013875639,0.0003995134,0.0010034388,0.0018475031,0.00074956106],"domain_scores_gemma":[0.975848,0.020016229,0.0013569169,0.0012322778,0.0009512145,0.0005953596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025389898,0.00089916104,0.0015336908,0.0011094623,0.0015916411,0.005028519,0.0024299105,0.001705794,0.007927727],"category_scores_gemma":[0.022341507,0.000780105,0.001836803,0.0024414198,0.0023188684,0.0077291396,0.0032858225,0.0036358363,0.00063872436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000494025,0.00036948652,0.004519505,0.001323546,0.00023223917,0.0008531238,0.0018003023,0.188233,0.0049057896,0.7187564,0.013575383,0.06493719],"study_design_scores_gemma":[0.00010121232,0.00003448502,0.00060933566,0.000043803855,0.00005270306,0.00027306174,0.0003338548,0.16747753,0.0012339813,0.82355076,0.0062622684,0.000027068092],"about_ca_topic_score_codex":0.0036186618,"about_ca_topic_score_gemma":0.00308851,"teacher_disagreement_score":0.007927727,"about_ca_system_score_codex":0.0025490932,"about_ca_system_score_gemma":0.0024126985,"threshold_uncertainty_score":0.026520848},"labels":[],"label_agreement":null},{"id":"W2042629502","doi":"10.1145/1342991.1342998","title":"A logic of nonmonotone inductive definitions","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Datalog; Iterated function; Higher-order logic; Inductive logic programming; Stable model semantics; Logic programming; Computational logic; Rotation formalisms in three dimensions; Computer science; Classical logic; Dynamic logic (digital electronics); Programming language; Semantics (computer science); Theoretical computer science; Mathematics; Multimodal logic; Description logic","score_opus":0.08719166760923303,"score_gpt":0.273118851588242,"score_spread":0.18592718397900898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042629502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011324658,0.0015907133,0.94641477,0.0017438715,0.00035343974,0.00011072814,0.00032720302,0.0004910365,0.03764359],"genre_scores_gemma":[0.32934847,0.0017655549,0.64274603,0.0021095648,0.0006457076,0.0003963103,0.00064302643,0.0002765907,0.02206877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971788,0.000726064,0.00030142782,0.0007428916,0.00082529854,0.00022544706],"domain_scores_gemma":[0.9973954,0.0013311914,0.00026676076,0.00035869554,0.0005224138,0.00012548795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003345286,0.0005769735,0.00049520377,0.0014272239,0.001355221,0.003299898,0.0016964807,0.0009289149,0.003161218],"category_scores_gemma":[0.0029592982,0.0005926506,0.0014034088,0.0013172708,0.0049695447,0.008527607,0.0024674477,0.0033831706,0.00086883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070237065,0.000008820647,0.00007718894,0.00004428789,0.0000060294024,0.000066558154,0.00021612691,0.00035229904,0.0006463289,0.9907799,0.0007141884,0.0070811547],"study_design_scores_gemma":[0.00001807261,0.000031755222,0.00015339539,0.00005293721,0.000028636516,0.00035807528,0.000103724524,0.0074180565,0.0034312147,0.91354156,0.07484045,0.000022081067],"about_ca_topic_score_codex":0.00066956994,"about_ca_topic_score_gemma":0.0007424937,"teacher_disagreement_score":0.003345286,"about_ca_system_score_codex":0.001684289,"about_ca_system_score_gemma":0.001352427,"threshold_uncertainty_score":0.017691731},"labels":[],"label_agreement":null},{"id":"W2044842674","doi":"10.1145/1227839.1227843","title":"Logical definability and query languages over ranked and unranked trees","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Unary operation; Tree automaton; Mathematics; Binary relation; Polynomial hierarchy; Tree (set theory); Discrete mathematics; Quantifier (linguistics); Satisfiability; Regular language; Theoretical computer science; Combinatorics; Computer science; Automaton; Time complexity; Artificial intelligence","score_opus":0.026347490715625234,"score_gpt":0.28644117574824435,"score_spread":0.2600936850326191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044842674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21191299,0.0010583126,0.76990956,0.001723736,0.000066617395,0.00020884581,0.0008121351,0.0009554107,0.013352374],"genre_scores_gemma":[0.7406166,0.0007494802,0.25080326,0.00045317016,0.00020272496,0.00031383414,0.0009773322,0.00021156894,0.005672079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944042,0.0014556691,0.0005742578,0.0010682258,0.0018203169,0.00067736715],"domain_scores_gemma":[0.98606837,0.010009023,0.001345111,0.0015068337,0.0006613639,0.00040927596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003734157,0.0006325687,0.0008393436,0.0012563386,0.0012802681,0.0053304476,0.0023062231,0.0014371454,0.0026078818],"category_scores_gemma":[0.011899268,0.00080397597,0.0020961452,0.0025297478,0.0046691056,0.014560867,0.00219266,0.002977135,0.0003461617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065651555,0.000068248526,0.00065722567,0.00010019702,0.000019366074,0.00018073947,0.00078500854,0.012500369,0.0023822407,0.9715025,0.00044246032,0.011295965],"study_design_scores_gemma":[0.000052338895,0.000059272115,0.00034942594,0.000032682885,0.00004707745,0.00027774784,0.00023923822,0.07511575,0.003471964,0.9147631,0.0055568325,0.000034516717],"about_ca_topic_score_codex":0.0043341434,"about_ca_topic_score_gemma":0.004383346,"teacher_disagreement_score":0.0053304476,"about_ca_system_score_codex":0.0032863065,"about_ca_system_score_gemma":0.0021024365,"threshold_uncertainty_score":0.023843884},"labels":[],"label_agreement":null},{"id":"W2056850725","doi":"10.1145/1119439.1119440","title":"Unfolding partiality and disjunctions in stable model semantics","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":142,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Partial evaluation; Computer science; Stable model semantics; Semantics (computer science); Modular design; Programming language; Program transformation; Model transformation; Theoretical computer science; Disjunctive normal form; Transformation (genetics); Stability (learning theory); Core (optical fiber); State (computer science); Operational semantics; Artificial intelligence","score_opus":0.028269337300304863,"score_gpt":0.2572350780560444,"score_spread":0.22896574075573953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056850725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012754971,0.0000575456,0.98442036,0.00010598083,0.000010398753,0.000035112396,0.000039957573,0.00071826536,0.0018575522],"genre_scores_gemma":[0.34541708,0.00024747654,0.6499996,0.00012709004,0.000040467225,0.0001434128,0.00029867387,0.00040739693,0.0033187382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978588,0.0006660138,0.00012456626,0.00042892754,0.00073628547,0.00018535732],"domain_scores_gemma":[0.99818283,0.00087471714,0.000116634175,0.0005039584,0.00025566758,0.00006612324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024042844,0.0006048529,0.0004608088,0.0008059588,0.0006994105,0.0015358252,0.0013351084,0.00049431715,0.0027849397],"category_scores_gemma":[0.0041578743,0.00076053943,0.0013881543,0.000840782,0.0029197298,0.0053434484,0.002856727,0.0018799145,0.0005054903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013401515,0.000063755404,0.0009847715,0.00017543115,0.000049814495,0.0001699348,0.0011710471,0.03692455,0.008593243,0.85286516,0.00089367846,0.09797457],"study_design_scores_gemma":[0.000034227865,0.00011504664,0.0002872513,0.000051531242,0.00006913487,0.00015361136,0.00023488299,0.20892295,0.019694505,0.7548564,0.015545986,0.000034616245],"about_ca_topic_score_codex":0.00197701,"about_ca_topic_score_gemma":0.00300512,"teacher_disagreement_score":0.0027849397,"about_ca_system_score_codex":0.0012030115,"about_ca_system_score_gemma":0.0010389725,"threshold_uncertainty_score":0.01271522},"labels":[],"label_agreement":null},{"id":"W2068047345","doi":"10.1145/1183278.1183285","title":"Kleene algebra with domain","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":173,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Kleene algebra; Kleene's recursion theorem; Axiom; Algebra over a field; Term algebra; Domain (mathematical analysis); Extension (predicate logic); Mathematics; Propositional calculus; Simple (philosophy); Equational logic; Process calculus; Two-element Boolean algebra; Computer science; Programming language; Pure mathematics; Algebra representation; Discrete mathematics; Rewriting","score_opus":0.01697811803986092,"score_gpt":0.23442776605644527,"score_spread":0.21744964801658434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068047345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012947505,0.002104037,0.8929951,0.0023610585,0.0006423894,0.00018255357,0.000595983,0.00070654147,0.08746471],"genre_scores_gemma":[0.45274127,0.003520748,0.5041023,0.0016246575,0.0010775924,0.00040966846,0.0011695074,0.00026707572,0.035087198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804014,0.00047463964,0.00017409213,0.00046637835,0.00062096043,0.00022385338],"domain_scores_gemma":[0.99862313,0.0003558792,0.000115084695,0.00036514524,0.0003718219,0.00016896265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022886144,0.0005336267,0.0007418554,0.001509295,0.0019724877,0.0037135864,0.0014497918,0.0011255726,0.007274304],"category_scores_gemma":[0.0030015935,0.00040719716,0.0017928495,0.0015903254,0.0036232325,0.01138982,0.0029986424,0.0034333935,0.002543844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005607806,0.0000066550224,0.00003679652,0.000017517368,0.0000029994933,0.000031674663,0.000048791,0.000376007,0.0002534552,0.9954391,0.00045063172,0.0033307783],"study_design_scores_gemma":[0.000009701294,0.0000145662,0.00003590768,0.00001791499,0.000009693396,0.00010855845,0.000034216588,0.0039408565,0.00076667225,0.9579887,0.03705803,0.000015093359],"about_ca_topic_score_codex":0.0014004356,"about_ca_topic_score_gemma":0.001374237,"teacher_disagreement_score":0.007274304,"about_ca_system_score_codex":0.001321145,"about_ca_system_score_gemma":0.0016167985,"threshold_uncertainty_score":0.024334967},"labels":[],"label_agreement":null},{"id":"W2071118378","doi":"10.1145/1055686.1055694","title":"Minimum model semantics for logic programs with negation-as-failure","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Negation; Mathematics; Uncountable set; Countable set; Zero (linguistics); Discrete mathematics; Truth value; Intersection (aeronautics); Stable model semantics; Negation as failure; Element (criminal law); Semantics (computer science); Computer science; Operational semantics; Programming language","score_opus":0.02990417311902534,"score_gpt":0.2711068560446593,"score_spread":0.24120268292563393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071118378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03558721,0.00023174867,0.9508844,0.0011157956,0.00005403341,0.0001075007,0.00029403958,0.00075320306,0.010972101],"genre_scores_gemma":[0.6873579,0.00029364444,0.3049319,0.00041012585,0.00011039278,0.0005895728,0.00068137905,0.00046145587,0.0051636295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984767,0.00034307956,0.00011562112,0.00026756138,0.0005750128,0.00022211591],"domain_scores_gemma":[0.9985592,0.00064556685,0.00018586492,0.00021999989,0.0002547693,0.00013466584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017661536,0.0007923537,0.0008704636,0.0013750402,0.0013933437,0.003432591,0.0023565535,0.001495493,0.003333531],"category_scores_gemma":[0.0029784746,0.0006133208,0.002349708,0.0012249844,0.00387922,0.008335372,0.003314878,0.003994444,0.000456528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000293845,0.000031844418,0.00017959962,0.000050687297,0.000014665982,0.0001060493,0.00048252454,0.0049748155,0.0014382796,0.9883631,0.00043904939,0.0038900753],"study_design_scores_gemma":[0.000030497065,0.000037318565,0.00008684657,0.000032977197,0.000021069753,0.000108273474,0.00014783246,0.040666856,0.0026803552,0.9513504,0.0048189214,0.000018749997],"about_ca_topic_score_codex":0.0020846624,"about_ca_topic_score_gemma":0.0022547708,"teacher_disagreement_score":0.003432591,"about_ca_system_score_codex":0.0028013359,"about_ca_system_score_gemma":0.0018145149,"threshold_uncertainty_score":0.020325184},"labels":[],"label_agreement":null},{"id":"W2087144687","doi":"10.1145/383779.383782","title":"Incremental execution of guarded theories","year":2001,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Nondeterministic algorithm; Prolog; Implementation; Programming language; Expressive power; Bounded function; Robot; Interpreter; Heuristics; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.02347817064120366,"score_gpt":0.26743130340983406,"score_spread":0.2439531327686304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087144687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092083804,0.00030501393,0.88526964,0.00046997526,0.000086989545,0.00016463679,0.00030042493,0.00795724,0.0133621935],"genre_scores_gemma":[0.6189023,0.00024630266,0.3764241,0.0001735668,0.00003869063,0.00015197061,0.00052840746,0.00051130384,0.0030232219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858,0.00050754735,0.00009144347,0.00020365664,0.00038597223,0.00023141677],"domain_scores_gemma":[0.99668187,0.002084857,0.00014050584,0.0006662543,0.00031579888,0.00011067499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017472793,0.0004469191,0.00040323715,0.000578923,0.0005750933,0.0013370138,0.0017401095,0.0005778595,0.0033733982],"category_scores_gemma":[0.007172005,0.00051233044,0.0010110547,0.00043129895,0.001891546,0.0025847503,0.002638485,0.0013360815,0.00040812948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006581912,0.00024109342,0.00546986,0.0006006999,0.00013370672,0.0012260156,0.0020144158,0.17758368,0.022862824,0.61015207,0.0050734445,0.17398396],"study_design_scores_gemma":[0.0001111155,0.00011545372,0.000582399,0.0000880083,0.000105418374,0.00013599324,0.00019286094,0.6274358,0.021021185,0.33703965,0.013129095,0.00004304044],"about_ca_topic_score_codex":0.003544871,"about_ca_topic_score_gemma":0.007553176,"teacher_disagreement_score":0.003544871,"about_ca_system_score_codex":0.0009912532,"about_ca_system_score_gemma":0.0015426265,"threshold_uncertainty_score":0.011285067},"labels":[],"label_agreement":null},{"id":"W2094663018","doi":"10.1145/1024922.1024924","title":"Abstract versus concrete computation on metric partial algebras","year":2004,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Nondeterministic algorithm; Computation; Converse; Equivalence (formal languages); Discrete mathematics; Countable set; Model of computation; Metric (unit); Algebra over a field; Pure mathematics; Algorithm","score_opus":0.049565025204491485,"score_gpt":0.2997099780135482,"score_spread":0.25014495280905674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094663018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093681335,0.0007390251,0.8711662,0.0013287542,0.00015124894,0.00006966451,0.00025924415,0.0006952404,0.031909253],"genre_scores_gemma":[0.8669272,0.00074296497,0.12063334,0.00036970156,0.00020835566,0.00015561662,0.000334689,0.0002153151,0.010412857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975994,0.0007847347,0.0001437524,0.00034318437,0.000870146,0.00025870375],"domain_scores_gemma":[0.9980094,0.0006960559,0.0002252386,0.00041862324,0.00041552243,0.00023519617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015007013,0.0006886379,0.0006758209,0.0008424095,0.0010474559,0.0033446215,0.0011155774,0.0010753558,0.0045689084],"category_scores_gemma":[0.0041317153,0.000364185,0.0015309601,0.001040206,0.0046126605,0.0096924715,0.0026891208,0.00271718,0.0007271681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006757753,0.000004682008,0.000043284217,0.000019877187,0.000003429938,0.000014991416,0.00006649708,0.0030220195,0.0003742072,0.9954,0.00011009805,0.00093436154],"study_design_scores_gemma":[0.0000073799406,0.000025247784,0.00006181766,0.000017945275,0.000008364083,0.000038322552,0.00005488563,0.042710308,0.0010855753,0.95267445,0.0032994987,0.000016344471],"about_ca_topic_score_codex":0.0017647898,"about_ca_topic_score_gemma":0.0010619906,"teacher_disagreement_score":0.0045689084,"about_ca_system_score_codex":0.0022804064,"about_ca_system_score_gemma":0.0014032024,"threshold_uncertainty_score":0.016545534},"labels":[],"label_agreement":null},{"id":"W2101814946","doi":"10.1145/2071368.2071369","title":"Robust Vacuity for Branching Temporal Logic","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Temporal logic; Bisimulation; Linear temporal logic; Atomic sentence; Theoretical computer science; Model checking; TRACE (psycholinguistics); Algorithm; Artificial intelligence; Linguistics; Philosophy","score_opus":0.14772062146454748,"score_gpt":0.3420534356106389,"score_spread":0.1943328141460914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101814946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041867223,0.0007565185,0.94027746,0.002352326,0.000076216085,0.00024030246,0.0003304723,0.0032534185,0.010846192],"genre_scores_gemma":[0.66296566,0.0008502139,0.3295902,0.001190078,0.00028492085,0.00034873397,0.0009333211,0.00043559066,0.0034013113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99154246,0.0018953049,0.00064503046,0.0016427796,0.0036703306,0.00060402503],"domain_scores_gemma":[0.97999805,0.013868509,0.001454474,0.0026529492,0.0016302377,0.0003956754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064924485,0.00083732326,0.001214874,0.0022891762,0.0016043978,0.0039148736,0.0022625378,0.001567117,0.003407867],"category_scores_gemma":[0.026581423,0.00090510154,0.0028816632,0.0022105195,0.005675228,0.0071893483,0.0040380256,0.007060933,0.0004777341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024028013,0.00009103791,0.0015343395,0.00039364534,0.00011519691,0.0004386149,0.00087855716,0.04344482,0.009325893,0.9018469,0.0024034653,0.03928721],"study_design_scores_gemma":[0.00003017305,0.000028445833,0.00018927759,0.000036805533,0.000034460907,0.00011610166,0.00006429678,0.13050264,0.0033869373,0.8633698,0.0022135908,0.000027547176],"about_ca_topic_score_codex":0.0044460385,"about_ca_topic_score_gemma":0.0027706062,"teacher_disagreement_score":0.0064924485,"about_ca_system_score_codex":0.0048979237,"about_ca_system_score_gemma":0.0018644016,"threshold_uncertainty_score":0.035537064},"labels":[],"label_agreement":null},{"id":"W2105146990","doi":"10.1145/1614431.1614437","title":"Higher-order term indexing using substitution trees","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Search engine indexing; Substitution (logic); Decidability; Computer science; Preorder; Term (time); Undecidable problem; Correctness; Order (exchange); Generalization; Lexicographical order; Rewriting; Set (abstract data type); Theoretical computer science; Mathematics; Algorithm; Discrete mathematics; Programming language; Combinatorics; Information retrieval","score_opus":0.05282286613692782,"score_gpt":0.29225385938640736,"score_spread":0.23943099324947953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105146990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009187983,0.00024736873,0.98265207,0.00014486232,0.00009648816,0.000107135114,0.00022691516,0.00266772,0.0046695014],"genre_scores_gemma":[0.101795115,0.00036855927,0.88899744,0.00017243707,0.00008062255,0.00013073097,0.00072441896,0.0009871729,0.0067435233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792886,0.00029522736,0.0003082238,0.00033731735,0.00089445896,0.00023586338],"domain_scores_gemma":[0.99760073,0.0006420825,0.00019044905,0.0009248334,0.0005421908,0.0000997416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014190881,0.00064206653,0.0010948277,0.0024052681,0.001130675,0.003060628,0.0022224688,0.0008978068,0.0067323577],"category_scores_gemma":[0.0037903087,0.0006285362,0.00177599,0.0041903723,0.0018554378,0.0063413787,0.0027019111,0.0018478339,0.004195236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018074771,0.0001309289,0.001234972,0.00037369845,0.00005997381,0.00033411966,0.0011134949,0.008895462,0.030088775,0.6862498,0.00640174,0.2649364],"study_design_scores_gemma":[0.00009544501,0.0002754042,0.0004450964,0.00013342936,0.0001392013,0.0010419936,0.0002925653,0.15402421,0.074339814,0.6422143,0.12683149,0.00016709573],"about_ca_topic_score_codex":0.0024488019,"about_ca_topic_score_gemma":0.0028039746,"teacher_disagreement_score":0.0067323577,"about_ca_system_score_codex":0.0012696824,"about_ca_system_score_gemma":0.0020492997,"threshold_uncertainty_score":0.022521913},"labels":[],"label_agreement":null},{"id":"W2108096932","doi":"10.1145/1740582.1740584","title":"On the completeness of compositional reasoning methods","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Completeness (order theory); Computer science; Concurrency; Reasoning system; Automated reasoning; Deductive reasoning; Component (thermodynamics); Model checking; Theoretical computer science; Qualitative reasoning; Programming language; Model-based reasoning; Artificial intelligence; Mathematics; Knowledge representation and reasoning","score_opus":0.05707745779628404,"score_gpt":0.361903936170222,"score_spread":0.30482647837393795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108096932","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009319447,0.00059942977,0.98051906,0.0012064184,0.000080755795,0.00021585029,0.00012654801,0.00055544666,0.0073770615],"genre_scores_gemma":[0.16324319,0.0012889332,0.82805794,0.00076114177,0.00042887495,0.00072655565,0.0006649739,0.0005870334,0.0042414274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96687496,0.012946725,0.002789128,0.003539787,0.012399701,0.0014497513],"domain_scores_gemma":[0.854274,0.109604605,0.0031794927,0.019795869,0.0120999385,0.0010461503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.036684036,0.0017022046,0.0021758077,0.0033474616,0.004019518,0.0048549357,0.003398327,0.0030563343,0.005026496],"category_scores_gemma":[0.09883411,0.0018456262,0.004858962,0.0016802097,0.011378603,0.018296639,0.008261238,0.00833887,0.0019021229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014424702,0.00013173933,0.0007115211,0.00048637434,0.00011689314,0.00020560081,0.0016597736,0.02445897,0.0023390763,0.91660595,0.0019061394,0.05123364],"study_design_scores_gemma":[0.00007173422,0.000051805728,0.00009832209,0.00012265707,0.00005442641,0.00009264516,0.000112648384,0.0681841,0.0039314833,0.9213177,0.0059257825,0.00003657984],"about_ca_topic_score_codex":0.0030836673,"about_ca_topic_score_gemma":0.0025981746,"teacher_disagreement_score":0.036684036,"about_ca_system_score_codex":0.0021742315,"about_ca_system_score_gemma":0.005206001,"threshold_uncertainty_score":0.19400603},"labels":[],"label_agreement":null},{"id":"W2112512535","doi":"10.1145/1183278.1183283","title":"The strength of replacement in weak arithmetic","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Bounded function; Discrete mathematics; Class (philosophy); Axiom; Combinatorics; Complexity class; Polynomial; Integer (computer science); Quantifier (linguistics); Quantifier elimination; P; Time complexity; Computer science","score_opus":0.02121284245199038,"score_gpt":0.25849239291829507,"score_spread":0.2372795504663047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112512535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21239434,0.0023524691,0.6196578,0.006577998,0.00065123424,0.00017778354,0.00067260285,0.0017385005,0.1557772],"genre_scores_gemma":[0.91491455,0.0005987988,0.07110613,0.0012625516,0.00039915464,0.0001693449,0.00035932928,0.0001860149,0.0110041825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99158055,0.0022013916,0.0008002331,0.0018625932,0.0026641043,0.00089109736],"domain_scores_gemma":[0.9880377,0.0062362663,0.0006808648,0.0029457023,0.0015679189,0.0005315354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059289862,0.00069846,0.0009807377,0.0020496265,0.0027906692,0.0054113255,0.0023407436,0.0019907563,0.004647048],"category_scores_gemma":[0.0119416835,0.0013410067,0.0023332138,0.0012862111,0.012877796,0.0123562645,0.008455612,0.0064027198,0.0010036735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041214782,0.000008597606,0.00052294304,0.00007886894,0.000018913533,0.00005163673,0.0003065296,0.0006899486,0.0010742812,0.99196965,0.00061474304,0.0046226275],"study_design_scores_gemma":[0.00003568919,0.00010788854,0.0005474772,0.000058466194,0.000053478983,0.00017004584,0.0002202965,0.007133517,0.0040474143,0.9736022,0.013984095,0.00003935929],"about_ca_topic_score_codex":0.0017843506,"about_ca_topic_score_gemma":0.0013227938,"teacher_disagreement_score":0.0059289862,"about_ca_system_score_codex":0.00267965,"about_ca_system_score_gemma":0.0017206954,"threshold_uncertainty_score":0.031355917},"labels":[],"label_agreement":null},{"id":"W2138769606","doi":"10.1145/2490818","title":"Algebra-coalgebra duality in brzozowski's minimization algorithm","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"semigroups and automata theory","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundação para a Ciência e a Tecnologia; Centre National de la Recherche Scientifique; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Agence Nationale de la Recherche","keywords":"Coalgebra; Duality (order theory); Mathematics; Automaton; Correctness; Algebra over a field; Reachability; Discrete mathematics; Computer science; Algorithm; Pure mathematics; Theoretical computer science","score_opus":0.016456805134547968,"score_gpt":0.2515546325590415,"score_spread":0.2350978274244935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138769606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010881068,0.00007986724,0.9825283,0.00023034154,0.00004433951,0.000050234627,0.00007707585,0.00056889997,0.005539757],"genre_scores_gemma":[0.1954401,0.0001745645,0.79287565,0.00021554234,0.000033865213,0.00025790447,0.00028734416,0.00048688048,0.010228092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933416,0.000115934934,0.00006109598,0.00019701009,0.0002048864,0.000086877386],"domain_scores_gemma":[0.9997185,0.00011693911,0.000015946523,0.00006222696,0.000068781424,0.00001764069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008469889,0.00044483342,0.0006271465,0.00063299236,0.00063162314,0.0012000683,0.002087863,0.0007569004,0.006072032],"category_scores_gemma":[0.0021041438,0.0004236725,0.0008213941,0.0006580192,0.001027244,0.0024903598,0.0017313698,0.0013406178,0.0013787518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014536509,0.00009975469,0.00052194245,0.00017346482,0.0000402713,0.00007342505,0.00028930936,0.04189232,0.010999367,0.8141315,0.0036891538,0.12794411],"study_design_scores_gemma":[0.00006286461,0.00006559878,0.00025453075,0.00003379571,0.000042345357,0.00009470932,0.00008795618,0.27254248,0.016845573,0.69582397,0.014110699,0.00003553551],"about_ca_topic_score_codex":0.002326424,"about_ca_topic_score_gemma":0.004450927,"teacher_disagreement_score":0.006072032,"about_ca_system_score_codex":0.0011368803,"about_ca_system_score_gemma":0.0014256353,"threshold_uncertainty_score":0.020313025},"labels":[],"label_agreement":null},{"id":"W2139289843","doi":"10.1145/2071368.2071375","title":"Reachability Problems in Piecewise FIFO Systems","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Critical Systems Labs","funders":"","keywords":"FIFO (computing and electronics); Piecewise; Reachability; Computer science; Limit (mathematics); Channel (broadcasting); Set (abstract data type); Regular language; Algorithm; Theoretical computer science; Mathematics; Computer network; Programming language","score_opus":0.07257438177833501,"score_gpt":0.31310532786628825,"score_spread":0.24053094608795322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139289843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32539842,0.0004785177,0.66919655,0.00041434675,0.000018785902,0.000101901394,0.00041656315,0.00084380875,0.00313122],"genre_scores_gemma":[0.8553316,0.00035237786,0.14100793,0.00009049673,0.000023475606,0.00016329058,0.0006007506,0.00013962536,0.0022904803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985808,0.00036253905,0.00012171915,0.00038336974,0.00034007285,0.00021139227],"domain_scores_gemma":[0.99263656,0.006326621,0.0004454763,0.00026333553,0.00020860981,0.000119331715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013149118,0.0005209625,0.0006422021,0.00091552,0.000993962,0.0014110093,0.0010780154,0.000829241,0.0018336716],"category_scores_gemma":[0.008596687,0.0005693592,0.0010461395,0.00087904616,0.0018751677,0.0037980154,0.0018098208,0.001176636,0.00014975257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042427657,0.000083748346,0.0034457832,0.0004768714,0.00008456811,0.0006620552,0.0013071778,0.70401835,0.01201949,0.23556888,0.0009678133,0.040940985],"study_design_scores_gemma":[0.000049284678,0.00005734334,0.0005353019,0.000044004504,0.000042020958,0.00018090293,0.00037337933,0.6556478,0.0055935928,0.336139,0.0013016865,0.00003560957],"about_ca_topic_score_codex":0.0038504773,"about_ca_topic_score_gemma":0.0023259171,"teacher_disagreement_score":0.0038504773,"about_ca_system_score_codex":0.0014202908,"about_ca_system_score_gemma":0.0010457634,"threshold_uncertainty_score":0.010304987},"labels":[],"label_agreement":null},{"id":"W2154595228","doi":"10.1145/1183278.1183279","title":"Domain-dependent knowledge in answer set planning","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Planner; Answer set programming; Correctness; Domain (mathematical analysis); Domain knowledge; Plan (archaeology); Logic programming; Set (abstract data type); Control (management); Semantics (computer science); Modular design; Programming language; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.02998419991651737,"score_gpt":0.2864637845921789,"score_spread":0.25647958467566156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154595228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017873432,0.00027488035,0.9740475,0.00048247422,0.000024789419,0.000089131805,0.000057494668,0.00035124324,0.006799094],"genre_scores_gemma":[0.5282831,0.00050656847,0.46685317,0.00028567453,0.00006932073,0.00024775043,0.00024018314,0.00013618538,0.0033780092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965714,0.0013764551,0.00020691758,0.00047605456,0.0010982715,0.00027076466],"domain_scores_gemma":[0.9896119,0.008502368,0.00039667834,0.0009090741,0.00040280216,0.00017712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044533177,0.0006044397,0.0005788234,0.00092985266,0.0009492981,0.0022002126,0.0019568084,0.0013590908,0.0028459541],"category_scores_gemma":[0.012714415,0.00072387425,0.0010192513,0.0009103588,0.0044026077,0.005283163,0.0027163248,0.0022169042,0.00038274043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027337053,0.00014764289,0.0011660412,0.0004646993,0.00006662851,0.0006588993,0.0013435509,0.31413892,0.006204916,0.5718476,0.0011560707,0.10253154],"study_design_scores_gemma":[0.000061165156,0.00008808933,0.00029764872,0.000085226726,0.000059502672,0.00019970007,0.000202702,0.44925818,0.009789603,0.5306237,0.0092938095,0.00004077879],"about_ca_topic_score_codex":0.003475498,"about_ca_topic_score_gemma":0.0038560356,"teacher_disagreement_score":0.0044533177,"about_ca_system_score_codex":0.0014403433,"about_ca_system_score_gemma":0.0017267072,"threshold_uncertainty_score":0.023551643},"labels":[],"label_agreement":null},{"id":"W2171572930","doi":"10.1145/2071368.2071377","title":"The Complexity of Proving the Discrete Jordan Curve Theorem","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Mathematics; Jordan curve theorem; Disjoint sets; Simple (philosophy); Context (archaeology); Discrete mathematics; Bounded function; Mathematical proof; Polynomial; Grid; Sequence (biology); Combinatorics; Mathematical analysis; Geometry","score_opus":0.05867429881197218,"score_gpt":0.2920372054230701,"score_spread":0.23336290661109793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171572930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20734468,0.0036237806,0.63496524,0.041086845,0.0009603303,0.0010492138,0.00464729,0.008185746,0.09813687],"genre_scores_gemma":[0.6780974,0.0028928178,0.28931478,0.0028976635,0.0012395984,0.0007997886,0.0060477424,0.0023753566,0.01633472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9755047,0.008309005,0.0013973064,0.0032243207,0.009287075,0.0022775817],"domain_scores_gemma":[0.82655334,0.14327598,0.0031161723,0.019018658,0.0063390746,0.0016967091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009366804,0.0013869188,0.0029434913,0.0020121157,0.0040618344,0.0087712575,0.0068002464,0.0027750507,0.030597676],"category_scores_gemma":[0.0703525,0.0021642582,0.005157184,0.0031194314,0.0064499355,0.029258218,0.008470449,0.009328891,0.0047703707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021096645,0.0006336494,0.0057854247,0.0036455712,0.0007883473,0.0014194826,0.002115147,0.073765576,0.013146524,0.6236303,0.044667326,0.22829305],"study_design_scores_gemma":[0.0002535169,0.00008428739,0.0010879161,0.00015544439,0.00020423604,0.000328125,0.0005462703,0.109179355,0.0065285917,0.87086636,0.010678964,0.00008690625],"about_ca_topic_score_codex":0.004276708,"about_ca_topic_score_gemma":0.004709749,"teacher_disagreement_score":0.030597676,"about_ca_system_score_codex":0.006292156,"about_ca_system_score_gemma":0.0064114593,"threshold_uncertainty_score":0.10235947},"labels":[],"label_agreement":null},{"id":"W2177400022","doi":"10.1145/507382.507387","title":"Resource-bounded continuity and sequentiality for type-two functionals","year":2002,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Bounded function; Type (biology); Mathematics; Resource (disambiguation); Computer science; Mathematical analysis","score_opus":0.09452582875744181,"score_gpt":0.3083196057574211,"score_spread":0.2137937769999793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177400022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0763561,0.00017579117,0.90962666,0.000497871,0.000069972455,0.00012727684,0.00018755162,0.00047145213,0.012487271],"genre_scores_gemma":[0.8078091,0.00025101996,0.18367295,0.0002852423,0.00009430356,0.00046312384,0.00029424162,0.00021164445,0.0069183526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99641114,0.0007227745,0.00032997617,0.0008771582,0.0010727139,0.00058621215],"domain_scores_gemma":[0.989076,0.0058687944,0.0007846019,0.0025088782,0.0011600703,0.0006016153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003273569,0.0007225815,0.00087960577,0.0009720062,0.0011641181,0.0028700407,0.0018824959,0.0013137113,0.0050808634],"category_scores_gemma":[0.013044951,0.00073581544,0.0017457795,0.0010186096,0.005151831,0.008129041,0.0037271916,0.0037260302,0.0005592507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009096279,0.000046097746,0.0007722464,0.00008209877,0.00002263686,0.00034704703,0.00038267177,0.015848013,0.0031990658,0.9705694,0.00031092056,0.008328839],"study_design_scores_gemma":[0.000046849138,0.00010806086,0.00039852047,0.000051027208,0.000041313637,0.00041171827,0.00011918934,0.14531451,0.009617941,0.8376412,0.0062057455,0.00004391619],"about_ca_topic_score_codex":0.0016358497,"about_ca_topic_score_gemma":0.0008139284,"teacher_disagreement_score":0.0050808634,"about_ca_system_score_codex":0.0015388062,"about_ca_system_score_gemma":0.001767315,"threshold_uncertainty_score":0.017312467},"labels":[],"label_agreement":null},{"id":"W2231494278","doi":"10.1145/2835490","title":"Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Seventh Framework Programme; York University; National Science Foundation","keywords":"Separation logic; Conjunction (astronomy); Computer science; Assertion; Fragment (logic); Counterexample; Programming language; Mathematics; Discrete mathematics","score_opus":0.03283917579971757,"score_gpt":0.2840790779650231,"score_spread":0.2512399021653055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2231494278","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24963985,0.001143008,0.6957758,0.0053654076,0.00018534456,0.00012154697,0.001120439,0.0026091104,0.04403944],"genre_scores_gemma":[0.8638516,0.00059504993,0.12373767,0.0011886667,0.00019197997,0.00014079553,0.0010497503,0.00038709005,0.008857492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937635,0.0014073742,0.00049758016,0.0011168425,0.0023713761,0.0008434663],"domain_scores_gemma":[0.9825231,0.012153383,0.0008304474,0.0022989933,0.0017589711,0.00043519016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050274264,0.0007548961,0.0009688253,0.0013358371,0.0020772715,0.004958284,0.00248402,0.0014436934,0.0030879886],"category_scores_gemma":[0.012464047,0.0012812909,0.0022776157,0.001087011,0.005936337,0.010749675,0.005011195,0.006608706,0.00057377544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002679461,0.00011436641,0.0011953107,0.00031946637,0.00008202478,0.00030538047,0.0014491794,0.013213432,0.009188666,0.9494648,0.0021784601,0.022220993],"study_design_scores_gemma":[0.00007280689,0.000044516444,0.0003233895,0.00005183121,0.000076148164,0.00021815099,0.00020790004,0.040462017,0.012439219,0.9382863,0.0077671465,0.000050612827],"about_ca_topic_score_codex":0.0034654865,"about_ca_topic_score_gemma":0.003193887,"teacher_disagreement_score":0.0050274264,"about_ca_system_score_codex":0.002418935,"about_ca_system_score_gemma":0.0036477179,"threshold_uncertainty_score":0.026587903},"labels":[],"label_agreement":null},{"id":"W2615306226","doi":"10.1145/3091119","title":"Progression of Decomposed Local-Effect Action Theories","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Situation calculus; Forgetting; Action (physics); Bridging (networking); Computer science; Representation (politics); Decomposition; Subject (documents); Modularity (biology); Belief revision; Theory; Mathematics; Artificial intelligence; Cognitive science; Theoretical computer science; Cognitive psychology; Psychology","score_opus":0.03292469093502936,"score_gpt":0.33700050771135626,"score_spread":0.3040758167763269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615306226","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08955528,0.000598746,0.881891,0.0008356545,0.0000836735,0.00024608214,0.0002698076,0.0008733118,0.025646528],"genre_scores_gemma":[0.70348555,0.000759091,0.2833981,0.0002467577,0.00010541057,0.0002820481,0.0006504616,0.00025651153,0.010816114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968869,0.00081820786,0.00022157644,0.00062430475,0.0011099149,0.0003389969],"domain_scores_gemma":[0.9953318,0.0021694507,0.0003948801,0.000991498,0.00077314844,0.00033917866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004760404,0.00086222193,0.0006592171,0.0026927076,0.0014696304,0.0031084556,0.0017570674,0.0012502255,0.006941405],"category_scores_gemma":[0.010036883,0.0007437645,0.0027596701,0.0012094617,0.005925677,0.010029295,0.0047353394,0.003879113,0.00081180944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061212144,0.000027405855,0.00063343276,0.00010351398,0.000028736378,0.00042540938,0.0016738332,0.008412669,0.0020978693,0.9734995,0.00033408316,0.012702287],"study_design_scores_gemma":[0.000031696673,0.00004975594,0.00026206675,0.000055783137,0.00004161072,0.00015624221,0.00021209117,0.026993152,0.0017629409,0.96540105,0.0050102468,0.000023421506],"about_ca_topic_score_codex":0.0031289852,"about_ca_topic_score_gemma":0.002798,"teacher_disagreement_score":0.006941405,"about_ca_system_score_codex":0.0024950325,"about_ca_system_score_gemma":0.0016402698,"threshold_uncertainty_score":0.02517569},"labels":[],"label_agreement":null},{"id":"W2745248131","doi":"10.1145/3105908","title":"The Logical View on Continuous Petri Nets","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Petri net; Decidability; Reachability; Reachability problem; Stochastic Petri net; Computer science; Process architecture; Theoretical computer science; Mathematics; Algorithm; Discrete mathematics","score_opus":0.0655201784738755,"score_gpt":0.3138251653201195,"score_spread":0.248304986846244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745248131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061377115,0.0014610982,0.97474074,0.0018820637,0.00021148474,0.00006049699,0.0002890378,0.00027468096,0.014942773],"genre_scores_gemma":[0.35206878,0.0047832304,0.62879336,0.001680774,0.0013312036,0.00062279037,0.00080521073,0.0002728034,0.009641833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996855,0.0010475407,0.00024282472,0.0006830788,0.00089071953,0.00028093983],"domain_scores_gemma":[0.99420446,0.0040894034,0.00042509302,0.00063682586,0.0004033938,0.00024081518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003068823,0.0013453342,0.00071975036,0.0019119696,0.0014084881,0.0053391345,0.002366088,0.0015155171,0.005359566],"category_scores_gemma":[0.0071479646,0.0008780705,0.0023049815,0.0019134943,0.010397304,0.008439112,0.002449043,0.0054733483,0.000919509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019243978,0.000012839195,0.00010989369,0.00011124265,0.000009838954,0.000106428444,0.00010959562,0.010629862,0.0007972582,0.9826151,0.00041775414,0.0050607948],"study_design_scores_gemma":[0.000018777282,0.000030547297,0.00008109106,0.000060181817,0.00001720834,0.00009592505,0.00006257793,0.035943445,0.0011067493,0.9509139,0.011654929,0.000014646638],"about_ca_topic_score_codex":0.002614333,"about_ca_topic_score_gemma":0.0018864233,"teacher_disagreement_score":0.005359566,"about_ca_system_score_codex":0.00330327,"about_ca_system_score_gemma":0.0018382339,"threshold_uncertainty_score":0.023967028},"labels":[],"label_agreement":null},{"id":"W2913482449","doi":"10.1145/3568025","title":"Canonisation and Definability for Graphs of Bounded Rank Width","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bounded function; Mathematics; Rank (graph theory); Treewidth; Discrete mathematics; Combinatorics; Pathwidth; Graph; Mathematical analysis","score_opus":0.042091926921377934,"score_gpt":0.3101518114053621,"score_spread":0.26805988448398416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913482449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6174412,0.0003936802,0.34016368,0.0022745093,0.000115520284,0.00019817802,0.0011534311,0.003147484,0.035112314],"genre_scores_gemma":[0.93529755,0.00020357591,0.054382,0.00048466463,0.0000942189,0.00011385732,0.0019783664,0.00036523645,0.0070804222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711776,0.00050165027,0.00013721368,0.0010260794,0.0006132401,0.0006040921],"domain_scores_gemma":[0.98990214,0.006627817,0.00073424313,0.0017241368,0.00051235897,0.00049923407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016148722,0.00082206825,0.0008349753,0.0013653666,0.0012714862,0.0032919357,0.0019872086,0.0010072456,0.01003496],"category_scores_gemma":[0.01185345,0.00059898925,0.00228318,0.0013123369,0.0033635327,0.008073947,0.0031523637,0.0034230344,0.00068540155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052256905,0.00043085316,0.004679468,0.0004026866,0.000086109874,0.00032930117,0.0013040757,0.022665318,0.010297889,0.89784425,0.004669769,0.05676777],"study_design_scores_gemma":[0.000095624906,0.00013617935,0.0015208415,0.00004515153,0.00011025069,0.00021936718,0.0003549066,0.061992515,0.013033259,0.91696066,0.005470875,0.00006041107],"about_ca_topic_score_codex":0.003788721,"about_ca_topic_score_gemma":0.0041170046,"teacher_disagreement_score":0.01003496,"about_ca_system_score_codex":0.0027738751,"about_ca_system_score_gemma":0.0016165469,"threshold_uncertainty_score":0.03357023},"labels":[],"label_agreement":null},{"id":"W2953082263","doi":"10.1145/1166109.1166110","title":"Domain-dependent knowledge in answer set planning","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Planner; Computer science; Answer set programming; Correctness; Domain (mathematical analysis); Domain knowledge; Plan (archaeology); Logic programming; Set (abstract data type); Control (management); Semantics (computer science); Modular design; Artificial intelligence; Programming language; Theoretical computer science; Mathematics","score_opus":0.02998419991651737,"score_gpt":0.2864637845921789,"score_spread":0.25647958467566156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953082263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017873432,0.00027488035,0.9740475,0.00048247422,0.000024789419,0.000089131805,0.000057494668,0.00035124324,0.006799094],"genre_scores_gemma":[0.5282831,0.00050656847,0.46685317,0.00028567453,0.00006932073,0.00024775043,0.00024018314,0.00013618538,0.0033780092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965714,0.0013764551,0.00020691758,0.00047605456,0.0010982715,0.00027076466],"domain_scores_gemma":[0.9896119,0.008502368,0.00039667834,0.0009090741,0.00040280216,0.00017712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044533177,0.0006044397,0.0005788234,0.00092985266,0.0009492981,0.0022002126,0.0019568084,0.0013590908,0.0028459541],"category_scores_gemma":[0.012714415,0.00072387425,0.0010192513,0.0009103588,0.0044026077,0.005283163,0.0027163248,0.0022169042,0.00038274043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027337053,0.00014764289,0.0011660412,0.0004646993,0.00006662851,0.0006588993,0.0013435509,0.31413892,0.006204916,0.5718476,0.0011560707,0.10253154],"study_design_scores_gemma":[0.000061165156,0.00008808933,0.00029764872,0.000085226726,0.000059502672,0.00019970007,0.000202702,0.44925818,0.009789603,0.5306237,0.0092938095,0.00004077879],"about_ca_topic_score_codex":0.003475498,"about_ca_topic_score_gemma":0.0038560356,"teacher_disagreement_score":0.0044533177,"about_ca_system_score_codex":0.0014403433,"about_ca_system_score_gemma":0.0017267072,"threshold_uncertainty_score":0.023551643},"labels":[],"label_agreement":null},{"id":"W2966293955","doi":"10.1145/3329121","title":"A Representation Theorem for Change through Composition of Activities","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Interoperation; Rotation formalisms in three dimensions; Computer science; Domain (mathematical analysis); Theoretical computer science; Representation (politics); Class (philosophy); Information system; Process calculus; Canonical form; Process (computing); Mathematics; Programming language; Artificial intelligence; Interoperability; Pure mathematics","score_opus":0.08042164214727479,"score_gpt":0.32501280596151305,"score_spread":0.24459116381423826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966293955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0098391725,0.0005068558,0.95004535,0.0015273917,0.00016400161,0.00010542008,0.00026933363,0.00059626513,0.03694623],"genre_scores_gemma":[0.41040587,0.0012553202,0.5580473,0.00099931,0.00044113875,0.00069446483,0.0012468882,0.00046043002,0.026449345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957504,0.00091580674,0.0004176172,0.0013518814,0.0010187812,0.00054538815],"domain_scores_gemma":[0.99634403,0.0017713108,0.00033723595,0.00063741225,0.0007182637,0.00019180539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034377738,0.0008636955,0.0007126073,0.0022437305,0.0024048232,0.004479364,0.0018288984,0.0020391673,0.010308056],"category_scores_gemma":[0.007589794,0.0006645645,0.0036030228,0.0022475799,0.006174745,0.015546524,0.0039718244,0.0046106027,0.0019029931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008678211,0.0000076060956,0.00009188936,0.00002656609,0.000006859598,0.00006710848,0.00028536597,0.0011429203,0.00027841303,0.9922496,0.0005529216,0.0052822046],"study_design_scores_gemma":[0.00002199481,0.000015446854,0.00007767066,0.000029937399,0.000020994083,0.00017822723,0.000115473405,0.016286442,0.00078387454,0.96201795,0.020436386,0.00001554971],"about_ca_topic_score_codex":0.005678108,"about_ca_topic_score_gemma":0.0028017543,"teacher_disagreement_score":0.010308056,"about_ca_system_score_codex":0.0030356292,"about_ca_system_score_gemma":0.0017391341,"threshold_uncertainty_score":0.03448391},"labels":[],"label_agreement":null},{"id":"W3100307655","doi":"10.1145/1507244.1507252","title":"Differential recursion","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Japan Society for the Promotion of Science","keywords":"Recursion (computer science); Mathematics; Algebra over a field; Computable function; μ operator; Primitive recursive function; Computation; Class (philosophy); Differential (mechanical device); Computability theory; Algebraic number; Discrete mathematics; Computer science; Pure mathematics; Algorithm; Recursive functions","score_opus":0.026435018129861626,"score_gpt":0.27410203973081015,"score_spread":0.24766702160094853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100307655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016885366,0.0033717528,0.72807544,0.0037088238,0.0009172006,0.000054439595,0.00024554034,0.00034467573,0.2463968],"genre_scores_gemma":[0.7160951,0.0044341097,0.20241323,0.0026571734,0.0012069419,0.00019121906,0.0002778453,0.00029581416,0.072428495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991504,0.00017685627,0.000036961123,0.00019771085,0.00032531883,0.00011277629],"domain_scores_gemma":[0.99917054,0.0003084781,0.000060699225,0.0002107821,0.0001694,0.00008005088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008916049,0.00041602246,0.0005072037,0.0009862995,0.0012904733,0.0022221326,0.0011235378,0.00087993365,0.008068248],"category_scores_gemma":[0.002741556,0.00021551191,0.0008686789,0.00086472236,0.0037526924,0.004537167,0.0022619565,0.002295791,0.001599899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012763146,0.0000016153712,0.00001822437,0.000004713291,6.45832e-7,0.000008685189,0.00003210333,0.00017510609,0.000093366136,0.9969637,0.00037392834,0.0023265816],"study_design_scores_gemma":[0.0000029244848,0.000007488202,0.00003379914,0.000009251229,0.000003450032,0.00007323348,0.00001737387,0.0044922833,0.00037119098,0.9614223,0.03356116,0.000005506215],"about_ca_topic_score_codex":0.0010587208,"about_ca_topic_score_gemma":0.0010201401,"teacher_disagreement_score":0.008068248,"about_ca_system_score_codex":0.0019978723,"about_ca_system_score_gemma":0.0007397936,"threshold_uncertainty_score":0.02699095},"labels":[],"label_agreement":null},{"id":"W3123946441","doi":"10.1145/3558549","title":"Continuous One-counter Automata","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Vlaamse regering; Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek","keywords":"Reachability; Decidability; Upper and lower bounds; Reachability problem; Automaton; Mathematics; Discrete mathematics; Combinatorics; Counterexample; Parametric statistics; Computer science; Theoretical computer science","score_opus":0.05042667329219194,"score_gpt":0.29836543458208986,"score_spread":0.24793876128989792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123946441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12306675,0.0011130363,0.8475457,0.0009777687,0.00020845828,0.0002672709,0.00068803737,0.0016044675,0.024528531],"genre_scores_gemma":[0.83324844,0.0004965217,0.15792696,0.00027820302,0.000097504606,0.00031546576,0.00058111193,0.00012620525,0.00692951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797887,0.0003926036,0.00013235601,0.00073273695,0.00047866078,0.00028479533],"domain_scores_gemma":[0.99044997,0.006714375,0.00082517683,0.0008857205,0.00068042596,0.00044427902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001216676,0.0009239536,0.0008562,0.0007883992,0.0009845528,0.0025304083,0.0026737766,0.0016465341,0.005112284],"category_scores_gemma":[0.0074383677,0.00040882104,0.0010704349,0.0011018268,0.0032312125,0.003375151,0.0016834876,0.0024032772,0.000593384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039544195,0.00019627277,0.0025933892,0.00053203193,0.00007226796,0.0010574958,0.0006016541,0.18869936,0.012673,0.756767,0.0025776366,0.03383448],"study_design_scores_gemma":[0.00009603148,0.00015431477,0.00040543158,0.000074291645,0.0000676255,0.00040875797,0.00015898353,0.5957718,0.008750703,0.38615236,0.007897545,0.00006219707],"about_ca_topic_score_codex":0.0032328565,"about_ca_topic_score_gemma":0.0021243272,"teacher_disagreement_score":0.005112284,"about_ca_system_score_codex":0.0019025982,"about_ca_system_score_gemma":0.0014881436,"threshold_uncertainty_score":0.017102301},"labels":[],"label_agreement":null},{"id":"W3155570673","doi":"10.1145/3508069","title":"QCSP on Reflexive Tournaments","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja; European Commission","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Tournament; Constraint satisfaction problem; Reflexivity; Discrete mathematics; Graph; Statistics","score_opus":0.05988162739378244,"score_gpt":0.34701124063691474,"score_spread":0.2871296132431323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155570673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3262964,0.0006706819,0.62558603,0.0048560877,0.00022495323,0.0004271338,0.002722007,0.0011545555,0.03806204],"genre_scores_gemma":[0.84328645,0.00052973174,0.14048412,0.0011352577,0.00027485006,0.00042426438,0.0028272886,0.00025945238,0.010778542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705815,0.0006990492,0.00019877675,0.0007715851,0.00071352907,0.0005589531],"domain_scores_gemma":[0.99242413,0.0048259157,0.0006858542,0.0008499904,0.00064862455,0.00056542084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001728993,0.0008543688,0.000961851,0.0008406655,0.0014844638,0.0036595697,0.0021405923,0.0012950284,0.010418357],"category_scores_gemma":[0.007821896,0.0004962601,0.0019964287,0.0020573363,0.0020543584,0.0055141095,0.0030827865,0.003812733,0.0006129596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050239865,0.00030571158,0.0018719097,0.0005046532,0.00018016253,0.00047290197,0.00060060446,0.087824516,0.007209492,0.8459517,0.008412216,0.046163872],"study_design_scores_gemma":[0.0001331335,0.0000975019,0.00062610174,0.000040319464,0.000057182733,0.00017287956,0.00012622739,0.2443513,0.0023725703,0.7464319,0.005554535,0.000036295976],"about_ca_topic_score_codex":0.0044807764,"about_ca_topic_score_gemma":0.003380318,"teacher_disagreement_score":0.010418357,"about_ca_system_score_codex":0.002027474,"about_ca_system_score_gemma":0.001364063,"threshold_uncertainty_score":0.034852862},"labels":[],"label_agreement":null},{"id":"W4297986018","doi":"10.1145/1166109.1166114","title":"The strength of replacement in weak arithmetic","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Class (philosophy); Bounded function; Discrete mathematics; Complexity class; Quantifier (linguistics); Axiom; Integer (computer science); Polynomial; Combinatorics; Time complexity; Computer science","score_opus":0.015527304787196765,"score_gpt":0.25024992507927163,"score_spread":0.23472262029207486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297986018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23600431,0.001898103,0.623687,0.0058343094,0.0005299185,0.00018987349,0.00062272855,0.0016811828,0.12955254],"genre_scores_gemma":[0.91835326,0.00050843664,0.07029548,0.0009943462,0.0003355207,0.00016545733,0.00032902826,0.00018053298,0.008837947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99068135,0.002325629,0.0009056556,0.0021668244,0.0028784587,0.0010420951],"domain_scores_gemma":[0.98473537,0.008179987,0.0009004677,0.0037379435,0.0018057611,0.00064037717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071582696,0.0006845222,0.0010488473,0.0021845635,0.002833353,0.0055990824,0.0025188494,0.0019540119,0.0049626497],"category_scores_gemma":[0.014590043,0.0013365861,0.0023913702,0.0014806392,0.013201368,0.014477458,0.008820851,0.006022831,0.0010180547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057283138,0.000011119626,0.00067246327,0.00009055979,0.000021559947,0.00006220938,0.00034311,0.0008549806,0.0012271691,0.9904997,0.00059547607,0.005564373],"study_design_scores_gemma":[0.00004528096,0.00012470038,0.0006094588,0.000060565933,0.000070864684,0.00021831898,0.00025968064,0.009006488,0.004996988,0.97099364,0.013568844,0.00004521714],"about_ca_topic_score_codex":0.0021743805,"about_ca_topic_score_gemma":0.0015082698,"teacher_disagreement_score":0.0071582696,"about_ca_system_score_codex":0.0027375487,"about_ca_system_score_gemma":0.0018825255,"threshold_uncertainty_score":0.037856996},"labels":[],"label_agreement":null},{"id":"W4297999774","doi":"10.1145/3565364","title":"Reducible Theories and Amalgamations of Models","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ontology; Computer science; Representation (politics); Suggested Upper Merged Ontology; Process ontology; Knowledge representation and reasoning; Upper ontology; Isomorphism (crystallography); Description logic; Ontology alignment; Theoretical computer science; Artificial intelligence; Epistemology; Domain knowledge","score_opus":0.03793682739011632,"score_gpt":0.26327203496522833,"score_spread":0.225335207575112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297999774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09837732,0.0033707167,0.7922603,0.0056855464,0.00041667573,0.0002952879,0.00075666764,0.00086703,0.09797045],"genre_scores_gemma":[0.7451634,0.0015754937,0.23841399,0.0010763363,0.0003570928,0.0005791387,0.0014741553,0.0002578994,0.0111025665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99135137,0.0030408872,0.0007923926,0.0014465008,0.0026129526,0.00075589],"domain_scores_gemma":[0.9930797,0.0031372346,0.0004573885,0.002446503,0.00065393717,0.00022517197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004941569,0.0010616325,0.0012608543,0.0038883071,0.00279765,0.0056896578,0.002650565,0.002082955,0.003924937],"category_scores_gemma":[0.011406686,0.001025142,0.0049670786,0.002380735,0.01238295,0.011959801,0.006541632,0.006940958,0.0006501026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039599117,0.0000058350493,0.00004392389,0.000016038637,0.000010000111,0.000038889997,0.00025000662,0.0009766641,0.0000617239,0.99720806,0.00022166177,0.0011632575],"study_design_scores_gemma":[0.0000048972533,0.0000035638168,0.000018683344,0.000012580913,0.000006145626,0.00002665679,0.00006929547,0.002316583,0.000105439205,0.9957379,0.0016942407,0.0000039664237],"about_ca_topic_score_codex":0.00379091,"about_ca_topic_score_gemma":0.0026603346,"teacher_disagreement_score":0.0056896578,"about_ca_system_score_codex":0.0047646826,"about_ca_system_score_gemma":0.0014602774,"threshold_uncertainty_score":0.034570277},"labels":[],"label_agreement":null},{"id":"W4298334981","doi":"10.1145/3545115","title":"A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Type theory; Type (biology); Syntax; Simple (philosophy); Mathematics; Abstract syntax; Semantics (computer science); Class (philosophy); Categorical variable; Modal; Function (biology); Context (archaeology); Category theory; Space (punctuation); Theoretical computer science; Computer science; Pure mathematics; Artificial intelligence; Programming language","score_opus":0.03040894846688633,"score_gpt":0.26945061988882885,"score_spread":0.23904167142194252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298334981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02546966,0.0017600479,0.9109548,0.002458045,0.0004527109,0.000085508786,0.0005673212,0.00077829516,0.057473674],"genre_scores_gemma":[0.67883193,0.0016286186,0.29496548,0.002182858,0.0007046411,0.00042609355,0.0006231459,0.0005857108,0.020051492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801743,0.0005467554,0.00009647723,0.0004802117,0.0005325965,0.00032641971],"domain_scores_gemma":[0.9979505,0.00058437977,0.00015150779,0.00062462495,0.00042392444,0.0002650861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018908845,0.00073838915,0.000753262,0.0025380333,0.0020338285,0.0052012,0.002451957,0.0017749412,0.0074474523],"category_scores_gemma":[0.0033119707,0.00080334843,0.0013316637,0.0021751628,0.009051675,0.011930649,0.0046500973,0.0038980576,0.0009919372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065105783,0.000003402051,0.000092235,0.000017315888,0.0000027851202,0.000031693628,0.00027050928,0.0003175216,0.00024086318,0.99711007,0.00029060742,0.0016164692],"study_design_scores_gemma":[0.00000924315,0.000018592642,0.00020132055,0.00003914735,0.000016598067,0.000119199554,0.00025390318,0.00341779,0.0007192548,0.9607184,0.03446542,0.000021136262],"about_ca_topic_score_codex":0.0059667625,"about_ca_topic_score_gemma":0.004070283,"teacher_disagreement_score":0.0074474523,"about_ca_system_score_codex":0.0029159328,"about_ca_system_score_gemma":0.0013369565,"threshold_uncertainty_score":0.024914205},"labels":[],"label_agreement":null},{"id":"W4384407481","doi":"10.1145/3604553","title":"Inputs, Outputs, and Composition in the Logic of Information Flows","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Bijzonder Onderzoeksfonds UGent; Vlaamse regering; Natural Sciences and Engineering Research Council of Canada; Fonds Wetenschappelijk Onderzoek; National Natural Science Foundation of China","keywords":"Expressive power; Composition (language); Bounded function; Computer science; Variable (mathematics); Theoretical computer science; Mathematics; Linguistics","score_opus":0.01825130089344324,"score_gpt":0.25172301655374196,"score_spread":0.23347171566029873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384407481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024762247,0.0016488135,0.94709736,0.0035982467,0.00019435506,0.0000930558,0.00025317416,0.0004998309,0.021853056],"genre_scores_gemma":[0.5250843,0.0020495362,0.45963177,0.0013461295,0.00062433985,0.00046670457,0.00046779675,0.0002956176,0.01003386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99267465,0.003138287,0.0006661594,0.0012797599,0.0016236091,0.0006175936],"domain_scores_gemma":[0.99523854,0.0034095482,0.00034353067,0.0004198566,0.00042606753,0.00016247106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00722358,0.0010918451,0.0006928784,0.002059447,0.0020705883,0.0062717325,0.0015166851,0.00233773,0.0030219448],"category_scores_gemma":[0.008531535,0.0009846307,0.0020215116,0.0020690726,0.011340407,0.014070545,0.00325816,0.005165964,0.00046966213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040923962,0.00001237185,0.00010564997,0.000045544602,0.0000083338855,0.000058672485,0.0003012536,0.0037704697,0.00039063528,0.9890948,0.00031741316,0.0058538495],"study_design_scores_gemma":[0.000015047294,0.000014420599,0.00004432019,0.000023144043,0.000017709885,0.00004490416,0.000053937332,0.015842788,0.0007762833,0.9792925,0.0038615637,0.000013312716],"about_ca_topic_score_codex":0.0033325157,"about_ca_topic_score_gemma":0.0018827055,"teacher_disagreement_score":0.00722358,"about_ca_system_score_codex":0.0032637028,"about_ca_system_score_gemma":0.0022079274,"threshold_uncertainty_score":0.038202405},"labels":[],"label_agreement":null},{"id":"W4414783286","doi":"10.1145/3769868","title":"The Complexity of Linear Temporal Verification for Continuous Counter Systems","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Linear temporal logic; Temporal logic; Fragment (logic); Constant (computer programming); Computational complexity theory; Time complexity; Hybrid system; Linear logic","score_opus":0.08437898775922498,"score_gpt":0.3436640172484169,"score_spread":0.2592850294891919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414783286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32257134,0.0010000952,0.6527632,0.00670668,0.00010977545,0.00038244354,0.0016419486,0.0025158557,0.012308704],"genre_scores_gemma":[0.8968776,0.0004770845,0.09688113,0.0005438039,0.00015587661,0.0002952742,0.0010805426,0.000291882,0.003396871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99123454,0.0027550797,0.00057660515,0.0018362828,0.0026017625,0.0009956366],"domain_scores_gemma":[0.9087682,0.08120141,0.003145705,0.0042640045,0.0018873862,0.0007333194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005613591,0.000961615,0.0015325937,0.0010846158,0.0014919654,0.006104704,0.0035184447,0.0019238237,0.0060348604],"category_scores_gemma":[0.03702197,0.0013357105,0.00310863,0.0012832205,0.0039361776,0.012058317,0.004022098,0.004447206,0.00046436815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015223022,0.00037683663,0.007347587,0.0013011346,0.00040127136,0.0012486507,0.0014488754,0.53711367,0.012815146,0.3689916,0.0051403525,0.062292557],"study_design_scores_gemma":[0.00012168068,0.000038374026,0.00047477582,0.00003213678,0.00008473538,0.00012337853,0.00011651615,0.71339256,0.0032933953,0.28130037,0.0009822954,0.000039806662],"about_ca_topic_score_codex":0.007891197,"about_ca_topic_score_gemma":0.0073080063,"teacher_disagreement_score":0.007891197,"about_ca_system_score_codex":0.0052837743,"about_ca_system_score_gemma":0.004219525,"threshold_uncertainty_score":0.038336635},"labels":[],"label_agreement":null}]}