{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":35,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":35,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"cc26a47497b5","filters":{"venue":"Theory and Practice of Logic Programming"}},"results":[{"id":"W2174235632","doi":"10.1017/s1471068402001539","title":"A framework for compiling preferences in logic programs","year":2003,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":129,"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":"Computer science; Logic programming; Logic program; Answer set programming; Programming language; Set (abstract data type); Stable model semantics; Semantics (computer science); Compiler; Theoretical computer science; Implementation; Preference; Range (aeronautics); Program transformation; Operational semantics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06676812964106243,"gpt":0.3393231874155429,"spread":0.2725550577744805,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006031319,0.0001893143,0.0003086524,0.0000882634,0.0001641209,0.0001877198,0.0004539211,0.0001515657,0.000007116456],"category_scores_gemma":[0.007125098,0.0001469058,0.00006856693,0.0004161189,0.0001824174,0.0006593638,0.0001110453,0.0002771851,0.000003493763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000170168,"about_ca_system_score_gemma":0.00006806925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006881708,"about_ca_topic_score_gemma":0.000005261587,"domain_scores_codex":[0.9976472,0.0009857331,0.000342095,0.0004354268,0.0001547944,0.0004347083],"domain_scores_gemma":[0.9933169,0.005826415,0.000321598,0.0003132833,0.000135693,0.00008604146],"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.0001102637,0.0002652947,0.0004659854,0.00007384113,0.00001745057,0.000006953701,0.002080565,0.000005352369,0.00002340882,0.7730833,0.000001088282,0.2238665],"study_design_scores_gemma":[0.000406282,0.0007219985,0.00006527644,0.0001243337,0.00002873289,0.00007510544,0.002269848,0.0002482231,0.0002416154,0.9860529,0.009545353,0.0002203657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008074726,0.004449002,0.9675447,0.0002714053,0.0002317039,0.0008581387,5.371901e-7,0.0001403456,0.01842941],"genre_scores_gemma":[0.5822746,0.00007771058,0.4173998,0.0001113023,0.00002243132,0.00008043736,0.000001222088,0.000005200583,0.00002733933],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5741999,"threshold_uncertainty_score":0.8529923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2795456052","doi":"10.1017/s1471068415000150","title":"Abstract gringo","year":2015,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Griffith University; Deutsche Forschungsgemeinschaft; Simon Fraser University; National Science Foundation","keywords":"Computer science; Programming language; ASCII; Semantics (computer science); Syntax; Operational semantics; Natural language processing","retraction":null,"screen_n_in":null,"score":{"opus":0.04921704846220617,"gpt":0.3125891107936691,"spread":0.2633720623314629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005306801,0.0001193499,0.000164958,0.00004989204,0.00009175191,0.0001325691,0.0004135053,0.00006908301,0.000008201406],"category_scores_gemma":[0.003490038,0.00009218481,0.00003914656,0.0001839714,0.0001215944,0.0009956666,0.0002285691,0.0001680168,0.0000325163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001344504,"about_ca_system_score_gemma":0.000061499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001522299,"about_ca_topic_score_gemma":0.000001146502,"domain_scores_codex":[0.9987851,0.0003474745,0.0001949858,0.0002510105,0.0001771113,0.0002443058],"domain_scores_gemma":[0.9974965,0.001664415,0.0002272062,0.0003064117,0.0001549219,0.0001504956],"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.00009071916,0.0001049625,0.0000796286,0.00002165026,0.00001775619,0.0000279022,0.002818306,0.000003012376,0.0001135311,0.7403656,0.00004116072,0.2563158],"study_design_scores_gemma":[0.001252443,0.001012632,0.0010034,0.00008368936,0.0000840477,0.0007636251,0.004378193,0.0002638996,0.001564271,0.722815,0.2661837,0.0005950312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02326371,0.00901609,0.3840271,0.001478279,0.0007573366,0.0004463969,8.573177e-7,0.0004967086,0.5805136],"genre_scores_gemma":[0.9342471,0.00005260469,0.06525294,0.0001861057,0.00007733503,0.000008320333,7.401818e-7,0.000005306927,0.0001695087],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9109834,"threshold_uncertainty_score":0.4178154,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035142469","doi":"10.1017/s1471068414000210","title":"<tt>claspfolio</tt>2: Advances in Algorithm Selection for Answer Set Programming","year":2014,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Solver; Computer science; Selection (genetic algorithm); Modular design; Portfolio; Answer set programming; Set (abstract data type); Schedule; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.01772871674396846,"gpt":0.3088274356007915,"spread":0.291098718856823,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006353862,0.000222616,0.0003222121,0.0001564399,0.0002291561,0.00018859,0.0004030555,0.000133478,0.000004710006],"category_scores_gemma":[0.002783243,0.0001867394,0.00007688875,0.0005302646,0.0001492548,0.001875954,0.0001367662,0.000240488,0.000004299202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003078269,"about_ca_system_score_gemma":0.00004981306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001779257,"about_ca_topic_score_gemma":0.00002088011,"domain_scores_codex":[0.9976026,0.0008228433,0.0003672879,0.0005127323,0.0001915372,0.0005030127],"domain_scores_gemma":[0.9957637,0.003289685,0.0003827247,0.0002591437,0.0002054384,0.00009930693],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001215943,0.0001319227,0.0001838895,0.00007775964,0.00001222201,0.000002160042,0.001176663,0.00001296081,0.00006308957,0.3155413,0.00000667916,0.6826698],"study_design_scores_gemma":[0.001865239,0.00250833,0.0001592589,0.0001466655,0.0001090867,0.0003230558,0.002178352,0.0206548,0.00148255,0.3228453,0.6470047,0.0007226481],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001388162,0.004135617,0.9877658,0.0002783128,0.0003083844,0.0006731539,0.000001152561,0.0001847757,0.005264683],"genre_scores_gemma":[0.4689618,0.0002886554,0.5300543,0.000188887,0.0001960629,0.0001643873,0.000005997433,0.0000161183,0.0001238247],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6819472,"threshold_uncertainty_score":0.7615011,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115895293","doi":"10.1017/s1471068406002729","title":"Temporal phylogenetic networks and logic programming","year":2006,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Toronto; Austrian Science Fund; National Science Foundation","keywords":"Computer science; Phylogenetic tree; Logic programming; Constraint (computer-aided design); Set (abstract data type); Programming language; Theoretical computer science; Artificial intelligence; Mathematics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.01761395012785124,"gpt":0.2711694130920532,"spread":0.2535554629642019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003766489,0.0002723767,0.0003392652,0.00009069207,0.0003136201,0.0003225193,0.0004298517,0.0001634318,0.00000672319],"category_scores_gemma":[0.0007184548,0.0002172664,0.00006896337,0.0003807834,0.0003897691,0.0006663576,0.000365908,0.0002822094,0.000004209752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001571477,"about_ca_system_score_gemma":0.00003899661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005990064,"about_ca_topic_score_gemma":0.0000107175,"domain_scores_codex":[0.9974947,0.0008233932,0.0003911282,0.0005504954,0.0002028159,0.0005374572],"domain_scores_gemma":[0.997085,0.001850425,0.0004222284,0.0003815815,0.0001357385,0.0001250353],"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.0001010788,0.000198116,0.001601396,0.00005447963,0.0000282474,0.00004986172,0.0003943843,0.00005142029,0.0001156401,0.6186855,0.00001631163,0.3787035],"study_design_scores_gemma":[0.002760911,0.003448281,0.00516005,0.0002560006,0.0004480045,0.00259715,0.002746063,0.009645984,0.0006651934,0.8379268,0.1324033,0.001942225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02145218,0.02962647,0.9241608,0.0007205647,0.0003335431,0.0008716562,9.114411e-7,0.0004134064,0.02242045],"genre_scores_gemma":[0.8729743,0.0001823449,0.1263018,0.0001741316,0.0001598345,0.00003288687,0.000004274857,0.00001247633,0.0001579424],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8515221,"threshold_uncertainty_score":0.8859866,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4280605585","doi":"10.1017/s1471068422000102","title":"Fifty Years of Prolog and Beyond","year":2022,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":36,"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":"Fundação para a Ciência e a Tecnologia; NOVA Laboratory for Computer Science and Informatics; Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación","keywords":"Prolog; Computer science; Programming language; Implementation; Software portability; Logic programming; Datalog; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02326956094968936,"gpt":0.278226877541892,"spread":0.2549573165922027,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005016219,0.00009517041,0.0002120608,0.00007138565,0.0001628783,0.00005120061,0.0003366849,0.00004371225,0.00001328349],"category_scores_gemma":[0.0006749994,0.00008678075,0.00003670726,0.000242106,0.0001926936,0.0003918516,0.0005181984,0.0001896921,0.000001017904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008429086,"about_ca_system_score_gemma":0.0000360388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002587199,"about_ca_topic_score_gemma":7.643512e-7,"domain_scores_codex":[0.9981534,0.0009058531,0.0002513538,0.0002672399,0.0002215487,0.0002005827],"domain_scores_gemma":[0.9978527,0.001394744,0.0003676926,0.0002738977,0.00005710776,0.00005389036],"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.0001090248,0.0001018299,0.0001589788,0.00004532625,0.00002740046,0.00001909813,0.002676934,0.000003630343,0.0001717311,0.6760435,0.000008639822,0.3206339],"study_design_scores_gemma":[0.00100939,0.003154906,0.0006106451,0.000007231662,0.0001132604,0.001038501,0.008361899,0.0002678423,0.0004441296,0.8002599,0.1843421,0.000390088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.212824,0.04295453,0.6493171,0.004523547,0.001949297,0.004212236,0.00001308579,0.0007762027,0.08343004],"genre_scores_gemma":[0.9807358,0.0000528652,0.01887909,0.0001748364,0.0000195162,0.00003970536,0.000001554058,0.000005353033,0.00009123213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7679119,"threshold_uncertainty_score":0.3538817,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170245713","doi":"10.1017/s1471068414000015","title":"aspeed: Solver scheduling via answer set programming","year":2014,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Answer set programming; Solver; Constraint programming; Benchmarking; Boolean satisfiability problem; Scheduling (production processes); Set (abstract data type); Computation; Satisfiability; Theoretical computer science; Simple (philosophy); Mathematical optimization; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.02471089799935112,"gpt":0.2937271739713797,"spread":0.2690162759720285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008151505,0.0002734707,0.0003578537,0.0001143185,0.0003394381,0.0003205347,0.0006769043,0.0001615016,0.00002007946],"category_scores_gemma":[0.003404222,0.0002220716,0.0001059651,0.0004047373,0.0002619597,0.001436225,0.0003982401,0.0003685685,0.00003452096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001994535,"about_ca_system_score_gemma":0.00004766856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001905,"about_ca_topic_score_gemma":0.000002890192,"domain_scores_codex":[0.9970636,0.001096943,0.0003944598,0.000567354,0.0003034775,0.0005741104],"domain_scores_gemma":[0.9955725,0.003014453,0.0004458024,0.0005592352,0.0002275857,0.0001804364],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008839485,0.0001277627,0.0001371426,0.00006035323,0.00004292551,0.00001234492,0.002092957,0.00001291047,0.0003813942,0.4836566,0.000008230681,0.513379],"study_design_scores_gemma":[0.002465048,0.00282045,0.0003289783,0.0003301564,0.0004249663,0.001341508,0.004875867,0.0160308,0.004268372,0.5304081,0.4348697,0.001836004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006169232,0.001762034,0.9675699,0.0005652728,0.0003877122,0.0003754806,4.36612e-7,0.00032933,0.02284057],"genre_scores_gemma":[0.6992174,0.00003952402,0.3001001,0.0003206552,0.0001570302,0.00002160577,0.000002823508,0.00001389715,0.0001270222],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6930481,"threshold_uncertainty_score":0.9055817,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3012364298","doi":"10.1017/s1471068420000046","title":"Train Scheduling with Hybrid Answer Set Programming","year":2020,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","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","funders":"","keywords":"Computer science; Answer set programming; Scheduling (production processes); Heuristics; Preprocessor; Job shop scheduling; Mathematical optimization; Distributed computing; Set (abstract data type); Routing (electronic design automation); Artificial intelligence; Programming language; Embedded system; Operating system; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03509764070194063,"gpt":0.2860400346852408,"spread":0.2509423939833002,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003161098,0.0002495941,0.0003300477,0.00005629051,0.0002403822,0.0002878312,0.0005654435,0.00007086529,0.00001306933],"category_scores_gemma":[0.002182691,0.0001857387,0.00006841792,0.0004438027,0.0002477286,0.001247421,0.0002374101,0.0003558286,0.0000118706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001269016,"about_ca_system_score_gemma":0.00008714556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006657177,"about_ca_topic_score_gemma":0.000001129051,"domain_scores_codex":[0.9977024,0.0007037559,0.0003066311,0.0005539964,0.0002731323,0.0004601521],"domain_scores_gemma":[0.9972966,0.001633306,0.000353094,0.0003165724,0.000164029,0.000236355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004937462,0.0001476388,0.0001510765,0.0001417158,0.00009199034,0.0001669231,0.009287698,0.00003646775,0.0003540833,0.4421575,0.00001354372,0.5469576],"study_design_scores_gemma":[0.009780251,0.01842245,0.0003638185,0.001044522,0.001330799,0.006867608,0.05440167,0.02463846,0.01671646,0.1957172,0.6655933,0.00512343],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01793249,0.002612885,0.9649929,0.003316186,0.0001169717,0.0005947176,0.000001847713,0.0004370475,0.009994945],"genre_scores_gemma":[0.7087453,0.00003908945,0.2903332,0.0007153311,0.0001000988,0.00002297504,0.000003151776,0.00001292287,0.00002791046],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6908128,"threshold_uncertainty_score":0.7574202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2175707891","doi":"10.1017/s1471068401001193","title":"High-level networking with mobile code and first order AND-continuations","year":2001,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Code (set theory); Programming language; Scheme (mathematics); Unification; Hierarchy; Server; Set (abstract data type); Redundant code; Code generation; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02759578243579439,"gpt":0.2700335425156901,"spread":0.2424377600798957,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002325618,0.0001406732,0.0001709553,0.00005672891,0.0002676915,0.000190366,0.0001871095,0.00004115126,0.000009052228],"category_scores_gemma":[0.0001673238,0.0001126433,0.00001236126,0.0003425501,0.0001611828,0.0006572531,0.0002522206,0.0001257652,0.000001200596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001138811,"about_ca_system_score_gemma":0.0000175237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003641219,"about_ca_topic_score_gemma":0.00004108735,"domain_scores_codex":[0.9987384,0.0003201661,0.0001947441,0.0003414788,0.0001503659,0.0002548479],"domain_scores_gemma":[0.9974229,0.001906624,0.0002332186,0.0002814695,0.00008059647,0.00007520063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002238533,0.00009734075,0.0006439121,0.0000442225,0.00007238274,0.00005349977,0.0009745325,0.001254553,0.00001222568,0.2599085,0.00003682505,0.7366782],"study_design_scores_gemma":[0.005358027,0.00445162,0.003415589,0.0007352299,0.0008542787,0.001628074,0.006823136,0.04393387,0.0001312386,0.09667278,0.8341884,0.001807729],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02626835,0.003172728,0.9663916,0.001242838,0.00009902334,0.0007103803,9.999494e-7,0.0001163266,0.001997788],"genre_scores_gemma":[0.7784219,0.001016551,0.2198493,0.0003923209,0.00006498626,0.0001047508,0.00000250274,0.000009114169,0.0001385931],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8341516,"threshold_uncertainty_score":0.4593459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2002154970","doi":"10.1017/s1471068410000281","title":"A program-level approach to revising logic programs under the answer set semantics","year":2010,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"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":"Stable model semantics; Set (abstract data type); Answer set programming; Computer science; Logic program; Analogy; Semantics (computer science); Circumscription; Logic programming; Discrete mathematics; Belief revision; Preference; Programming language; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Operational semantics; Epistemology; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.06849882632326876,"gpt":0.3296679072681382,"spread":0.2611690809448695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008296142,0.0003361973,0.0003757732,0.00009567721,0.0005029298,0.0007199288,0.001214678,0.000199919,0.00000640454],"category_scores_gemma":[0.002121672,0.0002087219,0.0001229013,0.0008082684,0.0004743418,0.0008422969,0.0006199978,0.0007369464,0.00001883142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001601196,"about_ca_system_score_gemma":0.00008875281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001867988,"about_ca_topic_score_gemma":0.000008394013,"domain_scores_codex":[0.9968329,0.0009919357,0.0004341173,0.0006743306,0.000393172,0.0006735501],"domain_scores_gemma":[0.9961786,0.001933615,0.0004098672,0.0009319159,0.0003273592,0.0002186536],"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.00007232889,0.000468882,0.0000650465,0.0000707846,0.00005845705,0.000007991532,0.002811893,0.00000604309,0.0002354717,0.6444528,0.00002485362,0.3517255],"study_design_scores_gemma":[0.001822738,0.003744713,0.00127261,0.0003313962,0.0008417445,0.003513767,0.0166071,0.004667304,0.0009092786,0.6503403,0.3137188,0.002230256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01212553,0.001881198,0.9298158,0.0045588,0.0006768806,0.002934454,0.000002337631,0.0006708636,0.04733407],"genre_scores_gemma":[0.6194152,0.00002779299,0.3793245,0.0007675759,0.0001427775,0.0001264796,0.000005142546,0.00001689998,0.0001735759],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6072897,"threshold_uncertainty_score":0.8511433,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120811814","doi":"10.1017/s1471068409990056","title":"Characterizations of stable model semantics for logic programs with arbitrary constraint atoms","year":2009,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Constraint (computer-aided design); Stable model semantics; Constraint logic programming; Computer science; Semantics (computer science); Atom (system on chip); Representation (politics); Theoretical computer science; Programming language; Discrete mathematics; Constraint satisfaction; Mathematics; Operational semantics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0320336723505918,"gpt":0.2855219591597016,"spread":0.2534882868091098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001989407,0.0001831942,0.0003199234,0.00006910827,0.0001616064,0.0001102392,0.0003531287,0.00009212059,0.000002301877],"category_scores_gemma":[0.0005376191,0.0001339542,0.00006377524,0.0002874973,0.0002812699,0.0008410366,0.00007098726,0.0001481502,6.67314e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009834886,"about_ca_system_score_gemma":0.0001255089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001957436,"about_ca_topic_score_gemma":6.882073e-7,"domain_scores_codex":[0.9986306,0.0002191971,0.0003277468,0.0003218615,0.0001674713,0.0003331568],"domain_scores_gemma":[0.9978802,0.0009198694,0.0004859722,0.0003249123,0.0002979747,0.00009103122],"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.0002493167,0.0004822663,0.00005080263,0.00009598371,0.00004152884,0.000006745801,0.001529974,0.00004326352,0.0008015021,0.8674662,0.00000194578,0.1292304],"study_design_scores_gemma":[0.0015939,0.004749851,0.000135373,0.0002664299,0.0002927954,0.0004127726,0.001768174,0.0368175,0.003359808,0.9464263,0.00355075,0.0006263899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01104244,0.0005592517,0.9803291,0.0007364479,0.00003993015,0.0007559055,0.000004696175,0.0001230186,0.006409193],"genre_scores_gemma":[0.6688656,0.00006502579,0.3307571,0.0001964817,0.00001828171,0.00002566214,0.000009719033,0.000005817638,0.00005631245],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6578231,"threshold_uncertainty_score":0.5462494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110717496","doi":"10.1017/s1471068410000268","title":"Loop formulas for description logic programs","year":2010,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","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 Alberta","funders":"","keywords":"Answer set programming; Computer science; Stable model semantics; Logic programming; Formalism (music); Semantics (computer science); Theoretical computer science; Description logic; Set (abstract data type); Property (philosophy); Programming language; Classical logic; Algebra over a field; Operational semantics; Mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04084231505699853,"gpt":0.305537181138046,"spread":0.2646948660810474,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005041222,0.0001909047,0.0002401911,0.00007290127,0.000270231,0.0002838788,0.0005174078,0.0001626953,0.000009115125],"category_scores_gemma":[0.003184022,0.0001456559,0.00009830386,0.0002396389,0.0002183441,0.001408971,0.0001901031,0.0002917756,0.000009637207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001107112,"about_ca_system_score_gemma":0.00005114967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008319423,"about_ca_topic_score_gemma":0.000009387642,"domain_scores_codex":[0.9984255,0.0003016809,0.0002908898,0.0004021512,0.0001643285,0.0004153841],"domain_scores_gemma":[0.99699,0.001860851,0.0003517139,0.0004051845,0.0002720981,0.0001201399],"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.000140505,0.0001840894,0.00005659709,0.00004987842,0.00001841045,0.000004033173,0.0008314827,4.395513e-7,0.001852227,0.6047624,0.0000100093,0.3920899],"study_design_scores_gemma":[0.0009733129,0.001685071,0.00008963304,0.00004309604,0.0001172504,0.0004134701,0.001246908,0.001309263,0.00205219,0.9026319,0.08901595,0.0004219468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02213614,0.001003668,0.9577146,0.0006751218,0.0006921864,0.00106005,0.000001010013,0.0003071374,0.01641015],"genre_scores_gemma":[0.6988152,0.000037201,0.3004388,0.0001928872,0.0001134935,0.0001034025,0.000005377173,0.000009566267,0.0002840987],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6766791,"threshold_uncertainty_score":0.5939677,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2408791408","doi":"10.1017/s147106841600017x","title":"Consistency and trust in peer data exchange systems","year":2016,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Data integrity; Data exchange; Semantics (computer science); Consistency (knowledge bases); SQL; Data consistency; Null (SQL); Invariant (physics); Operational semantics","retraction":null,"screen_n_in":null,"score":{"opus":0.07054837066759287,"gpt":0.3145633066913243,"spread":0.2440149360237314,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009440047,0.000157053,0.0002870181,0.0000977805,0.0001012039,0.0001911057,0.0006247714,0.0001020694,0.000006171765],"category_scores_gemma":[0.002951332,0.00009846493,0.00001983799,0.0002072529,0.0002504757,0.001484746,0.0006003919,0.0001151579,0.000007593143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001425321,"about_ca_system_score_gemma":0.00004028169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001161006,"about_ca_topic_score_gemma":0.00001111843,"domain_scores_codex":[0.9975744,0.0009959445,0.0003573307,0.0004998312,0.0002584578,0.0003140109],"domain_scores_gemma":[0.9961295,0.002574786,0.0003138205,0.0007579274,0.0001309681,0.00009306703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006152227,0.00006257446,0.0007932424,0.000112305,0.00002041013,0.00003932783,0.0008664022,9.451073e-8,0.00008748307,0.687107,0.00002702009,0.3108226],"study_design_scores_gemma":[0.003344495,0.001356111,0.001191017,0.000264606,0.0001683692,0.002402535,0.009815595,0.0007166078,0.0001384106,0.305654,0.6738812,0.001066974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008034783,0.04441081,0.8961394,0.005766044,0.0013165,0.001880535,0.00001293587,0.000381974,0.04205702],"genre_scores_gemma":[0.9905324,0.0004066851,0.008321623,0.00008179581,0.00006691652,0.0000286294,0.000003070989,0.00000791855,0.0005509604],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9824976,"threshold_uncertainty_score":0.4015283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2193302029","doi":"10.1017/s1471068402001540","title":"The witness properties and the semantics of the Prolog cut","year":2002,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Prolog; Computer science; Logic programming; Programming language; Semantics (computer science); Negation; Generalization; Horn clause; Well-founded semantics; Context (archaeology); Witness; Consistency (knowledge bases); Stable model semantics; Theoretical computer science; Operational semantics; Mathematics; Artificial intelligence; Denotational semantics","retraction":null,"screen_n_in":null,"score":{"opus":0.03591203920956548,"gpt":0.2516279599677328,"spread":0.2157159207581673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005000553,0.0001154578,0.0001713089,0.00001286574,0.0005366635,0.0001390378,0.0006707188,0.00005296443,0.00000317537],"category_scores_gemma":[0.002917306,0.0000427904,0.00004884893,0.0001981001,0.001645256,0.0003387639,0.0004997678,0.0002044757,0.000001883053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000406497,"about_ca_system_score_gemma":0.00001596029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009524386,"about_ca_topic_score_gemma":0.000004057089,"domain_scores_codex":[0.9978171,0.00140911,0.0002164135,0.0001791555,0.0001736237,0.000204621],"domain_scores_gemma":[0.9956536,0.003420727,0.0003475405,0.0004412555,0.0001093049,0.0000275739],"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.0001970253,0.00006727378,0.0001552492,0.00004455738,0.00003993259,0.000001690427,0.007454092,0.000003958244,0.00007697311,0.88775,0.00002129525,0.104188],"study_design_scores_gemma":[0.00289407,0.001022585,0.0007165351,0.0002496618,0.0005020204,0.001196492,0.009258116,0.02187728,0.003468496,0.870195,0.08802862,0.000591088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3186471,0.161066,0.2232646,0.1108176,0.002237829,0.008406085,0.000002517495,0.00053914,0.1750191],"genre_scores_gemma":[0.9957966,0.0007121781,0.002759737,0.0002058473,0.00002868542,0.00002717324,4.074689e-8,0.000004443108,0.0004652617],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6771495,"threshold_uncertainty_score":0.6062015,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152906186","doi":"10.1017/s147106840500236x","title":"A CHR-based implementation of known arc-consistency","year":2005,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"European Commission; Canadian Patient Safety Institute","keywords":"Local consistency; Computer science; Constraint satisfaction problem; Constraint satisfaction; Constraint logic programming; Constraint (computer-aided design); Consistency (knowledge bases); Constraint programming; Solver; Extension (predicate logic); Domain (mathematical analysis); Obsolescence; Programming language; Theoretical computer science; Process (computing); Mathematical optimization; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02296435859975818,"gpt":0.3225588025497875,"spread":0.2995944439500293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001625469,0.00006801859,0.0001050351,0.00007684382,0.00006831531,0.00003434873,0.0001081448,0.00003028807,0.00007136279],"category_scores_gemma":[0.0003552127,0.00006142981,0.00003181774,0.0001731572,0.00009201096,0.0006329861,0.0000361831,0.00006063676,0.000001999535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001035827,"about_ca_system_score_gemma":0.00006862736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001441575,"about_ca_topic_score_gemma":0.000009157323,"domain_scores_codex":[0.9990759,0.0003169816,0.0002458395,0.0001403089,0.0001163607,0.0001046447],"domain_scores_gemma":[0.9984817,0.0009138409,0.0003062227,0.0001544907,0.000109598,0.00003418526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005161009,0.00005800684,0.0001302182,0.00001973333,0.00001075195,7.490373e-7,0.0006038233,0.00008977704,0.0004635085,0.3028919,0.000002272028,0.6956776],"study_design_scores_gemma":[0.02348275,0.01181202,0.03157512,0.000968851,0.001638461,0.001698005,0.0755849,0.08707254,0.2148538,0.2908972,0.2560324,0.004383916],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009653869,0.000431237,0.9832374,0.002057549,0.0000578506,0.0002444646,0.000001465865,0.00006387176,0.004252291],"genre_scores_gemma":[0.7451688,0.00002719249,0.2545867,0.0001853515,0.00001164126,0.000006407611,0.000001853025,0.000001964298,0.00001011162],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7355149,"threshold_uncertainty_score":0.2505035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963390246","doi":"10.1017/s1471068417000291","title":"Well-founded operators for normal hybrid MKNF knowledge bases","year":2017,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","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":"University of Alberta","funders":"","keywords":"Computer science; DPLL algorithm; Operator (biology); Knowledge base; Solver; Knowledge representation and reasoning; Theoretical computer science; Constraint (computer-aided design); Realization (probability); Algorithm; Artificial intelligence; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03538053620335877,"gpt":0.3295888816316333,"spread":0.2942083454282745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00510474,0.0002088943,0.0002924118,0.00006356534,0.001036785,0.0006233546,0.001060233,0.00008232352,0.00001959154],"category_scores_gemma":[0.00594314,0.000166019,0.000102447,0.00007424824,0.0003328498,0.001986307,0.0005072877,0.000185928,0.0000264385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001741343,"about_ca_system_score_gemma":0.0001023887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001744205,"about_ca_topic_score_gemma":0.000006880715,"domain_scores_codex":[0.9982499,0.0005148354,0.0002744175,0.0004250098,0.0001294838,0.0004062994],"domain_scores_gemma":[0.9950375,0.003372358,0.0004532887,0.0007376563,0.0002638125,0.0001353631],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002415285,0.0002214688,0.0001424315,0.00008081319,0.00004654582,0.00001779757,0.0009958458,0.000001326311,0.0001227009,0.7152466,0.0001066926,0.2827763],"study_design_scores_gemma":[0.00349034,0.003201125,0.0005769726,0.0002257375,0.0003519428,0.0008065033,0.002442393,0.003266012,0.01183634,0.2819418,0.6905798,0.001280998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03363343,0.005867482,0.6709941,0.001294389,0.001680067,0.00136863,0.000007409863,0.0003615333,0.284793],"genre_scores_gemma":[0.9418387,0.000114486,0.05670675,0.0001648672,0.0001917234,0.00005771548,0.000002891428,0.00001214089,0.0009107224],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9082053,"threshold_uncertainty_score":0.7974218,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980229219","doi":"10.1017/s1471068403001698","title":"Polymorphic lemmas and definitions in $\\lambda$Prolog and Twelf","year":2004,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Prolog; Computer science; Metalanguage; Programming language; ENCODE; Object (grammar); Inference; Logic programming; Logic program; Description logic; Encoding (memory); Theoretical computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04689005546835771,"gpt":0.2824642193132949,"spread":0.2355741638449372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002673694,0.0001574927,0.0002380147,0.0001201157,0.0001732751,0.0001696211,0.0001937011,0.0001114725,0.00000325061],"category_scores_gemma":[0.0008115504,0.0001310437,0.00002616455,0.0002465981,0.0003095494,0.0007911275,0.0002111982,0.0002201812,0.000003898188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001308003,"about_ca_system_score_gemma":0.00004342361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001385191,"about_ca_topic_score_gemma":0.00001707745,"domain_scores_codex":[0.9984437,0.0004667085,0.0002845481,0.000367746,0.0001330974,0.0003042629],"domain_scores_gemma":[0.9982612,0.001140322,0.000210135,0.0002396527,0.0000510988,0.00009761238],"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.00006927922,0.0001123674,0.0006036485,0.00005446807,0.00001588525,0.00005796632,0.001910876,0.000003344959,0.00009857333,0.9020846,8.867154e-7,0.09498809],"study_design_scores_gemma":[0.001019452,0.0006656995,0.001151851,0.00002701555,0.00004283088,0.00116267,0.001588401,0.00004118603,0.0001015658,0.9879539,0.005999671,0.0002457578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2354703,0.03550518,0.6755279,0.009069552,0.0006616339,0.002090454,0.000003131726,0.0005709762,0.0411009],"genre_scores_gemma":[0.9712663,0.0004534337,0.0279038,0.0002797603,0.00003498841,0.00003207764,0.00000154608,0.000006746662,0.00002139277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.735796,"threshold_uncertainty_score":0.5343806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143269622","doi":"10.1017/s1471068404002285","title":"Integrating design synthesis and assembly of structured objects in a visual design language","year":2005,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Design Education and Practice","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Programming language; Visual programming language; Design language; Fifth-generation programming language; Programmer; Programming paradigm; Logic programming; Procedural programming; Functional logic programming; Inductive programming","retraction":null,"screen_n_in":null,"score":{"opus":0.02443424095857679,"gpt":0.3142253968630848,"spread":0.289791155904508,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004479704,0.0001407918,0.0002269018,0.0001279574,0.00003912134,0.00004321667,0.00007705994,0.00008759645,0.00003064258],"category_scores_gemma":[0.006042676,0.0001264087,0.00001958025,0.0002033333,0.00006755524,0.0005971357,0.0000191656,0.000213102,0.00000161076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001880913,"about_ca_system_score_gemma":0.00003544339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001552858,"about_ca_topic_score_gemma":0.000005623874,"domain_scores_codex":[0.9980739,0.001208066,0.0002918148,0.0001427154,0.0001045502,0.000178902],"domain_scores_gemma":[0.9889289,0.01069875,0.000171432,0.0001051895,0.00004329246,0.00005245439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008489597,0.0001491986,0.00003551598,0.0002217663,0.00008958632,0.00001379309,0.01791734,0.001820537,0.07225212,0.009949676,0.00001630997,0.8966852],"study_design_scores_gemma":[0.002686839,0.001694381,0.0009202933,0.001013173,0.001038993,0.00117228,0.22894,0.033472,0.708762,0.01389195,0.004602015,0.001806093],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3126939,0.01383228,0.6592382,0.0004447851,0.0002098785,0.001386902,0.000005181634,0.0002911132,0.01189782],"genre_scores_gemma":[0.8271622,0.000158737,0.1725673,0.00004296491,0.00002392839,0.00002239377,8.358361e-7,0.00001150874,0.00001008086],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8948791,"threshold_uncertainty_score":0.7234084,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105946993","doi":"10.1017/s1471068411000391","title":"Coding guidelines for Prolog","year":2011,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Prolog; Debugging; Programming language; Coding (social sciences); Normative; Documentation; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1463430220138174,"gpt":0.3549441782571504,"spread":0.208601156243333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006903474,0.0001497121,0.0002369606,0.00006624723,0.0001762525,0.00008911722,0.0004613305,0.00009684583,0.000006852295],"category_scores_gemma":[0.004483556,0.0001123238,0.00007020676,0.0001674233,0.0001368624,0.000742174,0.0001693995,0.000103415,0.000005183942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007327535,"about_ca_system_score_gemma":0.00003569953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002466703,"about_ca_topic_score_gemma":0.000001493313,"domain_scores_codex":[0.9984192,0.0004053317,0.0003886872,0.0003338454,0.0001379386,0.0003149454],"domain_scores_gemma":[0.9972494,0.00149462,0.0004056884,0.0003354056,0.0004395188,0.00007536478],"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.0001602864,0.0000724763,0.00005333835,0.00006881302,0.00003335171,0.000006577075,0.001708517,3.212736e-7,0.0001363576,0.7470669,0.00003633468,0.2506567],"study_design_scores_gemma":[0.0005766394,0.001175243,0.00003494043,0.00001753173,0.00008801596,0.0002840378,0.00205215,0.0003570153,0.001786164,0.8873134,0.1060155,0.0002994278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002831752,0.001663813,0.9821607,0.000544255,0.0002979279,0.0006422036,4.125491e-7,0.0001817217,0.01422581],"genre_scores_gemma":[0.645743,0.00005594717,0.3534732,0.0004028424,0.00008481142,0.00008629051,0.000001259114,0.000007987086,0.0001446819],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6454598,"threshold_uncertainty_score":0.5367559,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964029271","doi":"10.1017/s147106841100038x","title":"Relating weight constraint and aggregate programs: Semantics and representation","year":2011,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"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":"Stable model semantics; Well-founded semantics; Semantics (computer science); Computer science; Constraint (computer-aided design); Operational semantics; Programming language; Representation (politics); Set (abstract data type); Theoretical computer science; Logic programming; Aggregate (composite); Denotational semantics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04945355396791649,"gpt":0.2932697694423416,"spread":0.2438162154744251,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002831851,0.0001401747,0.0001930046,0.00005532233,0.000199099,0.0001424671,0.0001544428,0.00008436918,0.000004296836],"category_scores_gemma":[0.00155736,0.0001115691,0.0000257863,0.0001688194,0.0004276613,0.0009307581,0.0002400754,0.0001781016,0.000001538711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005517942,"about_ca_system_score_gemma":0.00002218353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000235368,"about_ca_topic_score_gemma":0.000002305691,"domain_scores_codex":[0.9984931,0.0005595676,0.0002518316,0.0003482669,0.0001166352,0.0002305818],"domain_scores_gemma":[0.9979044,0.001303465,0.0003651165,0.0002227902,0.0001062701,0.0000980101],"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.00006100161,0.00006395736,0.001705149,0.00004912498,0.00002800176,0.00002765547,0.008124858,6.926162e-8,0.0001472327,0.5633041,9.940403e-7,0.4264879],"study_design_scores_gemma":[0.001736807,0.001864424,0.002441478,0.0004408512,0.0003519039,0.003133581,0.01571382,0.002421506,0.0039939,0.9609499,0.006144729,0.000807127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3110044,0.01844859,0.513383,0.001280172,0.0004889573,0.001762014,0.000001551493,0.0006345757,0.1529967],"genre_scores_gemma":[0.8467534,0.0004378658,0.1526505,0.0000548902,0.00002534051,0.00001146668,0.00000107787,0.000005747478,0.00005972158],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.535749,"threshold_uncertainty_score":0.4549656,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170782811","doi":"10.1017/s1471068413000112","title":"Editorial: 29th International Conference on Logic Programming special issue","year":2013,"lang":"en","type":"editorial","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Universität Ulm; Università degli Studi di Udine; Università degli Studi di Ferrara; German University in Cairo; Università di Bologna; Universiteit Gent; Universität Potsdam; Università della Calabria; Ben-Gurion University of the Negev; KU Leuven; Universidad Complutense de Madrid; Universität Leipzig; Imperial College London; Università degli Studi di Parma; University of Alberta; Universiteit van Amsterdam; National University of Singapore; Universidade do Porto; University of Cambridge; Institut national de recherche en informatique et en automatique (INRIA); Simon Fraser University; Arizona State University; Texas Tech University","keywords":"Computer science; Publication; Library science; Logic programming; Engineering ethics; Programming language; Political science; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.02509858821790251,"gpt":0.3188915131612344,"spread":0.2937929249433319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006518774,0.0006893259,0.000836451,0.0002537305,0.0003403584,0.001261786,0.002289172,0.001151358,0.0003125994],"category_scores_gemma":[0.01620956,0.0005606003,0.0002004607,0.0003333022,0.0004686707,0.001543459,0.0009277885,0.001783173,0.0002329388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001200504,"about_ca_system_score_gemma":0.0004621762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005170527,"about_ca_topic_score_gemma":0.00000672277,"domain_scores_codex":[0.994294,0.001505266,0.0007824065,0.001201629,0.001454648,0.0007620068],"domain_scores_gemma":[0.987807,0.008219194,0.001478056,0.0008212465,0.001422835,0.0002516079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003410202,0.0003063042,9.661426e-7,0.0000919236,0.0001144779,0.00002783579,0.0009845032,9.147891e-7,0.00001000622,0.3644125,0.4410382,0.1926714],"study_design_scores_gemma":[0.0006219131,0.001087578,6.956873e-7,0.0002250123,0.0001125478,0.00002793228,0.000615771,0.00005165005,0.00002300084,0.07659996,0.9200534,0.0005805203],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.000002840779,0.0005521359,0.01456344,0.0006304355,0.8742723,0.0007508134,0.00001215989,0.0002682758,0.1089476],"genre_scores_gemma":[0.0003718351,0.0008098116,0.03488687,0.0001069269,0.961455,0.0001385571,0.0000876574,0.00003997236,0.002103314],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.4790153,"threshold_uncertainty_score":0.999775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2997463312","doi":"10.1017/s1471068421000089","title":"Exploring the Jungle of Intuitionistic Temporal Logics","year":2021,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Computer science; Soundness; Kripke semantics; Intuitionistic logic; Linear logic; Axiom; Interpretation (philosophy); Class (philosophy); Type theory; Theoretical computer science; Artificial intelligence; Intermediate logic; Mathematics; Description logic; Type (biology); Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.09011873064827158,"gpt":0.3032837098513963,"spread":0.2131649792031247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032627,0.0001105092,0.0001941367,0.00003332502,0.0002144598,0.0001114602,0.0003732821,0.00003904953,0.00001090969],"category_scores_gemma":[0.004014732,0.00007439628,0.00006136471,0.000354696,0.0002425537,0.0007652422,0.0003368063,0.0001807314,0.000004285316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001010495,"about_ca_system_score_gemma":0.00008003926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000100475,"about_ca_topic_score_gemma":0.000002854684,"domain_scores_codex":[0.9982585,0.0008720512,0.0002633564,0.0002351085,0.0001723867,0.0001986401],"domain_scores_gemma":[0.995612,0.003432293,0.0002862937,0.0003802035,0.0002399732,0.00004919307],"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.00003685247,0.0001652067,0.00007761853,0.00005631386,0.00002973683,0.00003206683,0.002759058,0.000008247606,0.0003089734,0.8499059,0.000005912113,0.1466141],"study_design_scores_gemma":[0.0008080744,0.00102882,0.0008903836,0.0002149111,0.0002115095,0.00086186,0.01646829,0.0006007338,0.01344772,0.9182569,0.04668793,0.0005228055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04476538,0.00652051,0.8877004,0.001899048,0.0007394844,0.0003523117,0.000002191422,0.0001665166,0.05785413],"genre_scores_gemma":[0.9616517,0.0002360347,0.03781027,0.0001297685,0.00004635366,0.0000128657,0.000002064852,0.000004648701,0.0001063421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9168863,"threshold_uncertainty_score":0.4806299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113835981","doi":"10.1017/s1471068413000355","title":"Disjunctive logic programs with existential quantification in rule heads","year":2013,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","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":"Decidability; Undecidable problem; Computer science; Stable model semantics; Existentialism; Programming language; Fragment (logic); Extension (predicate logic); Theoretical computer science; Semantics (computer science); Operational semantics; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.03106231653637484,"gpt":0.2877385025871762,"spread":0.2566761860508013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002536064,0.0001810824,0.0002436146,0.00008978956,0.0001368492,0.000261755,0.0003867737,0.00009190808,0.00001502727],"category_scores_gemma":[0.0007133224,0.0001246168,0.00004209141,0.0004391669,0.0002752178,0.00151671,0.0001490585,0.0002202753,0.0000302168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002349612,"about_ca_system_score_gemma":0.00004720388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009863941,"about_ca_topic_score_gemma":0.00001383279,"domain_scores_codex":[0.9979472,0.0007775653,0.0002828465,0.0004378921,0.0002008526,0.0003536899],"domain_scores_gemma":[0.9980209,0.0009892159,0.0003273072,0.0003636481,0.0002104998,0.00008841317],"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.0001842078,0.0004100859,0.0007962462,0.00003936485,0.00002273207,0.00001216516,0.00209462,0.000004271251,0.000242916,0.6211054,0.00000396661,0.375084],"study_design_scores_gemma":[0.002941096,0.004896152,0.0124901,0.0003491075,0.0001857528,0.0007134379,0.01496389,0.002918181,0.001776635,0.9473543,0.01012307,0.001288314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1054546,0.003287156,0.8269292,0.001879274,0.0003245075,0.002264937,7.903252e-7,0.0003822388,0.05947733],"genre_scores_gemma":[0.9243308,0.00005067746,0.07517866,0.00009216335,0.00003414643,0.0001447344,0.000005450094,0.000007920621,0.000155459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8188762,"threshold_uncertainty_score":0.5081725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2966640145","doi":"10.1017/s1471068419000395","title":"Domain-Independent Cost-Optimal Planning in ASP","year":2019,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"AI-based Problem Solving and Planning","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 Alberta","funders":"","keywords":"Planner; Job shop scheduling; Answer set programming; Motion planning","retraction":null,"screen_n_in":null,"score":{"opus":0.02277286717745461,"gpt":0.2990778356143491,"spread":0.2763049684368946,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006518561,0.000148119,0.0002242843,0.0001210837,0.00009403794,0.0001308247,0.000398761,0.00009892987,0.00001900519],"category_scores_gemma":[0.0003992153,0.0001320325,0.00003630824,0.0002496791,0.00005631079,0.0008881757,0.0002076419,0.0003705062,0.00002060483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002189637,"about_ca_system_score_gemma":0.00005366557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001934163,"about_ca_topic_score_gemma":5.962787e-7,"domain_scores_codex":[0.9980319,0.0007538069,0.0002847438,0.0003509808,0.0002244308,0.0003541783],"domain_scores_gemma":[0.9958709,0.003427587,0.000269273,0.0003097111,0.00004909226,0.0000734618],"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.0007130216,0.0001649143,0.007151572,0.0001215445,0.00004707821,0.0002142238,0.01062188,0.003033949,0.0009019753,0.7739354,0.00001535134,0.203079],"study_design_scores_gemma":[0.01136716,0.007041836,0.008959646,0.0032851,0.0002446307,0.003844921,0.0524483,0.02178314,0.004464419,0.536078,0.3464372,0.004045654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2458688,0.003319724,0.720875,0.001111061,0.0003379782,0.0007890459,0.000001521387,0.0001955955,0.02750134],"genre_scores_gemma":[0.8210889,0.00001320602,0.1784986,0.0002643738,0.00002079076,0.0000146214,0.000002334296,0.000006970335,0.00009030118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.57522,"threshold_uncertainty_score":0.538413,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3040097605","doi":"10.1017/s1471068420000101","title":"Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation","year":2020,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Advanced Database Systems and Queries","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 Alberta","funders":"","keywords":"Chase; Computer science; Decidability; Parameterized complexity; Hierarchy; Class (philosophy); Bounded function; Conjunctive query; Existentialism; Theoretical computer science; Programming language; Algorithm; Artificial intelligence; Database; Mathematics; Relational database","retraction":null,"screen_n_in":null,"score":{"opus":0.05125413606843647,"gpt":0.3375370963073417,"spread":0.2862829602389052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006967204,0.00007791083,0.000120505,0.00002896346,0.0001193617,0.00005401056,0.00008023265,0.00003380663,7.387181e-7],"category_scores_gemma":[0.001130732,0.00006558611,0.00001878289,0.00009555345,0.00009661423,0.0009449798,0.00009275349,0.00006577677,2.558363e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004259082,"about_ca_system_score_gemma":0.0000151361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000272906,"about_ca_topic_score_gemma":5.372176e-8,"domain_scores_codex":[0.9991018,0.0002865945,0.0001729545,0.0002362107,0.00009389369,0.0001085753],"domain_scores_gemma":[0.9987848,0.0008193642,0.0001746303,0.0001047121,0.00005217891,0.00006428538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004424035,0.00005453442,0.000002029301,0.0001122237,0.00001129067,0.000003494677,0.004015429,0.000001932801,0.003326658,0.8158622,0.000003989146,0.1761637],"study_design_scores_gemma":[0.01734985,0.01477984,0.0006348654,0.0005105081,0.000650459,0.001929626,0.08695577,0.1007807,0.03272193,0.2996829,0.4409498,0.003053761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005211781,0.0005496842,0.9926301,0.0004841704,0.00003069092,0.0003980405,0.000006829845,0.00005244012,0.0006362667],"genre_scores_gemma":[0.3368053,0.00003066596,0.6628402,0.0001677656,0.00005125802,0.0000677588,0.00002450029,0.000003898057,0.000008660676],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5161793,"threshold_uncertainty_score":0.2674524,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406401421","doi":"10.1017/s147106842400036x","title":"On Lower Bounding Minimal Model Count","year":2024,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Ministry of Education, India; National Supercomputing Centre Singapore; University of Toronto; National Research Foundation Singapore; National Research Foundation","keywords":"Computer science; Bounding overwatch; Count data; Statistics; Artificial intelligence; Mathematics; Poisson distribution","retraction":null,"screen_n_in":null,"score":{"opus":0.0330155996511509,"gpt":0.3339099828072208,"spread":0.3008943831560699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003722276,0.00008953339,0.00009180629,0.00007191816,0.0001158016,0.000322939,0.000227035,0.00004499543,0.000007409622],"category_scores_gemma":[0.001496189,0.00007047963,0.00002767898,0.0001652909,0.00006642007,0.000803737,0.00008917894,0.0002175214,0.0000166346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000141869,"about_ca_system_score_gemma":0.00004066824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003762854,"about_ca_topic_score_gemma":2.005804e-7,"domain_scores_codex":[0.998939,0.0003189091,0.0001485576,0.0002801786,0.0001661372,0.0001471588],"domain_scores_gemma":[0.996906,0.002669466,0.00008820849,0.0002593866,0.00003429211,0.00004259071],"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.0000986894,0.00004590618,0.000002173774,0.00004018069,0.00001117816,0.00001320699,0.000608267,0.0001200505,0.0002728272,0.7691452,0.00003830397,0.229604],"study_design_scores_gemma":[0.0002096531,0.0007617758,0.00002785587,0.0002105838,0.00006960414,0.0001915655,0.0004943125,0.3623079,0.0001598063,0.5147851,0.1204901,0.0002916991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003881257,0.00127552,0.9680239,0.002197571,0.0002196368,0.0001052487,0.000001671461,0.0002135927,0.02408161],"genre_scores_gemma":[0.9200956,0.00005737129,0.07927933,0.0002768726,0.00003274329,0.000008678579,0.000003632703,0.000005688461,0.0002401177],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9162143,"threshold_uncertainty_score":0.3114108,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4205994671","doi":"10.1017/s147106841000013x","title":"TLP volume 10 issue 3 Cover and Front matter","year":2010,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Political Systems and Governance","field":"Social Sciences","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; Simon Fraser University","funders":"","keywords":"Computer science; Front cover; Volume (thermodynamics); Cover (algebra); Front (military); Action (physics); Mechanical engineering; Geology; Thermodynamics; Oceanography; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01672153767915117,"gpt":0.3171916336613706,"spread":0.3004700959822194,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003362397,0.00007360281,0.0001373358,0.00001232929,0.0002196964,0.00009043879,0.00009162536,0.0001004723,0.003119294],"category_scores_gemma":[0.002847377,0.00005954485,0.00002178924,0.00003984955,0.0005197341,0.0004255217,0.00004689022,0.0001699251,0.000333985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007470752,"about_ca_system_score_gemma":0.00002822287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002370812,"about_ca_topic_score_gemma":0.00006675958,"domain_scores_codex":[0.998857,0.0004482168,0.0001418073,0.0001492617,0.0001574745,0.00024628],"domain_scores_gemma":[0.9982661,0.001303392,0.0001505473,0.0001061563,0.00005720228,0.0001165798],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001905389,0.00008115144,0.002034472,0.00005269657,0.00002394503,0.000008912071,0.005267866,8.897405e-8,0.0003779716,0.9315552,0.001677361,0.05872983],"study_design_scores_gemma":[0.0001120219,0.00005534922,0.0009672453,0.00001493827,0.00002721595,0.00001481971,0.00159598,0.000002008694,0.00003353297,0.01758631,0.9795013,0.00008928517],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1545309,0.001852928,0.001474331,0.01157258,0.0005657476,0.0005223327,0.00001199512,0.0000678037,0.8294014],"genre_scores_gemma":[0.9547737,0.00005918975,0.002277327,0.0007510078,0.0002850209,0.000009358293,5.830972e-7,0.000005692882,0.04183808],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9778239,"threshold_uncertainty_score":0.997792,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4238432756","doi":"10.1017/s1471068410000414","title":"TLP volume 10 issue 4-6 Cover and Front matter","year":2010,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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; Simon Fraser University","funders":"","keywords":"Computer science; Volume (thermodynamics); Front cover; Cover (algebra); Front (military); Action (physics); Computer graphics (images); Mechanical engineering; Thermodynamics; Physics; Meteorology","retraction":null,"screen_n_in":null,"score":{"opus":0.0262135827088531,"gpt":0.2441452007527627,"spread":0.2179316180439096,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002685774,0.0001034227,0.0002530473,0.00006439017,0.0001287121,0.0001031422,0.00009758847,0.0000713441,0.03248362],"category_scores_gemma":[0.0007199761,0.0001020368,0.00003552182,0.00004087613,0.0003088868,0.0004730353,0.0001204326,0.0001410666,0.01109342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006229224,"about_ca_system_score_gemma":0.000004595501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004365422,"about_ca_topic_score_gemma":0.000001057876,"domain_scores_codex":[0.9991841,0.00003674594,0.0002772014,0.0002937267,0.00001959507,0.0001886841],"domain_scores_gemma":[0.9990494,0.0003918635,0.0002960595,0.000180187,0.00002589094,0.00005661394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006636353,0.0002926191,0.01570969,0.0001613339,0.0003228697,0.00001262648,0.006376456,0.00000431729,0.0001366732,0.8646359,0.06207246,0.04961145],"study_design_scores_gemma":[0.0002515608,0.00005777408,0.0006987247,0.000005067885,0.00002248566,0.00002152972,0.001531986,0.00003570239,0.00001985234,0.02155011,0.9756598,0.0001454141],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04509168,0.003264099,0.001079611,0.001319967,0.001219903,0.0002450773,0.00006522971,0.00003088114,0.9476836],"genre_scores_gemma":[0.6362416,0.0003147617,0.008539824,0.0008147855,0.0001498887,0.00001747927,0.000005063091,0.00001556562,0.3539011],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9135873,"threshold_uncertainty_score":0.9896765,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4238620831","doi":"10.1017/s1471068411000573","title":"TLP volume 11 issue 6 Cover and Front matter","year":2011,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Political Systems and Governance","field":"Social Sciences","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; Simon Fraser University","funders":"","keywords":"Computer science; Front cover; Volume (thermodynamics); Front (military); Cover (algebra); Action (physics); Content (measure theory); Mechanical engineering; Thermodynamics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03440374133059238,"gpt":0.3125089927081705,"spread":0.2781052513775781,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002864985,0.00007411742,0.0001420775,0.00001275512,0.0001849384,0.00004579842,0.00008826425,0.00007582202,0.001585161],"category_scores_gemma":[0.001323949,0.00005998943,0.00002216305,0.00004027785,0.0004507391,0.0004532631,0.00004776762,0.0000833056,0.0001869808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001195985,"about_ca_system_score_gemma":0.00002202177,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007983348,"about_ca_topic_score_gemma":0.00005943348,"domain_scores_codex":[0.9986821,0.0006320563,0.0001492388,0.0001467534,0.0001398707,0.0002499376],"domain_scores_gemma":[0.9988479,0.0007458797,0.0001587722,0.00009423271,0.00004559637,0.0001076359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001694822,0.00008851701,0.007075773,0.00005012244,0.00002302622,0.00001230948,0.01675136,3.415756e-8,0.00002256282,0.9492517,0.0005891431,0.02596598],"study_design_scores_gemma":[0.0001307304,0.00008932104,0.003369786,0.00003244627,0.00004424438,0.00001550072,0.005360275,0.000001133458,0.00003460145,0.03215947,0.9586508,0.0001116913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.08333913,0.003456052,0.003782732,0.003339135,0.0003042374,0.0005025194,0.000008849282,0.00006341078,0.9052039],"genre_scores_gemma":[0.980553,0.0001133157,0.002886852,0.0007738899,0.0001305807,0.000009493302,3.408977e-7,0.000005490268,0.01552701],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9580616,"threshold_uncertainty_score":0.9993275,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4249993600","doi":"10.1017/s1471068410000499","title":"TLP volume 11 issue 1 Cover and Front matter","year":2011,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Political Systems and Governance","field":"Social Sciences","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; Simon Fraser University","funders":"","keywords":"Computer science; Front cover; Volume (thermodynamics); Front (military); Cover (algebra); Action (physics); Content (measure theory); Mechanical engineering; Thermodynamics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03507534124623912,"gpt":0.3128911798684199,"spread":0.2778158386221807,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002862388,0.00007411442,0.0001420051,0.00001275418,0.0001848844,0.0000456758,0.00008828062,0.00007582218,0.001668714],"category_scores_gemma":[0.001337922,0.00005998948,0.00002216136,0.00004028278,0.0004505938,0.0004528005,0.00004777955,0.00008330912,0.0001897385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001197168,"about_ca_system_score_gemma":0.00002206484,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007809926,"about_ca_topic_score_gemma":0.00005754026,"domain_scores_codex":[0.9986821,0.0006321855,0.0001491171,0.0001467808,0.0001398407,0.000249907],"domain_scores_gemma":[0.9988416,0.0007520363,0.0001587218,0.00009434139,0.00004567433,0.0001076216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001715624,0.00008967284,0.007220848,0.00005054178,0.00002345928,0.00001234128,0.01699329,3.533003e-8,0.00002313469,0.9487341,0.0006331439,0.02604786],"study_design_scores_gemma":[0.0001290297,0.0000888475,0.003331184,0.00003232814,0.00004415549,0.00001544692,0.005341303,0.000001139258,0.00003444704,0.0316464,0.9592245,0.0001112706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.08407779,0.003451347,0.003775597,0.003372327,0.0003069488,0.0005063036,0.000009274563,0.00006401705,0.9044364],"genre_scores_gemma":[0.9804023,0.0001123626,0.002932765,0.0007766426,0.0001309647,0.00000970904,3.511798e-7,0.000005515853,0.01562943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9585913,"threshold_uncertainty_score":0.9992439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105801569","doi":"10.1017/s1471068402001564","title":"In Memoriam: RAYMOND REITER June 12, 1939 – September 16, 2002","year":2002,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Artificial intelligence; Library science; Art history; History","retraction":null,"screen_n_in":null,"score":{"opus":0.03146516822735217,"gpt":0.2808058307561522,"spread":0.2493406625288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004487935,0.0001808144,0.0002496978,0.0001255053,0.00014278,0.0001394602,0.0003818628,0.0001159258,0.000297878],"category_scores_gemma":[0.0009218577,0.0001572514,0.00004817242,0.0003401728,0.00009977067,0.001408882,0.000166978,0.0003566009,0.00006084861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001942862,"about_ca_system_score_gemma":0.00001531828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001617004,"about_ca_topic_score_gemma":0.000005004862,"domain_scores_codex":[0.9977495,0.0009257018,0.0003502959,0.0003779687,0.0002169213,0.0003795945],"domain_scores_gemma":[0.9961465,0.003027491,0.0002858073,0.0003914489,0.00005826996,0.00009047431],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006083396,0.0008761821,0.000665976,0.0003374181,0.0001545289,0.0007008543,0.01642153,0.0003075707,0.0007378394,0.3717884,0.02355875,0.5838426],"study_design_scores_gemma":[0.001495278,0.0005741025,0.00004609644,0.0002907678,0.000087607,0.0006252209,0.001090436,0.004453549,0.00096602,0.07317533,0.9164817,0.0007138683],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01009702,0.02624721,0.4388322,0.01342731,0.003248599,0.001297231,0.000006023841,0.0006072865,0.5062371],"genre_scores_gemma":[0.7376054,0.0003491851,0.2381937,0.002863297,0.0003934415,0.00005118103,0.000004700941,0.00003372975,0.02050538],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8929229,"threshold_uncertainty_score":0.6412526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403810684","doi":"10.1017/s1471068424000255","title":"On the Foundations of Conflict-Driven Solving for Hybrid MKNF Knowledge Bases","year":2024,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Logic, Reasoning, and Knowledge","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 Alberta","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.05358612368344712,"gpt":0.3415910061733454,"spread":0.2880048824898983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003566276,0.0001291028,0.0001790085,0.00007875188,0.0002488976,0.0002004351,0.0004050459,0.00003938808,0.00002108602],"category_scores_gemma":[0.00461995,0.00008253881,0.00009590036,0.0002239303,0.000218845,0.000526787,0.0001579119,0.0001521414,0.00001139869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001357509,"about_ca_system_score_gemma":0.0000952749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004667952,"about_ca_topic_score_gemma":0.000001632324,"domain_scores_codex":[0.9986774,0.0004889622,0.0002406472,0.0002739183,0.0001102308,0.0002088137],"domain_scores_gemma":[0.9791717,0.02013788,0.0001727925,0.0002989598,0.0001741468,0.00004455241],"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.00006179199,0.0001088385,0.000004019689,0.0001215037,0.00005589883,0.000003991648,0.00283684,0.000006064009,0.0002976829,0.856276,0.0001583357,0.140069],"study_design_scores_gemma":[0.0004579596,0.00141083,0.0000234995,0.0004930122,0.0002427845,0.0001755455,0.002484069,0.01914444,0.005144998,0.6094537,0.3606075,0.000361719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005368618,0.007233765,0.9211211,0.001729343,0.0005725045,0.0007701938,0.000008179979,0.0001972458,0.06299909],"genre_scores_gemma":[0.9768823,0.0001213128,0.02232663,0.0001454506,0.00008147443,0.00006675212,0.000003197388,0.000009161635,0.0003636976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9715137,"threshold_uncertainty_score":0.5530845,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4255294472","doi":"10.1017/s1471068410000049","title":"TLP volume 10 issue 2 Cover and Front matter","year":2010,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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; Simon Fraser University","funders":"","keywords":"Computer science; Front cover; Volume (thermodynamics); Cover (algebra); Front (military); Action (physics); Content (measure theory); Process engineering; Mechanical engineering; Thermodynamics; Physics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02574515064414819,"gpt":0.243817643817196,"spread":0.2180724931730478,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002688211,0.0001017283,0.000249717,0.00006339631,0.0001283082,0.000102055,0.00009615656,0.00006919043,0.03310828],"category_scores_gemma":[0.0007094737,0.0001004637,0.00003493475,0.00004019006,0.0003050021,0.0004683223,0.000118936,0.0001371044,0.01128192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006141205,"about_ca_system_score_gemma":0.000004517753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004335267,"about_ca_topic_score_gemma":0.000001034096,"domain_scores_codex":[0.9991943,0.00003628775,0.0002738271,0.0002900682,0.00001925412,0.0001862392],"domain_scores_gemma":[0.999063,0.0003848732,0.0002931062,0.0001778362,0.00002547612,0.00005573416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006594494,0.0002900629,0.01489382,0.0001604,0.0003208155,0.0000127585,0.006286114,0.000004482141,0.0001277258,0.8614612,0.06591249,0.04987067],"study_design_scores_gemma":[0.0002469818,0.00005652131,0.0006680143,0.000004919307,0.00002232007,0.00002140237,0.001492295,0.00003579914,0.00001881627,0.02114899,0.9761419,0.0001420872],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.04337591,0.003219771,0.001001058,0.001301403,0.001200132,0.0002378993,0.00006311324,0.00002987045,0.9495708],"genre_scores_gemma":[0.6170829,0.0003226858,0.008684049,0.0008336812,0.0001550665,0.00001786878,0.000005191685,0.00001563289,0.3728829],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.9102294,"threshold_uncertainty_score":0.9894879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4240466114","doi":"10.1017/s1471068411000044","title":"TLP volume 11 issue 2-3 Cover and Front matter","year":2011,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Library Science and Information Systems","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; Simon Fraser University","funders":"","keywords":"Computer science; Front cover; Volume (thermodynamics); Cover (algebra); Front (military); Action (physics); Content (measure theory); Computer graphics (images); Mechanical engineering; Geology; Thermodynamics; Physics; Oceanography; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02972669369757308,"gpt":0.256908822545738,"spread":0.2271821288481649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002250116,0.00008543532,0.0001242154,0.00005185782,0.0001055977,0.0001857404,0.0003150177,0.00004419165,0.0004545544],"category_scores_gemma":[0.0001565591,0.00006380879,0.00001913011,0.000105992,0.0001412334,0.006926917,0.0001969249,0.00006926643,0.0004372086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003104332,"about_ca_system_score_gemma":0.00001772636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002954864,"about_ca_topic_score_gemma":1.144262e-7,"domain_scores_codex":[0.9990304,0.0002739539,0.0002243268,0.0001686555,0.0001364563,0.0001662231],"domain_scores_gemma":[0.9991171,0.0003111497,0.000221822,0.0002328744,0.00004619891,0.00007084088],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002626186,0.0001889308,0.0129662,0.0002042003,0.00005683042,0.00002893812,0.09349451,0.000002791162,0.0001823069,0.5639616,0.004173344,0.3244777],"study_design_scores_gemma":[0.0005015637,0.0006153567,0.003837318,0.0000670638,0.00002247289,0.0005701085,0.01148589,0.001204085,0.001178237,0.02987553,0.9502132,0.0004291703],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03184924,0.001449232,0.625923,0.002890393,0.0005888373,0.0006017241,0.000002429141,0.0001837412,0.3365114],"genre_scores_gemma":[0.9204065,0.0000466071,0.07214586,0.002898976,0.00004937356,0.00001157148,0.000001014879,0.000004323557,0.004435739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9460399,"threshold_uncertainty_score":0.5619578,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4230066001","doi":"10.1017/s147106840999024x","title":"TLP volume 10 issue 1 Cover and Front matter","year":2009,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","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; Simon Fraser University","funders":"","keywords":"Computer science; Front cover; Volume (thermodynamics); Front (military); Cover (algebra); Action (physics); Content (measure theory); Mechanical engineering; Thermodynamics; Physics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03058974171028559,"gpt":0.2480548072012278,"spread":0.2174650654909422,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002184158,0.0001028194,0.0002668333,0.00006481253,0.0001168456,0.00009311559,0.00008382151,0.00005300958,0.0152671],"category_scores_gemma":[0.0004430887,0.0001024613,0.00003596435,0.00004594903,0.0001696605,0.0004789219,0.00006192156,0.00007535444,0.008050149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001201066,"about_ca_system_score_gemma":0.000003610297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001920477,"about_ca_topic_score_gemma":1.496117e-7,"domain_scores_codex":[0.9991776,0.00004532822,0.0002837771,0.0002840301,0.00001958158,0.0001896474],"domain_scores_gemma":[0.9992307,0.0002645118,0.0002839177,0.0001495123,0.00002147766,0.00004992677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0009804489,0.0003805581,0.00492203,0.0001075365,0.0002735305,0.00001775065,0.00706696,0.00001584826,0.00002832673,0.7796635,0.09585141,0.1106921],"study_design_scores_gemma":[0.0002959114,0.000146936,0.001067213,0.000009864824,0.00002567725,0.00001834941,0.001783784,0.00004092535,0.00001045973,0.04226097,0.9541809,0.0001589897],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01095949,0.00915404,0.001760496,0.00226043,0.0004148182,0.0002248353,0.00004208511,0.00002996451,0.9751539],"genre_scores_gemma":[0.6333436,0.0007190333,0.006309302,0.001998429,0.0001095576,0.000008594133,0.000005177301,0.00001031349,0.357496],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.8583295,"threshold_uncertainty_score":0.9927222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4245159100","doi":"10.1017/s1471068411000354","title":"TLP volume 11 issue 4 Cover and Front matter","year":2011,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"Political Systems and Governance","field":"Social Sciences","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; Simon Fraser University","funders":"","keywords":"Computer science; Front cover; Volume (thermodynamics); Cover (algebra); Front (military); Action (physics); Computer graphics (images); Mechanical engineering; Thermodynamics; Physics; Oceanography; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.03469210943631935,"gpt":0.3128701160777947,"spread":0.2781780066414754,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00286341,0.00007410906,0.0001420541,0.0000127559,0.0001849622,0.00004579637,0.00008829033,0.00007582215,0.001599135],"category_scores_gemma":[0.001318474,0.00005998553,0.00002216167,0.00004026228,0.0004507091,0.0004532234,0.00004776293,0.00008328912,0.0001878531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001197285,"about_ca_system_score_gemma":0.00002199273,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007828519,"about_ca_topic_score_gemma":0.00005818191,"domain_scores_codex":[0.9986827,0.0006314841,0.0001492402,0.0001467314,0.0001398615,0.0002499177],"domain_scores_gemma":[0.9988474,0.000746725,0.0001587758,0.00009424861,0.00004521097,0.0001076187],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001720628,0.00008844933,0.00714817,0.00005031226,0.00002311938,0.00001236608,0.01677895,3.436151e-8,0.00002251843,0.9490608,0.0005917864,0.02605142],"study_design_scores_gemma":[0.0001309643,0.00009071059,0.003343257,0.00003249604,0.00004430417,0.00001553831,0.005358255,0.000001150792,0.00003463999,0.03221755,0.9586193,0.0001118556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.08409477,0.003474087,0.003812677,0.003341773,0.0003063674,0.0005055086,0.000009018938,0.00006386644,0.9043919],"genre_scores_gemma":[0.9807893,0.0001133569,0.002884472,0.0007724795,0.0001304023,0.000009471143,3.433105e-7,0.000005482757,0.01529468],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9580275,"threshold_uncertainty_score":0.9993135,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}