{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":42,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":42,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"ff3e5a785132","filters":{"venue":"ACM Transactions on Computational Logic"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04999189289866275,"gpt":0.2705926195485807,"spread":0.220600726649918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002084537,0.000154315,0.0001596823,0.0001237707,0.0004291153,0.00005761619,0.0006951315,0.00007966332,0.0001034979],"category_scores_gemma":[0.00003965271,0.000131261,0.0001019263,0.000380958,0.0001122281,0.0002428383,0.00001567663,0.0001855402,0.0006577737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004584133,"about_ca_system_score_gemma":0.0001260635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001728657,"about_ca_topic_score_gemma":0.000003475266,"domain_scores_codex":[0.9987087,0.0001376935,0.0002267074,0.0003543781,0.0003438649,0.0002286885],"domain_scores_gemma":[0.9987921,0.0004549267,0.0000658557,0.0004160035,0.0001801144,0.0000909993],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003538072,0.0002550634,0.00006482354,0.000006078685,0.00005404316,0.00004880347,0.0006115446,0.05617321,0.00001824202,0.9045391,0.0003096155,0.03788407],"study_design_scores_gemma":[0.0007530865,0.0005756296,0.002582512,0.000003259287,0.00001190902,0.0004162274,0.00006599242,0.03176073,0.0001187071,0.9586357,0.004730043,0.0003462233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002404774,0.000100287,0.9928627,0.0005885998,0.0007173269,0.0001674133,0.00000233091,0.0003106981,0.002845863],"genre_scores_gemma":[0.9658999,0.000009607248,0.03224863,0.0007813912,0.00006448173,0.00001898672,0.000009850484,0.000009015786,0.0009581641],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9634951,"threshold_uncertainty_score":0.845457,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01697811803986092,"gpt":0.2344277660564453,"spread":0.2174496480165843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001536714,0.0001731913,0.0001554478,0.0001423873,0.0003047281,0.0001555097,0.0006100812,0.00006540378,0.00004615456],"category_scores_gemma":[0.00000358026,0.0001334551,0.00007937898,0.0004754264,0.0000700004,0.000251021,0.00001049579,0.0001475896,0.0002291849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005443747,"about_ca_system_score_gemma":0.00007463914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009270226,"about_ca_topic_score_gemma":0.00004688706,"domain_scores_codex":[0.9986343,0.0000723826,0.0002291832,0.0004018635,0.0004060007,0.00025625],"domain_scores_gemma":[0.9991013,0.00020628,0.00008245512,0.0004284436,0.0001161033,0.00006540705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001522283,0.0002771095,0.0001412129,0.000009263604,0.00003238414,0.00003528607,0.00008880124,0.1331554,0.00001959479,0.8507817,0.000201692,0.01524228],"study_design_scores_gemma":[0.0007149432,0.0003820632,0.004256314,0.000004421207,0.00001039745,0.0001393407,0.00002497928,0.009138945,0.0001391284,0.980692,0.004216864,0.0002805671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002371987,0.00005190804,0.9915575,0.001696796,0.0002329901,0.00020392,0.000002569906,0.0003325564,0.003549712],"genre_scores_gemma":[0.8196185,0.000001024447,0.1795568,0.0003516888,0.00006317463,0.00003751463,0.00001593935,0.000009168408,0.0003461479],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8172466,"threshold_uncertainty_score":0.544214,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1657644237840136,"gpt":0.3205390979875744,"spread":0.1547746742035607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002767025,0.0001530977,0.0001965897,0.0002460566,0.0002105926,0.00002115175,0.0006286067,0.00005941178,0.0002475572],"category_scores_gemma":[0.00004948295,0.0001458001,0.0001028258,0.0005860768,0.0006831394,0.0003829389,0.00002303721,0.0002513723,0.00005813881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000056499,"about_ca_system_score_gemma":0.0001172142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007661943,"about_ca_topic_score_gemma":0.00003141644,"domain_scores_codex":[0.9984904,0.0001881941,0.0003377989,0.0003618381,0.0003978117,0.0002239743],"domain_scores_gemma":[0.998376,0.0005620361,0.000146249,0.0004675456,0.0003586937,0.00008951571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005971554,0.0003144553,0.00059805,0.00002560898,0.00007669454,0.000006020633,0.0009979744,0.04329232,0.0003128838,0.920845,0.00001190853,0.03345932],"study_design_scores_gemma":[0.0004177953,0.0003588485,0.03420271,0.00002164947,0.000006000316,0.00003163394,0.00008068935,0.01959391,0.001732318,0.9433887,0.00001580584,0.0001499609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01201083,0.00001447631,0.9852003,0.0005435931,0.0001309079,0.0003199648,0.00003862103,0.0001414878,0.001599799],"genre_scores_gemma":[0.669648,0.000003940199,0.330145,0.000144223,0.000003743093,0.00002639761,0.000004261858,0.000005445033,0.00001897255],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6576372,"threshold_uncertainty_score":0.5945556,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02826933730030486,"gpt":0.2572350780560444,"spread":0.2289657407557395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002012962,0.000145849,0.0001556454,0.0001380489,0.0003151812,0.000127574,0.0003061928,0.0000677994,0.00001454599],"category_scores_gemma":[0.00002181297,0.0001377064,0.00005758926,0.0004419348,0.0000618058,0.0003723658,0.00002187754,0.0001761616,0.00002375897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007405273,"about_ca_system_score_gemma":0.00008213166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009341087,"about_ca_topic_score_gemma":0.000177584,"domain_scores_codex":[0.998843,0.00006085612,0.0002597908,0.0003738413,0.0002145826,0.0002479065],"domain_scores_gemma":[0.999222,0.0002973961,0.00005540006,0.0002822347,0.0000816521,0.00006134038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004586852,0.000203538,0.000508462,0.000007377858,0.000006205617,0.000003755023,0.00009537423,0.768661,0.00002720281,0.2282507,0.00005917136,0.002172553],"study_design_scores_gemma":[0.0002738938,0.00003110326,0.005731964,0.000008663006,0.000006484068,0.0000104774,0.00001134675,0.6472245,0.00006387549,0.346417,0.00009851399,0.0001220844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02688276,0.0000728716,0.9698123,0.001354618,0.0001703883,0.0001265564,0.000009732352,0.0001431665,0.001427631],"genre_scores_gemma":[0.9081866,0.00001208153,0.091282,0.0001657361,0.0000251814,0.00002230712,0.000009770581,0.000006307157,0.0002900785],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8813038,"threshold_uncertainty_score":0.5615503,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08719166760923303,"gpt":0.273118851588242,"spread":0.185927183979009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001218203,0.000194716,0.0002511922,0.0002757478,0.0004558666,0.00002538375,0.0007631589,0.0001051299,0.0001112909],"category_scores_gemma":[0.00007157862,0.0001761084,0.0001817202,0.0007364351,0.0002215764,0.0003252352,0.00002720816,0.000256241,0.0002579741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006841662,"about_ca_system_score_gemma":0.000196183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002652646,"about_ca_topic_score_gemma":0.000008033145,"domain_scores_codex":[0.9985338,0.0001021498,0.0003397038,0.000424512,0.0003520143,0.0002477983],"domain_scores_gemma":[0.998307,0.0006551835,0.0001405484,0.0004828719,0.0003124242,0.000102001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004586393,0.001902764,0.0003200193,0.00002293503,0.000151034,0.00006682426,0.002363994,0.1397116,0.0002420059,0.8408493,0.0003538299,0.01396982],"study_design_scores_gemma":[0.001134911,0.0007403982,0.01907398,0.00002981502,0.00003111065,0.0003602596,0.00009188653,0.02706919,0.001088136,0.9495775,0.0003475019,0.0004553024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01538821,0.00007208137,0.976098,0.0009446272,0.000281427,0.0001947457,0.00002401309,0.0001841412,0.006812778],"genre_scores_gemma":[0.7944648,0.00004343054,0.2049014,0.0003897377,0.00002895222,0.00004188987,0.00001245804,0.000007744123,0.0001096134],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7790766,"threshold_uncertainty_score":0.7181492,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02945810078838233,"gpt":0.2759510668570427,"spread":0.2464929660686604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003634844,0.0001850889,0.0001382904,0.0002382008,0.0003888438,0.0001707527,0.0005438717,0.00006520627,0.00001331888],"category_scores_gemma":[0.00004285612,0.0001235167,0.00007422692,0.001019266,0.00006729205,0.0001870698,0.000006823499,0.0002787881,0.0001030419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001153633,"about_ca_system_score_gemma":0.0001509995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002080516,"about_ca_topic_score_gemma":0.0001641883,"domain_scores_codex":[0.9985436,0.0002098797,0.0002067242,0.0003979443,0.000369065,0.0002728185],"domain_scores_gemma":[0.9981757,0.001144706,0.00007056406,0.0003999825,0.0001550272,0.00005397918],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007024954,0.0008133386,0.0001098534,0.00001044177,0.00001824063,0.00007219181,0.002008301,0.6840578,0.000007897092,0.05046314,0.00003807498,0.2623305],"study_design_scores_gemma":[0.001553205,0.0009316435,0.007354265,0.00009379749,0.0000206216,0.0001495192,0.0001886074,0.9306037,0.00007974255,0.0578617,0.0007911724,0.0003720392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02002904,0.00002917536,0.9751883,0.002116438,0.0001444548,0.0003212606,0.000001054718,0.0001548165,0.00201548],"genre_scores_gemma":[0.9226236,0.000001784607,0.07642996,0.000808738,0.00003537302,0.00002812197,0.00001114451,0.000008660698,0.00005262676],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9025946,"threshold_uncertainty_score":0.5036867,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04956502520449148,"gpt":0.2997099780135482,"spread":0.2501449528090567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000433811,0.0004492062,0.0003888606,0.0006368675,0.0005731716,0.0002916081,0.001300141,0.0001845812,0.0001133533],"category_scores_gemma":[0.0001790376,0.0004470786,0.0003003723,0.001618854,0.0001637641,0.0005732497,0.00005139199,0.0005714477,0.0008555612],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005122932,"about_ca_system_score_gemma":0.0003085693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006434211,"about_ca_topic_score_gemma":0.00000910687,"domain_scores_codex":[0.996439,0.000151081,0.000658603,0.001082677,0.001119539,0.0005490998],"domain_scores_gemma":[0.9961216,0.002262819,0.000223301,0.0008063928,0.0003258811,0.0002599714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001196868,0.0002494905,0.00000580991,0.00001101403,0.00007339974,0.00003463806,0.0001390821,0.9070118,0.00002659385,0.04101337,0.00004844518,0.05126667],"study_design_scores_gemma":[0.009241427,0.003451559,0.01493225,0.00007291154,0.00007845465,0.00009259531,0.00006943378,0.383669,0.001937299,0.5844145,0.0005901174,0.001450526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02413411,0.00004440748,0.9669604,0.004654528,0.002020736,0.0004898666,0.00003135106,0.0007127391,0.0009518426],"genre_scores_gemma":[0.7745017,0.000005955148,0.2243137,0.0009458123,0.0001174476,0.00004450257,0.00004051972,0.00002175266,0.000008650376],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7503676,"threshold_uncertainty_score":0.9999224,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02998419991651737,"gpt":0.2864637845921789,"spread":0.2564795846756616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002894038,0.0002279653,0.0002145699,0.000358556,0.0002780291,0.000129378,0.000829933,0.0001129784,0.00007205085],"category_scores_gemma":[0.00001028986,0.000212666,0.0001125341,0.0006366376,0.00006024407,0.0003191211,0.00002950248,0.0003059612,0.0003519191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001631962,"about_ca_system_score_gemma":0.0001307155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005060841,"about_ca_topic_score_gemma":0.0001028731,"domain_scores_codex":[0.9982893,0.0001332128,0.0003560217,0.0005392765,0.0003145167,0.0003677057],"domain_scores_gemma":[0.9987973,0.0005200265,0.00007765718,0.0004116013,0.0001138815,0.00007953664],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003043303,0.0009545697,0.001264861,0.0000210026,0.00003001557,0.0001154604,0.001516008,0.7116567,0.00006976528,0.2715734,0.0008558622,0.01191196],"study_design_scores_gemma":[0.002214257,0.0003152309,0.05174869,0.00007856883,0.00001448807,0.0001523032,0.0002100333,0.08206382,0.0002664062,0.8547652,0.007422506,0.000748529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0235249,0.0002573391,0.960353,0.00067327,0.0005713097,0.0001793475,0.00001070017,0.0002320491,0.01419815],"genre_scores_gemma":[0.9215004,0.00000320655,0.07750773,0.0002481508,0.00009432688,0.00003911139,0.00002336485,0.00001212648,0.0005715878],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8979755,"threshold_uncertainty_score":0.8672269,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01645680513454797,"gpt":0.2515546325590415,"spread":0.2350978274244935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004778799,0.0001893186,0.0002008083,0.0002774752,0.0001934985,0.000121791,0.0007906117,0.00009741655,0.00009673936],"category_scores_gemma":[0.00006828116,0.0001860146,0.00009364541,0.0006625865,0.00006076703,0.0004559747,0.00002315733,0.0002118311,0.0001683602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007018301,"about_ca_system_score_gemma":0.00005750421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002824345,"about_ca_topic_score_gemma":0.0000098419,"domain_scores_codex":[0.9982145,0.0002585567,0.0003685827,0.0005022957,0.0003814789,0.0002745198],"domain_scores_gemma":[0.998311,0.0008652849,0.00009353099,0.0005523815,0.00008849375,0.00008926471],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001105483,0.0004496937,0.00007439437,0.00001307713,0.00002158615,0.00000885293,0.0003383507,0.2672625,0.00002534059,0.2269261,0.0001332375,0.5047357],"study_design_scores_gemma":[0.000460012,0.00008714887,0.00799774,0.00001558791,0.000004108579,0.00001815495,0.00001561727,0.5569309,0.0001385272,0.4338293,0.0003211233,0.0001817693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006430177,0.0000221498,0.9896711,0.00250242,0.0003650301,0.0001566418,0.0000118582,0.000284143,0.0005564507],"genre_scores_gemma":[0.6803432,0.00000499687,0.3178011,0.001690916,0.00003885641,0.00002615612,0.00002848372,0.000009806734,0.00005656051],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.673913,"threshold_uncertainty_score":0.7585456,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02121284245199038,"gpt":0.2584923929182951,"spread":0.2372795504663047,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002633377,0.00009962591,0.0001086742,0.0001582023,0.0002321787,0.0000560423,0.0006932738,0.00003129684,0.00001953637],"category_scores_gemma":[0.00001874607,0.00007827116,0.00007809214,0.0005712325,0.00009937338,0.0001086321,0.00001826685,0.0001565132,0.0000120618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004235187,"about_ca_system_score_gemma":0.00005355792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009353099,"about_ca_topic_score_gemma":0.0001248646,"domain_scores_codex":[0.9988602,0.00008263104,0.0003219274,0.0002389569,0.0003289687,0.0001672604],"domain_scores_gemma":[0.9984304,0.0009773573,0.00007823286,0.0004173417,0.00007337179,0.0000232713],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002157298,0.0004884526,0.0001341121,0.000007051865,0.000017391,0.000003129888,0.00005772747,0.3579196,0.00001243998,0.562892,0.0001558663,0.07829066],"study_design_scores_gemma":[0.0004616996,0.0001768165,0.01456406,0.00001722326,0.000004044231,0.00001102552,0.000033479,0.2433649,0.0001871536,0.7396906,0.001373426,0.0001155606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00451899,0.00008093148,0.9906303,0.002755715,0.0002311166,0.0001370528,0.000008467618,0.00005348567,0.001583904],"genre_scores_gemma":[0.8462308,0.00001122625,0.1534484,0.00009045453,0.00001538344,0.00002146946,0.000004839415,0.000003520698,0.0001739177],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8417118,"threshold_uncertainty_score":0.3191805,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06109427292373652,"gpt":0.284544185857898,"spread":0.2234499129341615,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000219281,0.0002200675,0.0002041731,0.0003337853,0.0001959909,0.000181591,0.0008943233,0.0000973487,0.00004805807],"category_scores_gemma":[0.00002933995,0.0001943747,0.00009547072,0.0008254501,0.00005765322,0.0004871385,0.00003710989,0.0002438405,0.0003752702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009704497,"about_ca_system_score_gemma":0.00006665019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000768109,"about_ca_topic_score_gemma":0.00002078061,"domain_scores_codex":[0.9983252,0.00008873502,0.0002713643,0.0005758799,0.0003302598,0.0004085461],"domain_scores_gemma":[0.9989763,0.00019343,0.00005172524,0.0004537147,0.0001565682,0.000168208],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001165508,0.0009491427,0.0001427268,0.00003305874,0.00002298377,0.000005265157,0.006134407,0.61857,0.00001350784,0.2305031,0.000148262,0.1434658],"study_design_scores_gemma":[0.0003423255,0.0001642041,0.002492147,0.00001911617,0.000005322444,0.00001989892,0.00005381896,0.8291731,0.0000127349,0.1673105,0.0001534239,0.0002534247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007115841,0.00004300266,0.9872185,0.00184929,0.0001595241,0.0008334902,0.000005658409,0.0002172682,0.002557424],"genre_scores_gemma":[0.6680886,0.000003123023,0.3301286,0.001090832,0.00003099763,0.0005469008,0.00001127815,0.000009975043,0.00008965355],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6609728,"threshold_uncertainty_score":0.7926372,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02990417311902534,"gpt":0.2711068560446593,"spread":0.2412026829256339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001743209,0.0002809462,0.0002328998,0.0001695688,0.0005073734,0.0002153757,0.0008581381,0.0001339288,0.00002720274],"category_scores_gemma":[0.000037407,0.0002246051,0.0001571995,0.0004724401,0.0001020091,0.0004914995,0.00001814418,0.0002208011,0.0001586823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009485896,"about_ca_system_score_gemma":0.0002563984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004387302,"about_ca_topic_score_gemma":0.00005706555,"domain_scores_codex":[0.9982418,0.00004482605,0.000308021,0.0005972733,0.0004158606,0.0003922158],"domain_scores_gemma":[0.9983669,0.0004360706,0.0001289876,0.0004969718,0.0004260643,0.0001450109],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004041635,0.0005130914,0.00001911467,0.00002101372,0.00005035217,0.00000348098,0.0005071409,0.7821868,0.0000159564,0.181179,0.000277321,0.03518629],"study_design_scores_gemma":[0.0008882741,0.0005663975,0.00006688788,0.00002253903,0.00002943892,0.00005991354,0.00003595863,0.7623135,0.0001117901,0.2341659,0.001452898,0.000286573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003146246,0.00004400289,0.9845524,0.01017923,0.0001314063,0.0006403342,0.00001236382,0.0003708459,0.0009231034],"genre_scores_gemma":[0.5346053,0.000004712252,0.4638368,0.0008781275,0.00006313613,0.0001226742,0.00003076577,0.00001285304,0.0004455871],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5314591,"threshold_uncertainty_score":0.915913,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03676618893922188,"gpt":0.244743616054268,"spread":0.2079774271150462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003088722,0.0001827587,0.0002521133,0.000184203,0.0002545243,0.00007229058,0.0007963335,0.00006998123,0.000004209006],"category_scores_gemma":[0.0000413392,0.000148369,0.0001187149,0.0003214171,0.00007161524,0.0001489749,0.0000297668,0.0002217347,0.00004624488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002572595,"about_ca_system_score_gemma":0.00007726079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001744509,"about_ca_topic_score_gemma":3.689753e-7,"domain_scores_codex":[0.9984919,0.0001240305,0.0003613906,0.0003756584,0.0004200865,0.0002269068],"domain_scores_gemma":[0.9988487,0.0002771555,0.0001354832,0.0004830909,0.0001840374,0.000071567],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007143996,0.0000972001,0.000002004622,0.00003094667,0.00002066592,8.236359e-7,0.0001980635,0.9646993,0.0005415397,0.0230681,0.000011274,0.011323],"study_design_scores_gemma":[0.0002231708,0.0001644215,0.00005118934,0.00008913295,0.00000771002,0.00002467503,0.00000678678,0.9628078,0.0004518153,0.03595009,0.00005352276,0.0001696265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03549769,0.00006214307,0.9627749,0.0009091283,0.0002682061,0.0001431751,0.000006176043,0.00023313,0.0001054041],"genre_scores_gemma":[0.8209698,0.000001745987,0.1787173,0.0001716374,0.0000458207,0.00001041908,0.000002957756,0.00001104655,0.00006928275],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7854722,"threshold_uncertainty_score":0.605031,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02347817064120366,"gpt":0.2674313034098341,"spread":0.2439531327686304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001908515,0.0001355029,0.0001524838,0.0001522164,0.0002271113,0.00004655762,0.0005958984,0.00006029923,0.000149356],"category_scores_gemma":[0.00003708092,0.0001192609,0.0001115007,0.000433122,0.00009767383,0.0002845127,0.00001973435,0.0001203265,0.00009994426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005809635,"about_ca_system_score_gemma":0.00007033307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001998394,"about_ca_topic_score_gemma":0.000009697043,"domain_scores_codex":[0.9988921,0.00008657572,0.0002499629,0.00028068,0.0003128656,0.0001777778],"domain_scores_gemma":[0.9990286,0.000324032,0.00009312921,0.000334763,0.0001634925,0.00005601581],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007687727,0.000710953,0.0003730461,0.00001649066,0.00008217448,0.00001616382,0.0009699594,0.06191973,0.0006099846,0.8703011,0.0001892847,0.06473423],"study_design_scores_gemma":[0.0009916928,0.0005281639,0.01360906,0.00002777022,0.00002365967,0.000114136,0.0001515868,0.03806549,0.002633751,0.9426211,0.0009210604,0.0003125489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02708956,0.00006044114,0.9650316,0.0007451971,0.0003166724,0.0001275338,0.000007521359,0.0001477245,0.006473774],"genre_scores_gemma":[0.9292048,0.00002205666,0.07027992,0.0002531057,0.00003253321,0.00001534273,0.0000108652,0.000005375819,0.0001760177],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9021152,"threshold_uncertainty_score":0.486332,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03172090831785155,"gpt":0.2671615229607867,"spread":0.2354406146429352,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001684715,0.0002802763,0.0002331127,0.0002036305,0.0005587833,0.0002844894,0.00101376,0.0001324218,0.0009118323],"category_scores_gemma":[0.00005655692,0.000230434,0.0001642741,0.0007326357,0.0001237842,0.0005959176,0.00004427169,0.0003236218,0.002125398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008357746,"about_ca_system_score_gemma":0.0001318421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003746783,"about_ca_topic_score_gemma":0.000005354377,"domain_scores_codex":[0.9979449,0.0001093293,0.0003403672,0.0006470343,0.0005085206,0.0004498729],"domain_scores_gemma":[0.9980158,0.0005977956,0.0001062218,0.0005607049,0.0005316438,0.000187858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001687609,0.001245375,0.0001253201,0.00002757179,0.0001110123,0.00004024737,0.0003437459,0.1218559,0.0001170236,0.5167671,0.002403717,0.3569461],"study_design_scores_gemma":[0.0009812058,0.0005122596,0.02025345,0.00003437722,0.00002468606,0.0001356916,0.00004132777,0.1130091,0.00007935134,0.8547828,0.00945903,0.0006866544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001702942,0.0001359814,0.9865448,0.006524358,0.0008348589,0.0004003278,0.000003686513,0.0005124403,0.003340556],"genre_scores_gemma":[0.6067829,0.000006703253,0.3900338,0.001839991,0.00008448337,0.0001291743,0.00001631734,0.00001285144,0.001093775],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6050799,"threshold_uncertainty_score":0.9986516,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0655201784738755,"gpt":0.3138251653201195,"spread":0.248304986846244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005463752,0.0002094021,0.0002188704,0.00009923853,0.002594254,0.0008117406,0.003037047,0.00009122946,0.00002416493],"category_scores_gemma":[0.0002286095,0.0001440728,0.0001554812,0.000174355,0.0001556892,0.0003120659,0.00005693892,0.000350631,0.0004357084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008962519,"about_ca_system_score_gemma":0.00008367198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001123791,"about_ca_topic_score_gemma":0.000007730699,"domain_scores_codex":[0.9979905,0.0001574192,0.0003587525,0.0005161989,0.0006440579,0.0003330343],"domain_scores_gemma":[0.99625,0.00165864,0.0002177454,0.001587485,0.0001805855,0.0001055344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003957665,0.0002362594,0.00003787897,0.000007977594,0.00005945072,0.00004805631,0.00009993802,0.4522096,0.00001228758,0.1822412,0.0006598516,0.364348],"study_design_scores_gemma":[0.001388345,0.000779273,0.009395226,0.0001435622,0.00002324699,0.0002153616,0.00003596058,0.5929594,0.0001048388,0.3678587,0.02644487,0.000651195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002019957,0.0001475564,0.9791844,0.01295728,0.001260298,0.0002400912,0.000008441206,0.0001957878,0.003986113],"genre_scores_gemma":[0.954999,0.00004631367,0.04295668,0.001432085,0.00007921986,0.00004365019,0.000002687887,0.00001066686,0.0004297433],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.952979,"threshold_uncertainty_score":0.9987043,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1477206214645475,"gpt":0.3420534356106389,"spread":0.1943328141460914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007987808,0.0001841996,0.0001718563,0.0001753452,0.0004739989,0.00009660419,0.0008331424,0.0001005933,0.00005021597],"category_scores_gemma":[0.0001170006,0.0001737629,0.0001461404,0.0003489881,0.00005310504,0.001008614,0.00001889726,0.0002195851,0.0001225442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001097978,"about_ca_system_score_gemma":0.00005931692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007946599,"about_ca_topic_score_gemma":0.000001663756,"domain_scores_codex":[0.9984775,0.0001470104,0.000322488,0.0003521695,0.0003239824,0.0003768526],"domain_scores_gemma":[0.9983915,0.0006807793,0.0001300603,0.0005183135,0.0001512206,0.0001281361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003216885,0.0004604626,0.0001992811,0.00003202997,0.00003718379,5.083449e-7,0.0003717631,0.4774639,0.00006836201,0.4376876,0.0001693753,0.08347743],"study_design_scores_gemma":[0.0008163161,0.0003281761,0.01206539,0.0000194423,0.00002797973,0.00004983323,0.00004327124,0.5265303,0.0008936879,0.4563946,0.002329719,0.0005013385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001635271,0.00005056458,0.9947796,0.001342307,0.001079624,0.0003841514,0.00002126366,0.0002931607,0.0004140219],"genre_scores_gemma":[0.4391695,0.000001836883,0.5599852,0.0006376735,0.00007214854,0.00006588457,0.00001565794,0.000007756661,0.00004434665],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4375342,"threshold_uncertainty_score":0.7085845,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03058921425536587,"gpt":0.2715346414251692,"spread":0.2409454271698033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002470399,0.0002087833,0.000233629,0.0002745452,0.0002141072,0.00009673979,0.0006768834,0.00009233691,0.00001778127],"category_scores_gemma":[0.00005653512,0.0001872627,0.0001375993,0.00073548,0.00005613988,0.0002826552,0.00001790174,0.0001680328,0.00006337411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009922346,"about_ca_system_score_gemma":0.0001010078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006740702,"about_ca_topic_score_gemma":0.000003376696,"domain_scores_codex":[0.9983621,0.0001440032,0.0003416883,0.000506448,0.0003539498,0.0002918683],"domain_scores_gemma":[0.9989603,0.0001446497,0.0001308529,0.0004284863,0.0002182113,0.0001175367],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003420579,0.002925361,0.0002378814,0.00009550198,0.0001017418,0.00001172916,0.001831928,0.1876355,0.002219883,0.5835656,0.00004748896,0.2212932],"study_design_scores_gemma":[0.001586339,0.001447238,0.01893808,0.00008084651,0.00005392421,0.0002846796,0.0001850681,0.6603329,0.002025993,0.3125722,0.001450391,0.001042393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02139404,0.00003014541,0.9726061,0.0004209333,0.000290754,0.0003995822,0.000005966963,0.0001644357,0.004688086],"genre_scores_gemma":[0.6280515,0.000002944425,0.37134,0.0003070703,0.00001051567,0.00006707302,0.000021317,0.000007833855,0.0001917609],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6066574,"threshold_uncertainty_score":0.7636352,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05707745779628404,"gpt":0.361903936170222,"spread":0.3048264783739379,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001089695,0.0001502075,0.0001661811,0.0001625104,0.0004167787,0.00006361008,0.001236827,0.00007695504,0.0001442035],"category_scores_gemma":[0.0002581823,0.000113195,0.0001182717,0.0005017267,0.0001843928,0.0002115451,0.00002281022,0.0004753767,0.00005042921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003011472,"about_ca_system_score_gemma":0.00007442836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008071108,"about_ca_topic_score_gemma":0.000001620235,"domain_scores_codex":[0.9983271,0.0004055371,0.0003379792,0.0003166838,0.0004448973,0.0001677659],"domain_scores_gemma":[0.9954948,0.00328592,0.0001734726,0.0007389447,0.0002512868,0.00005553706],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001841872,0.0001509443,0.00000478276,0.000004821428,0.00002106961,7.965479e-7,0.00007880665,0.1055949,0.002855345,0.8636873,0.00002526208,0.02755756],"study_design_scores_gemma":[0.0002325054,0.0001826033,0.00605024,0.00002110737,0.00001000401,0.00005555577,0.00001651173,0.4323102,0.009719362,0.5509886,0.0002516133,0.0001616908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01157763,0.000005538198,0.9837243,0.002592409,0.0006866813,0.0001905468,0.00001805979,0.0001041733,0.001100655],"genre_scores_gemma":[0.4300863,6.56687e-7,0.5692679,0.0005794356,0.00001627016,0.00002654607,0.000006759422,0.000005249367,0.00001080381],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4185087,"threshold_uncertainty_score":0.4615958,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05282286613692782,"gpt":0.2922538593864074,"spread":0.2394309932494795,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001626343,0.0001835353,0.0001686214,0.0002035996,0.0004444297,0.0001953538,0.0005726845,0.0001010377,0.00003939531],"category_scores_gemma":[0.00001337267,0.0001645891,0.00009943661,0.0006024371,0.00005516857,0.0004717284,0.000009152091,0.0001864615,0.0000759739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001093813,"about_ca_system_score_gemma":0.00009482567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002354367,"about_ca_topic_score_gemma":0.000006382041,"domain_scores_codex":[0.9986019,0.00007719655,0.0002794498,0.000404466,0.0003700073,0.0002670217],"domain_scores_gemma":[0.9991528,0.0001337086,0.0001026561,0.0003768886,0.0001508341,0.00008314662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001156892,0.0002727078,0.0001247976,0.000006986056,0.00002936106,0.00002012708,0.0001849909,0.434296,0.0002401383,0.4875365,0.00001702078,0.07725973],"study_design_scores_gemma":[0.001055531,0.0005011277,0.02708503,0.00001985814,0.000033818,0.0001407559,0.00002353786,0.1865266,0.0003388112,0.7817532,0.001927711,0.0005941003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006181455,0.00007820076,0.9905441,0.00106375,0.0006796174,0.0001836367,0.00000144757,0.0003203355,0.0009474513],"genre_scores_gemma":[0.9021199,0.00000323671,0.09703092,0.0005963216,0.00008897176,0.000007975159,0.00001004852,0.000005958651,0.0001366292],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8959385,"threshold_uncertainty_score":0.6711747,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02498019671775906,"gpt":0.2537081889100911,"spread":0.228727992192332,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002966771,0.0001741315,0.0001518628,0.0001851968,0.000556242,0.0001446565,0.0004008211,0.0001142865,0.0006555457],"category_scores_gemma":[0.0002126165,0.0001819408,0.00008102733,0.0006168529,0.00009307014,0.0004311559,0.000007174025,0.0001798973,0.00009305392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008649458,"about_ca_system_score_gemma":0.0003324141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007670992,"about_ca_topic_score_gemma":0.00001309902,"domain_scores_codex":[0.9986131,0.00006510896,0.0002800065,0.0004473346,0.0003159413,0.0002785531],"domain_scores_gemma":[0.9982617,0.0007918558,0.00008883615,0.0003648564,0.0003941657,0.00009856363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005742659,0.00008738163,0.00003668909,0.000008347233,0.00001782978,0.000001257527,0.00004070547,0.5293209,0.000005853951,0.4601052,0.00009844692,0.01027164],"study_design_scores_gemma":[0.001451958,0.0002022143,0.000730899,0.00002459836,0.00002085153,0.0001359755,0.00005659477,0.3191902,0.0001817517,0.6721962,0.005404122,0.0004046353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000752152,0.00001490333,0.9934899,0.001462664,0.0004819384,0.0003827976,0.00002641734,0.0001995289,0.003866629],"genre_scores_gemma":[0.3626815,0.000005177201,0.6361691,0.0008154932,0.000008246566,0.00007676371,0.00001192364,0.000007815524,0.0002239959],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3626063,"threshold_uncertainty_score":0.7419332,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02634749071562523,"gpt":0.2864411757482443,"spread":0.2600936850326191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005099186,0.0001671449,0.0001934262,0.0001247179,0.0002615948,0.0001234601,0.0002728609,0.0001076798,0.00002518723],"category_scores_gemma":[0.00005014265,0.0001337669,0.00006509464,0.0002439316,0.0001618614,0.0002164722,0.00002346921,0.0001719098,0.00001508991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003628893,"about_ca_system_score_gemma":0.00003076231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001301757,"about_ca_topic_score_gemma":0.0001597956,"domain_scores_codex":[0.9986942,0.00009360341,0.0002598865,0.0004452708,0.0002634069,0.0002436406],"domain_scores_gemma":[0.9986282,0.0008266848,0.00006307317,0.0002895049,0.00007530813,0.0001172106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001327118,0.0006469938,0.009454044,0.00007496299,0.0001280992,0.00009947708,0.001242061,0.006915174,0.0001543403,0.7306288,0.00007277896,0.2504506],"study_design_scores_gemma":[0.001471378,0.0004973903,0.4559462,0.000007581141,0.00002853024,0.0001989828,0.000175173,0.01113386,0.0001106452,0.5289695,0.00103447,0.0004263217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1076743,0.0002639216,0.8902591,0.0006993489,0.0001401498,0.0001993078,0.000002733822,0.0001814505,0.0005796861],"genre_scores_gemma":[0.9697906,0.00001251172,0.0296037,0.0004739383,0.00003529699,0.00001178799,0.000005949457,0.000006072619,0.00006019183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8621163,"threshold_uncertainty_score":0.5454856,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0547705234772416,"gpt":0.2592648288224847,"spread":0.2044943053452432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003850874,0.0003141904,0.0002915519,0.0002549538,0.0004621166,0.0002558921,0.001022541,0.0001264988,0.0004691256],"category_scores_gemma":[0.00007861642,0.0003107899,0.00014358,0.0006776537,0.00021011,0.0005662671,0.00005743112,0.0003916404,0.00038391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001495564,"about_ca_system_score_gemma":0.00003767171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001766787,"about_ca_topic_score_gemma":0.000006822239,"domain_scores_codex":[0.997403,0.0001397137,0.0005338651,0.0009759428,0.0005810101,0.0003664486],"domain_scores_gemma":[0.9970863,0.001352621,0.0001411895,0.0009902193,0.0002253135,0.000204317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001738433,0.001667299,0.0003657395,0.00005490308,0.0000692801,0.00002230219,0.0007069698,0.2512004,0.00008398364,0.05041209,0.0003710783,0.6950285],"study_design_scores_gemma":[0.0006027973,0.0002177476,0.1016891,0.00001364894,0.00001159153,0.00009472387,0.00002231037,0.5563487,0.00007185142,0.3398317,0.0006739598,0.0004218477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02353142,0.0001703104,0.9668118,0.007019779,0.0004518865,0.0003944216,0.00001780582,0.0005237699,0.001078747],"genre_scores_gemma":[0.779994,0.00002481408,0.2192593,0.0005703616,0.00005787702,0.00002730526,0.000009232246,0.00001240365,0.00004465257],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7564626,"threshold_uncertainty_score":0.9999344,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03283917579971757,"gpt":0.2840790779650231,"spread":0.2512399021653055,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002273836,0.0001781793,0.0002314155,0.0001279774,0.0002558734,0.00008088573,0.000304998,0.00006213818,0.00003015648],"category_scores_gemma":[0.00003405722,0.0001126898,0.00004840791,0.0002591829,0.0001299969,0.0004606891,0.00001681936,0.00008193548,0.00004256702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004150381,"about_ca_system_score_gemma":0.00007566029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004084677,"about_ca_topic_score_gemma":0.00001311689,"domain_scores_codex":[0.9986108,0.000138885,0.0003196988,0.0004211504,0.0003207153,0.0001887619],"domain_scores_gemma":[0.998336,0.0006561251,0.0002341373,0.0003175132,0.0003906743,0.00006553104],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001812166,0.0003665811,0.0006394534,0.00008320419,0.0001641037,0.00001093839,0.0005466154,0.1420973,0.005634749,0.7998697,0.0001165424,0.05028962],"study_design_scores_gemma":[0.005461965,0.002985551,0.004708462,0.00013892,0.00008962203,0.0003281032,0.000157141,0.1457951,0.004481826,0.8330823,0.001825144,0.0009458442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003986229,0.00003812518,0.9937503,0.0003855874,0.0002483866,0.0002752616,0.000007574517,0.0001260493,0.001182521],"genre_scores_gemma":[0.9185826,0.000006064703,0.08101959,0.0001544284,0.00004081817,0.00004825038,0.000009317154,0.000007729732,0.0001312736],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9145963,"threshold_uncertainty_score":0.4595356,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06790359646617276,"gpt":0.2596512324328837,"spread":0.191747635966711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001367342,0.0001734414,0.0001445371,0.0001839265,0.0004451187,0.0001330914,0.0009156084,0.00006444129,0.00008608264],"category_scores_gemma":[0.00001767685,0.0001502632,0.000117597,0.0005154359,0.0001432374,0.0003471963,0.00003134787,0.0002554287,0.0001747004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000634964,"about_ca_system_score_gemma":0.00006220731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002739048,"about_ca_topic_score_gemma":0.00001374701,"domain_scores_codex":[0.9986635,0.00006620259,0.0002327652,0.0003918049,0.0003795653,0.0002661652],"domain_scores_gemma":[0.9990811,0.0002216726,0.0000490342,0.0004424902,0.0001171348,0.00008850553],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001565019,0.000236148,0.00002199656,0.000007622528,0.00003251152,0.00003752799,0.0002139755,0.7678852,0.00001773398,0.05903503,0.00004926297,0.1724473],"study_design_scores_gemma":[0.0003917665,0.0001966517,0.001383903,0.00002820036,0.00001025491,0.0002310134,0.00006939051,0.5433894,0.0002535824,0.4515345,0.002196326,0.000315076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002816859,0.000105362,0.9914817,0.003613497,0.0003883759,0.00012808,0.000004306659,0.0003534816,0.00110831],"genre_scores_gemma":[0.8264866,0.00001700063,0.1721672,0.001090265,0.00003890662,0.00002043007,0.000003905107,0.000006972938,0.0001687486],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8236697,"threshold_uncertainty_score":0.6127557,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02643501812986163,"gpt":0.2741020397308102,"spread":0.2476670216009485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014522,0.0002578636,0.0002343787,0.0002531389,0.0003868537,0.0001776154,0.001309804,0.0001097338,0.0002319048],"category_scores_gemma":[0.00004192941,0.0002390206,0.0001961326,0.0006313215,0.00006124974,0.0003799396,0.00002921804,0.0003256644,0.0002313663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001294932,"about_ca_system_score_gemma":0.00008061732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005990149,"about_ca_topic_score_gemma":0.000001948497,"domain_scores_codex":[0.9978604,0.0001366177,0.0003627162,0.0006896297,0.0006015893,0.000349054],"domain_scores_gemma":[0.9982856,0.00049368,0.00008916634,0.0007962206,0.0001822554,0.000153082],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003719414,0.001180487,0.00001678366,0.000007477427,0.0000287964,0.0000221629,0.0002149761,0.2718085,0.0001731201,0.07405082,0.0002785814,0.652181],"study_design_scores_gemma":[0.0006122263,0.0007167921,0.01356224,0.00001444033,0.00001099173,0.00006247302,0.000008119046,0.3034643,0.0003517563,0.6802444,0.0006079411,0.0003443023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007264753,0.00002505362,0.9804235,0.009908251,0.0007966873,0.0002477336,0.00001031632,0.0005559616,0.0007677926],"genre_scores_gemma":[0.7312433,0.000005470577,0.2673512,0.001186953,0.00007224116,0.00001034413,0.00001246582,0.000006537388,0.0001115461],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7239785,"threshold_uncertainty_score":0.9746978,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Bounded function; Type (biology); Mathematics; Resource (disambiguation); Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.09452582875744181,"gpt":0.3083196057574211,"spread":0.2137937769999793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003275795,0.000156341,0.0001842685,0.000106882,0.000446823,0.0002070267,0.0003673621,0.00007579594,0.00009926602],"category_scores_gemma":[0.00005480789,0.0001418025,0.0001018755,0.0002795853,0.00009082194,0.000222982,0.00001641172,0.0001306974,0.00008409988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005422283,"about_ca_system_score_gemma":0.00003097171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002583064,"about_ca_topic_score_gemma":0.00001698934,"domain_scores_codex":[0.998665,0.0001082108,0.0002686167,0.0004426814,0.0002863647,0.0002291206],"domain_scores_gemma":[0.9986872,0.0005664126,0.00009706223,0.0003404962,0.000213131,0.00009567075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005203087,0.0004012097,0.0001449384,0.00004401718,0.0001276574,0.000006724375,0.0004332821,0.02009102,0.00004913041,0.867019,0.00139187,0.1102391],"study_design_scores_gemma":[0.001614404,0.0004793373,0.001463945,0.000005739324,0.00003526197,0.0000992231,0.00003706086,0.100614,0.00009061446,0.8445964,0.05060662,0.0003573874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001510438,0.0001538498,0.9939424,0.001849007,0.0005067851,0.0003841918,0.00001077433,0.000219736,0.001422824],"genre_scores_gemma":[0.9532809,0.000006464636,0.04485002,0.0007649183,0.00008992349,0.00005493293,0.00001960727,0.000008922816,0.0009243303],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9517704,"threshold_uncertainty_score":0.5782539,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bounded function; Mathematics; Rank (graph theory); Treewidth; Discrete mathematics; Combinatorics; Pathwidth; Graph; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.04209192692137793,"gpt":0.3101518114053621,"spread":0.2680598844839842,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004832682,0.00009354637,0.000131334,0.0002303905,0.0006168976,0.00002887676,0.0004779501,0.00002290547,0.00003450178],"category_scores_gemma":[0.00005786545,0.00009875107,0.00008532892,0.000524317,0.0001372892,0.000189633,0.00003272498,0.0001511371,0.000001079632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008229873,"about_ca_system_score_gemma":0.0001455254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001568311,"about_ca_topic_score_gemma":0.000007420622,"domain_scores_codex":[0.9987595,0.0001655298,0.0002136275,0.0003362736,0.0003612296,0.000163845],"domain_scores_gemma":[0.9981872,0.00118783,0.00007717735,0.0003419681,0.0001566595,0.00004919691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000137755,0.0002361284,0.0001454728,0.0000274137,0.0000290161,9.536757e-7,0.0002632478,0.3162593,0.0001646817,0.6445958,0.0000153926,0.03812485],"study_design_scores_gemma":[0.0005981163,0.0004267583,0.002740944,0.000001945381,0.000006021035,0.00001453458,0.00004203653,0.0462307,0.0002089591,0.9494697,0.000168861,0.00009145399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03861103,0.00004367337,0.9588314,0.001805165,0.0001132524,0.0004121002,0.000067843,0.00005819547,0.00005729925],"genre_scores_gemma":[0.7943814,0.000003516195,0.2052225,0.0001678649,0.000002927248,0.000177448,0.00001418659,0.000005210064,0.00002497809],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7557703,"threshold_uncertainty_score":0.474474,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03906599009138076,"gpt":0.2874935594328966,"spread":0.2484275693415159,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001444955,0.0001756874,0.0001491302,0.0001172447,0.0002762018,0.0002144337,0.0003760625,0.0000597387,0.00004092745],"category_scores_gemma":[0.00004908397,0.0001426024,0.00004874982,0.0002737256,0.00009606236,0.0007461292,0.00001477925,0.0001680771,0.0001266862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004091523,"about_ca_system_score_gemma":0.0001420691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004755713,"about_ca_topic_score_gemma":0.000004966448,"domain_scores_codex":[0.9989423,0.00006776345,0.0001786214,0.000302321,0.0002453881,0.0002636074],"domain_scores_gemma":[0.9987559,0.0006963019,0.0000687782,0.0002244766,0.0001321757,0.0001224043],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001897068,0.0007055494,0.0003179495,0.0001234918,0.00005936933,0.000004862845,0.002260999,0.03755709,0.00002040756,0.8623512,0.0003017049,0.09627846],"study_design_scores_gemma":[0.002040116,0.001359508,0.03169936,0.0002704107,0.00007039565,0.0003316737,0.001207594,0.03001279,0.001021869,0.9254838,0.005203025,0.001299502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01688435,0.001236309,0.976629,0.001216206,0.0004498459,0.000160383,0.000007884194,0.0002164592,0.003199533],"genre_scores_gemma":[0.9839628,0.00006893883,0.01538496,0.0003374077,0.00006024416,0.00003577543,0.000007150731,0.000007079495,0.0001356696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9670784,"threshold_uncertainty_score":0.5815155,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03040894846688633,"gpt":0.2694506198888288,"spread":0.2390416714219425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000259214,0.0001472624,0.000227165,0.0001433063,0.0002902301,0.00005358977,0.0008608472,0.00004060166,0.0005228673],"category_scores_gemma":[0.00003036716,0.000131535,0.0001010198,0.0004028896,0.0000505073,0.00009756939,0.00006231777,0.0001767278,0.0002028474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007667358,"about_ca_system_score_gemma":0.0001291034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002837194,"about_ca_topic_score_gemma":0.00005303122,"domain_scores_codex":[0.9984583,0.0002030235,0.0003036985,0.0003845913,0.0004568557,0.0001934884],"domain_scores_gemma":[0.998759,0.000503003,0.0001034668,0.0004264051,0.0001271354,0.00008097741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005529705,0.0003769292,0.00006692696,0.00002177734,0.000135056,0.0000169497,0.001489014,0.3906712,0.00008291863,0.5457474,0.0001982966,0.06113826],"study_design_scores_gemma":[0.0006721971,0.001023471,0.0007779765,0.000006013465,0.00005483827,0.00003931653,0.0004156853,0.02846519,0.0003353134,0.9588984,0.008944227,0.0003673124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00563457,0.0004026956,0.9912869,0.0007906776,0.0005046325,0.0003171142,0.00004552102,0.0001242405,0.0008936638],"genre_scores_gemma":[0.9888217,0.000005771952,0.01000159,0.0008476649,0.00003263831,0.00008862743,0.00003849349,0.00001088451,0.000152664],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9831871,"threshold_uncertainty_score":0.572503,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03292469093502936,"gpt":0.3370005077113563,"spread":0.3040758167763269,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003441522,0.0001871856,0.0002335611,0.0001334762,0.0009047046,0.0001756324,0.001242985,0.0001000771,0.00004413132],"category_scores_gemma":[0.000112004,0.0001453907,0.0001570057,0.0001444652,0.000249697,0.0005445756,0.00004196361,0.0001912346,0.00007999653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005638401,"about_ca_system_score_gemma":0.0000858706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001567372,"about_ca_topic_score_gemma":0.00001273198,"domain_scores_codex":[0.9986501,0.0001426421,0.0002505798,0.0003767548,0.0003722211,0.0002077122],"domain_scores_gemma":[0.9979544,0.000668644,0.0002634559,0.0008411116,0.0001915326,0.00008081758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001381957,0.0004710327,0.0005626418,0.00006197906,0.00007674375,0.00001262497,0.0003443602,0.04900263,0.0004206035,0.1693637,0.00006650738,0.779479],"study_design_scores_gemma":[0.002195156,0.002116192,0.04720332,0.0001616605,0.00005607641,0.00007621966,0.00005241039,0.1863192,0.02664836,0.734042,0.0005683046,0.0005610949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0136421,0.00005387069,0.9819708,0.0007456382,0.000686514,0.000238515,0.000005520651,0.0001600693,0.002496982],"genre_scores_gemma":[0.9421711,0.00001132103,0.05756578,0.00007584962,0.00004097424,0.00003311644,0.000007268171,0.000008491728,0.00008612623],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.928529,"threshold_uncertainty_score":0.6958348,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01552730478719676,"gpt":0.2502499250792716,"spread":0.2347226202920749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002811989,0.0001130143,0.0001242298,0.0001274336,0.0002119086,0.00005823896,0.0006410816,0.00004295051,0.00002250206],"category_scores_gemma":[0.00003438856,0.00008175294,0.00007792981,0.0004524866,0.00007702945,0.0001103965,0.00001661868,0.0001466144,0.00003390768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006579572,"about_ca_system_score_gemma":0.00008218735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007531668,"about_ca_topic_score_gemma":0.0001544169,"domain_scores_codex":[0.9988448,0.00009292032,0.0003176652,0.0002636841,0.0002898411,0.000191059],"domain_scores_gemma":[0.9985082,0.0008752069,0.00009262492,0.0003942903,0.00009993329,0.0000297862],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003726434,0.0007863347,0.0005724016,0.00001238073,0.00002751497,0.000005407303,0.000185107,0.2939261,0.00003061862,0.6481654,0.0004612994,0.05579024],"study_design_scores_gemma":[0.001222634,0.000458792,0.04304326,0.00003401274,0.00001292328,0.00002607142,0.00008638153,0.2391747,0.0005563045,0.7113269,0.003786225,0.0002717683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00754662,0.0001658444,0.9824106,0.001640873,0.0002723812,0.0001657492,0.000004776968,0.0000664785,0.007726742],"genre_scores_gemma":[0.9543398,0.00001476046,0.04492674,0.00007257437,0.00002190373,0.00002572901,0.000005108141,0.000004415966,0.0005889857],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9467931,"threshold_uncertainty_score":0.3333788,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04025305083435371,"gpt":0.2969539954423772,"spread":0.2567009446080235,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008894872,0.0002009138,0.0002367584,0.0004702429,0.0003213201,0.0001302202,0.0006201915,0.0001363121,0.000006733855],"category_scores_gemma":[0.00007343403,0.0001981493,0.000132052,0.0008011844,0.00004993414,0.0003662367,0.00001276272,0.0002470305,0.00004463257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002111206,"about_ca_system_score_gemma":0.00007955648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004512737,"about_ca_topic_score_gemma":0.0000446033,"domain_scores_codex":[0.9981995,0.00008365115,0.000486162,0.0005427152,0.0002979052,0.0003901263],"domain_scores_gemma":[0.9979217,0.001219813,0.0001305618,0.0003742701,0.0002463694,0.0001072808],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007659275,0.0003576766,0.0001716641,0.00004461525,0.00003799565,0.00001567848,0.0004740116,0.8420505,0.00008428688,0.0990695,0.00018615,0.05743137],"study_design_scores_gemma":[0.001825824,0.0004427279,0.00958161,0.0001051082,0.00001787714,0.0001279687,0.0002078734,0.8753231,0.0001701991,0.107994,0.003695705,0.0005080156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005179937,0.0002078056,0.9904992,0.0007035161,0.001807702,0.0004847299,0.000007941533,0.0002778907,0.0008312781],"genre_scores_gemma":[0.7998607,0.00001720094,0.1995598,0.0002185072,0.0001260104,0.00004150665,0.0000242882,0.0000128595,0.0001390557],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7946808,"threshold_uncertainty_score":0.8080295,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01825130089344324,"gpt":0.251723016553742,"spread":0.2334717156602987,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002753341,0.0001113462,0.0001167443,0.0003956188,0.0001595078,0.00007453148,0.0006027978,0.00005200193,0.000006105437],"category_scores_gemma":[0.000005752362,0.00008254117,0.00004491567,0.001153764,0.00003142378,0.000482682,0.00002478642,0.0001634786,0.00005452302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001564964,"about_ca_system_score_gemma":0.00003039579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003957383,"about_ca_topic_score_gemma":0.0000372765,"domain_scores_codex":[0.998962,0.0001111571,0.0002803802,0.0001703162,0.000329454,0.0001467343],"domain_scores_gemma":[0.9989775,0.000546739,0.00008262195,0.0002814294,0.00008234785,0.00002935092],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003879617,0.0002136192,0.0002293815,0.0001062072,0.00003337953,0.000009277867,0.009483842,0.752436,0.0001997948,0.163144,0.0000673626,0.07403835],"study_design_scores_gemma":[0.001224211,0.000435883,0.08075685,0.00008359176,0.0000207865,0.00007508124,0.000659731,0.4390033,0.0005338622,0.4758427,0.001059611,0.0003044801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05752737,0.00002742852,0.9309316,0.01073003,0.0001540337,0.0002191075,0.00001726287,0.0001177517,0.0002754192],"genre_scores_gemma":[0.9675906,0.00002050252,0.02834857,0.003921284,0.00001338633,0.00002614298,0.00007431027,0.000002880007,0.000002291098],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9100633,"threshold_uncertainty_score":0.3365931,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05988162739378244,"gpt":0.3470112406369147,"spread":0.2871296132431323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003104087,0.0001410487,0.0001209114,0.0003559325,0.0009939062,0.00006517825,0.001363301,0.0000253401,0.0005008598],"category_scores_gemma":[0.00002876394,0.0001423691,0.0001067852,0.000786381,0.00005851014,0.0002248606,0.00006718918,0.000525559,0.0002243441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002442136,"about_ca_system_score_gemma":0.000087234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003039014,"about_ca_topic_score_gemma":8.306496e-7,"domain_scores_codex":[0.9979287,0.0002697118,0.0001991469,0.0004562652,0.0008656523,0.000280464],"domain_scores_gemma":[0.9984458,0.0007245285,0.00006701723,0.0005768494,0.00008670174,0.00009910756],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006575596,0.0003049101,0.000005904179,0.000001795849,0.00002547614,0.00002911222,0.0001255837,0.7933474,0.00003435895,0.1665798,0.0001634777,0.03931647],"study_design_scores_gemma":[0.000598492,0.001034753,0.0005685734,0.000005839015,0.000003895209,0.00005646385,0.00007326092,0.04906522,0.0001747269,0.9452395,0.002971802,0.0002074016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003806332,0.00001921244,0.988611,0.004747282,0.0003970673,0.0002152891,0.00003535861,0.000187307,0.001981142],"genre_scores_gemma":[0.9033449,0.00000382315,0.09323709,0.002529215,0.00002104156,0.0001312583,0.00001387329,0.00001236115,0.0007064992],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8995385,"threshold_uncertainty_score":0.7644423,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07257438177833501,"gpt":0.3131053278662883,"spread":0.2405309460879532,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001081082,0.0001524329,0.000165885,0.0002309552,0.0001441039,0.00007176816,0.0007039844,0.00009297412,0.00002118551],"category_scores_gemma":[0.0001057766,0.000145359,0.00006476742,0.0006582757,0.00005652913,0.0008761128,0.00001748243,0.0002636016,0.0001575215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001977024,"about_ca_system_score_gemma":0.00005320146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006314841,"about_ca_topic_score_gemma":0.000004589127,"domain_scores_codex":[0.9982716,0.0003084762,0.000394078,0.0003331026,0.0003686659,0.0003241097],"domain_scores_gemma":[0.9985656,0.0004759257,0.000100711,0.0006484159,0.0001025255,0.0001068382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009068204,0.0006673413,0.001159062,0.00004755289,0.00001321211,8.698838e-7,0.0007718786,0.8111194,0.0000487445,0.1429415,0.00002828198,0.04319309],"study_design_scores_gemma":[0.0007465146,0.0002581009,0.09218491,0.00007216742,0.00001196408,0.0000814675,0.0000950777,0.7790273,0.0001920468,0.1247503,0.002064282,0.0005158937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007038566,0.0001376956,0.9900279,0.000529727,0.0008676962,0.0003971684,0.000007885429,0.0001934799,0.000799853],"genre_scores_gemma":[0.6265883,0.000004595454,0.3731096,0.0001135027,0.00002775399,0.0001000363,0.00000559988,0.0000056565,0.00004485566],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6195498,"threshold_uncertainty_score":0.5927567,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02998419991651737,"gpt":0.2864637845921789,"spread":0.2564795846756616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002894038,0.0002279653,0.0002145699,0.000358556,0.0002780291,0.000129378,0.000829933,0.0001129784,0.00007205085],"category_scores_gemma":[0.00001028986,0.000212666,0.0001125341,0.0006366376,0.00006024407,0.0003191211,0.00002950248,0.0003059612,0.0003519191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001631962,"about_ca_system_score_gemma":0.0001307155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005060841,"about_ca_topic_score_gemma":0.0001028731,"domain_scores_codex":[0.9982893,0.0001332128,0.0003560217,0.0005392765,0.0003145167,0.0003677057],"domain_scores_gemma":[0.9987973,0.0005200265,0.00007765718,0.0004116013,0.0001138815,0.00007953664],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003043303,0.0009545697,0.001264861,0.0000210026,0.00003001557,0.0001154604,0.001516008,0.7116567,0.00006976528,0.2715734,0.0008558622,0.01191196],"study_design_scores_gemma":[0.002214257,0.0003152309,0.05174869,0.00007856883,0.00001448807,0.0001523032,0.0002100333,0.08206382,0.0002664062,0.8547652,0.007422506,0.000748529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0235249,0.0002573391,0.960353,0.00067327,0.0005713097,0.0001793475,0.00001070017,0.0002320491,0.01419815],"genre_scores_gemma":[0.9215004,0.00000320655,0.07750773,0.0002481508,0.00009432688,0.00003911139,0.00002336485,0.00001212648,0.0005715878],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8979755,"threshold_uncertainty_score":0.8672269,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03793682739011632,"gpt":0.2632720349652283,"spread":0.225335207575112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001682613,0.0000761979,0.0001111562,0.00015344,0.0004060793,0.00003198534,0.0004603976,0.00001859515,0.0000576459],"category_scores_gemma":[0.00001874225,0.00007277131,0.00004575458,0.0003256303,0.00007858506,0.000235,0.00004118711,0.0001131364,0.000003239821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002173686,"about_ca_system_score_gemma":0.00006472247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002163798,"about_ca_topic_score_gemma":0.000002195639,"domain_scores_codex":[0.9991727,0.00007960145,0.0001747629,0.0002171653,0.0002531102,0.0001026837],"domain_scores_gemma":[0.9990706,0.0004802012,0.0000613135,0.0002951425,0.00006542759,0.00002733081],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005312425,0.0000661024,0.00001016357,0.000003738859,0.00001161254,0.000001078451,0.0003955583,0.5205442,0.00001733879,0.4722008,0.00002724667,0.006716764],"study_design_scores_gemma":[0.0001550022,0.000129688,0.0008716375,0.000002649734,0.000006070235,0.00003108693,0.0002427851,0.2201769,0.0001028743,0.7781509,0.00006237114,0.00006801594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01340341,0.0001149595,0.9818037,0.003190651,0.0001677978,0.00009641684,0.00001966046,0.00009803175,0.0011054],"genre_scores_gemma":[0.8537271,0.000009609775,0.1458678,0.0002659319,0.000004558116,0.00003549839,0.000004509874,0.000003004285,0.00008202216],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8403237,"threshold_uncertainty_score":0.3123274,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08437898775922498,"gpt":0.3436640172484169,"spread":0.2592850294891919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006792683,0.0001168573,0.0001690594,0.0001188114,0.0005194441,0.00008844816,0.0009088375,0.00006649319,0.000002464149],"category_scores_gemma":[0.0001325876,0.00009248945,0.0000994646,0.0004027657,0.000257322,0.0001925703,0.00001285277,0.0001214767,0.00001001872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007541801,"about_ca_system_score_gemma":0.0001181442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002566352,"about_ca_topic_score_gemma":0.000004098447,"domain_scores_codex":[0.9987251,0.0001542745,0.0004442731,0.0002716735,0.0002508501,0.0001538904],"domain_scores_gemma":[0.9977494,0.0009270685,0.000194362,0.0006121709,0.0004897245,0.00002724732],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006621976,0.0001215427,0.00002532381,0.0000433867,0.00004509299,1.371581e-7,0.00008078528,0.1138963,0.00007344703,0.8691935,0.0001919963,0.01626225],"study_design_scores_gemma":[0.0004319587,0.0001608878,0.002083858,0.00003227884,0.00001560889,0.000004085791,0.00007300682,0.8059425,0.0006853429,0.1853676,0.005095368,0.0001075245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006808552,0.00008895381,0.9947813,0.002366949,0.001029264,0.000605603,0.00004265775,0.00009911075,0.000305334],"genre_scores_gemma":[0.5465728,0.000006351252,0.4529447,0.0001483596,0.00001602945,0.0001226516,0.00001793856,0.000004086412,0.0001670451],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6920462,"threshold_uncertainty_score":0.3995196,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05042667329219194,"gpt":0.2983654345820899,"spread":0.2479387612898979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000476374,0.0001332387,0.0001417154,0.000214694,0.0006704527,0.00009720715,0.001381081,0.00003518379,0.0003852554],"category_scores_gemma":[0.00003973632,0.0001478008,0.0000922421,0.0005594213,0.00004841122,0.0003751522,0.00006144453,0.0003262298,0.0001848386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001685941,"about_ca_system_score_gemma":0.00008739696,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001019567,"about_ca_topic_score_gemma":7.878219e-7,"domain_scores_codex":[0.9982262,0.000240931,0.0002796646,0.000408343,0.00063145,0.0002134387],"domain_scores_gemma":[0.9987036,0.0003221803,0.0001065526,0.0007089485,0.00009935282,0.0000593962],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003638832,0.0006454663,0.00001778989,0.000008853135,0.00004642192,0.00001036023,0.0003957636,0.6281593,0.00009414453,0.25659,0.0004393986,0.1135561],"study_design_scores_gemma":[0.0008188415,0.0006296271,0.004108572,0.000007801505,0.00001694849,0.0001550068,0.00008735201,0.7050904,0.0003186675,0.2787678,0.009615025,0.0003839587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001988355,0.00001956962,0.9923127,0.00279138,0.0007895751,0.0002156654,0.00003468926,0.000428542,0.00141954],"genre_scores_gemma":[0.4540055,0.000001789614,0.54421,0.001430699,0.00001680432,0.0001116947,0.0000156582,0.000007911343,0.0001999434],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4520172,"threshold_uncertainty_score":0.6027141,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05867429881197218,"gpt":0.2920372054230701,"spread":0.2333629066110979,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001285394,0.0002346428,0.0002188446,0.00008248671,0.001118414,0.0001625596,0.002164982,0.00005949609,0.00003410779],"category_scores_gemma":[0.0001496446,0.0001340799,0.0002217539,0.0006246425,0.0009125231,0.0004246529,0.0001164813,0.0003843669,0.00004540455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009375133,"about_ca_system_score_gemma":0.0001081239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004559971,"about_ca_topic_score_gemma":0.00002877314,"domain_scores_codex":[0.9975209,0.0005088871,0.000473533,0.0003655212,0.0006691325,0.0004620005],"domain_scores_gemma":[0.9951375,0.003177255,0.0002113096,0.001121788,0.0002411999,0.0001109986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002633674,0.0003801336,0.0003297271,0.0000156966,0.00007920732,0.000001003362,0.001104188,0.1186448,0.00002018606,0.8033814,0.00006952679,0.07594771],"study_design_scores_gemma":[0.000260682,0.0001656046,0.02871069,0.00001201655,0.00001964292,0.0000433383,0.0001444959,0.2048567,0.000199434,0.764721,0.0006482456,0.0002181567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005547222,0.0001825103,0.9813738,0.01081767,0.0007761699,0.0004703518,0.00002097479,0.0001500041,0.0006613155],"genre_scores_gemma":[0.8762235,0.000007338725,0.123236,0.0003411914,0.00008866405,0.00004400254,0.000005389552,0.00001063714,0.00004329546],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8706763,"threshold_uncertainty_score":0.8602048,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08042164214727479,"gpt":0.3250128059615131,"spread":0.2445911638142383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001078745,0.0001071402,0.0001808639,0.0001059698,0.0001081319,0.00003744444,0.0004036639,0.00005471706,0.0000293196],"category_scores_gemma":[0.00001436787,0.00009680464,0.000121587,0.0002451705,0.00005182691,0.0005785465,0.00001130068,0.00006785423,0.00002203742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002897828,"about_ca_system_score_gemma":0.00002907996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002397695,"about_ca_topic_score_gemma":0.000003398623,"domain_scores_codex":[0.9990996,0.00006010144,0.0002004653,0.0002767468,0.0002273086,0.0001358229],"domain_scores_gemma":[0.9983459,0.001066779,0.000112726,0.0003475589,0.00010875,0.00001832047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002066907,0.0005350728,0.0004745125,0.0001224529,0.0001256356,0.000002165264,0.002942753,0.1249456,0.00187206,0.7991972,0.00009973394,0.06947611],"study_design_scores_gemma":[0.001427999,0.0008158776,0.01396799,0.00006793576,0.00003135673,0.0000275294,0.0004779915,0.1497587,0.01359994,0.8193562,0.0001715386,0.0002969838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04822161,0.0000368391,0.9483148,0.001951385,0.0003966099,0.0004919468,0.00002112958,0.0001124763,0.00045316],"genre_scores_gemma":[0.8003132,0.000008517169,0.1990858,0.0004354604,0.00002254902,0.00007673923,0.00002029769,0.000005005993,0.00003244622],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7520916,"threshold_uncertainty_score":0.3947579,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}