{"meta":{"query_hash":"cc26a47497b5","filters":{"venue":"Theory and Practice of Logic Programming"},"cohort_total":35,"direct_labels_cover":0,"predictions_cover":35,"exported":35,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/cc26a47497b5","api":"https://metacan.xera.ac/api/v1/cohort?venue=Theory+and+Practice+of+Logic+Programming"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.046890055468357714,"score_gpt":0.2824642193132949,"score_spread":0.23557416384493718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980229219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011871057,0.0012470515,0.9348403,0.0020849032,0.00045432494,0.00012195964,0.00052819576,0.0018279968,0.047024183],"genre_scores_gemma":[0.25311562,0.0019581786,0.71425635,0.002001284,0.00030283903,0.0005353819,0.0008380039,0.001241093,0.025751261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785775,0.0007598967,0.00019577406,0.00029811924,0.00053470256,0.00035376853],"domain_scores_gemma":[0.9984267,0.0006670834,0.00026961396,0.00032323733,0.00024758282,0.000065888074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020336427,0.0004601175,0.00045772176,0.0014921211,0.0015799497,0.004239324,0.0014503498,0.000990264,0.005153259],"category_scores_gemma":[0.0043685604,0.00082663365,0.00074594404,0.0021300835,0.004984405,0.0054136403,0.0022860602,0.00313442,0.0020317836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042671112,0.00001308444,0.00017501411,0.00008968313,0.0000071436707,0.00009719789,0.000612516,0.0007905073,0.00083484687,0.9705832,0.0039001259,0.022853985],"study_design_scores_gemma":[0.000041597643,0.000045784695,0.00044990546,0.00015154717,0.000035547826,0.0005915653,0.000447022,0.006535908,0.0072605624,0.6203124,0.36405906,0.00006908438],"about_ca_topic_score_codex":0.0044568176,"about_ca_topic_score_gemma":0.00422276,"teacher_disagreement_score":0.005153259,"about_ca_system_score_codex":0.0015618949,"about_ca_system_score_gemma":0.0014090696,"threshold_uncertainty_score":0.017239392},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06849882632326876,"score_gpt":0.3296679072681382,"score_spread":0.26116908094486946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002154970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0103751095,0.00012477815,0.9827915,0.00059377484,0.000046150002,0.00012948916,0.0000613099,0.00062417524,0.0052537345],"genre_scores_gemma":[0.33761376,0.00022751262,0.653991,0.0005477861,0.0002459937,0.0003555244,0.00022582995,0.0002910598,0.0065015242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995739,0.0016616932,0.00029906357,0.00056591985,0.0013442949,0.00039013667],"domain_scores_gemma":[0.9946637,0.0023519078,0.00034825504,0.0010515128,0.0013846533,0.00019985696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00480348,0.00048100646,0.00067284674,0.0015855771,0.0009626546,0.004258991,0.0023359025,0.0012459306,0.0041384934],"category_scores_gemma":[0.008819259,0.000519192,0.0017052249,0.000967531,0.0034638415,0.0050379657,0.0027520368,0.003225233,0.00051250524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076442484,0.000103962266,0.0005318735,0.00014499872,0.000042740554,0.00020921993,0.0011484437,0.02281742,0.0062662996,0.9112102,0.0011550725,0.056293443],"study_design_scores_gemma":[0.000044407458,0.000118544514,0.00025273993,0.00006696589,0.00008867201,0.00016309682,0.00022191281,0.19018508,0.009543041,0.78108966,0.018176591,0.000049196686],"about_ca_topic_score_codex":0.0023848042,"about_ca_topic_score_gemma":0.002107355,"teacher_disagreement_score":0.00480348,"about_ca_system_score_codex":0.0020986213,"about_ca_system_score_gemma":0.001625528,"threshold_uncertainty_score":0.0254035},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01772871674396846,"score_gpt":0.30882743560079146,"score_spread":0.291098718856823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035142469","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005312829,0.0006519615,0.9724076,0.0011775161,0.00018023315,0.00014452395,0.0003169586,0.008983539,0.010824855],"genre_scores_gemma":[0.08079989,0.00060097023,0.90857816,0.0006685039,0.00023070425,0.00018837972,0.0014368903,0.0020159981,0.005480524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99407274,0.0021295394,0.00043811856,0.0007701288,0.002285556,0.00030393072],"domain_scores_gemma":[0.9928039,0.004069462,0.00031599024,0.0011709293,0.0013312532,0.00030849376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006405593,0.0011200225,0.000792088,0.0017613624,0.0007027424,0.003244398,0.003113337,0.0013175287,0.014842696],"category_scores_gemma":[0.01544213,0.00065531867,0.001407422,0.0020660188,0.00112267,0.00375657,0.003432839,0.003669002,0.004069015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046606676,0.00039973896,0.0015170324,0.0006236341,0.00016200561,0.00020712102,0.0002473997,0.08267284,0.008226175,0.15575421,0.07755086,0.67217296],"study_design_scores_gemma":[0.00019897436,0.0001931469,0.000392412,0.0001806839,0.000054165634,0.00034403644,0.00008048136,0.6861024,0.020329975,0.18712188,0.104948245,0.000053678243],"about_ca_topic_score_codex":0.0020241647,"about_ca_topic_score_gemma":0.0029144872,"teacher_disagreement_score":0.014842696,"about_ca_system_score_codex":0.0017194729,"about_ca_system_score_gemma":0.0027508696,"threshold_uncertainty_score":0.04965377},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Artificial intelligence; Library science; Art history; History","score_opus":0.03146516822735217,"score_gpt":0.28080583075615223,"score_spread":0.24934066252880005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105801569","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002040433,0.0097047845,0.0003714879,0.53748137,0.4340567,0.000040417744,0.00034994623,0.00016542836,0.017625812],"genre_scores_gemma":[0.006040086,0.011904135,0.0005602602,0.25487438,0.19696353,0.000084595995,0.00052662,0.00029025527,0.5287561],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986986,0.00018773518,0.000107996995,0.0003176679,0.0005306676,0.00015734433],"domain_scores_gemma":[0.9961825,0.00070440513,0.00023934894,0.00011916443,0.0019020688,0.0008525412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021040377,0.000988032,0.0009156469,0.00069510826,0.0026315516,0.0039396877,0.0015178077,0.004757737,0.04726808],"category_scores_gemma":[0.012162079,0.00031722378,0.0006039209,0.00040707493,0.0011561953,0.002718435,0.0021421146,0.00917006,0.038026325],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011099594,0.0000026146413,0.000020348025,0.000010843828,0.0000014276533,0.000035931287,0.000018977356,0.0000051358743,0.000018032768,0.00035525902,0.99676454,0.0027557383],"study_design_scores_gemma":[0.000005780717,0.000006992374,0.000077089026,0.000052338433,0.0000032305763,0.00008081927,0.000058271533,0.000015085792,0.00006881509,0.00031959277,0.9993069,0.0000051159495],"about_ca_topic_score_codex":0.004595534,"about_ca_topic_score_gemma":0.011098349,"teacher_disagreement_score":0.04726808,"about_ca_system_score_codex":0.0027735743,"about_ca_system_score_gemma":0.0028112344,"threshold_uncertainty_score":0.15812755},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1463430220138174,"score_gpt":0.3549441782571504,"score_spread":0.208601156243333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105946993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059105046,0.00043556665,0.93679744,0.0074783424,0.0015084009,0.0050204606,0.007304076,0.0041854153,0.031359795],"genre_scores_gemma":[0.028972544,0.0005341973,0.94383305,0.0014388157,0.00019148894,0.009755199,0.004691272,0.0025923864,0.007991059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9147418,0.057429884,0.015321627,0.0020039284,0.009225476,0.0012772888],"domain_scores_gemma":[0.7557431,0.112316616,0.01718539,0.03171982,0.08124334,0.001791663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.044879742,0.0010490038,0.00069892104,0.008749432,0.0037629784,0.0066512274,0.002634088,0.0015796587,0.016219078],"category_scores_gemma":[0.19495831,0.0013848776,0.0008545003,0.009607841,0.0040469607,0.0047188126,0.004744891,0.0056767757,0.010199697],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002838357,0.00012111482,0.0017706965,0.0018192562,0.000024349794,0.00055076793,0.015818203,0.0034589625,0.0029160571,0.5233384,0.20523258,0.24466574],"study_design_scores_gemma":[0.00008855026,0.00010637306,0.0010873488,0.0026336713,0.000017388273,0.00062287477,0.005674799,0.008091588,0.0043684714,0.19769004,0.77951,0.00010887122],"about_ca_topic_score_codex":0.004447446,"about_ca_topic_score_gemma":0.0040255645,"teacher_disagreement_score":0.044879742,"about_ca_system_score_codex":0.0048697502,"about_ca_system_score_gemma":0.009650217,"threshold_uncertainty_score":0.23734963},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04084231505699853,"score_gpt":0.30553718113804595,"score_spread":0.2646948660810474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110717496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056028996,0.0006398982,0.9155968,0.002364027,0.00013933408,0.00022850014,0.0006171387,0.0016679462,0.022717336],"genre_scores_gemma":[0.7733301,0.0005563164,0.21720627,0.0009451765,0.00021951014,0.0005711138,0.0012868309,0.00031757334,0.0055671316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99521095,0.0016676462,0.00035562454,0.0006797199,0.0015959479,0.00049013935],"domain_scores_gemma":[0.9896219,0.0064232983,0.0005652858,0.00085816684,0.0021239144,0.00040731538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038965011,0.00066695176,0.00074045453,0.0021889752,0.001056,0.003986736,0.0014388168,0.0013792036,0.0048700324],"category_scores_gemma":[0.014496131,0.0005262172,0.0016135107,0.0014428446,0.004867505,0.008253043,0.0037038112,0.0033172623,0.0005016422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027218874,0.000025666906,0.0002384889,0.000050389033,0.000008770056,0.00007583727,0.00035124566,0.0033055188,0.0003763543,0.9878848,0.0006958612,0.0069598],"study_design_scores_gemma":[0.000028051938,0.000016279528,0.00006263023,0.000028876346,0.000014160203,0.00004219042,0.000084291125,0.042746995,0.0010142407,0.9506028,0.0053461073,0.000013317359],"about_ca_topic_score_codex":0.0036584886,"about_ca_topic_score_gemma":0.0021919466,"teacher_disagreement_score":0.0048700324,"about_ca_system_score_codex":0.002932349,"about_ca_system_score_gemma":0.0017859506,"threshold_uncertainty_score":0.021275818},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03106231653637484,"score_gpt":0.2877385025871762,"score_spread":0.25667618605080134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113835981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1938504,0.00026228424,0.78274244,0.0021248448,0.00007964658,0.00025588853,0.00036914073,0.0012310835,0.019084228],"genre_scores_gemma":[0.8491761,0.00027306273,0.14459574,0.00042259763,0.00007485951,0.00018349076,0.0002931679,0.00013913217,0.004841787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975968,0.0008388922,0.00014974928,0.00042888196,0.0006496195,0.00033603958],"domain_scores_gemma":[0.9945569,0.0038108754,0.000394717,0.00044576084,0.0005686441,0.00022311512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004238084,0.0005593296,0.00057414005,0.0010954557,0.0008744036,0.0031261873,0.0015363188,0.00085979595,0.0029824702],"category_scores_gemma":[0.0072603542,0.0005230984,0.0012552196,0.0010187522,0.0044208206,0.00654555,0.0023987999,0.0021828827,0.00030651738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011929216,0.00010761373,0.0011196611,0.000121662844,0.000040713687,0.000504487,0.0010662476,0.030739011,0.0039648274,0.94511807,0.00076446036,0.016333848],"study_design_scores_gemma":[0.00007257291,0.00007841512,0.00029517172,0.00006275549,0.00008810297,0.00014755806,0.00031349182,0.19810951,0.009150623,0.7839704,0.0076733287,0.000038111946],"about_ca_topic_score_codex":0.0036993392,"about_ca_topic_score_gemma":0.0035685282,"teacher_disagreement_score":0.004238084,"about_ca_system_score_codex":0.0021479535,"about_ca_system_score_gemma":0.0018661504,"threshold_uncertainty_score":0.022413373},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01761395012785124,"score_gpt":0.27116941309205317,"score_spread":0.25355546296420195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115895293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014577423,0.004523342,0.936541,0.01032439,0.00021851427,0.00008408126,0.00052679697,0.00054484606,0.03265953],"genre_scores_gemma":[0.46560413,0.005197458,0.51258713,0.0022388552,0.0007591344,0.0005089678,0.0009022694,0.00018744415,0.01201468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975448,0.0011975954,0.0001433418,0.0005331443,0.0003870269,0.00019400063],"domain_scores_gemma":[0.99338406,0.005376006,0.00043074993,0.00029934698,0.00030673054,0.0002031939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003567516,0.0007687862,0.0007720565,0.0018784486,0.0016674673,0.004535636,0.0019485599,0.0016882408,0.0064469506],"category_scores_gemma":[0.008776014,0.00047453932,0.0016152851,0.0031401243,0.0056637176,0.008002441,0.002325626,0.0034849523,0.0007072844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011989067,0.000009670084,0.00012550861,0.00005786672,0.000015248954,0.000040155686,0.00009461128,0.009930689,0.00006098552,0.97904074,0.0010132279,0.0095993625],"study_design_scores_gemma":[0.0000048531665,0.0000026281784,0.00002442974,0.000011411768,0.0000041700596,0.000017331342,0.000020119844,0.02064453,0.000038324524,0.9768693,0.002358819,0.000004053441],"about_ca_topic_score_codex":0.006742198,"about_ca_topic_score_gemma":0.004509007,"teacher_disagreement_score":0.006742198,"about_ca_system_score_codex":0.0050124717,"about_ca_system_score_gemma":0.0019176542,"threshold_uncertainty_score":0.03636819},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0320336723505918,"score_gpt":0.2855219591597016,"score_spread":0.2534882868091098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120811814","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08204917,0.00022050267,0.9110131,0.00066128693,0.000038520528,0.0001557327,0.00041869364,0.0008460865,0.0045969947],"genre_scores_gemma":[0.79228777,0.00027316084,0.20200104,0.0003685903,0.00010850014,0.0005347493,0.0012645508,0.00039831657,0.0027632294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953328,0.00094783976,0.0003860295,0.0008441025,0.0020206796,0.000468632],"domain_scores_gemma":[0.9923854,0.0033442366,0.00095167226,0.0011957181,0.001796281,0.0003267233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033236614,0.00085277186,0.0010939775,0.0027777215,0.0009980871,0.004020952,0.0025379756,0.0018156361,0.0035573975],"category_scores_gemma":[0.011487857,0.000758188,0.0022881385,0.0019325027,0.0034283835,0.009574919,0.0028714056,0.002702343,0.0005280318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008151628,0.00008732285,0.00084194686,0.000093636576,0.000057418332,0.00021164733,0.0006164992,0.021844074,0.004446014,0.9593706,0.00069287734,0.011656407],"study_design_scores_gemma":[0.000043695676,0.00005985937,0.00020619886,0.00003527593,0.000040058192,0.0000958837,0.0001496582,0.18306577,0.0043694223,0.8087998,0.0031048297,0.000029537565],"about_ca_topic_score_codex":0.0024544063,"about_ca_topic_score_gemma":0.0021892847,"teacher_disagreement_score":0.004020952,"about_ca_system_score_codex":0.0024875859,"about_ca_system_score_gemma":0.0017345696,"threshold_uncertainty_score":0.018048763},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.024434240958576794,"score_gpt":0.31422539686308476,"score_spread":0.289791155904508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143269622","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003376211,0.0000617728,0.9930281,0.00009860079,0.000009766934,0.000041187366,0.000009465039,0.0003639313,0.0030109996],"genre_scores_gemma":[0.06613045,0.00018687763,0.9302091,0.00008196439,0.000011598644,0.00011871711,0.00006098231,0.00016013588,0.0030401233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985024,0.0005602914,0.0001163231,0.0002635165,0.0004593747,0.000098222525],"domain_scores_gemma":[0.9980909,0.001172301,0.0001484858,0.00037712263,0.0001477614,0.00006336777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026604116,0.0007560801,0.0004589116,0.00075211114,0.0006963411,0.0023728227,0.0015134686,0.0010674761,0.002995213],"category_scores_gemma":[0.0038994872,0.00063848885,0.0010688829,0.00057548867,0.0034746393,0.003443094,0.0019155509,0.001394844,0.0007669495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011559081,0.00011364258,0.00055791606,0.0006093134,0.000041166582,0.00038337405,0.0025350933,0.10473102,0.039456785,0.70315224,0.0013842836,0.14691952],"study_design_scores_gemma":[0.00014942476,0.0004846384,0.00027953892,0.00024632455,0.000090649635,0.00058120897,0.0007417057,0.2984221,0.075220995,0.5154246,0.108276896,0.000081846556],"about_ca_topic_score_codex":0.0013959523,"about_ca_topic_score_gemma":0.0016722056,"teacher_disagreement_score":0.002995213,"about_ca_system_score_codex":0.001106146,"about_ca_system_score_gemma":0.0016978872,"threshold_uncertainty_score":0.014069736},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02296435859975818,"score_gpt":0.32255880254978747,"score_spread":0.29959444395002927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152906186","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00472635,0.000085251835,0.9561587,0.00030654727,0.00016893182,0.00026544055,0.00072925224,0.030587967,0.0069714366],"genre_scores_gemma":[0.11850872,0.00018743852,0.8630692,0.0005538165,0.000092803835,0.0005180197,0.0021435558,0.004088731,0.010837722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965108,0.00081005465,0.00037213502,0.00077024236,0.0011115925,0.00042518493],"domain_scores_gemma":[0.9948767,0.0023079778,0.00030258493,0.0014190292,0.000943503,0.00015037437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040331385,0.000780825,0.0008339878,0.0012487657,0.0008985295,0.0033898158,0.00614076,0.0025011706,0.026450012],"category_scores_gemma":[0.00848189,0.001021454,0.0020039808,0.0014021418,0.0019551262,0.0038886042,0.0026423878,0.0033201945,0.0066288305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012972085,0.0006410976,0.0020850454,0.001838576,0.00029413443,0.0016267087,0.001427011,0.069780625,0.057121664,0.5624032,0.04239056,0.25909418],"study_design_scores_gemma":[0.000781667,0.0005273081,0.0007068568,0.00024685575,0.0002801861,0.0015554448,0.0003054084,0.5804809,0.1196966,0.12006016,0.17501576,0.00034285607],"about_ca_topic_score_codex":0.0040495214,"about_ca_topic_score_gemma":0.0033292957,"teacher_disagreement_score":0.026450012,"about_ca_system_score_codex":0.001056866,"about_ca_system_score_gemma":0.0027605835,"threshold_uncertainty_score":0.08848411},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02471089799935112,"score_gpt":0.29372717397137965,"score_spread":0.26901627597202854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170245713","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013676234,0.00016215423,0.9672355,0.00070841046,0.00020306621,0.00023785555,0.0008287475,0.006508051,0.010439947],"genre_scores_gemma":[0.18332535,0.00019902096,0.8086811,0.00039946364,0.00011172287,0.00040111772,0.0020168466,0.0012284507,0.0036370312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997044,0.0011926539,0.00021697233,0.00040469138,0.0008701091,0.00027161298],"domain_scores_gemma":[0.9949891,0.0031034497,0.00024711492,0.0008190283,0.00067889923,0.00016245172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025922514,0.001046806,0.0006540097,0.0011945029,0.00067847135,0.0022284437,0.0019833387,0.0010017429,0.0128639955],"category_scores_gemma":[0.010103336,0.00052636495,0.0012553015,0.0013889062,0.0010726751,0.0023283416,0.0019726935,0.002534065,0.00228916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047366574,0.00046118797,0.0013242562,0.00059698016,0.0000836303,0.00025906804,0.00025905433,0.37986073,0.008159076,0.22681491,0.031591978,0.3501154],"study_design_scores_gemma":[0.00009046087,0.00009176632,0.00011648874,0.00005010582,0.000025765714,0.00005285823,0.000049425536,0.8433764,0.009534929,0.13399398,0.012598668,0.00001921147],"about_ca_topic_score_codex":0.0020573705,"about_ca_topic_score_gemma":0.0025302204,"teacher_disagreement_score":0.0128639955,"about_ca_system_score_codex":0.0011290449,"about_ca_system_score_gemma":0.0022165617,"threshold_uncertainty_score":0.043034375},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.025098588217902507,"score_gpt":0.31889151316123443,"score_spread":0.2937929249433319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170782811","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041361844,0.0036695236,0.00038222948,0.03821588,0.95081055,0.000032911314,0.00009959941,0.00009536218,0.0066526],"genre_scores_gemma":[0.0008572074,0.0056704953,0.00051266653,0.016968329,0.9306289,0.000055818902,0.00014556946,0.00019572325,0.044965286],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.994323,0.00069422997,0.0005700022,0.0007214383,0.0032393313,0.00045191965],"domain_scores_gemma":[0.98214227,0.0033341548,0.0007880174,0.00047537492,0.010681284,0.0025788383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005940146,0.0027558815,0.0025480834,0.005013899,0.0032529507,0.010572519,0.0029058466,0.008328903,0.043239146],"category_scores_gemma":[0.017086672,0.0007290193,0.0027074264,0.0021442948,0.0023100798,0.004788895,0.0016258623,0.012181131,0.026385147],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014209977,0.000009996136,0.00002060355,0.00008915894,0.00000790617,0.00005319305,0.000006457777,0.000030611583,0.000037452908,0.00068849436,0.9941071,0.0049348343],"study_design_scores_gemma":[0.000019234487,0.000009512484,0.00013130241,0.00021822887,0.000019696627,0.00013114185,0.000018007695,0.0001245554,0.00008626096,0.0018057913,0.9974274,0.0000089435525],"about_ca_topic_score_codex":0.00217924,"about_ca_topic_score_gemma":0.00535454,"teacher_disagreement_score":0.043239146,"about_ca_system_score_codex":0.0062334677,"about_ca_system_score_gemma":0.006807081,"threshold_uncertainty_score":0.14464933},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06676812964106243,"score_gpt":0.3393231874155429,"score_spread":0.27255505777448047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174235632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016447995,0.000072886294,0.99405116,0.00016299068,0.000032703698,0.00008551,0.00010256211,0.0017608417,0.0020863703],"genre_scores_gemma":[0.03849817,0.00024085976,0.9583648,0.00019073465,0.000072779454,0.00026791706,0.0002965922,0.00049930013,0.0015689705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970855,0.0007814928,0.00043421504,0.0005560017,0.0008554488,0.00028730478],"domain_scores_gemma":[0.9980077,0.00081741996,0.00019216929,0.00056496833,0.00032482843,0.00009303092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034069875,0.00087670906,0.00081892405,0.001791216,0.0010163205,0.002978705,0.0019191498,0.0010508577,0.004498132],"category_scores_gemma":[0.007546845,0.0010511721,0.0022713642,0.0017769743,0.0024549635,0.0048563504,0.002902479,0.0030917549,0.0013210694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005494448,0.00007444104,0.00055950775,0.00032493993,0.00005550935,0.0003008848,0.0008606255,0.04255792,0.0035065596,0.85409147,0.0032898947,0.09432341],"study_design_scores_gemma":[0.00005243809,0.00006896243,0.00018405596,0.0001388326,0.00007319425,0.00027706646,0.0001841104,0.10719547,0.0074738744,0.81767255,0.066625215,0.00005432119],"about_ca_topic_score_codex":0.0028379706,"about_ca_topic_score_gemma":0.0027757145,"teacher_disagreement_score":0.004498132,"about_ca_system_score_codex":0.0014705096,"about_ca_system_score_gemma":0.0022222945,"threshold_uncertainty_score":0.018018067},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Code (set theory); Programming language; Scheme (mathematics); Unification; Hierarchy; Server; Set (abstract data type); Redundant code; Code generation; Operating system","score_opus":0.02759578243579439,"score_gpt":0.27003354251569006,"score_spread":0.24243776007989568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175707891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02108429,0.0004979549,0.9643691,0.0006094808,0.00010141721,0.00005314244,0.000023120276,0.0013410776,0.011920422],"genre_scores_gemma":[0.43698177,0.0008324661,0.5431114,0.00030588362,0.00014657938,0.0003020616,0.000075507225,0.0003071479,0.017937195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992843,0.00019814301,0.000050656567,0.00011561228,0.0002420964,0.00010922343],"domain_scores_gemma":[0.99903214,0.0003282949,0.00012334668,0.00031340402,0.000095978336,0.00010686082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010639137,0.0004639483,0.00036988079,0.00067980436,0.0015938036,0.002980853,0.0014032418,0.001030244,0.003049381],"category_scores_gemma":[0.0024732994,0.00043961324,0.00059302495,0.0005813199,0.0039376994,0.004703807,0.002524346,0.0021611955,0.00078390667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037310627,0.000020252788,0.00023496614,0.00003900619,0.000006644684,0.00012866243,0.0004556949,0.009833309,0.003008912,0.9646543,0.0007761895,0.0208048],"study_design_scores_gemma":[0.00004638891,0.00007953531,0.00015560324,0.00007748791,0.000025597874,0.00034205802,0.0001376763,0.14547528,0.011242992,0.7833302,0.059041727,0.00004544778],"about_ca_topic_score_codex":0.0014940959,"about_ca_topic_score_gemma":0.0018462006,"teacher_disagreement_score":0.003049381,"about_ca_system_score_codex":0.001375363,"about_ca_system_score_gemma":0.0010579379,"threshold_uncertainty_score":0.010201156},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.035912039209565476,"score_gpt":0.2516279599677328,"score_spread":0.2157159207581673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2193302029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02883697,0.00049966737,0.9347609,0.0026587204,0.00016313574,0.00015006027,0.00023304488,0.0010442346,0.031653326],"genre_scores_gemma":[0.65406156,0.0005681959,0.33555,0.00097421743,0.000191596,0.0003293108,0.00035439027,0.00051929423,0.0074514304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968221,0.0012565794,0.00022693133,0.00048750205,0.0008378099,0.00036910264],"domain_scores_gemma":[0.99644035,0.0018521188,0.00029863784,0.00076205644,0.00047432623,0.0001725297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034911016,0.00041731758,0.00049385533,0.0009289529,0.0014726678,0.0053957696,0.0013592014,0.0015435206,0.004219513],"category_scores_gemma":[0.007408629,0.0008017267,0.0011092557,0.00094318064,0.0076545333,0.009027882,0.0034648723,0.004243209,0.00074951287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030013838,0.000009787327,0.000088529945,0.000049760067,0.0000051819293,0.00007556706,0.00055239,0.0011780955,0.00069492194,0.9912361,0.00047332532,0.0056062597],"study_design_scores_gemma":[0.00003403908,0.00004098776,0.00010217329,0.000045689143,0.000017784849,0.00015715841,0.00026270308,0.010681386,0.0022516241,0.96891785,0.017467767,0.000020772],"about_ca_topic_score_codex":0.0014562052,"about_ca_topic_score_gemma":0.0009486037,"teacher_disagreement_score":0.0053957696,"about_ca_system_score_codex":0.0014858666,"about_ca_system_score_gemma":0.0014677766,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07054837066759287,"score_gpt":0.31456330669132426,"score_spread":0.2440149360237314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408791408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07188183,0.0005942035,0.91805756,0.0021657231,0.000085393825,0.0001528301,0.00011359092,0.0003513328,0.006597528],"genre_scores_gemma":[0.87274534,0.00039732744,0.123175085,0.00022929392,0.00012483746,0.00019699527,0.000184596,0.00009452676,0.0028520364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98318326,0.0065337406,0.001689684,0.0019032593,0.0057138465,0.00097616523],"domain_scores_gemma":[0.9691835,0.016547047,0.0030648347,0.0055625536,0.004776695,0.00086530694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01118237,0.00049077574,0.0011581563,0.0015182905,0.002176748,0.0063444353,0.0029165153,0.0025495237,0.0020928164],"category_scores_gemma":[0.03937884,0.00072319986,0.0011622078,0.0017081755,0.0056241094,0.013471114,0.005546902,0.002594854,0.0003438475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000981253,0.000048058504,0.0012667256,0.000106579246,0.000056503708,0.00038599872,0.0012670988,0.03710439,0.001103221,0.9453816,0.0007733843,0.012408419],"study_design_scores_gemma":[0.000052006773,0.00005190485,0.00019337128,0.000041410935,0.000041310668,0.0002389279,0.0004094207,0.113647476,0.0018970051,0.8765811,0.0068115788,0.000034589375],"about_ca_topic_score_codex":0.003076209,"about_ca_topic_score_gemma":0.0009877929,"teacher_disagreement_score":0.01118237,"about_ca_system_score_codex":0.0026366273,"about_ca_system_score_gemma":0.0028044558,"threshold_uncertainty_score":0.059138715},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04921704846220617,"score_gpt":0.3125891107936691,"score_spread":0.26337206233146293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795456052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028961798,0.00080085127,0.73185873,0.0062912134,0.00092135003,0.0003467782,0.0034048904,0.014710308,0.2127041],"genre_scores_gemma":[0.5248279,0.0014891365,0.37492272,0.003822306,0.000565533,0.0005181634,0.0062963003,0.005981827,0.081576146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977537,0.00062207,0.00017946397,0.0004437747,0.0007031929,0.00029779915],"domain_scores_gemma":[0.9982382,0.0004493029,0.000121441706,0.000491611,0.0005603163,0.00013898207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018222627,0.0005879993,0.0006022066,0.00084934273,0.00086624967,0.0037451787,0.001641068,0.000908697,0.017390732],"category_scores_gemma":[0.0047406326,0.00037259416,0.00070275686,0.0008409863,0.0019865723,0.005989671,0.0031698926,0.0025464564,0.0061476408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018577745,0.000038528597,0.0005722889,0.00023660513,0.000011000606,0.00034294362,0.0006707409,0.0032348572,0.0028237898,0.9128391,0.02788967,0.05115468],"study_design_scores_gemma":[0.000065254426,0.000068948124,0.00043431553,0.00030202005,0.000026171576,0.00050530786,0.0002772385,0.019109124,0.009209407,0.48164156,0.48829994,0.000060722392],"about_ca_topic_score_codex":0.0024085648,"about_ca_topic_score_gemma":0.0010685658,"teacher_disagreement_score":0.017390732,"about_ca_system_score_codex":0.0017371924,"about_ca_system_score_gemma":0.0014085021,"threshold_uncertainty_score":0.05817777},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03538053620335877,"score_gpt":0.3295888816316333,"score_spread":0.2942083454282745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963390246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020979404,0.00011075102,0.97380644,0.00034525534,0.00003420201,0.00011422348,0.00023139601,0.0005748304,0.0038035703],"genre_scores_gemma":[0.3290962,0.00017040689,0.6666196,0.00027208787,0.00006889198,0.0002272717,0.0006369508,0.00015340166,0.0027551826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951939,0.0010735522,0.0005403416,0.00086829823,0.00188756,0.0004363799],"domain_scores_gemma":[0.9905359,0.0056802863,0.00066845445,0.0010403774,0.0017639232,0.00031102684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049615297,0.00063916645,0.00065645983,0.0030257443,0.001070669,0.003387466,0.0022298023,0.001355407,0.003845003],"category_scores_gemma":[0.013073443,0.0006174445,0.0017492098,0.0017237704,0.003883272,0.006795774,0.003761059,0.0031399226,0.0006780008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010344916,0.00009322877,0.0006217175,0.0001962173,0.000055171196,0.0003478272,0.0009938703,0.054710623,0.0057360823,0.87274766,0.0015971587,0.06279709],"study_design_scores_gemma":[0.00003028087,0.000039436378,0.00013594922,0.000100805984,0.00004550655,0.00013553795,0.00023226417,0.24376285,0.007333445,0.73999596,0.008148956,0.000039100836],"about_ca_topic_score_codex":0.004239284,"about_ca_topic_score_gemma":0.005461502,"teacher_disagreement_score":0.0049615297,"about_ca_system_score_codex":0.0022711556,"about_ca_system_score_gemma":0.0016976058,"threshold_uncertainty_score":0.026239395},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04945355396791649,"score_gpt":0.2932697694423416,"score_spread":0.24381621547442514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964029271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049774367,0.0000967825,0.9429582,0.00071466295,0.00003410253,0.00009410444,0.0002241926,0.0009991915,0.005104381],"genre_scores_gemma":[0.67883354,0.00024726824,0.31440824,0.00048474284,0.00009410388,0.00030249328,0.000674238,0.0004593394,0.0044960524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961145,0.0012483317,0.00026327564,0.00057726016,0.0014780072,0.00031856116],"domain_scores_gemma":[0.99333644,0.0038137254,0.00071290345,0.00077139906,0.0012037626,0.0001618256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002452279,0.00053151476,0.00046161533,0.0017326791,0.000678797,0.0034917684,0.0016268796,0.0012269662,0.00418166],"category_scores_gemma":[0.010733289,0.00041010737,0.0011556359,0.0023078695,0.0031834033,0.0060306494,0.0027281176,0.002031195,0.00036750897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011744001,0.00011042542,0.0011226694,0.00014793657,0.000040502935,0.00023642137,0.0010011803,0.030058075,0.0059208134,0.92197764,0.0014303438,0.03783662],"study_design_scores_gemma":[0.000025298032,0.00005643094,0.00030768773,0.000050664366,0.00004187489,0.00012311236,0.00022077345,0.22750777,0.008766295,0.75666434,0.0062081944,0.000027466544],"about_ca_topic_score_codex":0.0030947041,"about_ca_topic_score_gemma":0.0016287621,"teacher_disagreement_score":0.00418166,"about_ca_system_score_codex":0.0013675791,"about_ca_system_score_gemma":0.0014344321,"threshold_uncertainty_score":0.013989031},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Planner; Job shop scheduling; Answer set programming; Motion planning","score_opus":0.02277286717745461,"score_gpt":0.29907783561434914,"score_spread":0.27630496843689456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966640145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08332561,0.0001963131,0.89885485,0.00063021755,0.00004562652,0.00020157087,0.00019670892,0.00094027736,0.015608829],"genre_scores_gemma":[0.6206391,0.00023455238,0.374727,0.00011166377,0.000021455664,0.0001494751,0.0002624393,0.0002006273,0.0036537643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987771,0.0004518721,0.00006962579,0.00015199435,0.00038808936,0.00016128199],"domain_scores_gemma":[0.99711955,0.0019931123,0.00017362132,0.00029044753,0.00030658272,0.000116657364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013337701,0.0005137055,0.0004608872,0.0004898781,0.0005162824,0.0011049991,0.0008466339,0.00056596653,0.0031199018],"category_scores_gemma":[0.0045841644,0.00042254513,0.0006446689,0.0006330452,0.0014484291,0.0016329288,0.0013022331,0.0011865613,0.00025998979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019397114,0.000109257046,0.000701952,0.00015791338,0.000032533426,0.00013630184,0.0001198881,0.858562,0.003792682,0.08046337,0.00182553,0.053904608],"study_design_scores_gemma":[0.00003479455,0.000057017663,0.00015661499,0.000014662659,0.00001837905,0.000042845768,0.00005168309,0.9216357,0.004301806,0.07062664,0.0030509376,0.000008930561],"about_ca_topic_score_codex":0.004513742,"about_ca_topic_score_gemma":0.0055645737,"teacher_disagreement_score":0.004513742,"about_ca_system_score_codex":0.001151212,"about_ca_system_score_gemma":0.0018120861,"threshold_uncertainty_score":0.010437131},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.09011873064827158,"score_gpt":0.3032837098513963,"score_spread":0.21316497920312472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997463312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09796761,0.0042688735,0.8069733,0.012104227,0.00039478875,0.00010447211,0.00016450197,0.00041521576,0.07760707],"genre_scores_gemma":[0.8557325,0.0013967202,0.13839932,0.0010366723,0.00024128145,0.00009138616,0.00009143428,0.0000643561,0.002946298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671966,0.0016203561,0.00018445557,0.0003427704,0.0008056803,0.0003270758],"domain_scores_gemma":[0.995488,0.0027738016,0.00035534785,0.0004508722,0.0006049187,0.0003272176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051815216,0.0005176875,0.00047290337,0.0019873562,0.0020768514,0.006376905,0.0013058095,0.0015378863,0.0027156828],"category_scores_gemma":[0.0050284923,0.0007117711,0.0010961054,0.0012663472,0.010623509,0.010874626,0.004121893,0.0041627954,0.00030596263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075286007,0.000009231468,0.000068508794,0.000016351974,0.0000032643777,0.00003687266,0.00026847434,0.000812883,0.00019484779,0.99684,0.00017321827,0.001568843],"study_design_scores_gemma":[0.0000056883932,0.000006374795,0.000028623574,0.000016554619,0.0000031305667,0.000017916855,0.000089053596,0.006838443,0.00014640707,0.9911937,0.001648835,0.000005207985],"about_ca_topic_score_codex":0.0025637394,"about_ca_topic_score_gemma":0.0025955157,"teacher_disagreement_score":0.006376905,"about_ca_system_score_codex":0.002869611,"about_ca_system_score_gemma":0.001673949,"threshold_uncertainty_score":0.027402818},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03509764070194063,"score_gpt":0.2860400346852408,"score_spread":0.2509423939833002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012364298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022831291,0.00013989478,0.9672596,0.00065749616,0.00006830697,0.00013562068,0.00031467745,0.002363385,0.006229773],"genre_scores_gemma":[0.29936728,0.000121717836,0.6954853,0.00048136344,0.00006128575,0.00023698983,0.00080922584,0.00029833926,0.0031385769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818355,0.0008326517,0.0000823973,0.0002528051,0.0004527329,0.00019582082],"domain_scores_gemma":[0.997152,0.0019427309,0.00013280068,0.00034211436,0.00033046192,0.00009992384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019176268,0.00088771916,0.0007523614,0.0010497336,0.00050338067,0.0019378628,0.0019802756,0.0011934601,0.005566442],"category_scores_gemma":[0.0054086135,0.00044169292,0.0012576203,0.0013186284,0.0010680554,0.0017089744,0.0018780956,0.0021718103,0.0008212411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028995817,0.00035611662,0.0006923795,0.00017591064,0.000089393034,0.00013082595,0.00016238785,0.81027746,0.003382445,0.07666377,0.00613457,0.10164478],"study_design_scores_gemma":[0.000044968077,0.00003886548,0.00006625069,0.000011962719,0.000012231653,0.000017515154,0.000033471624,0.94891435,0.0012855857,0.04679372,0.0027739825,0.0000070529923],"about_ca_topic_score_codex":0.0036997963,"about_ca_topic_score_gemma":0.0047334456,"teacher_disagreement_score":0.005566442,"about_ca_system_score_codex":0.0011170609,"about_ca_system_score_gemma":0.0015785069,"threshold_uncertainty_score":0.018621624},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05125413606843647,"score_gpt":0.3375370963073417,"score_spread":0.2862829602389052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040097605","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4597731,0.00041740775,0.52100575,0.00026367462,0.000036651873,0.0008494305,0.0005206339,0.0034679642,0.013665373],"genre_scores_gemma":[0.7032385,0.00019116983,0.29298946,0.000096547374,0.000012347732,0.00026710925,0.00087202294,0.00050889736,0.0018238424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942696,0.0026964291,0.00032483993,0.00069374096,0.0016382525,0.00037709842],"domain_scores_gemma":[0.9727745,0.019739576,0.00052305585,0.003867066,0.0026521836,0.00044358798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00568065,0.0004813427,0.0006831257,0.0016226835,0.0010914837,0.0012611318,0.0021108326,0.0010508337,0.0038660876],"category_scores_gemma":[0.027921157,0.00037781367,0.0010680335,0.0012049135,0.0018121016,0.003142452,0.0019583008,0.0019233841,0.0006116002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002127497,0.0058831074,0.024405433,0.0017229528,0.0002891295,0.0011865336,0.008006987,0.30422926,0.102204286,0.141886,0.0068996106,0.40115908],"study_design_scores_gemma":[0.00015287419,0.00070587854,0.0031758025,0.000108716165,0.00007946096,0.00021759838,0.0010324082,0.9007604,0.047499336,0.038592685,0.0076071913,0.00006771637],"about_ca_topic_score_codex":0.005986583,"about_ca_topic_score_gemma":0.006649495,"teacher_disagreement_score":0.005986583,"about_ca_system_score_codex":0.0014741318,"about_ca_system_score_gemma":0.0011854735,"threshold_uncertainty_score":0.03004253},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01672153767915117,"score_gpt":0.3171916336613706,"score_spread":0.3004700959822194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205994671","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013867497,0.0015733944,0.0015173642,0.011759248,0.013401538,0.00009871271,0.0015870797,0.002221427,0.96645445],"genre_scores_gemma":[0.0029644768,0.0006746147,0.00039326362,0.0016209701,0.00199177,0.000027572443,0.0006539874,0.0004239459,0.9912493],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993228,0.000062748324,0.000027151906,0.00012783991,0.00037585746,0.00008369073],"domain_scores_gemma":[0.9983626,0.00024260959,0.000052163858,0.00028683696,0.00061974424,0.00043611275],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008819128,0.0007391636,0.00064573606,0.0018344895,0.0016646031,0.006442432,0.0009670384,0.00306291,0.82776624],"category_scores_gemma":[0.0026899455,0.00035646342,0.0007915247,0.0015110903,0.0010623063,0.0025969232,0.0022235254,0.002596853,0.74577713],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003768802,0.000059315214,0.00018153936,0.00013428065,0.000004818383,0.00008470388,0.000035897396,0.00005343058,0.00060210814,0.0025174154,0.92313796,0.07315079],"study_design_scores_gemma":[0.000009594679,0.000015221108,0.00036522612,0.00008335482,0.0000029888818,0.000102452716,0.000047239057,0.00013606127,0.00034007142,0.0010213811,0.99787223,0.000004125369],"about_ca_topic_score_codex":0.0018458553,"about_ca_topic_score_gemma":0.0028173525,"teacher_disagreement_score":0.82776624,"about_ca_system_score_codex":0.0016851175,"about_ca_system_score_gemma":0.0017617188,"threshold_uncertainty_score":0.24567056},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03058974171028559,"score_gpt":0.2480548072012278,"score_spread":0.21746506549094222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230066001","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012220208,0.002124359,0.0018750111,0.010491442,0.017020531,0.00011625694,0.001987787,0.00264647,0.96251625],"genre_scores_gemma":[0.0025161195,0.0009328742,0.0005065846,0.0015587113,0.0025947064,0.000029892397,0.00095086533,0.00050041475,0.99040985],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927944,0.0000600783,0.000028296066,0.00013540634,0.0004183477,0.000078422505],"domain_scores_gemma":[0.9980585,0.00027194925,0.000063022075,0.00030454493,0.000813761,0.00048815628],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00084966864,0.000808357,0.0006991982,0.0021468145,0.0014910983,0.0065662586,0.0010920927,0.0028227363,0.81583005],"category_scores_gemma":[0.0026888202,0.00036027306,0.0007743237,0.0016160842,0.0009183966,0.0028507689,0.0021248914,0.002519729,0.76149714],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033627683,0.00006053468,0.0001642236,0.0001378066,0.000004530024,0.00007945524,0.000024820483,0.000055820637,0.00057043845,0.0020061526,0.9248264,0.07203621],"study_design_scores_gemma":[0.000008441305,0.00001488338,0.00037494916,0.00008816543,0.0000029085697,0.00010623428,0.000036268248,0.00012708068,0.00032348573,0.0009601189,0.9979532,0.000004175124],"about_ca_topic_score_codex":0.0014522992,"about_ca_topic_score_gemma":0.0021143127,"teacher_disagreement_score":0.18416995,"about_ca_system_score_codex":0.001597386,"about_ca_system_score_gemma":0.001567073,"threshold_uncertainty_score":0.2626961},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026213582708853104,"score_gpt":0.24414520075276266,"score_spread":0.21793161804390956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238432756","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012971194,0.0014696277,0.0025004395,0.00958618,0.0124072125,0.00011498446,0.0025752818,0.003325376,0.96672374],"genre_scores_gemma":[0.0031887968,0.0007885388,0.0008289473,0.0015142905,0.0020877628,0.000036127338,0.0013759497,0.00078447047,0.9893952],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923563,0.000077589626,0.000035051482,0.00012142471,0.00044523965,0.00008512424],"domain_scores_gemma":[0.9977709,0.0003173701,0.00006850159,0.00039697756,0.000927437,0.0005188685],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00096464687,0.0007846192,0.000708206,0.0022944862,0.0014505611,0.007116151,0.0010600818,0.0025261047,0.813734],"category_scores_gemma":[0.0029629555,0.00035066533,0.00084857875,0.0016855901,0.00096191093,0.0029762434,0.002117627,0.0024604776,0.7572944],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036689533,0.00006499044,0.00018070143,0.0001345877,0.000004899552,0.00006776782,0.000025864776,0.0000691817,0.0006416504,0.0024045857,0.9325554,0.063813716],"study_design_scores_gemma":[0.000012492899,0.000019003763,0.00043930052,0.00009643905,0.0000040019368,0.00011215337,0.00004747623,0.00019246899,0.000512373,0.0015090598,0.9970498,0.000005370844],"about_ca_topic_score_codex":0.0019120979,"about_ca_topic_score_gemma":0.002489846,"teacher_disagreement_score":0.186266,"about_ca_system_score_codex":0.0018362488,"about_ca_system_score_gemma":0.0016783272,"threshold_uncertainty_score":0.26568586},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03440374133059238,"score_gpt":0.3125089927081705,"score_spread":0.27810525137757813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238620831","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010766025,0.0014049313,0.0012973739,0.009773989,0.011305672,0.00009850966,0.0018379105,0.0021663946,0.9710386],"genre_scores_gemma":[0.0023208037,0.00064222014,0.00036175497,0.0012674595,0.0016581259,0.000023871024,0.00076537306,0.00041591562,0.9925444],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914503,0.00007767335,0.00003447832,0.00015432951,0.00048623685,0.00010235541],"domain_scores_gemma":[0.9980458,0.00025948728,0.00006578717,0.00035738488,0.00075750507,0.000514004],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00095143315,0.00079212914,0.0006929507,0.0022945723,0.001785202,0.007272056,0.0010145975,0.0030911006,0.8530618],"category_scores_gemma":[0.0029157444,0.00039618486,0.0008485169,0.0018240155,0.001053054,0.002717525,0.002624028,0.0026680164,0.7910873],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003235761,0.000056838086,0.00016274284,0.00013826395,0.0000046289415,0.00007081463,0.000033493878,0.000049280396,0.0005737728,0.0022864444,0.9269768,0.0696146],"study_design_scores_gemma":[0.000007826764,0.000013592365,0.00033823005,0.00008855748,0.0000027416943,0.00008661187,0.000045818964,0.00010709969,0.0003054325,0.00079917087,0.998201,0.000003862568],"about_ca_topic_score_codex":0.0018021882,"about_ca_topic_score_gemma":0.0028735718,"teacher_disagreement_score":0.1469382,"about_ca_system_score_codex":0.0018159836,"about_ca_system_score_gemma":0.0018113176,"threshold_uncertainty_score":0.20958942},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02972669369757308,"score_gpt":0.256908822545738,"score_spread":0.2271821288481649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240466114","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011201869,0.0015335522,0.0021854688,0.008589815,0.012058786,0.00011618074,0.0023285418,0.0034678015,0.9685997],"genre_scores_gemma":[0.0025372463,0.0008748133,0.00069243304,0.0016061274,0.0017260136,0.000036694735,0.0012089096,0.0007987531,0.9905191],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895227,0.0000961108,0.000044526343,0.00017299596,0.0006226089,0.000111435416],"domain_scores_gemma":[0.99732566,0.00033382987,0.00008454349,0.0005395209,0.0010876568,0.0006288376],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011205865,0.0008275999,0.00075178227,0.0029280265,0.00181931,0.008917825,0.0011549884,0.0029425246,0.82680947],"category_scores_gemma":[0.0031913677,0.0004212897,0.0009638131,0.0024089254,0.0011187061,0.0034742116,0.0029355155,0.0024573503,0.795107],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028654855,0.000059121783,0.00017822257,0.00014590826,0.000004588154,0.00006564068,0.000030321551,0.000056409295,0.00058793457,0.0021297035,0.93182737,0.064886205],"study_design_scores_gemma":[0.000008166756,0.000013978437,0.00036382175,0.00009458378,0.0000032952967,0.000112475485,0.00004855564,0.00012549403,0.00035319946,0.00084967946,0.9980223,0.000004487886],"about_ca_topic_score_codex":0.0019420868,"about_ca_topic_score_gemma":0.0028388952,"teacher_disagreement_score":0.17319053,"about_ca_system_score_codex":0.00204953,"about_ca_system_score_gemma":0.0020274122,"threshold_uncertainty_score":0.24703526},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.034692109436319354,"score_gpt":0.31287011607779475,"score_spread":0.2781780066414754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245159100","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011024163,0.0014271791,0.001366151,0.010435592,0.012292275,0.00010430001,0.0019739498,0.002391579,0.9689066],"genre_scores_gemma":[0.0023287046,0.0006263011,0.0003642514,0.0013602736,0.0017206509,0.000026130343,0.00077767344,0.0004582698,0.9923379],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991068,0.00008270965,0.00003521465,0.00015926352,0.00050929,0.00010667585],"domain_scores_gemma":[0.9979036,0.00028974403,0.00007138593,0.0003960016,0.0008096835,0.0005296341],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010011838,0.00081368716,0.0007178273,0.0024467153,0.0018541533,0.007498992,0.0010872912,0.0031749262,0.85220957],"category_scores_gemma":[0.0031766423,0.00041739515,0.00088986923,0.0019652478,0.0011162327,0.0028315778,0.002772456,0.0026305378,0.78958905],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000307991,0.000054879787,0.00015789235,0.000131059,0.000004536988,0.00006711109,0.000030407204,0.00005170023,0.00051224005,0.0021959923,0.9318059,0.0649574],"study_design_scores_gemma":[0.000008042904,0.000013062293,0.00032887823,0.00008641873,0.0000028104996,0.000081834136,0.000044343167,0.00010998248,0.00029834447,0.0008609406,0.99816126,0.0000039882298],"about_ca_topic_score_codex":0.0019462004,"about_ca_topic_score_gemma":0.002933865,"teacher_disagreement_score":0.85220957,"about_ca_system_score_codex":0.0020011761,"about_ca_system_score_gemma":0.0020166698,"threshold_uncertainty_score":0.21080506},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.035075341246239115,"score_gpt":0.31289117986841986,"score_spread":0.27781583862218073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249993600","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011310581,0.0019543278,0.0014508766,0.011365115,0.014695823,0.00011036866,0.0019877835,0.0021938903,0.9651108],"genre_scores_gemma":[0.0024225663,0.00087756396,0.00039298454,0.0014970993,0.0022368322,0.000028403896,0.00086803635,0.00046443281,0.99121207],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990767,0.000089540496,0.00003652357,0.00016867789,0.0005222754,0.000106260304],"domain_scores_gemma":[0.99785656,0.00032092165,0.00007690647,0.00037904765,0.000819483,0.0005469987],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010097336,0.0008260372,0.0007422146,0.0024555472,0.0017773786,0.007683418,0.0011087438,0.0031534906,0.83961636],"category_scores_gemma":[0.003170584,0.0004092201,0.0008471527,0.002084713,0.0010864426,0.0029111125,0.0027698788,0.0026725421,0.77217203],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030396215,0.0000572349,0.00015753483,0.00015438208,0.000004516426,0.00006783047,0.000031956195,0.000052296837,0.000496122,0.0022647989,0.92538637,0.07129654],"study_design_scores_gemma":[0.000007498227,0.000013097734,0.00033713802,0.00009729146,0.0000026823147,0.00008536936,0.000042708318,0.000102736354,0.00026336496,0.0008674806,0.9981767,0.0000039275556],"about_ca_topic_score_codex":0.0015858223,"about_ca_topic_score_gemma":0.002526174,"teacher_disagreement_score":0.16038364,"about_ca_system_score_codex":0.0018985757,"about_ca_system_score_gemma":0.0019426331,"threshold_uncertainty_score":0.22876781},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025745150644148194,"score_gpt":0.24381764381719603,"score_spread":0.21807249317304783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255294472","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013786608,0.0019830803,0.0020712665,0.011833409,0.017823791,0.000116568444,0.0020292716,0.0028486126,0.95991546],"genre_scores_gemma":[0.0027736842,0.0008064437,0.00053694734,0.0017193388,0.0026884906,0.00003131989,0.0009127665,0.00054108206,0.9899899],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926406,0.00006271556,0.000029483415,0.00013667282,0.0004255235,0.000081467835],"domain_scores_gemma":[0.9980715,0.00026986963,0.000059255763,0.00032148065,0.0007934808,0.00048440762],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009168224,0.0008141835,0.000682062,0.0021009743,0.001563449,0.006928349,0.0010578809,0.0028800033,0.79951507],"category_scores_gemma":[0.0027462635,0.00035477744,0.0007842634,0.0015388516,0.0009602934,0.0028865093,0.002135657,0.0025426769,0.7381491],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038671224,0.00006172063,0.00017558645,0.00012846632,0.0000049291607,0.000087146276,0.000027717686,0.000058193727,0.00063936925,0.002305351,0.9265446,0.06992826],"study_design_scores_gemma":[0.000009739909,0.00001528839,0.00036124894,0.00007831586,0.0000031037773,0.00010699426,0.00003785793,0.00013506562,0.00036045708,0.0010166806,0.99787104,0.000004207877],"about_ca_topic_score_codex":0.0016569945,"about_ca_topic_score_gemma":0.0024239812,"teacher_disagreement_score":0.20048493,"about_ca_system_score_codex":0.0016392877,"about_ca_system_score_gemma":0.0016889796,"threshold_uncertainty_score":0.2859674},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02326956094968936,"score_gpt":0.278226877541892,"score_spread":0.25495731659220267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280605585","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043553833,0.19686328,0.25807765,0.13705115,0.009660791,0.00017485232,0.0007603548,0.0015943488,0.35226366],"genre_scores_gemma":[0.5646145,0.15092964,0.16067952,0.030624159,0.0075647337,0.0002545182,0.0009978142,0.0020149932,0.08232009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950329,0.002629942,0.00029791216,0.0005579403,0.0011865773,0.00029474564],"domain_scores_gemma":[0.9902111,0.005408723,0.0004708362,0.0012300091,0.0021904095,0.00048895576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077903974,0.00045563088,0.0003577058,0.0017709503,0.0015273934,0.0055727013,0.00074582355,0.001128596,0.005477568],"category_scores_gemma":[0.011296156,0.00041579435,0.00043807106,0.0018462393,0.0077901315,0.0084799975,0.0029459668,0.0043654875,0.0017750881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008049486,0.00003016117,0.000582664,0.00028479096,0.000015132586,0.000103505605,0.0018542806,0.0010302879,0.00052000367,0.8380015,0.021628035,0.13586918],"study_design_scores_gemma":[0.000011131347,0.000049376897,0.0006048117,0.00088578527,0.000010051788,0.0002039776,0.0007500662,0.0019028676,0.00079763413,0.1880619,0.8066899,0.00003244138],"about_ca_topic_score_codex":0.0031598194,"about_ca_topic_score_gemma":0.0015845952,"teacher_disagreement_score":0.0077903974,"about_ca_system_score_codex":0.0033018305,"about_ca_system_score_gemma":0.0023655219,"threshold_uncertainty_score":0.0412001},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.05358612368344712,"score_gpt":0.34159100617334537,"score_spread":0.28800488248989825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403810684","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015328112,0.0001974284,0.97484595,0.0013465438,0.000037675018,0.00018016374,0.0001790048,0.00024353011,0.007641632],"genre_scores_gemma":[0.32972503,0.0003061436,0.66584146,0.0005350933,0.00010859433,0.00039875606,0.00064695865,0.00011156136,0.0023263418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926999,0.0028982053,0.00055634364,0.0008181319,0.0023729193,0.00065448496],"domain_scores_gemma":[0.9758197,0.018758163,0.00095414004,0.0016232203,0.0023426816,0.00050202967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008696602,0.0006638292,0.00094925286,0.0024836631,0.0018835085,0.0048447656,0.00422014,0.0019309875,0.0054976135],"category_scores_gemma":[0.032507356,0.0009958944,0.0024347873,0.0025802352,0.0064557316,0.0066436487,0.0076107658,0.0045328126,0.00063452206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045899662,0.000081693535,0.0004439411,0.00013739002,0.000043847827,0.00016092096,0.0006104182,0.07516523,0.0005656434,0.90153044,0.001006518,0.020208184],"study_design_scores_gemma":[0.000018786985,0.000012781211,0.00005130997,0.000051701107,0.000015775511,0.000039715535,0.00011592084,0.21463527,0.00053326256,0.7824397,0.0020710474,0.000014725963],"about_ca_topic_score_codex":0.009514403,"about_ca_topic_score_gemma":0.009578245,"teacher_disagreement_score":0.009514403,"about_ca_system_score_codex":0.003183874,"about_ca_system_score_gemma":0.0031612257,"threshold_uncertainty_score":0.045992553},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.033015599651150904,"score_gpt":0.3339099828072208,"score_spread":0.30089438315606987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406401421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049205,0.0021778343,0.9338766,0.0023883046,0.00019679363,0.00018817995,0.0012871367,0.0051487284,0.0055314125],"genre_scores_gemma":[0.44297376,0.00092231686,0.5471428,0.0008747673,0.00033674555,0.00035481484,0.0022707684,0.0016477386,0.0034762556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9818617,0.005553757,0.0008451371,0.00302314,0.0073124063,0.0014039719],"domain_scores_gemma":[0.90106934,0.07545598,0.004332375,0.01195618,0.0052635623,0.001922421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008375102,0.0017154686,0.0031125753,0.0052179373,0.0021117367,0.0068195607,0.005571343,0.0022599944,0.008991392],"category_scores_gemma":[0.08993904,0.001408297,0.0030978704,0.0046526426,0.0034465508,0.014420718,0.008018382,0.005411328,0.0018440507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012338898,0.00048232323,0.014218102,0.0020374993,0.00041317914,0.0004133137,0.0012860389,0.19585139,0.010041688,0.39609316,0.02431021,0.3536192],"study_design_scores_gemma":[0.000038206294,0.00007735893,0.0005880526,0.0001603252,0.00008946091,0.00022328219,0.00014839711,0.6513817,0.0057825283,0.33673668,0.0047290195,0.000045004963],"about_ca_topic_score_codex":0.0035209733,"about_ca_topic_score_gemma":0.005346392,"teacher_disagreement_score":0.008991392,"about_ca_system_score_codex":0.003674722,"about_ca_system_score_gemma":0.0044199917,"threshold_uncertainty_score":0.04429233},"labels":[],"label_agreement":null}]}