{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051799375,0.0002078056,0.9904992,0.00070351607,0.0018077024,0.00048472988,0.000007941533,0.00027789068,0.0008312781],"genre_scores_gemma":[0.7998607,0.000017200944,0.19955984,0.00021850716,0.00012601043,0.00004150665,0.000024288198,0.000012859496,0.00013905573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819946,0.00008365115,0.00048616197,0.0005427152,0.00029790524,0.00039012628],"domain_scores_gemma":[0.9979217,0.0012198132,0.00013056178,0.0003742701,0.00024636943,0.00010728081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088948716,0.00020091384,0.00023675844,0.0004702429,0.0003213201,0.00013022017,0.0006201915,0.00013631207,0.000006733855],"category_scores_gemma":[0.00007343403,0.00019814933,0.00013205195,0.00080118445,0.00004993414,0.0003662367,0.000012762722,0.00024703046,0.00004463257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007659275,0.00035767656,0.00017166405,0.00004461525,0.00003799565,0.000015678477,0.0004740116,0.8420505,0.00008428688,0.0990695,0.00018615005,0.057431366],"study_design_scores_gemma":[0.0018258237,0.00044272793,0.00958161,0.00010510819,0.000017877142,0.00012796874,0.00020787341,0.87532306,0.00017019908,0.10799405,0.0036957045,0.0005080156],"about_ca_topic_score_codex":0.000045127374,"about_ca_topic_score_gemma":0.000044603305,"teacher_disagreement_score":0.7946808,"about_ca_system_score_codex":0.00021112057,"about_ca_system_score_gemma":0.00007955648,"threshold_uncertainty_score":0.8080295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017029417,0.00013598143,0.98654485,0.006524358,0.00083485886,0.00040032782,0.0000036865129,0.0005124403,0.0033405563],"genre_scores_gemma":[0.60678285,0.0000067032533,0.39003384,0.0018399911,0.00008448337,0.00012917434,0.00001631734,0.000012851445,0.0010937754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979449,0.00010932935,0.0003403672,0.00064703426,0.00050852064,0.0004498729],"domain_scores_gemma":[0.99801576,0.00059779565,0.00010622183,0.00056070485,0.0005316438,0.00018785796],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016847151,0.00028027626,0.00023311267,0.00020363051,0.0005587833,0.00028448942,0.0010137605,0.00013242185,0.00091183226],"category_scores_gemma":[0.000056556924,0.00023043402,0.00016427411,0.00073263573,0.00012378421,0.00059591763,0.00004427169,0.00032362176,0.0021253985],"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.000016876093,0.0012453755,0.00012532008,0.00002757179,0.000111012334,0.000040247374,0.00034374587,0.12185588,0.000117023636,0.51676714,0.0024037175,0.35694608],"study_design_scores_gemma":[0.0009812058,0.0005122596,0.020253446,0.000034377223,0.000024686058,0.00013569165,0.00004132777,0.11300915,0.00007935134,0.8547828,0.00945903,0.0006866544],"about_ca_topic_score_codex":0.000037467827,"about_ca_topic_score_gemma":0.000005354377,"teacher_disagreement_score":0.6050799,"about_ca_system_score_codex":0.00008357746,"about_ca_system_score_gemma":0.00013184205,"threshold_uncertainty_score":0.99865156},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021394037,0.000030145407,0.97260606,0.00042093327,0.00029075402,0.00039958223,0.0000059669633,0.0001644357,0.0046880865],"genre_scores_gemma":[0.62805146,0.0000029444254,0.37134,0.00030707032,0.0000105156705,0.000067073015,0.000021317002,0.000007833855,0.00019176092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836206,0.00014400316,0.00034168828,0.000506448,0.00035394984,0.00029186832],"domain_scores_gemma":[0.99896026,0.00014464968,0.00013085295,0.0004284863,0.0002182113,0.00011753674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024703992,0.00020878327,0.00023362899,0.00027454516,0.00021410723,0.00009673979,0.0006768834,0.00009233691,0.00001778127],"category_scores_gemma":[0.00005653512,0.00018726273,0.00013759933,0.00073548005,0.000056139885,0.0002826552,0.000017901744,0.00016803277,0.000063374115],"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.00003420579,0.0029253606,0.00023788137,0.00009550198,0.0001017418,0.000011729163,0.0018319276,0.1876355,0.0022198828,0.5835656,0.000047488964,0.22129318],"study_design_scores_gemma":[0.0015863389,0.0014472383,0.018938083,0.00008084651,0.00005392421,0.00028467955,0.00018506807,0.6603329,0.0020259926,0.31257215,0.0014503915,0.0010423927],"about_ca_topic_score_codex":0.000006740702,"about_ca_topic_score_gemma":0.0000033766962,"teacher_disagreement_score":0.60665745,"about_ca_system_score_codex":0.00009922346,"about_ca_system_score_gemma":0.00010100776,"threshold_uncertainty_score":0.7636352},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020029042,0.000029175362,0.97518826,0.0021164375,0.00014445477,0.0003212606,0.0000010547178,0.00015481646,0.0020154796],"genre_scores_gemma":[0.9226236,0.000001784607,0.076429956,0.000808738,0.000035373025,0.00002812197,0.000011144507,0.000008660698,0.000052626758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854356,0.0002098797,0.0002067242,0.00039794433,0.00036906498,0.0002728185],"domain_scores_gemma":[0.99817574,0.0011447057,0.000070564056,0.0003999825,0.00015502721,0.000053979184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003634844,0.0001850889,0.00013829037,0.00023820081,0.0003888438,0.00017075265,0.0005438717,0.00006520627,0.000013318883],"category_scores_gemma":[0.00004285612,0.00012351674,0.00007422692,0.0010192656,0.00006729205,0.00018706977,0.0000068234986,0.00027878812,0.000103041886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007024954,0.0008133386,0.000109853354,0.000010441771,0.00001824063,0.00007219181,0.0020083012,0.6840578,0.000007897092,0.050463144,0.00003807498,0.2623305],"study_design_scores_gemma":[0.0015532051,0.0009316435,0.007354265,0.00009379749,0.000020621597,0.00014951918,0.00018860745,0.9306037,0.000079742545,0.057861697,0.00079117244,0.0003720392],"about_ca_topic_score_codex":0.000020805164,"about_ca_topic_score_gemma":0.00016418827,"teacher_disagreement_score":0.90259457,"about_ca_system_score_codex":0.000115363335,"about_ca_system_score_gemma":0.0001509995,"threshold_uncertainty_score":0.50368667},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03549769,0.000062143066,0.96277493,0.0009091283,0.00026820615,0.00014317514,0.000006176043,0.00023313003,0.00010540406],"genre_scores_gemma":[0.8209698,0.0000017459872,0.17871726,0.0001716374,0.0000458207,0.000010419084,0.0000029577564,0.000011046547,0.00006928275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849194,0.0001240305,0.00036139062,0.0003756584,0.00042008646,0.00022690684],"domain_scores_gemma":[0.9988487,0.00027715552,0.00013548323,0.0004830909,0.00018403745,0.000071567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030887217,0.00018275865,0.00025211327,0.00018420299,0.00025452432,0.00007229058,0.0007963335,0.00006998123,0.000004209006],"category_scores_gemma":[0.0000413392,0.00014836896,0.00011871487,0.00032141714,0.00007161524,0.00014897494,0.000029766801,0.00022173474,0.000046244877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007143996,0.0000972001,0.000002004622,0.000030946674,0.000020665924,8.236359e-7,0.0001980635,0.96469927,0.00054153975,0.023068102,0.000011274004,0.011322997],"study_design_scores_gemma":[0.0002231708,0.00016442151,0.000051189338,0.000089132955,0.00000771002,0.000024675031,0.0000067867804,0.96280783,0.00045181526,0.035950087,0.00005352276,0.00016962651],"about_ca_topic_score_codex":0.000017445085,"about_ca_topic_score_gemma":3.689753e-7,"teacher_disagreement_score":0.78547215,"about_ca_system_score_codex":0.000025725945,"about_ca_system_score_gemma":0.00007726079,"threshold_uncertainty_score":0.605031},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024047736,0.00010028699,0.9928627,0.0005885998,0.0007173269,0.00016741334,0.0000023309099,0.00031069806,0.002845863],"genre_scores_gemma":[0.9658999,0.000009607248,0.032248627,0.00078139117,0.00006448173,0.000018986715,0.000009850484,0.000009015786,0.0009581641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870867,0.00013769347,0.00022670736,0.0003543781,0.00034386493,0.00022868848],"domain_scores_gemma":[0.9987921,0.00045492666,0.000065855704,0.00041600355,0.00018011444,0.000090999296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020845367,0.00015431504,0.00015968225,0.00012377069,0.00042911526,0.00005761619,0.00069513154,0.000079663325,0.00010349791],"category_scores_gemma":[0.000039652707,0.00013126101,0.00010192631,0.00038095802,0.000112228074,0.0002428383,0.000015676635,0.00018554021,0.0006577737],"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.000035380715,0.00025506335,0.000064823544,0.000006078685,0.00005404316,0.000048803475,0.00061154464,0.05617321,0.000018242015,0.9045391,0.00030961545,0.03788407],"study_design_scores_gemma":[0.0007530865,0.0005756296,0.0025825119,0.0000032592875,0.000011909016,0.00041622738,0.00006599242,0.03176073,0.000118707096,0.9586357,0.0047300435,0.0003462233],"about_ca_topic_score_codex":0.00001728657,"about_ca_topic_score_gemma":0.0000034752663,"teacher_disagreement_score":0.9634951,"about_ca_system_score_codex":0.00004584133,"about_ca_system_score_gemma":0.00012606346,"threshold_uncertainty_score":0.84545696},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028168592,0.000105362,0.9914817,0.0036134971,0.00038837592,0.00012807999,0.000004306659,0.0003534816,0.00110831],"genre_scores_gemma":[0.8264866,0.000017000628,0.17216718,0.0010902653,0.000038906623,0.000020430072,0.000003905107,0.000006972938,0.0001687486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986635,0.00006620259,0.00023276522,0.0003918049,0.00037956532,0.00026616515],"domain_scores_gemma":[0.99908113,0.00022167257,0.000049034203,0.00044249019,0.000117134754,0.00008850553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013673423,0.00017344141,0.00014453715,0.00018392655,0.00044511873,0.00013309144,0.0009156084,0.000064441294,0.00008608264],"category_scores_gemma":[0.000017676854,0.00015026324,0.00011759696,0.00051543594,0.00014323735,0.00034719633,0.000031347874,0.00025542875,0.0001747004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015650188,0.00023614799,0.000021996557,0.000007622528,0.000032511518,0.00003752799,0.00021397554,0.7678852,0.000017733979,0.059035033,0.00004926297,0.17244731],"study_design_scores_gemma":[0.00039176655,0.00019665169,0.0013839032,0.000028200358,0.000010254908,0.0002310134,0.00006939051,0.5433894,0.00025358243,0.45153448,0.002196326,0.00031507603],"about_ca_topic_score_codex":0.00002739048,"about_ca_topic_score_gemma":0.00001374701,"teacher_disagreement_score":0.82366973,"about_ca_system_score_codex":0.0000634964,"about_ca_system_score_gemma":0.00006220731,"threshold_uncertainty_score":0.6127557},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071158414,0.00004300266,0.9872185,0.0018492902,0.00015952408,0.00083349016,0.000005658409,0.00021726819,0.0025574241],"genre_scores_gemma":[0.6680886,0.0000031230234,0.33012864,0.0010908316,0.000030997628,0.00054690085,0.000011278147,0.000009975043,0.00008965355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983252,0.00008873502,0.00027136426,0.00057587994,0.0003302598,0.00040854613],"domain_scores_gemma":[0.99897635,0.00019343,0.000051725237,0.00045371475,0.00015656823,0.00016820803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000219281,0.00022006748,0.00020417309,0.00033378534,0.00019599087,0.000181591,0.0008943233,0.0000973487,0.00004805807],"category_scores_gemma":[0.00002933995,0.00019437475,0.00009547072,0.00082545006,0.000057653222,0.00048713855,0.000037109894,0.00024384049,0.00037527023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011655082,0.00094914273,0.00014272676,0.000033058743,0.000022983771,0.000005265157,0.006134407,0.61857,0.000013507838,0.23050313,0.00014826203,0.14346585],"study_design_scores_gemma":[0.0003423255,0.00016420413,0.0024921468,0.000019116165,0.0000053224444,0.000019898918,0.000053818963,0.8291731,0.000012734899,0.16731048,0.00015342394,0.0002534247],"about_ca_topic_score_codex":0.0000768109,"about_ca_topic_score_gemma":0.000020780606,"teacher_disagreement_score":0.6609728,"about_ca_system_score_codex":0.00009704497,"about_ca_system_score_gemma":0.00006665019,"threshold_uncertainty_score":0.7926372},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01688435,0.0012363092,0.976629,0.0012162055,0.00044984595,0.00016038297,0.000007884194,0.00021645916,0.0031995326],"genre_scores_gemma":[0.9839628,0.00006893883,0.015384961,0.00033740766,0.000060244158,0.000035775425,0.0000071507307,0.0000070794954,0.00013566956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989423,0.000067763445,0.00017862144,0.00030232104,0.00024538807,0.00026360736],"domain_scores_gemma":[0.9987559,0.00069630187,0.0000687782,0.00022447656,0.0001321757,0.0001224043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014449548,0.0001756874,0.00014913021,0.000117244745,0.00027620178,0.00021443373,0.00037606247,0.0000597387,0.000040927454],"category_scores_gemma":[0.000049083974,0.00014260235,0.00004874982,0.00027372563,0.00009606236,0.0007461292,0.000014779254,0.0001680771,0.00012668617],"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.00001897068,0.00070554944,0.0003179495,0.00012349177,0.00005936933,0.0000048628453,0.0022609988,0.037557088,0.00002040756,0.8623512,0.00030170486,0.09627846],"study_design_scores_gemma":[0.0020401163,0.0013595084,0.031699356,0.00027041067,0.000070395654,0.0003316737,0.0012075943,0.030012786,0.0010218689,0.92548376,0.005203025,0.0012995024],"about_ca_topic_score_codex":0.000004755713,"about_ca_topic_score_gemma":0.000004966448,"teacher_disagreement_score":0.96707845,"about_ca_system_score_codex":0.000040915234,"about_ca_system_score_gemma":0.00014206908,"threshold_uncertainty_score":0.5815155},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023531422,0.00017031038,0.96681184,0.0070197787,0.0004518865,0.00039442163,0.000017805824,0.0005237699,0.0010787471],"genre_scores_gemma":[0.779994,0.000024814084,0.21925934,0.0005703616,0.000057877016,0.000027305265,0.000009232246,0.000012403653,0.000044652574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997403,0.00013971365,0.00053386507,0.00097594276,0.0005810101,0.00036644857],"domain_scores_gemma":[0.99708635,0.0013526205,0.00014118954,0.0009902193,0.00022531349,0.000204317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038508736,0.00031419043,0.00029155193,0.00025495383,0.00046211656,0.0002558921,0.0010225406,0.00012649881,0.0004691256],"category_scores_gemma":[0.00007861642,0.0003107899,0.00014358004,0.0006776537,0.00021011001,0.0005662671,0.000057431123,0.00039164035,0.00038390997],"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.000017384325,0.0016672987,0.0003657395,0.00005490308,0.000069280104,0.000022302187,0.00070696976,0.2512004,0.000083983636,0.050412092,0.00037107835,0.69502854],"study_design_scores_gemma":[0.0006027973,0.00021774757,0.1016891,0.000013648941,0.0000115915345,0.000094723866,0.000022310365,0.55634874,0.00007185142,0.33983168,0.0006739598,0.0004218477],"about_ca_topic_score_codex":0.00001766787,"about_ca_topic_score_gemma":0.000006822239,"teacher_disagreement_score":0.7564626,"about_ca_system_score_codex":0.0001495564,"about_ca_system_score_gemma":0.000037671714,"threshold_uncertainty_score":0.99993443},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000752152,0.000014903329,0.9934899,0.0014626641,0.0004819384,0.00038279762,0.000026417341,0.00019952888,0.0038666287],"genre_scores_gemma":[0.36268148,0.0000051772013,0.63616914,0.0008154932,0.000008246566,0.00007676371,0.000011923642,0.000007815524,0.00022399591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861306,0.00006510896,0.00028000653,0.0004473346,0.00031594132,0.00027855308],"domain_scores_gemma":[0.99826175,0.0007918558,0.00008883615,0.00036485636,0.0003941657,0.00009856363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002966771,0.0001741315,0.00015186281,0.00018519677,0.000556242,0.0001446565,0.00040082113,0.0001142865,0.00065554574],"category_scores_gemma":[0.00021261652,0.00018194084,0.000081027334,0.0006168529,0.000093070135,0.0004311559,0.0000071740246,0.00017989732,0.000093053925],"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.000005742659,0.00008738163,0.00003668909,0.000008347233,0.000017829781,0.000001257527,0.000040705472,0.5293209,0.000005853951,0.46010518,0.00009844692,0.010271642],"study_design_scores_gemma":[0.0014519575,0.00020221432,0.000730899,0.000024598363,0.000020851534,0.00013597545,0.000056594774,0.3191902,0.00018175175,0.6721962,0.0054041217,0.00040463533],"about_ca_topic_score_codex":0.000007670992,"about_ca_topic_score_gemma":0.0000130990165,"teacher_disagreement_score":0.36260626,"about_ca_system_score_codex":0.000086494576,"about_ca_system_score_gemma":0.00033241414,"threshold_uncertainty_score":0.7419332},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012010832,0.000014476308,0.98520035,0.0005435931,0.00013090785,0.00031996483,0.000038621034,0.00014148782,0.0015997989],"genre_scores_gemma":[0.669648,0.000003940199,0.330145,0.00014422297,0.0000037430925,0.000026397605,0.000004261858,0.000005445033,0.000018972552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984904,0.00018819414,0.00033779888,0.00036183806,0.0003978117,0.00022397433],"domain_scores_gemma":[0.99837595,0.00056203606,0.00014624896,0.00046754556,0.0003586937,0.000089515706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027670249,0.00015309766,0.00019658967,0.00024605665,0.00021059257,0.000021151754,0.0006286067,0.000059411777,0.00024755715],"category_scores_gemma":[0.00004948295,0.00014580012,0.00010282581,0.00058607676,0.00068313937,0.00038293895,0.000023037212,0.00025137226,0.00005813881],"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.000059715545,0.00031445533,0.00059804996,0.000025608979,0.00007669454,0.0000060206326,0.0009979744,0.04329232,0.00031288379,0.92084503,0.000011908534,0.033459324],"study_design_scores_gemma":[0.00041779532,0.00035884845,0.034202706,0.00002164947,0.0000060003163,0.000031633943,0.00008068935,0.019593913,0.0017323183,0.9433887,0.000015805843,0.00014996094],"about_ca_topic_score_codex":0.00007661943,"about_ca_topic_score_gemma":0.000031416443,"teacher_disagreement_score":0.6576372,"about_ca_system_score_codex":0.000056499004,"about_ca_system_score_gemma":0.00011721421,"threshold_uncertainty_score":0.5945556},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015388209,0.00007208137,0.976098,0.0009446272,0.00028142697,0.00019474575,0.000024013092,0.00018414122,0.006812778],"genre_scores_gemma":[0.79446477,0.000043430544,0.20490141,0.0003897377,0.000028952225,0.000041889874,0.000012458036,0.000007744123,0.000109613444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853384,0.00010214984,0.00033970384,0.00042451202,0.00035201432,0.00024779834],"domain_scores_gemma":[0.998307,0.00065518345,0.00014054844,0.0004828719,0.0003124242,0.00010200102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012182026,0.00019471598,0.00025119222,0.00027574782,0.00045586663,0.000025383746,0.0007631589,0.000105129926,0.00011129089],"category_scores_gemma":[0.00007157862,0.00017610841,0.00018172024,0.0007364351,0.00022157637,0.00032523516,0.000027208156,0.00025624104,0.00025797414],"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.000045863926,0.0019027644,0.00032001932,0.000022935026,0.00015103402,0.00006682426,0.0023639945,0.13971157,0.00024200589,0.84084934,0.00035382994,0.013969824],"study_design_scores_gemma":[0.0011349105,0.00074039825,0.019073984,0.000029815017,0.000031110645,0.0003602596,0.00009188653,0.02706919,0.001088136,0.9495775,0.00034750195,0.00045530242],"about_ca_topic_score_codex":0.00002652646,"about_ca_topic_score_gemma":0.000008033145,"teacher_disagreement_score":0.7790766,"about_ca_system_score_codex":0.00006841662,"about_ca_system_score_gemma":0.00019618303,"threshold_uncertainty_score":0.71814924},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10767429,0.0002639216,0.8902591,0.00069934886,0.00014014976,0.00019930783,0.0000027338224,0.00018145052,0.0005796861],"genre_scores_gemma":[0.9697906,0.0000125117185,0.0296037,0.00047393833,0.00003529699,0.00001178799,0.000005949457,0.0000060726193,0.000060191833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986942,0.00009360341,0.0002598865,0.0004452708,0.0002634069,0.0002436406],"domain_scores_gemma":[0.9986282,0.0008266848,0.000063073174,0.0002895049,0.00007530813,0.000117210606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005099186,0.0001671449,0.00019342615,0.00012471787,0.0002615948,0.0001234601,0.0002728609,0.000107679814,0.000025187226],"category_scores_gemma":[0.000050142648,0.0001337669,0.00006509464,0.00024393157,0.00016186145,0.00021647215,0.00002346921,0.00017190982,0.000015089915],"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.00013271178,0.00064699375,0.009454044,0.00007496299,0.00012809923,0.00009947708,0.0012420606,0.006915174,0.00015434032,0.7306288,0.00007277896,0.25045055],"study_design_scores_gemma":[0.0014713783,0.00049739034,0.45594618,0.0000075811413,0.000028530238,0.00019898276,0.000175173,0.011133862,0.00011064519,0.52896947,0.0010344702,0.00042632167],"about_ca_topic_score_codex":0.00013017574,"about_ca_topic_score_gemma":0.00015979563,"teacher_disagreement_score":0.8621163,"about_ca_system_score_codex":0.00003628893,"about_ca_system_score_gemma":0.000030762312,"threshold_uncertainty_score":0.54548556},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026882757,0.0000728716,0.9698123,0.0013546176,0.0001703883,0.00012655639,0.000009732352,0.00014316646,0.0014276309],"genre_scores_gemma":[0.90818655,0.000012081532,0.091282,0.00016573606,0.000025181404,0.000022307118,0.000009770581,0.000006307157,0.0002900785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998843,0.000060856124,0.0002597908,0.00037384126,0.00021458263,0.00024790654],"domain_scores_gemma":[0.999222,0.00029739607,0.000055400058,0.00028223475,0.0000816521,0.00006134038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020129616,0.00014584903,0.00015564541,0.0001380489,0.0003151812,0.00012757398,0.0003061928,0.0000677994,0.0000145459935],"category_scores_gemma":[0.000021812968,0.00013770637,0.000057589255,0.00044193477,0.0000618058,0.00037236582,0.000021877542,0.00017616159,0.000023758974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004586852,0.00020353803,0.00050846196,0.000007377858,0.0000062056174,0.0000037550228,0.00009537423,0.768661,0.000027202808,0.22825074,0.000059171358,0.0021725534],"study_design_scores_gemma":[0.00027389382,0.000031103256,0.0057319636,0.000008663006,0.0000064840683,0.0000104774035,0.00001134675,0.64722455,0.000063875494,0.34641704,0.00009851399,0.00012208441],"about_ca_topic_score_codex":0.00009341087,"about_ca_topic_score_gemma":0.000177584,"teacher_disagreement_score":0.8813038,"about_ca_system_score_codex":0.00007405273,"about_ca_system_score_gemma":0.00008213166,"threshold_uncertainty_score":0.5615503},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023719869,0.000051908042,0.99155754,0.0016967962,0.00023299007,0.00020392003,0.0000025699062,0.00033255643,0.0035497118],"genre_scores_gemma":[0.8196185,0.0000010244466,0.1795568,0.00035168877,0.00006317463,0.000037514626,0.000015939353,0.000009168408,0.00034614786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863434,0.0000723826,0.00022918316,0.0004018635,0.0004060007,0.00025625],"domain_scores_gemma":[0.9991013,0.00020628002,0.00008245512,0.00042844363,0.00011610328,0.00006540705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015367143,0.00017319128,0.00015544782,0.00014238727,0.00030472808,0.00015550968,0.00061008125,0.00006540378,0.000046154564],"category_scores_gemma":[0.00000358026,0.00013345508,0.00007937898,0.00047542644,0.0000700004,0.00025102103,0.000010495787,0.0001475896,0.0002291849],"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.000015222826,0.0002771095,0.00014121293,0.000009263604,0.000032384138,0.00003528607,0.000088801244,0.13315539,0.00001959479,0.85078174,0.00020169205,0.015242282],"study_design_scores_gemma":[0.0007149432,0.0003820632,0.004256314,0.0000044212074,0.000010397454,0.00013934067,0.000024979283,0.009138945,0.0001391284,0.980692,0.004216864,0.00028056712],"about_ca_topic_score_codex":0.000092702256,"about_ca_topic_score_gemma":0.00004688706,"teacher_disagreement_score":0.81724656,"about_ca_system_score_codex":0.000054437467,"about_ca_system_score_gemma":0.00007463914,"threshold_uncertainty_score":0.544214},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031462456,0.000044002885,0.98455244,0.010179229,0.00013140633,0.0006403342,0.000012363825,0.00037084593,0.0009231034],"genre_scores_gemma":[0.5346053,0.000004712252,0.46383682,0.0008781275,0.00006313613,0.00012267422,0.00003076577,0.0000128530355,0.00044558712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982418,0.00004482605,0.00030802103,0.0005972733,0.0004158606,0.00039221576],"domain_scores_gemma":[0.9983669,0.00043607064,0.00012898762,0.0004969718,0.0004260643,0.00014501093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017432087,0.00028094623,0.00023289977,0.00016956881,0.0005073734,0.00021537568,0.0008581381,0.00013392878,0.00002720274],"category_scores_gemma":[0.000037407,0.0002246051,0.00015719954,0.00047244006,0.0001020091,0.0004914995,0.000018144183,0.00022080107,0.0001586823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004041635,0.0005130914,0.000019114666,0.000021013722,0.000050352166,0.0000034809796,0.0005071409,0.7821868,0.000015956397,0.18117903,0.00027732097,0.035186287],"study_design_scores_gemma":[0.0008882741,0.0005663975,0.00006688788,0.000022539032,0.00002943892,0.00005991354,0.000035958627,0.7623135,0.00011179012,0.23416586,0.0014528983,0.00028657305],"about_ca_topic_score_codex":0.000004387302,"about_ca_topic_score_gemma":0.00005706555,"teacher_disagreement_score":0.5314591,"about_ca_system_score_codex":0.00009485896,"about_ca_system_score_gemma":0.0002563984,"threshold_uncertainty_score":0.915913},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027089562,0.000060441143,0.96503156,0.00074519706,0.00031667238,0.00012753383,0.0000075213593,0.00014772454,0.0064737736],"genre_scores_gemma":[0.92920476,0.000022056656,0.07027992,0.0002531057,0.00003253321,0.000015342732,0.000010865205,0.0000053758185,0.0001760177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988921,0.00008657572,0.00024996293,0.00028068,0.0003128656,0.0001777778],"domain_scores_gemma":[0.99902856,0.000324032,0.00009312921,0.00033476303,0.00016349247,0.000056015808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019085153,0.00013550285,0.00015248382,0.00015221644,0.00022711128,0.000046557623,0.0005958984,0.00006029923,0.00014935597],"category_scores_gemma":[0.000037080925,0.000119260934,0.00011150073,0.00043312195,0.00009767383,0.00028451273,0.000019734347,0.000120326455,0.00009994426],"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.00007687727,0.000710953,0.00037304612,0.000016490663,0.00008217448,0.000016163822,0.00096995936,0.061919726,0.0006099846,0.8703011,0.0001892847,0.06473423],"study_design_scores_gemma":[0.0009916928,0.0005281639,0.013609064,0.000027770217,0.000023659672,0.00011413599,0.00015158685,0.038065486,0.0026337514,0.94262105,0.0009210604,0.00031254886],"about_ca_topic_score_codex":0.000019983936,"about_ca_topic_score_gemma":0.0000096970425,"teacher_disagreement_score":0.9021152,"about_ca_system_score_codex":0.000058096353,"about_ca_system_score_gemma":0.00007033307,"threshold_uncertainty_score":0.48633197},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024134113,0.000044407483,0.96696043,0.0046545276,0.002020736,0.0004898666,0.000031351057,0.00071273907,0.00095184264],"genre_scores_gemma":[0.7745017,0.0000059551485,0.22431368,0.00094581227,0.000117447606,0.000044502565,0.000040519717,0.000021752665,0.000008650376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996439,0.00015108097,0.00065860304,0.0010826774,0.0011195387,0.0005490998],"domain_scores_gemma":[0.99612164,0.0022628189,0.00022330105,0.00080639275,0.00032588115,0.00025997142],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043381096,0.00044920616,0.00038886064,0.0006368675,0.0005731716,0.00029160813,0.0013001409,0.00018458118,0.0001133533],"category_scores_gemma":[0.0001790376,0.00044707858,0.00030037234,0.0016188537,0.0001637641,0.0005732497,0.000051391988,0.0005714477,0.00085556123],"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.00011968677,0.00024949052,0.00000580991,0.000011014028,0.000073399744,0.000034638062,0.00013908213,0.9070118,0.00002659385,0.041013367,0.000048445185,0.051266674],"study_design_scores_gemma":[0.009241427,0.003451559,0.014932252,0.00007291154,0.00007845465,0.00009259531,0.00006943378,0.38366896,0.0019372987,0.5844145,0.0005901174,0.0014505257],"about_ca_topic_score_codex":0.00006434211,"about_ca_topic_score_gemma":0.0000091068705,"teacher_disagreement_score":0.7503676,"about_ca_system_score_codex":0.00051229325,"about_ca_system_score_gemma":0.00030856926,"threshold_uncertainty_score":0.9999224},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016352715,0.00005056458,0.99477965,0.0013423072,0.0010796243,0.00038415138,0.00002126366,0.00029316067,0.00041402187],"genre_scores_gemma":[0.4391695,0.0000018368828,0.5599852,0.00063767354,0.00007214854,0.000065884575,0.000015657935,0.000007756661,0.00004434665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984775,0.0001470104,0.00032248796,0.0003521695,0.00032398241,0.00037685258],"domain_scores_gemma":[0.9983915,0.00068077934,0.00013006029,0.0005183135,0.00015122064,0.00012813606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007987808,0.00018419964,0.00017185627,0.00017534515,0.0004739989,0.00009660419,0.0008331424,0.000100593265,0.000050215967],"category_scores_gemma":[0.00011700058,0.00017376289,0.00014614037,0.00034898808,0.000053105035,0.0010086135,0.000018897255,0.00021958508,0.00012254415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003216885,0.00046046256,0.0001992811,0.000032029966,0.000037183792,5.083449e-7,0.00037176308,0.47746387,0.00006836201,0.43768758,0.00016937529,0.08347743],"study_design_scores_gemma":[0.0008163161,0.00032817613,0.012065386,0.000019442303,0.00002797973,0.00004983323,0.00004327124,0.52653027,0.0008936879,0.4563946,0.002329719,0.00050133845],"about_ca_topic_score_codex":0.000007946599,"about_ca_topic_score_gemma":0.0000016637558,"teacher_disagreement_score":0.43753424,"about_ca_system_score_codex":0.00010979776,"about_ca_system_score_gemma":0.00005931692,"threshold_uncertainty_score":0.70858455},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061814548,0.00007820076,0.9905441,0.0010637495,0.0006796174,0.0001836367,0.0000014475704,0.0003203355,0.00094745134],"genre_scores_gemma":[0.90211993,0.0000032367097,0.09703092,0.0005963216,0.000088971756,0.000007975159,0.000010048522,0.000005958651,0.00013662918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860185,0.00007719655,0.00027944983,0.00040446597,0.0003700073,0.00026702174],"domain_scores_gemma":[0.9991528,0.00013370856,0.000102656064,0.0003768886,0.00015083411,0.00008314662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016263433,0.00018353527,0.00016862138,0.00020359956,0.00044442972,0.00019535377,0.0005726845,0.00010103772,0.000039395305],"category_scores_gemma":[0.000013372673,0.00016458906,0.000099436606,0.0006024371,0.000055168573,0.0004717284,0.0000091520915,0.00018646153,0.0000759739],"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.000011568918,0.00027270778,0.00012479765,0.0000069860557,0.000029361063,0.000020127083,0.00018499086,0.434296,0.00024013828,0.48753655,0.00001702078,0.077259734],"study_design_scores_gemma":[0.0010555305,0.00050112774,0.02708503,0.000019858137,0.000033817996,0.00014075589,0.000023537857,0.18652655,0.0003388112,0.7817532,0.0019277112,0.00059410033],"about_ca_topic_score_codex":0.00002354367,"about_ca_topic_score_gemma":0.0000063820407,"teacher_disagreement_score":0.89593846,"about_ca_system_score_codex":0.00010938127,"about_ca_system_score_gemma":0.00009482567,"threshold_uncertainty_score":0.6711747},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011577633,0.000005538198,0.9837243,0.002592409,0.0006866813,0.00019054681,0.000018059789,0.00010417327,0.0011006553],"genre_scores_gemma":[0.43008634,6.5668695e-7,0.5692679,0.00057943555,0.000016270164,0.000026546068,0.000006759422,0.0000052493674,0.000010803807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832714,0.0004055371,0.00033797923,0.00031668376,0.0004448973,0.00016776586],"domain_scores_gemma":[0.99549484,0.0032859202,0.00017347255,0.0007389447,0.00025128678,0.000055537064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001089695,0.00015020755,0.0001661811,0.0001625104,0.0004167787,0.00006361008,0.0012368273,0.00007695504,0.0001442035],"category_scores_gemma":[0.0002581823,0.000113195,0.00011827165,0.0005017267,0.00018439283,0.00021154515,0.000022810224,0.00047537673,0.000050429207],"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.000018418721,0.00015094425,0.00000478276,0.0000048214283,0.000021069607,7.965479e-7,0.000078806646,0.10559485,0.0028553454,0.86368734,0.000025262083,0.02755756],"study_design_scores_gemma":[0.00023250544,0.00018260333,0.00605024,0.000021107371,0.00001000401,0.00005555577,0.000016511725,0.43231016,0.009719362,0.5509886,0.00025161327,0.00016169075],"about_ca_topic_score_codex":0.000008071108,"about_ca_topic_score_gemma":0.0000016202354,"teacher_disagreement_score":0.4185087,"about_ca_system_score_codex":0.000030114721,"about_ca_system_score_gemma":0.00007442836,"threshold_uncertainty_score":0.4615958},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045189904,0.00008093148,0.9906303,0.0027557153,0.00023111665,0.00013705276,0.000008467618,0.000053485666,0.0015839044],"genre_scores_gemma":[0.8462308,0.000011226252,0.15344839,0.00009045453,0.000015383443,0.000021469465,0.000004839415,0.0000035206976,0.00017391774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886024,0.000082631035,0.00032192742,0.00023895688,0.00032896866,0.00016726044],"domain_scores_gemma":[0.99843043,0.0009773573,0.000078232864,0.0004173417,0.00007337179,0.000023271297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026333772,0.00009962591,0.00010867422,0.00015820228,0.00023217873,0.0000560423,0.00069327385,0.00003129684,0.000019536368],"category_scores_gemma":[0.000018746066,0.000078271165,0.00007809214,0.00057123246,0.000099373385,0.00010863206,0.000018266852,0.00015651324,0.000012061795],"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.000021572976,0.0004884526,0.00013411212,0.0000070518654,0.000017391,0.0000031298878,0.000057727473,0.35791957,0.000012439979,0.562892,0.00015586632,0.078290656],"study_design_scores_gemma":[0.00046169964,0.00017681651,0.014564063,0.000017223263,0.000004044231,0.000011025518,0.000033479002,0.24336492,0.00018715356,0.7396906,0.0013734257,0.000115560586],"about_ca_topic_score_codex":0.00009353099,"about_ca_topic_score_gemma":0.00012486464,"teacher_disagreement_score":0.8417118,"about_ca_system_score_codex":0.00004235187,"about_ca_system_score_gemma":0.000053557924,"threshold_uncertainty_score":0.31918055},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006430177,0.000022149805,0.9896711,0.0025024195,0.00036503008,0.00015664178,0.000011858197,0.00028414303,0.00055645074],"genre_scores_gemma":[0.68034315,0.0000049968703,0.31780106,0.001690916,0.000038856415,0.00002615612,0.000028483724,0.000009806734,0.00005656051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821454,0.00025855674,0.00036858267,0.00050229573,0.0003814789,0.00027451976],"domain_scores_gemma":[0.99831104,0.00086528494,0.000093530994,0.0005523815,0.00008849375,0.000089264715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004778799,0.00018931861,0.0002008083,0.00027747516,0.00019349846,0.00012179097,0.00079061167,0.000097416545,0.00009673936],"category_scores_gemma":[0.00006828116,0.00018601461,0.00009364541,0.00066258654,0.00006076703,0.00045597466,0.00002315733,0.0002118311,0.00016836025],"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.000011054831,0.0004496937,0.000074394375,0.00001307713,0.00002158615,0.00000885293,0.00033835074,0.26726255,0.000025340587,0.22692613,0.00013323748,0.5047357],"study_design_scores_gemma":[0.00046001197,0.00008714887,0.00799774,0.00001558791,0.0000041085787,0.00001815495,0.000015617274,0.5569309,0.00013852719,0.43382934,0.00032112334,0.00018176931],"about_ca_topic_score_codex":0.000028243452,"about_ca_topic_score_gemma":0.0000098419005,"teacher_disagreement_score":0.673913,"about_ca_system_score_codex":0.00007018301,"about_ca_system_score_gemma":0.000057504214,"threshold_uncertainty_score":0.7585456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070385663,0.00013769558,0.9900279,0.00052972697,0.00086769625,0.00039716845,0.000007885429,0.0001934799,0.000799853],"genre_scores_gemma":[0.62658834,0.0000045954544,0.37310964,0.00011350269,0.000027753995,0.00010003634,0.0000055998803,0.0000056564995,0.000044855664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982716,0.0003084762,0.000394078,0.00033310257,0.00036866593,0.0003241097],"domain_scores_gemma":[0.99856555,0.00047592566,0.00010071095,0.00064841594,0.00010252555,0.00010683822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010810824,0.00015243291,0.00016588497,0.00023095524,0.0001441039,0.00007176816,0.0007039844,0.00009297412,0.00002118551],"category_scores_gemma":[0.00010577663,0.00014535898,0.000064767424,0.0006582757,0.000056529127,0.00087611284,0.000017482433,0.00026360157,0.00015752153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009068204,0.00066734134,0.001159062,0.00004755289,0.000013212108,8.698838e-7,0.0007718786,0.81111944,0.000048744503,0.14294149,0.000028281982,0.043193087],"study_design_scores_gemma":[0.00074651465,0.00025810092,0.09218491,0.000072167415,0.000011964078,0.0000814675,0.0000950777,0.7790273,0.00019204683,0.12475027,0.002064282,0.0005158937],"about_ca_topic_score_codex":0.00006314841,"about_ca_topic_score_gemma":0.0000045891265,"teacher_disagreement_score":0.6195498,"about_ca_system_score_codex":0.00019770238,"about_ca_system_score_gemma":0.000053201456,"threshold_uncertainty_score":0.5927567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023524903,0.0002573391,0.96035296,0.00067327,0.0005713097,0.00017934754,0.00001070017,0.00023204912,0.0141981505],"genre_scores_gemma":[0.9215004,0.0000032065504,0.07750773,0.00024815078,0.00009432688,0.000039111386,0.000023364853,0.000012126476,0.00057158776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982893,0.00013321282,0.00035602174,0.00053927646,0.00031451674,0.00036770574],"domain_scores_gemma":[0.9987973,0.00052002654,0.00007765718,0.00041160133,0.000113881455,0.00007953664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028940383,0.00022796533,0.00021456993,0.000358556,0.0002780291,0.00012937798,0.00082993304,0.000112978385,0.00007205085],"category_scores_gemma":[0.000010289859,0.00021266604,0.000112534115,0.0006366376,0.00006024407,0.00031912109,0.000029502477,0.00030596124,0.00035191906],"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.000030433028,0.00095456967,0.0012648606,0.000021002596,0.00003001557,0.0001154604,0.0015160078,0.7116567,0.00006976528,0.27157336,0.00085586216,0.011911961],"study_design_scores_gemma":[0.0022142571,0.0003152309,0.051748686,0.00007856883,0.000014488066,0.00015230321,0.0002100333,0.082063824,0.00026640622,0.8547652,0.0074225063,0.00074852904],"about_ca_topic_score_codex":0.000050608414,"about_ca_topic_score_gemma":0.00010287314,"teacher_disagreement_score":0.8979755,"about_ca_system_score_codex":0.00016319624,"about_ca_system_score_gemma":0.00013071555,"threshold_uncertainty_score":0.8672269},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055472218,0.0001825103,0.9813738,0.0108176675,0.00077616994,0.0004703518,0.000020974792,0.00015000414,0.00066131545],"genre_scores_gemma":[0.8762235,0.000007338725,0.12323598,0.00034119136,0.00008866405,0.00004400254,0.000005389552,0.000010637136,0.000043295462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975209,0.0005088871,0.00047353303,0.0003655212,0.00066913245,0.00046200052],"domain_scores_gemma":[0.99513745,0.003177255,0.0002113096,0.0011217877,0.00024119993,0.00011099863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012853941,0.00023464278,0.00021884457,0.00008248671,0.0011184138,0.00016255956,0.0021649816,0.00005949609,0.000034107787],"category_scores_gemma":[0.00014964456,0.00013407986,0.0002217539,0.0006246425,0.00091252313,0.00042465294,0.00011648127,0.00038436693,0.000045404555],"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.000026336736,0.00038013363,0.0003297271,0.0000156966,0.00007920732,0.0000010033616,0.0011041877,0.11864485,0.000020186058,0.80338144,0.00006952679,0.07594771],"study_design_scores_gemma":[0.000260682,0.0001656046,0.028710693,0.000012016548,0.000019642921,0.000043338296,0.00014449589,0.20485666,0.00019943398,0.76472104,0.00064824556,0.0002181567],"about_ca_topic_score_codex":0.000045599707,"about_ca_topic_score_gemma":0.000028773138,"teacher_disagreement_score":0.8706763,"about_ca_system_score_codex":0.00009375133,"about_ca_system_score_gemma":0.0001081239,"threshold_uncertainty_score":0.86020476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001510438,0.00015384985,0.9939424,0.0018490067,0.00050678506,0.00038419178,0.000010774326,0.00021973602,0.0014228235],"genre_scores_gemma":[0.95328087,0.0000064646356,0.044850018,0.0007649183,0.00008992349,0.00005493293,0.000019607265,0.000008922816,0.0009243303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866503,0.000108210814,0.0002686167,0.0004426814,0.0002863647,0.0002291206],"domain_scores_gemma":[0.9986872,0.00056641264,0.000097062235,0.00034049616,0.00021313103,0.00009567075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003275795,0.000156341,0.00018426846,0.00010688196,0.00044682302,0.00020702674,0.00036736214,0.000075795935,0.00009926602],"category_scores_gemma":[0.000054807893,0.00014180252,0.000101875456,0.00027958528,0.000090821944,0.00022298201,0.000016411715,0.0001306974,0.000084099884],"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.000052030875,0.00040120966,0.00014493844,0.000044017175,0.00012765742,0.000006724375,0.00043328205,0.02009102,0.00004913041,0.867019,0.0013918702,0.11023913],"study_design_scores_gemma":[0.0016144038,0.00047933726,0.0014639447,0.0000057393245,0.00003526197,0.0000992231,0.00003706086,0.100614026,0.000090614456,0.8445964,0.050606623,0.00035738735],"about_ca_topic_score_codex":0.000025830637,"about_ca_topic_score_gemma":0.000016989337,"teacher_disagreement_score":0.9517704,"about_ca_system_score_codex":0.00005422283,"about_ca_system_score_gemma":0.000030971714,"threshold_uncertainty_score":0.5782539},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039862287,0.00003812518,0.9937503,0.00038558737,0.00024838658,0.0002752616,0.000007574517,0.00012604927,0.0011825209],"genre_scores_gemma":[0.91858256,0.000006064703,0.08101959,0.0001544284,0.000040818173,0.00004825038,0.000009317154,0.000007729732,0.00013127355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986108,0.00013888498,0.00031969877,0.0004211504,0.00032071528,0.0001887619],"domain_scores_gemma":[0.998336,0.0006561251,0.00023413726,0.00031751322,0.00039067434,0.00006553104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022738361,0.00017817927,0.00023141546,0.00012797739,0.0002558734,0.00008088573,0.00030499804,0.00006213818,0.000030156476],"category_scores_gemma":[0.000034057215,0.00011268978,0.000048407906,0.00025918294,0.0001299969,0.0004606891,0.000016819364,0.000081935475,0.00004256702],"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.00018121657,0.00036658108,0.00063945336,0.00008320419,0.0001641037,0.00001093839,0.0005466154,0.14209726,0.005634749,0.7998697,0.00011654238,0.050289616],"study_design_scores_gemma":[0.0054619648,0.002985551,0.0047084624,0.00013892003,0.00008962203,0.00032810317,0.00015714102,0.14579509,0.0044818255,0.8330823,0.0018251437,0.00094584416],"about_ca_topic_score_codex":0.00004084677,"about_ca_topic_score_gemma":0.000013116885,"teacher_disagreement_score":0.9145963,"about_ca_system_score_codex":0.00004150381,"about_ca_system_score_gemma":0.00007566029,"threshold_uncertainty_score":0.4595356},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013642097,0.000053870688,0.9819708,0.00074563816,0.00068651396,0.00023851504,0.000005520651,0.00016006932,0.0024969818],"genre_scores_gemma":[0.9421711,0.000011321033,0.05756578,0.00007584962,0.000040974235,0.000033116437,0.0000072681705,0.000008491728,0.00008612623],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986501,0.00014264212,0.00025057982,0.00037675476,0.00037222105,0.00020771222],"domain_scores_gemma":[0.9979544,0.000668644,0.0002634559,0.0008411116,0.00019153256,0.000080817576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034415224,0.00018718561,0.00023356115,0.00013347623,0.0009047046,0.00017563245,0.0012429853,0.000100077086,0.00004413132],"category_scores_gemma":[0.00011200404,0.00014539067,0.00015700574,0.00014446523,0.00024969704,0.00054457557,0.00004196361,0.00019123463,0.00007999653],"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.00013819573,0.00047103266,0.0005626418,0.00006197906,0.00007674375,0.000012624973,0.00034436025,0.049002632,0.00042060346,0.1693637,0.00006650738,0.77947897],"study_design_scores_gemma":[0.0021951564,0.0021161917,0.047203317,0.00016166047,0.000056076413,0.00007621966,0.000052410393,0.18631922,0.026648358,0.734042,0.00056830456,0.0005610949],"about_ca_topic_score_codex":0.000015673715,"about_ca_topic_score_gemma":0.000012731984,"teacher_disagreement_score":0.92852896,"about_ca_system_score_codex":0.000056384015,"about_ca_system_score_gemma":0.000085870604,"threshold_uncertainty_score":0.6958348},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020199572,0.00014755636,0.97918445,0.01295728,0.0012602977,0.00024009123,0.000008441206,0.00019578783,0.003986113],"genre_scores_gemma":[0.95499897,0.000046313675,0.042956676,0.0014320851,0.000079219855,0.00004365019,0.0000026878874,0.000010666862,0.0004297433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799055,0.0001574192,0.00035875247,0.00051619887,0.0006440579,0.0003330343],"domain_scores_gemma":[0.99625003,0.0016586396,0.00021774544,0.0015874852,0.00018058554,0.000105534426],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00054637523,0.00020940206,0.00021887041,0.00009923853,0.0025942544,0.00081174064,0.0030370466,0.00009122946,0.00002416493],"category_scores_gemma":[0.00022860947,0.00014407276,0.0001554812,0.00017435498,0.00015568922,0.0003120659,0.000056938916,0.000350631,0.00043570835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039576655,0.00023625937,0.000037878966,0.000007977594,0.000059450722,0.000048056314,0.00009993802,0.45220956,0.000012287577,0.18224116,0.00065985165,0.36434802],"study_design_scores_gemma":[0.0013883449,0.000779273,0.009395226,0.00014356218,0.00002324699,0.00021536161,0.000035960576,0.5929594,0.00010483882,0.3678587,0.02644487,0.000651195],"about_ca_topic_score_codex":0.00001123791,"about_ca_topic_score_gemma":0.000007730699,"teacher_disagreement_score":0.952979,"about_ca_system_score_codex":0.00008962519,"about_ca_system_score_gemma":0.000083671985,"threshold_uncertainty_score":0.99870425},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03861103,0.00004367337,0.9588314,0.001805165,0.00011325236,0.00041210023,0.000067843,0.00005819547,0.000057299254],"genre_scores_gemma":[0.7943814,0.0000035161954,0.20522252,0.00016786488,0.0000029272476,0.00017744805,0.00001418659,0.0000052100636,0.000024978086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987595,0.00016552981,0.00021362746,0.00033627363,0.00036122955,0.00016384502],"domain_scores_gemma":[0.9981872,0.00118783,0.00007717735,0.00034196812,0.00015665947,0.00004919691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048326823,0.00009354637,0.00013133402,0.00023039049,0.0006168976,0.00002887676,0.00047795012,0.000022905466,0.000034501783],"category_scores_gemma":[0.000057865454,0.00009875107,0.000085328924,0.00052431703,0.00013728917,0.00018963298,0.00003272498,0.00015113708,0.0000010796324],"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.00013775504,0.00023612838,0.00014547285,0.000027413704,0.000029016095,9.536757e-7,0.00026324776,0.3162593,0.00016468167,0.6445958,0.000015392596,0.03812485],"study_design_scores_gemma":[0.0005981163,0.00042675834,0.0027409443,0.0000019453812,0.0000060210355,0.000014534581,0.000042036532,0.046230704,0.00020895913,0.9494697,0.00016886099,0.000091453985],"about_ca_topic_score_codex":0.000015683107,"about_ca_topic_score_gemma":0.0000074206223,"teacher_disagreement_score":0.7557703,"about_ca_system_score_codex":0.000082298735,"about_ca_system_score_gemma":0.00014552544,"threshold_uncertainty_score":0.47447398},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023524903,0.0002573391,0.96035296,0.00067327,0.0005713097,0.00017934754,0.00001070017,0.00023204912,0.0141981505],"genre_scores_gemma":[0.9215004,0.0000032065504,0.07750773,0.00024815078,0.00009432688,0.000039111386,0.000023364853,0.000012126476,0.00057158776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982893,0.00013321282,0.00035602174,0.00053927646,0.00031451674,0.00036770574],"domain_scores_gemma":[0.9987973,0.00052002654,0.00007765718,0.00041160133,0.000113881455,0.00007953664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028940383,0.00022796533,0.00021456993,0.000358556,0.0002780291,0.00012937798,0.00082993304,0.000112978385,0.00007205085],"category_scores_gemma":[0.000010289859,0.00021266604,0.000112534115,0.0006366376,0.00006024407,0.00031912109,0.000029502477,0.00030596124,0.00035191906],"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.000030433028,0.00095456967,0.0012648606,0.000021002596,0.00003001557,0.0001154604,0.0015160078,0.7116567,0.00006976528,0.27157336,0.00085586216,0.011911961],"study_design_scores_gemma":[0.0022142571,0.0003152309,0.051748686,0.00007856883,0.000014488066,0.00015230321,0.0002100333,0.082063824,0.00026640622,0.8547652,0.0074225063,0.00074852904],"about_ca_topic_score_codex":0.000050608414,"about_ca_topic_score_gemma":0.00010287314,"teacher_disagreement_score":0.8979755,"about_ca_system_score_codex":0.00016319624,"about_ca_system_score_gemma":0.00013071555,"threshold_uncertainty_score":0.8672269},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048221614,0.000036839105,0.94831485,0.0019513849,0.0003966099,0.00049194676,0.000021129583,0.00011247629,0.00045316],"genre_scores_gemma":[0.80031323,0.000008517169,0.19908577,0.0004354604,0.000022549022,0.000076739234,0.000020297692,0.0000050059934,0.000032446223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909955,0.000060101444,0.00020046534,0.00027674675,0.00022730858,0.00013582293],"domain_scores_gemma":[0.99834585,0.0010667788,0.000112726026,0.00034755893,0.00010875002,0.000018320474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107874526,0.000107140186,0.00018086394,0.00010596978,0.000108131884,0.000037444435,0.0004036639,0.00005471706,0.000029319597],"category_scores_gemma":[0.000014367866,0.00009680464,0.00012158698,0.0002451705,0.00005182691,0.0005785465,0.000011300678,0.00006785423,0.000022037417],"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.00020669069,0.0005350728,0.00047451252,0.00012245287,0.00012563563,0.0000021652636,0.002942753,0.12494563,0.00187206,0.7991972,0.00009973394,0.069476105],"study_design_scores_gemma":[0.0014279988,0.0008158776,0.013967991,0.00006793576,0.000031356733,0.000027529397,0.00047799153,0.14975865,0.013599941,0.8193562,0.00017153863,0.0002969838],"about_ca_topic_score_codex":0.000023976952,"about_ca_topic_score_gemma":0.0000033986234,"teacher_disagreement_score":0.7520916,"about_ca_system_score_codex":0.000028978278,"about_ca_system_score_gemma":0.000029079962,"threshold_uncertainty_score":0.39475787},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072647533,0.000025053616,0.98042345,0.0099082505,0.00079668727,0.00024773355,0.000010316319,0.0005559616,0.00076779263],"genre_scores_gemma":[0.73124325,0.0000054705774,0.26735115,0.0011869534,0.00007224116,0.000010344133,0.000012465821,0.000006537388,0.000111546105],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978604,0.00013661772,0.00036271624,0.0006896297,0.0006015893,0.00034905397],"domain_scores_gemma":[0.9982856,0.00049367995,0.00008916634,0.00079622056,0.00018225543,0.00015308197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014522002,0.0002578636,0.00023437873,0.00025313886,0.00038685373,0.00017761538,0.001309804,0.00010973376,0.00023190484],"category_scores_gemma":[0.000041929412,0.0002390206,0.00019613258,0.00063132145,0.00006124974,0.0003799396,0.000029218038,0.00032566435,0.00023136626],"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.00003719414,0.0011804872,0.00001678366,0.0000074774266,0.000028796398,0.000022162903,0.00021497613,0.27180853,0.00017312006,0.07405082,0.00027858143,0.652181],"study_design_scores_gemma":[0.0006122263,0.0007167921,0.01356224,0.000014440333,0.00001099173,0.000062473024,0.000008119046,0.3034643,0.0003517563,0.68024445,0.0006079411,0.00034430227],"about_ca_topic_score_codex":0.0000059901486,"about_ca_topic_score_gemma":0.0000019484974,"teacher_disagreement_score":0.7239785,"about_ca_system_score_codex":0.00012949323,"about_ca_system_score_gemma":0.00008061732,"threshold_uncertainty_score":0.97469777},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019883553,0.000019569616,0.99231267,0.0027913796,0.0007895751,0.00021566538,0.00003468926,0.00042854197,0.0014195405],"genre_scores_gemma":[0.45400554,0.0000017896136,0.54420996,0.0014306986,0.00001680432,0.00011169468,0.000015658195,0.000007911343,0.00019994343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822617,0.000240931,0.00027966456,0.00040834298,0.00063145,0.00021343867],"domain_scores_gemma":[0.9987036,0.00032218028,0.000106552565,0.00070894853,0.000099352816,0.000059396203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047637403,0.00013323867,0.0001417154,0.00021469402,0.00067045266,0.00009720715,0.0013810811,0.00003518379,0.00038525544],"category_scores_gemma":[0.000039736322,0.00014780078,0.0000922421,0.00055942126,0.000048411217,0.00037515222,0.00006144453,0.00032622975,0.0001848386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003638832,0.00064546627,0.000017789891,0.000008853135,0.000046421923,0.000010360227,0.00039576358,0.62815934,0.00009414453,0.25659,0.00043939857,0.11355609],"study_design_scores_gemma":[0.00081884145,0.00062962715,0.004108572,0.0000078015055,0.000016948492,0.0001550068,0.00008735201,0.7050904,0.0003186675,0.27876776,0.009615025,0.00038395874],"about_ca_topic_score_codex":0.000010195669,"about_ca_topic_score_gemma":7.878219e-7,"teacher_disagreement_score":0.45201716,"about_ca_system_score_codex":0.00016859405,"about_ca_system_score_gemma":0.00008739696,"threshold_uncertainty_score":0.60271406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038063321,0.000019212435,0.988611,0.0047472822,0.00039706734,0.00021528912,0.00003535861,0.00018730697,0.001981142],"genre_scores_gemma":[0.90334487,0.0000038231497,0.09323709,0.0025292153,0.000021041562,0.00013125835,0.000013873286,0.000012361146,0.0007064992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792874,0.00026971177,0.00019914686,0.00045626517,0.00086565234,0.000280464],"domain_scores_gemma":[0.9984458,0.0007245285,0.00006701723,0.00057684944,0.000086701744,0.00009910756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031040868,0.00014104866,0.0001209114,0.00035593248,0.0009939062,0.00006517825,0.0013633008,0.000025340105,0.0005008598],"category_scores_gemma":[0.000028763938,0.00014236911,0.00010678523,0.00078638096,0.000058510144,0.00022486065,0.000067189176,0.000525559,0.00022434411],"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.000065755965,0.00030491006,0.0000059041795,0.0000017958491,0.000025476142,0.000029112221,0.0001255837,0.7933474,0.000034358953,0.16657975,0.00016347773,0.039316468],"study_design_scores_gemma":[0.000598492,0.0010347534,0.0005685734,0.0000058390146,0.0000038952094,0.00005646385,0.00007326092,0.049065217,0.00017472693,0.94523954,0.0029718021,0.00020740164],"about_ca_topic_score_codex":0.0000030390136,"about_ca_topic_score_gemma":8.3064964e-7,"teacher_disagreement_score":0.8995385,"about_ca_system_score_codex":0.00024421365,"about_ca_system_score_gemma":0.000087233995,"threshold_uncertainty_score":0.7644423},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00754662,0.00016584442,0.98241055,0.0016408735,0.00027238124,0.00016574917,0.000004776968,0.0000664785,0.007726742],"genre_scores_gemma":[0.9543398,0.000014760455,0.044926737,0.000072574374,0.00002190373,0.000025729008,0.000005108141,0.0000044159656,0.0005889857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988448,0.000092920316,0.00031766517,0.00026368408,0.00028984115,0.00019105902],"domain_scores_gemma":[0.99850816,0.0008752069,0.00009262492,0.00039429028,0.00009993329,0.0000297862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028119894,0.00011301426,0.00012422982,0.00012743364,0.00021190857,0.000058238962,0.0006410816,0.000042950505,0.000022502058],"category_scores_gemma":[0.000034388562,0.00008175294,0.00007792981,0.0004524866,0.00007702945,0.00011039649,0.000016618682,0.00014661443,0.00003390768],"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.000037264344,0.00078633474,0.00057240156,0.000012380728,0.000027514972,0.0000054073025,0.00018510697,0.29392606,0.000030618623,0.6481654,0.0004612994,0.055790238],"study_design_scores_gemma":[0.0012226342,0.000458792,0.043043263,0.000034012737,0.000012923284,0.000026071424,0.00008638153,0.23917472,0.00055630447,0.7113269,0.0037862253,0.0002717683],"about_ca_topic_score_codex":0.00007531668,"about_ca_topic_score_gemma":0.00015441688,"teacher_disagreement_score":0.94679314,"about_ca_system_score_codex":0.00006579572,"about_ca_system_score_gemma":0.00008218735,"threshold_uncertainty_score":0.33337882},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013403409,0.00011495951,0.98180366,0.0031906506,0.00016779777,0.00009641684,0.000019660461,0.00009803175,0.0011053997],"genre_scores_gemma":[0.8537271,0.000009609775,0.14586775,0.00026593186,0.000004558116,0.000035498386,0.0000045098736,0.0000030042852,0.00008202216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991727,0.00007960145,0.00017476294,0.00021716533,0.00025311016,0.00010268373],"domain_scores_gemma":[0.9990706,0.00048020124,0.0000613135,0.0002951425,0.00006542759,0.000027330814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016826126,0.000076197895,0.00011115623,0.00015343999,0.00040607926,0.000031985343,0.00046039757,0.000018595149,0.000057645902],"category_scores_gemma":[0.000018742247,0.00007277131,0.000045754576,0.00032563027,0.00007858506,0.000235,0.000041187108,0.00011313638,0.0000032398214],"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.0000053124254,0.0000661024,0.00001016357,0.0000037388588,0.00001161254,0.0000010784507,0.00039555834,0.52054423,0.000017338794,0.47220084,0.000027246671,0.006716764],"study_design_scores_gemma":[0.00015500221,0.00012968798,0.00087163755,0.0000026497341,0.000006070235,0.000031086933,0.00024278511,0.2201769,0.00010287434,0.7781509,0.00006237114,0.00006801594],"about_ca_topic_score_codex":0.000021637983,"about_ca_topic_score_gemma":0.0000021956387,"teacher_disagreement_score":0.8403237,"about_ca_system_score_codex":0.000021736862,"about_ca_system_score_gemma":0.000064722466,"threshold_uncertainty_score":0.31232744},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056345705,0.0004026956,0.9912869,0.00079067756,0.00050463254,0.00031711417,0.000045521017,0.0001242405,0.00089366385],"genre_scores_gemma":[0.9888217,0.000005771952,0.0100015905,0.0008476649,0.00003263831,0.00008862743,0.00003849349,0.000010884506,0.00015266398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984583,0.00020302349,0.00030369853,0.0003845913,0.00045685575,0.0001934884],"domain_scores_gemma":[0.99875903,0.000503003,0.00010346683,0.00042640505,0.0001271354,0.00008097741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000259214,0.00014726243,0.00022716496,0.00014330627,0.0002902301,0.000053589767,0.00086084724,0.00004060166,0.00052286725],"category_scores_gemma":[0.000030367157,0.00013153501,0.00010101977,0.0004028896,0.000050507304,0.00009756939,0.00006231777,0.00017672776,0.00020284735],"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.000055297045,0.0003769292,0.00006692696,0.000021777336,0.00013505605,0.000016949698,0.0014890144,0.3906712,0.00008291863,0.5457474,0.00019829658,0.06113826],"study_design_scores_gemma":[0.0006721971,0.0010234714,0.00077797653,0.000006013465,0.000054838274,0.000039316532,0.00041568527,0.028465195,0.00033531335,0.9588984,0.008944227,0.00036731237],"about_ca_topic_score_codex":0.00028371936,"about_ca_topic_score_gemma":0.000053031225,"teacher_disagreement_score":0.9831871,"about_ca_system_score_codex":0.00007667358,"about_ca_system_score_gemma":0.0001291034,"threshold_uncertainty_score":0.572503},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057527367,0.000027428521,0.93093157,0.010730034,0.00015403367,0.00021910755,0.00001726287,0.00011775175,0.00027541918],"genre_scores_gemma":[0.96759063,0.00002050252,0.028348567,0.0039212843,0.000013386334,0.000026142978,0.00007431027,0.0000028800068,0.0000022910983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998962,0.0001111571,0.00028038025,0.0001703162,0.00032945402,0.00014673425],"domain_scores_gemma":[0.9989775,0.00054673903,0.000082621955,0.00028142935,0.000082347855,0.000029350924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027533405,0.00011134619,0.00011674431,0.00039561882,0.00015950784,0.00007453148,0.00060279784,0.000052001935,0.0000061054375],"category_scores_gemma":[0.0000057523616,0.00008254117,0.00004491567,0.0011537643,0.000031423784,0.000482682,0.000024786415,0.00016347856,0.00005452302],"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.00003879617,0.00021361923,0.00022938146,0.000106207175,0.00003337953,0.000009277867,0.009483842,0.75243604,0.00019979484,0.16314396,0.0000673626,0.07403835],"study_design_scores_gemma":[0.0012242113,0.000435883,0.08075685,0.00008359176,0.000020786501,0.00007508124,0.00065973104,0.43900326,0.0005338622,0.47584265,0.0010596112,0.0003044801],"about_ca_topic_score_codex":0.00003957383,"about_ca_topic_score_gemma":0.000037276495,"teacher_disagreement_score":0.91006327,"about_ca_system_score_codex":0.000015649639,"about_ca_system_score_gemma":0.00003039579,"threshold_uncertainty_score":0.33659312},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068085524,0.000088953806,0.99478126,0.0023669493,0.0010292636,0.000605603,0.000042657746,0.00009911075,0.00030533405],"genre_scores_gemma":[0.5465728,0.000006351252,0.45294473,0.00014835957,0.000016029446,0.00012265162,0.000017938555,0.0000040864115,0.00016704507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872506,0.00015427452,0.00044427312,0.0002716735,0.0002508501,0.00015389042],"domain_scores_gemma":[0.99774945,0.0009270685,0.00019436196,0.0006121709,0.0004897245,0.000027247315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067926827,0.00011685728,0.00016905938,0.00011881137,0.00051944406,0.00008844816,0.00090883754,0.000066493194,0.0000024641492],"category_scores_gemma":[0.00013258758,0.00009248945,0.0000994646,0.0004027657,0.00025732195,0.00019257028,0.000012852772,0.00012147665,0.000010018722],"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.000066219756,0.00012154272,0.000025323812,0.000043386695,0.00004509299,1.3715808e-7,0.000080785285,0.113896325,0.00007344703,0.8691935,0.00019199625,0.016262254],"study_design_scores_gemma":[0.00043195873,0.00016088784,0.0020838578,0.00003227884,0.000015608888,0.000004085791,0.00007300682,0.8059425,0.00068534294,0.18536758,0.0050953683,0.00010752446],"about_ca_topic_score_codex":0.000025663523,"about_ca_topic_score_gemma":0.000004098447,"teacher_disagreement_score":0.69204617,"about_ca_system_score_codex":0.000075418015,"about_ca_system_score_gemma":0.000118144155,"threshold_uncertainty_score":0.39951962},"labels":[],"label_agreement":null}]}