{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Aleksandar Nanevski","is_ca":false},{"name":"Frank Pfenning","is_ca":false},{"name":"Brigitte Pientka","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001931021,0.0006071358,0.0007586408,0.001642858,0.002025982,0.004097399,0.00163885,0.001576319,0.01103233],"category_scores_gemma":[0.002993899,0.0005210142,0.001121882,0.002035137,0.004784456,0.006691738,0.002725874,0.003379684,0.001318187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002275737,"about_ca_system_score_gemma":0.001179093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002477449,"about_ca_topic_score_gemma":0.001965712,"domain_scores_codex":[0.998271,0.0004460689,0.00009731633,0.0004394537,0.0005396434,0.0002064248],"domain_scores_gemma":[0.9987689,0.0004474041,0.0001069131,0.0003072947,0.0002716154,0.00009795647],"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.000003613073,0.000001945326,0.00003378445,0.00002256042,0.000002957421,0.00001223556,0.00004789852,0.0001849756,0.0001367284,0.9967063,0.0005071326,0.002339875],"study_design_scores_gemma":[0.000007366002,0.000007387205,0.00009922419,0.00003179873,0.00001306143,0.00007044945,0.00004547492,0.002497711,0.0003554932,0.9795259,0.01733596,0.00001018151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01361596,0.004495676,0.8169709,0.005194102,0.0006683318,0.0001037495,0.0009227247,0.001011113,0.1570175],"genre_scores_gemma":[0.713999,0.003914598,0.2573517,0.002690079,0.001571644,0.0002709498,0.0008507745,0.000267619,0.01908369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01103233,"threshold_uncertainty_score":0.03690684,"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","authors":[{"name":"Jules Desharnais","is_ca":true},{"name":"Bernhard Möller","is_ca":false},{"name":"Georg Struth","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002288614,0.0005336267,0.0007418554,0.001509295,0.001972488,0.003713586,0.001449792,0.001125573,0.007274304],"category_scores_gemma":[0.003001594,0.0004071972,0.00179285,0.001590325,0.003623232,0.01138982,0.002998642,0.003433394,0.002543844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001321145,"about_ca_system_score_gemma":0.001616798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001400436,"about_ca_topic_score_gemma":0.001374237,"domain_scores_codex":[0.9980401,0.0004746396,0.0001740921,0.0004663783,0.0006209604,0.0002238534],"domain_scores_gemma":[0.9986231,0.0003558792,0.0001150847,0.0003651452,0.0003718219,0.0001689627],"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.000005607806,0.000006655022,0.00003679652,0.00001751737,0.000002999493,0.00003167466,0.000048791,0.000376007,0.0002534552,0.9954391,0.0004506317,0.003330778],"study_design_scores_gemma":[0.000009701294,0.0000145662,0.00003590768,0.00001791499,0.000009693396,0.0001085585,0.00003421659,0.003940857,0.0007666723,0.9579887,0.03705803,0.00001509336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01294751,0.002104037,0.8929951,0.002361058,0.0006423894,0.0001825536,0.000595983,0.0007065415,0.08746471],"genre_scores_gemma":[0.4527413,0.003520748,0.5041023,0.001624658,0.001077592,0.0004096685,0.001169507,0.0002670757,0.0350872],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007274304,"threshold_uncertainty_score":0.02433497,"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","authors":[{"name":"Andreĭ A. Bulatov","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00253899,0.000899161,0.001533691,0.001109462,0.001591641,0.005028519,0.00242991,0.001705794,0.007927727],"category_scores_gemma":[0.02234151,0.000780105,0.001836803,0.00244142,0.002318868,0.00772914,0.003285822,0.003635836,0.0006387244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002549093,"about_ca_system_score_gemma":0.002412698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003618662,"about_ca_topic_score_gemma":0.00308851,"domain_scores_codex":[0.9946123,0.001387564,0.0003995134,0.001003439,0.001847503,0.0007495611],"domain_scores_gemma":[0.975848,0.02001623,0.001356917,0.001232278,0.0009512145,0.0005953596],"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.000494025,0.0003694865,0.004519505,0.001323546,0.0002322392,0.0008531238,0.001800302,0.188233,0.00490579,0.7187564,0.01357538,0.06493719],"study_design_scores_gemma":[0.0001012123,0.00003448502,0.0006093357,0.00004380386,0.00005270306,0.0002730617,0.0003338548,0.1674775,0.001233981,0.8235508,0.006262268,0.00002706809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3349656,0.002319482,0.6031125,0.01176129,0.0001729506,0.0007171681,0.004504636,0.001321858,0.04112459],"genre_scores_gemma":[0.8446661,0.002002414,0.1324489,0.001190617,0.0003760655,0.0007913965,0.005834777,0.0003841152,0.01230563],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007927727,"threshold_uncertainty_score":0.02652085,"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","authors":[{"name":"Tomi Janhunen","is_ca":false},{"name":"Ilkka Niemelä","is_ca":false},{"name":"Dietmar Seipel","is_ca":false},{"name":"Patrik Simons","is_ca":false},{"name":"Jia-Huai You","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002404284,0.0006048529,0.0004608088,0.0008059588,0.0006994105,0.001535825,0.001335108,0.0004943172,0.00278494],"category_scores_gemma":[0.004157874,0.0007605394,0.001388154,0.000840782,0.00291973,0.005343448,0.002856727,0.001879915,0.0005054903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001203011,"about_ca_system_score_gemma":0.001038973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00197701,"about_ca_topic_score_gemma":0.00300512,"domain_scores_codex":[0.9978588,0.0006660138,0.0001245663,0.0004289275,0.0007362855,0.0001853573],"domain_scores_gemma":[0.9981828,0.0008747171,0.0001166342,0.0005039584,0.0002556676,0.00006612324],"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.0001340152,0.0000637554,0.0009847715,0.0001754312,0.00004981449,0.0001699348,0.001171047,0.03692455,0.008593243,0.8528652,0.0008936785,0.09797457],"study_design_scores_gemma":[0.00003422787,0.0001150466,0.0002872513,0.00005153124,0.00006913487,0.0001536114,0.000234883,0.208923,0.01969451,0.7548564,0.01554599,0.00003461625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01275497,0.0000575456,0.9844204,0.0001059808,0.00001039875,0.0000351124,0.00003995757,0.0007182654,0.001857552],"genre_scores_gemma":[0.3454171,0.0002474765,0.6499996,0.00012709,0.00004046722,0.0001434128,0.0002986739,0.0004073969,0.003318738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00278494,"threshold_uncertainty_score":0.01271522,"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","authors":[{"name":"Marc Denecker","is_ca":false},{"name":"Eugenia Ternovska","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003345286,0.0005769735,0.0004952038,0.001427224,0.001355221,0.003299898,0.001696481,0.0009289149,0.003161218],"category_scores_gemma":[0.002959298,0.0005926506,0.001403409,0.001317271,0.004969545,0.008527607,0.002467448,0.003383171,0.00086883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001684289,"about_ca_system_score_gemma":0.001352427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006695699,"about_ca_topic_score_gemma":0.0007424937,"domain_scores_codex":[0.9971788,0.000726064,0.0003014278,0.0007428916,0.0008252985,0.0002254471],"domain_scores_gemma":[0.9973954,0.001331191,0.0002667608,0.0003586955,0.0005224138,0.0001254879],"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.000007023707,0.000008820647,0.00007718894,0.00004428789,0.000006029402,0.00006655815,0.0002161269,0.000352299,0.0006463289,0.9907799,0.0007141884,0.007081155],"study_design_scores_gemma":[0.00001807261,0.00003175522,0.0001533954,0.00005293721,0.00002863652,0.0003580753,0.0001037245,0.007418056,0.003431215,0.9135416,0.07484045,0.00002208107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01132466,0.001590713,0.9464148,0.001743871,0.0003534397,0.0001107281,0.000327203,0.0004910365,0.03764359],"genre_scores_gemma":[0.3293485,0.001765555,0.642746,0.002109565,0.0006457076,0.0003963103,0.0006430264,0.0002765907,0.02206877],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003345286,"threshold_uncertainty_score":0.01769173,"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","authors":[{"name":"Ray Reiter","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003224055,0.001268215,0.0008777254,0.001119182,0.001643996,0.004063951,0.002652064,0.00179869,0.005000614],"category_scores_gemma":[0.005875969,0.0008270426,0.002406393,0.001568762,0.009181267,0.008354681,0.004642194,0.004113303,0.0008704437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002325387,"about_ca_system_score_gemma":0.002148293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005060987,"about_ca_topic_score_gemma":0.00479188,"domain_scores_codex":[0.9975038,0.0009829958,0.0001390133,0.0003688802,0.0006250949,0.0003801501],"domain_scores_gemma":[0.9976265,0.001571311,0.0001809475,0.0002727851,0.0001576573,0.0001906919],"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.00004494725,0.00004188645,0.0001573623,0.00008450749,0.00001659175,0.0001787139,0.000652245,0.01373627,0.0005670081,0.9735171,0.0007514671,0.0102518],"study_design_scores_gemma":[0.00003004145,0.00003156699,0.00007121809,0.00004094409,0.00002284997,0.00008899376,0.00008458213,0.04155038,0.0007819063,0.9497699,0.007506573,0.00002100258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01094571,0.000449939,0.9678861,0.00155915,0.0000857331,0.0001457732,0.0001076927,0.0008766289,0.01794329],"genre_scores_gemma":[0.3524406,0.001090718,0.6324988,0.001023274,0.0003144611,0.0006481837,0.0003076454,0.0004290335,0.01124732],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005060987,"threshold_uncertainty_score":0.01705068,"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","authors":[{"name":"John V. Tucker","is_ca":false},{"name":"J. I. Zucker","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001500701,0.0006886379,0.0006758209,0.0008424095,0.001047456,0.003344622,0.001115577,0.001075356,0.004568908],"category_scores_gemma":[0.004131715,0.000364185,0.00153096,0.001040206,0.004612661,0.009692471,0.002689121,0.00271718,0.0007271681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002280406,"about_ca_system_score_gemma":0.001403202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00176479,"about_ca_topic_score_gemma":0.001061991,"domain_scores_codex":[0.9975994,0.0007847347,0.0001437524,0.0003431844,0.000870146,0.0002587037],"domain_scores_gemma":[0.9980094,0.0006960559,0.0002252386,0.0004186232,0.0004155224,0.0002351962],"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.000006757753,0.000004682008,0.00004328422,0.00001987719,0.000003429938,0.00001499142,0.00006649708,0.00302202,0.0003742072,0.9954,0.0001100981,0.0009343615],"study_design_scores_gemma":[0.000007379941,0.00002524778,0.00006181766,0.00001794527,0.000008364083,0.00003832255,0.00005488563,0.04271031,0.001085575,0.9526744,0.003299499,0.00001634447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09368134,0.0007390251,0.8711662,0.001328754,0.0001512489,0.00006966451,0.0002592441,0.0006952404,0.03190925],"genre_scores_gemma":[0.8669272,0.000742965,0.1206333,0.0003697016,0.0002083557,0.0001556166,0.000334689,0.0002153151,0.01041286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004568908,"threshold_uncertainty_score":0.01654553,"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","authors":[{"name":"Tran Cao Son","is_ca":false},{"name":"Chitta Baral","is_ca":false},{"name":"Nam Tran","is_ca":false},{"name":"Sheila A. McIlraith","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004453318,0.0006044397,0.0005788234,0.0009298527,0.0009492981,0.002200213,0.001956808,0.001359091,0.002845954],"category_scores_gemma":[0.01271441,0.0007238743,0.001019251,0.0009103588,0.004402608,0.005283163,0.002716325,0.002216904,0.0003827404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001440343,"about_ca_system_score_gemma":0.001726707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003475498,"about_ca_topic_score_gemma":0.003856036,"domain_scores_codex":[0.9965714,0.001376455,0.0002069176,0.0004760546,0.001098271,0.0002707647],"domain_scores_gemma":[0.9896119,0.008502368,0.0003966783,0.0009090741,0.0004028022,0.00017712],"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.0002733705,0.0001476429,0.001166041,0.0004646993,0.00006662851,0.0006588993,0.001343551,0.3141389,0.006204916,0.5718476,0.001156071,0.1025315],"study_design_scores_gemma":[0.00006116516,0.00008808933,0.0002976487,0.00008522673,0.00005950267,0.0001997001,0.000202702,0.4492582,0.009789603,0.5306237,0.00929381,0.00004077879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01787343,0.0002748804,0.9740475,0.0004824742,0.00002478942,0.0000891318,0.00005749467,0.0003512432,0.006799094],"genre_scores_gemma":[0.5282831,0.0005065685,0.4668532,0.0002856745,0.00006932073,0.0002477504,0.0002401831,0.0001361854,0.003378009],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004453318,"threshold_uncertainty_score":0.02355164,"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","authors":[{"name":"Filippo Bonchi","is_ca":false},{"name":"Marcello Bonsangue","is_ca":false},{"name":"Helle Hvid Hansen","is_ca":false},{"name":"Prakash Panangaden","is_ca":true},{"name":"Jan Rutten","is_ca":false},{"name":"Alexandra Silva","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008469889,0.0004448334,0.0006271465,0.0006329924,0.0006316231,0.001200068,0.002087863,0.0007569004,0.006072032],"category_scores_gemma":[0.002104144,0.0004236725,0.0008213941,0.0006580192,0.001027244,0.00249036,0.00173137,0.001340618,0.001378752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00113688,"about_ca_system_score_gemma":0.001425635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002326424,"about_ca_topic_score_gemma":0.004450927,"domain_scores_codex":[0.9993342,0.0001159349,0.00006109598,0.0001970101,0.0002048864,0.00008687739],"domain_scores_gemma":[0.9997185,0.0001169391,0.00001594652,0.00006222696,0.00006878142,0.00001764069],"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.0001453651,0.00009975469,0.0005219424,0.0001734648,0.0000402713,0.00007342505,0.0002893094,0.04189232,0.01099937,0.8141315,0.003689154,0.1279441],"study_design_scores_gemma":[0.00006286461,0.00006559878,0.0002545308,0.00003379571,0.00004234536,0.00009470932,0.00008795618,0.2725425,0.01684557,0.695824,0.0141107,0.00003553551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01088107,0.00007986724,0.9825283,0.0002303415,0.00004433951,0.00005023463,0.00007707585,0.0005689,0.005539757],"genre_scores_gemma":[0.1954401,0.0001745645,0.7928756,0.0002155423,0.00003386521,0.0002579045,0.0002873442,0.0004868805,0.01022809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006072032,"threshold_uncertainty_score":0.02031302,"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","authors":[{"name":"Stephen Cook","is_ca":true},{"name":"Neil Thapen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005928986,0.00069846,0.0009807377,0.002049627,0.002790669,0.005411325,0.002340744,0.001990756,0.004647048],"category_scores_gemma":[0.01194168,0.001341007,0.002333214,0.001286211,0.0128778,0.01235626,0.008455612,0.00640272,0.001003674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00267965,"about_ca_system_score_gemma":0.001720695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001784351,"about_ca_topic_score_gemma":0.001322794,"domain_scores_codex":[0.9915805,0.002201392,0.0008002331,0.001862593,0.002664104,0.0008910974],"domain_scores_gemma":[0.9880377,0.006236266,0.0006808648,0.002945702,0.001567919,0.0005315354],"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.00004121478,0.000008597606,0.000522943,0.00007886894,0.00001891353,0.00005163673,0.0003065296,0.0006899486,0.001074281,0.9919696,0.000614743,0.004622628],"study_design_scores_gemma":[0.00003568919,0.0001078885,0.0005474772,0.00005846619,0.00005347898,0.0001700458,0.0002202965,0.007133517,0.004047414,0.9736022,0.0139841,0.00003935929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2123943,0.002352469,0.6196578,0.006577998,0.0006512342,0.0001777835,0.0006726029,0.001738501,0.1557772],"genre_scores_gemma":[0.9149145,0.0005987988,0.07110613,0.001262552,0.0003991546,0.0001693449,0.0003593293,0.0001860149,0.01100418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005928986,"threshold_uncertainty_score":0.03135592,"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","authors":[{"name":"James P. Delgrande","is_ca":true},{"name":"Torsten Schaub","is_ca":false},{"name":"Hans Tompits","is_ca":false},{"name":"Stefan Woltran","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009516712,0.0009505652,0.00118734,0.002363731,0.001647414,0.004906144,0.004571511,0.002987492,0.004758446],"category_scores_gemma":[0.02388286,0.0009191079,0.003330682,0.002268821,0.006972685,0.01073801,0.005535081,0.00741719,0.000509895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003877932,"about_ca_system_score_gemma":0.001521658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001462219,"about_ca_topic_score_gemma":0.001210717,"domain_scores_codex":[0.9907403,0.004218768,0.0003941997,0.001384224,0.002583305,0.0006791102],"domain_scores_gemma":[0.9833408,0.01165054,0.001234889,0.002102823,0.001153359,0.0005176094],"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.00002511839,0.00005731235,0.0002237034,0.0000728384,0.00004437561,0.00006436682,0.0004965591,0.01874653,0.0007869315,0.9658424,0.0006695846,0.01297035],"study_design_scores_gemma":[0.00001725694,0.00004949671,0.00008539476,0.00002859916,0.00002947353,0.00005778088,0.00008958098,0.09933931,0.000750033,0.8961928,0.003338414,0.00002192178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005535049,0.000323098,0.9876788,0.001891697,0.00006257457,0.00004995598,0.00003876246,0.0001161224,0.004304032],"genre_scores_gemma":[0.4394409,0.0006671466,0.5522982,0.001219151,0.0006492948,0.0004639615,0.0001606544,0.0001386038,0.004962082],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009516712,"threshold_uncertainty_score":0.0503298,"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","authors":[{"name":"Panos Rondogiannis","is_ca":false},{"name":"William W. Wadge","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001766154,0.0007923537,0.0008704636,0.00137504,0.001393344,0.003432591,0.002356553,0.001495493,0.003333531],"category_scores_gemma":[0.002978475,0.0006133208,0.002349708,0.001224984,0.00387922,0.008335372,0.003314878,0.003994444,0.000456528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002801336,"about_ca_system_score_gemma":0.001814515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002084662,"about_ca_topic_score_gemma":0.002254771,"domain_scores_codex":[0.9984767,0.0003430796,0.0001156211,0.0002675614,0.0005750128,0.0002221159],"domain_scores_gemma":[0.9985592,0.0006455668,0.0001858649,0.0002199999,0.0002547693,0.0001346658],"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.0000293845,0.00003184442,0.0001795996,0.0000506873,0.00001466598,0.0001060493,0.0004825245,0.004974816,0.00143828,0.9883631,0.0004390494,0.003890075],"study_design_scores_gemma":[0.00003049707,0.00003731856,0.00008684657,0.0000329772,0.00002106975,0.0001082735,0.0001478325,0.04066686,0.002680355,0.9513504,0.004818921,0.00001875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03558721,0.0002317487,0.9508844,0.001115796,0.00005403341,0.0001075007,0.0002940396,0.0007532031,0.0109721],"genre_scores_gemma":[0.6873579,0.0002936444,0.3049319,0.0004101259,0.0001103928,0.0005895728,0.0006813791,0.0004614559,0.00516363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003432591,"threshold_uncertainty_score":0.02032518,"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","authors":[{"name":"Mingsheng Ying","is_ca":false},{"name":"Yangjia Li","is_ca":false},{"name":"Nengkun Yu","is_ca":true},{"name":"Yuan Feng","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003915179,0.0008766289,0.001307242,0.001184238,0.001149834,0.003650948,0.003860942,0.001244588,0.003247482],"category_scores_gemma":[0.01801682,0.0008465984,0.00259413,0.0009591536,0.004833415,0.006728124,0.002810331,0.003133797,0.0004389566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0037533,"about_ca_system_score_gemma":0.003870089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009989326,"about_ca_topic_score_gemma":0.008757016,"domain_scores_codex":[0.9948218,0.001128167,0.0004005818,0.001060718,0.001743979,0.0008446674],"domain_scores_gemma":[0.98111,0.01280376,0.001831585,0.002634333,0.001316601,0.0003038086],"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.0005762305,0.0003932031,0.003825551,0.0004080765,0.0002534103,0.0007240638,0.0008371952,0.4391464,0.03165434,0.491012,0.001104001,0.0300655],"study_design_scores_gemma":[0.00007333155,0.00009006706,0.0001788586,0.00001998144,0.00006742869,0.00004852692,0.00006028639,0.7989248,0.03041859,0.1693656,0.000713471,0.00003906215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1073888,0.00009946693,0.8865423,0.0002599678,0.00004804795,0.0001113138,0.0001891544,0.002991174,0.002369781],"genre_scores_gemma":[0.9027572,0.00009322339,0.09531625,0.0001419324,0.000034046,0.0001547222,0.0003070663,0.0002822406,0.0009133092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009989326,"threshold_uncertainty_score":0.02723223,"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","authors":[{"name":"Giuseppe De Giacomo","is_ca":false},{"name":"Hector J. Levesque","is_ca":true},{"name":"Sebastian Sardiña","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001747279,0.0004469191,0.0004032372,0.000578923,0.0005750933,0.001337014,0.00174011,0.0005778595,0.003373398],"category_scores_gemma":[0.007172005,0.0005123304,0.001011055,0.0004312989,0.001891546,0.00258475,0.002638485,0.001336082,0.0004081295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009912532,"about_ca_system_score_gemma":0.001542627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003544871,"about_ca_topic_score_gemma":0.007553176,"domain_scores_codex":[0.99858,0.0005075473,0.00009144347,0.0002036566,0.0003859722,0.0002314168],"domain_scores_gemma":[0.9966819,0.002084857,0.0001405058,0.0006662543,0.0003157989,0.000110675],"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.0006581912,0.0002410934,0.00546986,0.0006006999,0.0001337067,0.001226016,0.002014416,0.1775837,0.02286282,0.6101521,0.005073444,0.173984],"study_design_scores_gemma":[0.0001111155,0.0001154537,0.000582399,0.0000880083,0.0001054184,0.0001359932,0.0001928609,0.6274358,0.02102119,0.3370396,0.01312909,0.00004304044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0920838,0.0003050139,0.8852696,0.0004699753,0.00008698954,0.0001646368,0.0003004249,0.00795724,0.01336219],"genre_scores_gemma":[0.6189023,0.0002463027,0.3764241,0.0001735668,0.00003869063,0.0001519706,0.0005284075,0.0005113038,0.003023222],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003544871,"threshold_uncertainty_score":0.01128507,"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","authors":[{"name":"Angelos Charalambidis","is_ca":false},{"name":"Konstantinos Handjopoulos","is_ca":false},{"name":"Panagiotis Rondogiannis","is_ca":false},{"name":"William W. Wadge","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003933516,0.0007212754,0.0006273848,0.001404913,0.0008628832,0.003186383,0.002683744,0.0008193466,0.004633391],"category_scores_gemma":[0.003235268,0.000423207,0.001840769,0.001311267,0.002977471,0.006940446,0.003491473,0.002890213,0.0006777627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001353068,"about_ca_system_score_gemma":0.001159149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005341259,"about_ca_topic_score_gemma":0.001021622,"domain_scores_codex":[0.9973233,0.0009055228,0.0002245673,0.0004350783,0.0009138098,0.0001977176],"domain_scores_gemma":[0.9980367,0.0008338887,0.0001535676,0.0005000153,0.0003458917,0.0001299475],"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.00001405075,0.00003394812,0.0001051015,0.00007487217,0.00001372389,0.00008457212,0.0001623231,0.002758228,0.0008053364,0.9809622,0.0005704876,0.01441522],"study_design_scores_gemma":[0.00002614336,0.00003305562,0.00009205905,0.00003110413,0.00002049741,0.0001859999,0.00005544968,0.02573844,0.001363809,0.9562427,0.01619409,0.00001653968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008124014,0.0003911356,0.9773008,0.0008235613,0.0001160812,0.00007668747,0.0001408054,0.0003911839,0.01263564],"genre_scores_gemma":[0.3249131,0.0006463734,0.6635606,0.0007034373,0.0003060057,0.000201726,0.0003431299,0.0001269097,0.009198715],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004633391,"threshold_uncertainty_score":0.02080268,"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","authors":[{"name":"Michael Blondin","is_ca":true},{"name":"Alain Finkel","is_ca":false},{"name":"Christoph Haase","is_ca":false},{"name":"Serge Haddad","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003068823,0.001345334,0.0007197504,0.00191197,0.001408488,0.005339134,0.002366088,0.001515517,0.005359566],"category_scores_gemma":[0.007147965,0.0008780705,0.002304981,0.001913494,0.0103973,0.008439112,0.002449043,0.005473348,0.000919509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00330327,"about_ca_system_score_gemma":0.001838234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002614333,"about_ca_topic_score_gemma":0.001886423,"domain_scores_codex":[0.996855,0.001047541,0.0002428247,0.0006830788,0.0008907195,0.0002809398],"domain_scores_gemma":[0.9942045,0.004089403,0.000425093,0.0006368259,0.0004033938,0.0002408152],"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.00001924398,0.00001283919,0.0001098937,0.0001112426,0.000009838954,0.0001064284,0.0001095956,0.01062986,0.0007972582,0.9826151,0.0004177541,0.005060795],"study_design_scores_gemma":[0.00001877728,0.0000305473,0.00008109106,0.00006018182,0.00001720834,0.00009592505,0.00006257793,0.03594344,0.001106749,0.9509139,0.01165493,0.00001464664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006137711,0.001461098,0.9747407,0.001882064,0.0002114847,0.00006049699,0.0002890378,0.000274681,0.01494277],"genre_scores_gemma":[0.3520688,0.00478323,0.6287934,0.001680774,0.001331204,0.0006227904,0.0008052107,0.0002728034,0.009641833],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005359566,"threshold_uncertainty_score":0.02396703,"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","authors":[{"name":"Arie Gurfinkel","is_ca":false},{"name":"Marsha Chećhik","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006492449,0.0008373233,0.001214874,0.002289176,0.001604398,0.003914874,0.002262538,0.001567117,0.003407867],"category_scores_gemma":[0.02658142,0.0009051015,0.002881663,0.00221052,0.005675228,0.007189348,0.004038026,0.007060933,0.0004777341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004897924,"about_ca_system_score_gemma":0.001864402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004446039,"about_ca_topic_score_gemma":0.002770606,"domain_scores_codex":[0.9915425,0.001895305,0.0006450305,0.00164278,0.003670331,0.000604025],"domain_scores_gemma":[0.9799981,0.01386851,0.001454474,0.002652949,0.001630238,0.0003956754],"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.0002402801,0.00009103791,0.00153434,0.0003936453,0.0001151969,0.0004386149,0.0008785572,0.04344482,0.009325893,0.9018469,0.002403465,0.03928721],"study_design_scores_gemma":[0.00003017305,0.00002844583,0.0001892776,0.00003680553,0.00003446091,0.0001161017,0.00006429678,0.1305026,0.003386937,0.8633698,0.002213591,0.00002754718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04186722,0.0007565185,0.9402775,0.002352326,0.00007621609,0.0002403025,0.0003304723,0.003253418,0.01084619],"genre_scores_gemma":[0.6629657,0.0008502139,0.3295902,0.001190078,0.0002849209,0.000348734,0.0009333211,0.0004355907,0.003401311],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006492449,"threshold_uncertainty_score":0.03553706,"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","authors":[{"name":"Yi-Dong Shen","is_ca":false},{"name":"Jia-Huai You","is_ca":true},{"name":"Li-Yan Yuan","is_ca":true},{"name":"Samuel S. P. Shen","is_ca":true},{"name":"Qiang Yang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003303509,0.0009419902,0.0008223064,0.003238733,0.001309284,0.002039946,0.002276647,0.001260297,0.00235963],"category_scores_gemma":[0.008243034,0.0006653008,0.001355329,0.001898295,0.004667381,0.007413414,0.003443817,0.003509982,0.0003602813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002607128,"about_ca_system_score_gemma":0.001200585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001554095,"about_ca_topic_score_gemma":0.001294729,"domain_scores_codex":[0.9961399,0.0007931311,0.0003516232,0.0007560654,0.001519334,0.0004399274],"domain_scores_gemma":[0.9926078,0.003700568,0.0009702536,0.001227806,0.001104355,0.0003892286],"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.0001742777,0.000119264,0.004104764,0.0002896229,0.00005879783,0.0005551823,0.000952236,0.08529755,0.0195292,0.8302246,0.001326222,0.05736828],"study_design_scores_gemma":[0.00003351133,0.0001018315,0.0009435399,0.00006227821,0.00005452872,0.0004910225,0.0001321447,0.3041022,0.008047829,0.6755745,0.0103992,0.00005740227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03253062,0.0003021579,0.9600396,0.0002443331,0.00001954878,0.00009409571,0.000172892,0.0003891551,0.006207509],"genre_scores_gemma":[0.5972053,0.0005872936,0.3958777,0.0002723258,0.000159382,0.0003911329,0.0007236552,0.0003774174,0.0044058],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003303509,"threshold_uncertainty_score":0.01891607,"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","authors":[{"name":"Kedar S. Namjoshi","is_ca":false},{"name":"Richard Trefler","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03668404,0.001702205,0.002175808,0.003347462,0.004019518,0.004854936,0.003398327,0.003056334,0.005026496],"category_scores_gemma":[0.09883411,0.001845626,0.004858962,0.00168021,0.0113786,0.01829664,0.008261238,0.00833887,0.001902123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002174231,"about_ca_system_score_gemma":0.005206001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003083667,"about_ca_topic_score_gemma":0.002598175,"domain_scores_codex":[0.966875,0.01294672,0.002789128,0.003539787,0.0123997,0.001449751],"domain_scores_gemma":[0.854274,0.1096046,0.003179493,0.01979587,0.01209994,0.00104615],"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.000144247,0.0001317393,0.0007115211,0.0004863743,0.0001168931,0.0002056008,0.001659774,0.02445897,0.002339076,0.9166059,0.001906139,0.05123364],"study_design_scores_gemma":[0.00007173422,0.00005180573,0.00009832209,0.0001226571,0.00005442641,0.00009264516,0.0001126484,0.0681841,0.003931483,0.9213177,0.005925782,0.00003657984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009319447,0.0005994298,0.9805191,0.001206418,0.0000807558,0.0002158503,0.000126548,0.0005554467,0.007377062],"genre_scores_gemma":[0.1632432,0.001288933,0.8280579,0.0007611418,0.0004288749,0.0007265556,0.0006649739,0.0005870334,0.004241427],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03668404,"threshold_uncertainty_score":0.194006,"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","authors":[{"name":"Brigitte Pientka","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001419088,0.0006420665,0.001094828,0.002405268,0.001130675,0.003060628,0.002222469,0.0008978068,0.006732358],"category_scores_gemma":[0.003790309,0.0006285362,0.00177599,0.004190372,0.001855438,0.006341379,0.002701911,0.001847834,0.004195236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001269682,"about_ca_system_score_gemma":0.0020493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002448802,"about_ca_topic_score_gemma":0.002803975,"domain_scores_codex":[0.9979289,0.0002952274,0.0003082238,0.0003373174,0.000894459,0.0002358634],"domain_scores_gemma":[0.9976007,0.0006420825,0.000190449,0.0009248334,0.0005421908,0.0000997416],"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.0001807477,0.0001309289,0.001234972,0.0003736985,0.00005997381,0.0003341197,0.001113495,0.008895462,0.03008877,0.6862498,0.00640174,0.2649364],"study_design_scores_gemma":[0.00009544501,0.0002754042,0.0004450964,0.0001334294,0.0001392013,0.001041994,0.0002925653,0.1540242,0.07433981,0.6422143,0.1268315,0.0001670957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009187983,0.0002473687,0.9826521,0.0001448623,0.00009648816,0.0001071351,0.0002269152,0.00266772,0.004669501],"genre_scores_gemma":[0.1017951,0.0003685593,0.8889974,0.0001724371,0.00008062255,0.000130731,0.000724419,0.0009871729,0.006743523],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006732358,"threshold_uncertainty_score":0.02252191,"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","authors":[{"name":"Leonid Libkin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005916869,0.0008454802,0.001190254,0.00177794,0.001984067,0.00438888,0.002626488,0.001370819,0.007764488],"category_scores_gemma":[0.02949625,0.00150813,0.00449175,0.002821143,0.003482979,0.0104693,0.003448201,0.007441396,0.0008593844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002658169,"about_ca_system_score_gemma":0.003099567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005063171,"about_ca_topic_score_gemma":0.008730722,"domain_scores_codex":[0.9913831,0.001855458,0.0006262065,0.001814693,0.00322107,0.001099445],"domain_scores_gemma":[0.9584879,0.03394363,0.001964049,0.003888585,0.001255385,0.000460405],"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.0002214242,0.000202621,0.002011461,0.0003738225,0.00008783071,0.0003634983,0.0007719365,0.04730903,0.003661401,0.8704905,0.003577413,0.07092901],"study_design_scores_gemma":[0.00005613932,0.00004545907,0.0005426829,0.00005413514,0.00006195347,0.0003099449,0.0001010226,0.186851,0.00667761,0.7988282,0.006432902,0.00003902109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02940326,0.0002079188,0.9597971,0.0007948316,0.00003637812,0.000164916,0.0007295917,0.0007967039,0.008069139],"genre_scores_gemma":[0.4454943,0.0008410464,0.5378852,0.0006542336,0.0003676864,0.0006830002,0.004020379,0.0005608913,0.009493295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007764488,"threshold_uncertainty_score":0.03129172,"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","authors":[{"name":"Michael Benedikt","is_ca":false},{"name":"Leonid Libkin","is_ca":true},{"name":"Frank Neven","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003734157,0.0006325687,0.0008393436,0.001256339,0.001280268,0.005330448,0.002306223,0.001437145,0.002607882],"category_scores_gemma":[0.01189927,0.000803976,0.002096145,0.002529748,0.004669106,0.01456087,0.00219266,0.002977135,0.0003461617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003286307,"about_ca_system_score_gemma":0.002102436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004334143,"about_ca_topic_score_gemma":0.004383346,"domain_scores_codex":[0.9944042,0.001455669,0.0005742578,0.001068226,0.001820317,0.0006773671],"domain_scores_gemma":[0.9860684,0.01000902,0.001345111,0.001506834,0.0006613639,0.000409276],"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.00006565155,0.00006824853,0.0006572257,0.000100197,0.00001936607,0.0001807395,0.0007850085,0.01250037,0.002382241,0.9715025,0.0004424603,0.01129596],"study_design_scores_gemma":[0.0000523389,0.00005927212,0.0003494259,0.00003268288,0.00004707745,0.0002777478,0.0002392382,0.07511575,0.003471964,0.9147631,0.005556833,0.00003451672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.211913,0.001058313,0.7699096,0.001723736,0.00006661739,0.0002088458,0.0008121351,0.0009554107,0.01335237],"genre_scores_gemma":[0.7406166,0.0007494802,0.2508033,0.0004531702,0.000202725,0.0003138341,0.0009773322,0.0002115689,0.005672079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005330448,"threshold_uncertainty_score":0.02384388,"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","authors":[{"name":"John V. Tucker","is_ca":false},{"name":"J. I. Zucker","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002390911,0.0005624426,0.000676712,0.001304573,0.001002097,0.003390671,0.001165129,0.000992406,0.002731373],"category_scores_gemma":[0.009110196,0.000386902,0.00125659,0.001404816,0.007526838,0.009284429,0.002898052,0.002452901,0.0003881906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003136575,"about_ca_system_score_gemma":0.002282422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004357592,"about_ca_topic_score_gemma":0.002348589,"domain_scores_codex":[0.9952635,0.001241621,0.0006085875,0.0008130058,0.001481316,0.0005921177],"domain_scores_gemma":[0.9945989,0.00203811,0.0004921004,0.001075192,0.001539631,0.0002562496],"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.000005886056,0.000004653146,0.0001271664,0.00001673648,0.00000317978,0.00001770777,0.0001134044,0.001547777,0.0003673796,0.9957942,0.0001298196,0.00187217],"study_design_scores_gemma":[0.00001405109,0.00001959725,0.0001592597,0.00003009507,0.00001573452,0.0000865932,0.0001564926,0.0196353,0.003567422,0.9689531,0.007339587,0.00002265142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1447768,0.0009562142,0.815015,0.00159213,0.0001269106,0.0001156173,0.0005057507,0.0009755506,0.03593622],"genre_scores_gemma":[0.9186426,0.0004944995,0.07446375,0.0002674038,0.00007681741,0.0001630153,0.0005417265,0.0001349291,0.005215368],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004357592,"threshold_uncertainty_score":0.02275753,"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","authors":[{"name":"Stéphane Demri","is_ca":false},{"name":"Morgan Deters","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005027426,0.0007548961,0.0009688253,0.001335837,0.002077271,0.004958284,0.00248402,0.001443693,0.003087989],"category_scores_gemma":[0.01246405,0.001281291,0.002277616,0.001087011,0.005936337,0.01074968,0.005011195,0.006608706,0.0005737754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002418935,"about_ca_system_score_gemma":0.003647718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003465486,"about_ca_topic_score_gemma":0.003193887,"domain_scores_codex":[0.9937635,0.001407374,0.0004975802,0.001116842,0.002371376,0.0008434663],"domain_scores_gemma":[0.9825231,0.01215338,0.0008304474,0.002298993,0.001758971,0.0004351902],"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.0002679461,0.0001143664,0.001195311,0.0003194664,0.00008202478,0.0003053805,0.001449179,0.01321343,0.009188666,0.9494648,0.00217846,0.02222099],"study_design_scores_gemma":[0.00007280689,0.00004451644,0.0003233895,0.00005183121,0.00007614816,0.000218151,0.0002079,0.04046202,0.01243922,0.9382863,0.007767146,0.00005061283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2496399,0.001143008,0.6957758,0.005365408,0.0001853446,0.000121547,0.001120439,0.00260911,0.04403944],"genre_scores_gemma":[0.8638516,0.0005950499,0.1237377,0.001188667,0.00019198,0.0001407955,0.00104975,0.0003870901,0.008857492],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005027426,"threshold_uncertainty_score":0.0265879,"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","authors":[{"name":"Leonid Libkin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002559462,0.0005739669,0.0006063213,0.001502055,0.001576433,0.002634881,0.00161999,0.00106295,0.002928562],"category_scores_gemma":[0.005431212,0.0006041382,0.001477101,0.001106137,0.004513236,0.009289536,0.004078378,0.002594475,0.0003948307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002377943,"about_ca_system_score_gemma":0.001104239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00184694,"about_ca_topic_score_gemma":0.002426665,"domain_scores_codex":[0.9976954,0.0006149486,0.0001745722,0.0005972386,0.0005605198,0.0003572979],"domain_scores_gemma":[0.9956084,0.002114292,0.0003643882,0.001135846,0.0005309381,0.0002462556],"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.00003814391,0.00002640791,0.0006709169,0.00008208545,0.00001608935,0.0001826557,0.0006441954,0.002993805,0.003407511,0.9775643,0.000583312,0.01379067],"study_design_scores_gemma":[0.00002414975,0.00004004079,0.0004035201,0.00003570136,0.00004888927,0.0003190831,0.0002885135,0.02218417,0.005982453,0.9613389,0.009307149,0.00002749274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1372717,0.0006681592,0.817848,0.001312793,0.00008050692,0.0001439766,0.0005191865,0.001756381,0.04039939],"genre_scores_gemma":[0.8508167,0.0002705692,0.1411841,0.0004950821,0.0001036236,0.0001615458,0.0003550408,0.0001481807,0.006465028],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002928562,"threshold_uncertainty_score":0.01725328,"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","authors":[{"name":"Akitoshi Kawamura","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008916049,0.0004160225,0.0005072037,0.0009862995,0.001290473,0.002222133,0.001123538,0.0008799337,0.008068248],"category_scores_gemma":[0.002741556,0.0002155119,0.0008686789,0.0008647224,0.003752692,0.004537167,0.002261956,0.002295791,0.001599899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001997872,"about_ca_system_score_gemma":0.0007397936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001058721,"about_ca_topic_score_gemma":0.00102014,"domain_scores_codex":[0.9991504,0.0001768563,0.00003696112,0.0001977108,0.0003253188,0.0001127763],"domain_scores_gemma":[0.9991705,0.0003084781,0.00006069923,0.0002107821,0.0001694,0.00008005088],"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.000001276315,0.000001615371,0.00001822437,0.000004713291,6.45832e-7,0.000008685189,0.00003210333,0.0001751061,0.00009336614,0.9969637,0.0003739283,0.002326582],"study_design_scores_gemma":[0.000002924485,0.000007488202,0.00003379914,0.000009251229,0.000003450032,0.00007323348,0.00001737387,0.004492283,0.000371191,0.9614223,0.03356116,0.000005506215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01688537,0.003371753,0.7280754,0.003708824,0.0009172006,0.0000544396,0.0002455403,0.0003446757,0.2463968],"genre_scores_gemma":[0.7160951,0.00443411,0.2024132,0.002657173,0.001206942,0.0001912191,0.0002778453,0.0002958142,0.07242849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008068248,"threshold_uncertainty_score":0.02699095,"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","authors":[{"name":"Samuel R. Buss","is_ca":false},{"name":"Bruce M. Kapron","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003273569,0.0007225815,0.0008796058,0.0009720062,0.001164118,0.002870041,0.001882496,0.001313711,0.005080863],"category_scores_gemma":[0.01304495,0.0007358154,0.00174578,0.00101861,0.005151831,0.008129041,0.003727192,0.00372603,0.0005592507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001538806,"about_ca_system_score_gemma":0.001767315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00163585,"about_ca_topic_score_gemma":0.0008139284,"domain_scores_codex":[0.9964111,0.0007227745,0.0003299762,0.0008771582,0.001072714,0.0005862121],"domain_scores_gemma":[0.989076,0.005868794,0.0007846019,0.002508878,0.00116007,0.0006016153],"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.00009096279,0.00004609775,0.0007722464,0.00008209877,0.00002263686,0.000347047,0.0003826718,0.01584801,0.003199066,0.9705694,0.0003109206,0.008328839],"study_design_scores_gemma":[0.00004684914,0.0001080609,0.0003985205,0.00005102721,0.00004131364,0.0004117183,0.0001191893,0.1453145,0.009617941,0.8376412,0.006205746,0.00004391619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0763561,0.0001757912,0.9096267,0.000497871,0.00006997246,0.0001272768,0.0001875516,0.0004714521,0.01248727],"genre_scores_gemma":[0.8078091,0.00025102,0.1836729,0.0002852423,0.00009430356,0.0004631238,0.0002942416,0.0002116445,0.006918353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005080863,"threshold_uncertainty_score":0.01731247,"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","authors":[{"name":"Martin Grohe","is_ca":false},{"name":"Daniel Neuen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001614872,0.0008220683,0.0008349753,0.001365367,0.001271486,0.003291936,0.001987209,0.001007246,0.01003496],"category_scores_gemma":[0.01185345,0.0005989893,0.00228318,0.001312337,0.003363533,0.008073947,0.003152364,0.003423034,0.0006854016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002773875,"about_ca_system_score_gemma":0.001616547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003788721,"about_ca_topic_score_gemma":0.004117005,"domain_scores_codex":[0.9971178,0.0005016503,0.0001372137,0.001026079,0.0006132401,0.0006040921],"domain_scores_gemma":[0.9899021,0.006627817,0.0007342431,0.001724137,0.000512359,0.0004992341],"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.0005225691,0.0004308532,0.004679468,0.0004026866,0.00008610987,0.0003293012,0.001304076,0.02266532,0.01029789,0.8978443,0.004669769,0.05676777],"study_design_scores_gemma":[0.00009562491,0.0001361794,0.001520841,0.00004515153,0.0001102507,0.0002193672,0.0003549066,0.06199251,0.01303326,0.9169607,0.005470875,0.00006041107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6174412,0.0003936802,0.3401637,0.002274509,0.0001155203,0.000198178,0.001153431,0.003147484,0.03511231],"genre_scores_gemma":[0.9352975,0.0002035759,0.054382,0.0004846646,0.0000942189,0.0001138573,0.001978366,0.0003652365,0.007080422],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01003496,"threshold_uncertainty_score":0.03357023,"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","authors":[{"name":"Konstantinos Chatzikokolakis","is_ca":false},{"name":"Sophia Knight","is_ca":false},{"name":"Catuscia Palamidessi","is_ca":false},{"name":"Prakash Panangaden","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003299581,0.001320466,0.0008212356,0.001774448,0.001875351,0.0035617,0.0019828,0.001953475,0.004902564],"category_scores_gemma":[0.006395047,0.0006491545,0.002094251,0.001493314,0.004786142,0.008228063,0.002975652,0.003002948,0.0008629839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00262414,"about_ca_system_score_gemma":0.002400232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004663717,"about_ca_topic_score_gemma":0.003685045,"domain_scores_codex":[0.9961393,0.001688528,0.0003894542,0.0004826591,0.0009012417,0.0003988191],"domain_scores_gemma":[0.9968975,0.00155541,0.0003297364,0.0002893528,0.0005805486,0.0003474632],"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.000005403918,0.00001085558,0.0000387478,0.00001637521,0.000004833529,0.00004202469,0.0001535944,0.002597691,0.0001824704,0.9954436,0.0001252701,0.001379256],"study_design_scores_gemma":[0.00001915345,0.00001837824,0.00003798232,0.00001931034,0.000009767503,0.00005326205,0.00007457926,0.01957678,0.0002993841,0.9729171,0.006962938,0.00001146733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01683985,0.0008038823,0.9502618,0.001514504,0.0001762236,0.000203262,0.0001314254,0.0002102513,0.02985891],"genre_scores_gemma":[0.5456319,0.001412472,0.4342209,0.0007584124,0.0004458542,0.001014414,0.0003502972,0.0001512515,0.01601447],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004902564,"threshold_uncertainty_score":0.01903957,"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","authors":[{"name":"Jason Z. S. Hu","is_ca":true},{"name":"Brigitte Pientka","is_ca":true},{"name":"Ulrich Schöpp","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001890884,0.0007383891,0.000753262,0.002538033,0.002033829,0.0052012,0.002451957,0.001774941,0.007447452],"category_scores_gemma":[0.003311971,0.0008033484,0.001331664,0.002175163,0.009051675,0.01193065,0.004650097,0.003898058,0.0009919372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002915933,"about_ca_system_score_gemma":0.001336957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005966763,"about_ca_topic_score_gemma":0.004070283,"domain_scores_codex":[0.9980174,0.0005467554,0.00009647723,0.0004802117,0.0005325965,0.0003264197],"domain_scores_gemma":[0.9979505,0.0005843798,0.0001515078,0.000624625,0.0004239244,0.0002650861],"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.000006510578,0.000003402051,0.000092235,0.00001731589,0.00000278512,0.00003169363,0.0002705093,0.0003175216,0.0002408632,0.9971101,0.0002906074,0.001616469],"study_design_scores_gemma":[0.00000924315,0.00001859264,0.0002013206,0.00003914735,0.00001659807,0.0001191996,0.0002539032,0.00341779,0.0007192548,0.9607184,0.03446542,0.00002113626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02546966,0.001760048,0.9109548,0.002458045,0.0004527109,0.00008550879,0.0005673212,0.0007782952,0.05747367],"genre_scores_gemma":[0.6788319,0.001628619,0.2949655,0.002182858,0.0007046411,0.0004260936,0.0006231459,0.0005857108,0.02005149],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007447452,"threshold_uncertainty_score":0.02491421,"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","authors":[{"name":"Denis Ponomaryov","is_ca":false},{"name":"Mikhail Soutchanski","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004760404,0.0008622219,0.0006592171,0.002692708,0.00146963,0.003108456,0.001757067,0.001250225,0.006941405],"category_scores_gemma":[0.01003688,0.0007437645,0.00275967,0.001209462,0.005925677,0.0100293,0.004735339,0.003879113,0.0008118094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002495033,"about_ca_system_score_gemma":0.00164027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003128985,"about_ca_topic_score_gemma":0.002798,"domain_scores_codex":[0.9968869,0.0008182079,0.0002215764,0.0006243048,0.001109915,0.0003389969],"domain_scores_gemma":[0.9953318,0.002169451,0.0003948801,0.000991498,0.0007731484,0.0003391787],"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.00006121214,0.00002740585,0.0006334328,0.000103514,0.00002873638,0.0004254094,0.001673833,0.008412669,0.002097869,0.9734995,0.0003340832,0.01270229],"study_design_scores_gemma":[0.00003169667,0.00004975594,0.0002620668,0.00005578314,0.00004161072,0.0001562422,0.0002120912,0.02699315,0.001762941,0.9654011,0.005010247,0.00002342151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.08955528,0.000598746,0.881891,0.0008356545,0.0000836735,0.0002460821,0.0002698076,0.0008733118,0.02564653],"genre_scores_gemma":[0.7034855,0.000759091,0.2833981,0.0002467577,0.0001054106,0.0002820481,0.0006504616,0.0002565115,0.01081611],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.006941405,"threshold_uncertainty_score":0.02517569,"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","authors":[{"name":"Stephen Cook","is_ca":true},{"name":"Neil Thapen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00715827,0.0006845222,0.001048847,0.002184564,0.002833353,0.005599082,0.002518849,0.001954012,0.00496265],"category_scores_gemma":[0.01459004,0.001336586,0.00239137,0.001480639,0.01320137,0.01447746,0.008820851,0.006022831,0.001018055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002737549,"about_ca_system_score_gemma":0.001882526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00217438,"about_ca_topic_score_gemma":0.00150827,"domain_scores_codex":[0.9906814,0.002325629,0.0009056556,0.002166824,0.002878459,0.001042095],"domain_scores_gemma":[0.9847354,0.008179987,0.0009004677,0.003737943,0.001805761,0.0006403772],"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.00005728314,0.00001111963,0.0006724633,0.00009055979,0.00002155995,0.00006220938,0.00034311,0.0008549806,0.001227169,0.9904997,0.0005954761,0.005564373],"study_design_scores_gemma":[0.00004528096,0.0001247004,0.0006094588,0.00006056593,0.00007086468,0.000218319,0.0002596806,0.009006488,0.004996988,0.9709936,0.01356884,0.00004521714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2360043,0.001898103,0.623687,0.005834309,0.0005299185,0.0001898735,0.0006227285,0.001681183,0.1295525],"genre_scores_gemma":[0.9183533,0.0005084366,0.07029548,0.0009943462,0.0003355207,0.0001654573,0.0003290283,0.000180533,0.008837947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00715827,"threshold_uncertainty_score":0.037857,"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","authors":[{"name":"Fangzhen Lin","is_ca":false},{"name":"Jia-Huai You","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006510509,0.0008559598,0.001530792,0.001741164,0.001588844,0.003569033,0.002614653,0.002037562,0.004522557],"category_scores_gemma":[0.02568924,0.001263059,0.002002564,0.001438274,0.003586433,0.0055143,0.003200141,0.003495248,0.001023178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002068192,"about_ca_system_score_gemma":0.00153067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003659551,"about_ca_topic_score_gemma":0.004643836,"domain_scores_codex":[0.9922168,0.003204951,0.000967535,0.00102864,0.002056969,0.0005250939],"domain_scores_gemma":[0.9815694,0.01357402,0.0005907489,0.002892465,0.001237988,0.0001353378],"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.0007405947,0.0004380102,0.00210251,0.001159897,0.0002439792,0.001003973,0.004083865,0.1149672,0.0279079,0.5765982,0.003719593,0.2670343],"study_design_scores_gemma":[0.0002773642,0.0002697279,0.00056911,0.0002260131,0.0003967616,0.0005220647,0.0005385215,0.4096133,0.03995677,0.5333414,0.01408076,0.0002082853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05676705,0.0009504457,0.9305896,0.0005723722,0.00009862974,0.0003948841,0.0002075033,0.005225261,0.005194276],"genre_scores_gemma":[0.3864938,0.0006398922,0.6053135,0.0004197106,0.00009263658,0.0003060676,0.0005931316,0.001131864,0.005009321],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006510509,"threshold_uncertainty_score":0.03443128,"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","authors":[{"name":"Heba Aamer","is_ca":false},{"name":"Bart Bogaerts","is_ca":false},{"name":"Dimitri Surinx","is_ca":false},{"name":"Eugenia Ternovska","is_ca":true},{"name":"Jan Van den Bussche","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00722358,0.001091845,0.0006928784,0.002059447,0.002070588,0.006271733,0.001516685,0.00233773,0.003021945],"category_scores_gemma":[0.008531535,0.0009846307,0.002021512,0.002069073,0.01134041,0.01407055,0.00325816,0.005165964,0.0004696621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003263703,"about_ca_system_score_gemma":0.002207927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003332516,"about_ca_topic_score_gemma":0.001882705,"domain_scores_codex":[0.9926746,0.003138287,0.0006661594,0.00127976,0.001623609,0.0006175936],"domain_scores_gemma":[0.9952385,0.003409548,0.0003435307,0.0004198566,0.0004260675,0.0001624711],"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.00004092396,0.00001237185,0.00010565,0.0000455446,0.000008333885,0.00005867249,0.0003012536,0.00377047,0.0003906353,0.9890948,0.0003174132,0.005853849],"study_design_scores_gemma":[0.00001504729,0.0000144206,0.00004432019,0.00002314404,0.00001770988,0.00004490416,0.00005393733,0.01584279,0.0007762833,0.9792925,0.003861564,0.00001331272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02476225,0.001648813,0.9470974,0.003598247,0.0001943551,0.0000930558,0.0002531742,0.0004998309,0.02185306],"genre_scores_gemma":[0.5250843,0.002049536,0.4596318,0.001346129,0.0006243399,0.0004667046,0.0004677968,0.0002956176,0.01003386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00722358,"threshold_uncertainty_score":0.0382024,"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","authors":[{"name":"Benoît Larose","is_ca":true},{"name":"Barnaby Martin","is_ca":false},{"name":"Petar Marković","is_ca":false},{"name":"Daniël Paulusma","is_ca":false},{"name":"Siani Smith","is_ca":false},{"name":"Stanislav Živný","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001728993,0.0008543688,0.000961851,0.0008406655,0.001484464,0.00365957,0.002140592,0.001295028,0.01041836],"category_scores_gemma":[0.007821896,0.0004962601,0.001996429,0.002057336,0.002054358,0.00551411,0.003082786,0.003812733,0.0006129596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002027474,"about_ca_system_score_gemma":0.001364063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004480776,"about_ca_topic_score_gemma":0.003380318,"domain_scores_codex":[0.9970582,0.0006990492,0.0001987767,0.0007715851,0.0007135291,0.0005589531],"domain_scores_gemma":[0.9924241,0.004825916,0.0006858542,0.0008499904,0.0006486246,0.0005654208],"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.0005023986,0.0003057116,0.00187191,0.0005046532,0.0001801625,0.000472902,0.0006006045,0.08782452,0.007209492,0.8459517,0.008412216,0.04616387],"study_design_scores_gemma":[0.0001331335,0.0000975019,0.0006261017,0.00004031946,0.00005718273,0.0001728796,0.0001262274,0.2443513,0.00237257,0.7464319,0.005554535,0.00003629598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3262964,0.0006706819,0.625586,0.004856088,0.0002249532,0.0004271338,0.002722007,0.001154555,0.03806204],"genre_scores_gemma":[0.8432865,0.0005297317,0.1404841,0.001135258,0.0002748501,0.0004242644,0.002827289,0.0002594524,0.01077854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01041836,"threshold_uncertainty_score":0.03485286,"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","authors":[{"name":"Naghmeh Ghafari","is_ca":true},{"name":"Arie Gurfinkel","is_ca":false},{"name":"Nils Klarlund","is_ca":false},{"name":"Richard Trefler","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001314912,0.0005209625,0.0006422021,0.00091552,0.0009939621,0.001411009,0.001078015,0.000829241,0.001833672],"category_scores_gemma":[0.008596687,0.0005693592,0.00104614,0.0008790462,0.001875168,0.003798015,0.001809821,0.001176636,0.0001497526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001420291,"about_ca_system_score_gemma":0.001045763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003850477,"about_ca_topic_score_gemma":0.002325917,"domain_scores_codex":[0.9985808,0.0003625391,0.0001217192,0.0003833697,0.0003400728,0.0002113923],"domain_scores_gemma":[0.9926366,0.006326621,0.0004454763,0.0002633355,0.0002086098,0.0001193317],"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.0004242766,0.00008374835,0.003445783,0.0004768714,0.00008456811,0.0006620552,0.001307178,0.7040184,0.01201949,0.2355689,0.0009678133,0.04094099],"study_design_scores_gemma":[0.00004928468,0.00005734334,0.0005353019,0.0000440045,0.00004202096,0.0001809029,0.0003733793,0.6556478,0.005593593,0.336139,0.001301687,0.00003560957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3253984,0.0004785177,0.6691965,0.0004143468,0.0000187859,0.0001019014,0.0004165632,0.0008438088,0.00313122],"genre_scores_gemma":[0.8553316,0.0003523779,0.1410079,0.00009049673,0.00002347561,0.0001632906,0.0006007506,0.0001396254,0.00229048],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003850477,"threshold_uncertainty_score":0.01030499,"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","authors":[{"name":"Tran Cao Son","is_ca":false},{"name":"Chitta Baral","is_ca":false},{"name":"Nam Tran","is_ca":false},{"name":"Sheila A. McIlraith","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004453318,0.0006044397,0.0005788234,0.0009298527,0.0009492981,0.002200213,0.001956808,0.001359091,0.002845954],"category_scores_gemma":[0.01271441,0.0007238743,0.001019251,0.0009103588,0.004402608,0.005283163,0.002716325,0.002216904,0.0003827404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001440343,"about_ca_system_score_gemma":0.001726707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003475498,"about_ca_topic_score_gemma":0.003856036,"domain_scores_codex":[0.9965714,0.001376455,0.0002069176,0.0004760546,0.001098271,0.0002707647],"domain_scores_gemma":[0.9896119,0.008502368,0.0003966783,0.0009090741,0.0004028022,0.00017712],"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.0002733705,0.0001476429,0.001166041,0.0004646993,0.00006662851,0.0006588993,0.001343551,0.3141389,0.006204916,0.5718476,0.001156071,0.1025315],"study_design_scores_gemma":[0.00006116516,0.00008808933,0.0002976487,0.00008522673,0.00005950267,0.0001997001,0.000202702,0.4492582,0.009789603,0.5306237,0.00929381,0.00004077879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01787343,0.0002748804,0.9740475,0.0004824742,0.00002478942,0.0000891318,0.00005749467,0.0003512432,0.006799094],"genre_scores_gemma":[0.5282831,0.0005065685,0.4668532,0.0002856745,0.00006932073,0.0002477504,0.0002401831,0.0001361854,0.003378009],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004453318,"threshold_uncertainty_score":0.02355164,"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","authors":[{"name":"Bahar Aameri","is_ca":true},{"name":"Michael Grüninger","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004941569,0.001061633,0.001260854,0.003888307,0.00279765,0.005689658,0.002650565,0.002082955,0.003924937],"category_scores_gemma":[0.01140669,0.001025142,0.004967079,0.002380735,0.01238295,0.0119598,0.006541632,0.006940958,0.0006501026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004764683,"about_ca_system_score_gemma":0.001460277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00379091,"about_ca_topic_score_gemma":0.002660335,"domain_scores_codex":[0.9913514,0.003040887,0.0007923926,0.001446501,0.002612953,0.00075589],"domain_scores_gemma":[0.9930797,0.003137235,0.0004573885,0.002446503,0.0006539372,0.000225172],"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.000003959912,0.000005835049,0.00004392389,0.00001603864,0.00001000011,0.00003889,0.0002500066,0.0009766641,0.0000617239,0.9972081,0.0002216618,0.001163258],"study_design_scores_gemma":[0.000004897253,0.000003563817,0.00001868334,0.00001258091,0.000006145626,0.00002665679,0.00006929547,0.002316583,0.0001054392,0.9957379,0.001694241,0.000003966424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09837732,0.003370717,0.7922603,0.005685546,0.0004166757,0.0002952879,0.0007566676,0.00086703,0.09797045],"genre_scores_gemma":[0.7451634,0.001575494,0.238414,0.001076336,0.0003570928,0.0005791387,0.001474155,0.0002578994,0.01110257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005689658,"threshold_uncertainty_score":0.03457028,"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","authors":[{"name":"Michael Blondin","is_ca":true},{"name":"Philip Offtermatt","is_ca":false},{"name":"Alex Sansfaçon-Buchanan","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005613591,0.000961615,0.001532594,0.001084616,0.001491965,0.006104704,0.003518445,0.001923824,0.00603486],"category_scores_gemma":[0.03702197,0.001335711,0.00310863,0.00128322,0.003936178,0.01205832,0.004022098,0.004447206,0.0004643681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005283774,"about_ca_system_score_gemma":0.004219525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007891197,"about_ca_topic_score_gemma":0.007308006,"domain_scores_codex":[0.9912345,0.00275508,0.0005766051,0.001836283,0.002601763,0.0009956366],"domain_scores_gemma":[0.9087682,0.08120141,0.003145705,0.004264005,0.001887386,0.0007333194],"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.001522302,0.0003768366,0.007347587,0.001301135,0.0004012714,0.001248651,0.001448875,0.5371137,0.01281515,0.3689916,0.005140353,0.06229256],"study_design_scores_gemma":[0.0001216807,0.00003837403,0.0004747758,0.00003213678,0.00008473538,0.0001233785,0.0001165162,0.7133926,0.003293395,0.2813004,0.0009822954,0.00003980666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3225713,0.001000095,0.6527632,0.00670668,0.0001097755,0.0003824435,0.001641949,0.002515856,0.0123087],"genre_scores_gemma":[0.8968776,0.0004770845,0.09688113,0.0005438039,0.0001558766,0.0002952742,0.001080543,0.000291882,0.003396871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007891197,"threshold_uncertainty_score":0.03833663,"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","authors":[{"name":"Michael Blondin","is_ca":true},{"name":"Tim Leys","is_ca":false},{"name":"Filip Mazowiecki","is_ca":false},{"name":"Philip Offtermatt","is_ca":true},{"name":"Guillermo A. Pérez","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001216676,0.0009239536,0.0008562,0.0007883992,0.0009845528,0.002530408,0.002673777,0.001646534,0.005112284],"category_scores_gemma":[0.007438368,0.000408821,0.001070435,0.001101827,0.003231212,0.003375151,0.001683488,0.002403277,0.000593384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001902598,"about_ca_system_score_gemma":0.001488144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003232857,"about_ca_topic_score_gemma":0.002124327,"domain_scores_codex":[0.9979789,0.0003926036,0.000132356,0.000732737,0.0004786608,0.0002847953],"domain_scores_gemma":[0.99045,0.006714375,0.0008251768,0.0008857205,0.000680426,0.000444279],"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.000395442,0.0001962728,0.002593389,0.0005320319,0.00007226796,0.001057496,0.0006016541,0.1886994,0.012673,0.756767,0.002577637,0.03383448],"study_design_scores_gemma":[0.00009603148,0.0001543148,0.0004054316,0.00007429165,0.0000676255,0.000408758,0.0001589835,0.5957718,0.008750703,0.3861524,0.007897545,0.00006219707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1230668,0.001113036,0.8475457,0.0009777687,0.0002084583,0.0002672709,0.0006880374,0.001604468,0.02452853],"genre_scores_gemma":[0.8332484,0.0004965217,0.157927,0.000278203,0.00009750461,0.0003154658,0.0005811119,0.0001262053,0.00692951],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005112284,"threshold_uncertainty_score":0.0171023,"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","authors":[{"name":"Phuong Nguyen","is_ca":true},{"name":"Stephen Cook","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009366804,0.001386919,0.002943491,0.002012116,0.004061834,0.008771257,0.006800246,0.002775051,0.03059768],"category_scores_gemma":[0.0703525,0.002164258,0.005157184,0.003119431,0.006449935,0.02925822,0.008470449,0.009328891,0.004770371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006292156,"about_ca_system_score_gemma":0.006411459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004276708,"about_ca_topic_score_gemma":0.004709749,"domain_scores_codex":[0.9755047,0.008309005,0.001397306,0.003224321,0.009287075,0.002277582],"domain_scores_gemma":[0.8265533,0.143276,0.003116172,0.01901866,0.006339075,0.001696709],"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.002109664,0.0006336494,0.005785425,0.003645571,0.0007883473,0.001419483,0.002115147,0.07376558,0.01314652,0.6236303,0.04466733,0.228293],"study_design_scores_gemma":[0.0002535169,0.00008428739,0.001087916,0.0001554444,0.000204236,0.000328125,0.0005462703,0.1091794,0.006528592,0.8708664,0.01067896,0.00008690625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2073447,0.003623781,0.6349652,0.04108685,0.0009603303,0.001049214,0.00464729,0.008185746,0.09813687],"genre_scores_gemma":[0.6780974,0.002892818,0.2893148,0.002897664,0.001239598,0.0007997886,0.006047742,0.002375357,0.01633472],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03059768,"threshold_uncertainty_score":0.1023595,"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","authors":[{"name":"Bahar Aameri","is_ca":true},{"name":"Michael Grüninger","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003437774,0.0008636955,0.0007126073,0.00224373,0.002404823,0.004479364,0.001828898,0.002039167,0.01030806],"category_scores_gemma":[0.007589794,0.0006645645,0.003603023,0.00224758,0.006174745,0.01554652,0.003971824,0.004610603,0.001902993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003035629,"about_ca_system_score_gemma":0.001739134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005678108,"about_ca_topic_score_gemma":0.002801754,"domain_scores_codex":[0.9957504,0.0009158067,0.0004176172,0.001351881,0.001018781,0.0005453881],"domain_scores_gemma":[0.996344,0.001771311,0.0003372359,0.0006374122,0.0007182637,0.0001918054],"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.000008678211,0.000007606096,0.00009188936,0.00002656609,0.000006859598,0.00006710848,0.000285366,0.00114292,0.000278413,0.9922496,0.0005529216,0.005282205],"study_design_scores_gemma":[0.00002199481,0.00001544685,0.00007767066,0.0000299374,0.00002099408,0.0001782272,0.0001154734,0.01628644,0.0007838745,0.962018,0.02043639,0.00001554971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009839172,0.0005068558,0.9500453,0.001527392,0.0001640016,0.0001054201,0.0002693336,0.0005962651,0.03694623],"genre_scores_gemma":[0.4104059,0.00125532,0.5580473,0.0009993101,0.0004411387,0.0006944648,0.001246888,0.00046043,0.02644935],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01030806,"threshold_uncertainty_score":0.03448391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}