{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2354703,0.035505183,0.6755279,0.009069552,0.00066163385,0.0020904543,0.0000031317256,0.00057097623,0.041100897],"genre_scores_gemma":[0.97126627,0.00045343375,0.0279038,0.00027976025,0.000034988407,0.00003207764,0.00000154608,0.0000067466617,0.000021392769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844366,0.00046670847,0.00028454806,0.000367746,0.00013309743,0.00030426285],"domain_scores_gemma":[0.99826115,0.0011403221,0.000210135,0.00023965267,0.0000510988,0.00009761238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002673694,0.00015749269,0.00023801472,0.00012011571,0.00017327507,0.00016962114,0.00019370108,0.00011147252,0.0000032506105],"category_scores_gemma":[0.0008115504,0.00013104366,0.00002616455,0.00024659807,0.00030954945,0.0007911275,0.00021119817,0.00022018117,0.000003898188],"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.00006927922,0.000112367394,0.0006036485,0.00005446807,0.000015885254,0.00005796632,0.0019108759,0.0000033449594,0.000098573335,0.9020846,8.8671544e-7,0.09498809],"study_design_scores_gemma":[0.0010194525,0.00066569954,0.0011518511,0.000027015547,0.000042830885,0.0011626704,0.0015884006,0.000041186035,0.00010156581,0.9879539,0.005999671,0.00024575775],"about_ca_topic_score_codex":0.00013851906,"about_ca_topic_score_gemma":0.000017077446,"teacher_disagreement_score":0.735796,"about_ca_system_score_codex":0.000013080031,"about_ca_system_score_gemma":0.000043423606,"threshold_uncertainty_score":0.53438056},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012125533,0.0018811985,0.9298158,0.0045588,0.0006768806,0.0029344542,0.0000023376313,0.0006708636,0.047334075],"genre_scores_gemma":[0.6194152,0.000027792992,0.37932453,0.0007675759,0.00014277751,0.00012647956,0.0000051425463,0.000016899985,0.00017357586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968329,0.0009919357,0.00043411733,0.0006743306,0.00039317203,0.00067355006],"domain_scores_gemma":[0.99617857,0.0019336146,0.00040986718,0.00093191594,0.0003273592,0.00021865357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008296142,0.00033619732,0.00037577323,0.00009567721,0.0005029298,0.0007199288,0.0012146779,0.00019991897,0.0000064045403],"category_scores_gemma":[0.0021216725,0.00020872192,0.00012290126,0.00080826844,0.00047434182,0.00084229687,0.0006199978,0.0007369464,0.000018831417],"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.00007232889,0.00046888203,0.0000650465,0.0000707846,0.000058457048,0.000007991532,0.0028118931,0.0000060430903,0.0002354717,0.64445275,0.000024853616,0.35172552],"study_design_scores_gemma":[0.0018227383,0.0037447135,0.0012726097,0.0003313962,0.00084174454,0.003513767,0.0166071,0.0046673045,0.00090927863,0.6503403,0.31371877,0.0022302556],"about_ca_topic_score_codex":0.000018679884,"about_ca_topic_score_gemma":0.000008394013,"teacher_disagreement_score":0.60728973,"about_ca_system_score_codex":0.000016011963,"about_ca_system_score_gemma":0.000088752815,"threshold_uncertainty_score":0.8511433},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013881618,0.0041356166,0.9877658,0.0002783128,0.00030838436,0.0006731539,0.0000011525606,0.0001847757,0.0052646827],"genre_scores_gemma":[0.4689618,0.0002886554,0.5300543,0.00018888697,0.00019606293,0.00016438727,0.000005997433,0.0000161183,0.0001238247],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976026,0.00082284334,0.0003672879,0.00051273225,0.00019153721,0.0005030127],"domain_scores_gemma":[0.9957637,0.003289685,0.00038272468,0.00025914374,0.0002054384,0.00009930693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063538617,0.00022261603,0.00032221214,0.00015643991,0.00022915608,0.00018858997,0.00040305554,0.00013347797,0.000004710006],"category_scores_gemma":[0.0027832426,0.00018673937,0.00007688875,0.0005302646,0.00014925483,0.0018759542,0.00013676618,0.00024048804,0.0000042992024],"study_design_candidate":"design_other","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.00012159429,0.00013192273,0.00018388945,0.00007775964,0.00001222201,0.0000021600422,0.0011766629,0.000012960812,0.00006308957,0.31554127,0.0000066791604,0.6826698],"study_design_scores_gemma":[0.0018652388,0.00250833,0.00015925887,0.00014666551,0.00010908668,0.00032305584,0.0021783519,0.020654803,0.0014825502,0.32284525,0.6470047,0.00072264805],"about_ca_topic_score_codex":0.000017792569,"about_ca_topic_score_gemma":0.000020880108,"teacher_disagreement_score":0.6819472,"about_ca_system_score_codex":0.00003078269,"about_ca_system_score_gemma":0.000049813058,"threshold_uncertainty_score":0.7615011},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010097017,0.026247207,0.43883222,0.0134273125,0.0032485987,0.0012972312,0.000006023841,0.00060728646,0.5062371],"genre_scores_gemma":[0.7376054,0.00034918505,0.23819368,0.0028632972,0.0003934415,0.00005118103,0.0000047009407,0.000033729746,0.02050538],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977495,0.00092570175,0.00035029586,0.0003779687,0.00021692125,0.00037959448],"domain_scores_gemma":[0.9961465,0.0030274913,0.00028580733,0.00039144894,0.000058269965,0.000090474314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004487935,0.00018081442,0.00024969783,0.00012550528,0.00014277999,0.00013946017,0.0003818628,0.000115925766,0.00029787797],"category_scores_gemma":[0.0009218577,0.0001572514,0.000048172424,0.00034017276,0.00009977067,0.0014088823,0.00016697805,0.00035660085,0.00006084861],"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.00060833956,0.0008761821,0.000665976,0.0003374181,0.00015452887,0.00070085435,0.016421532,0.00030757068,0.0007378394,0.37178844,0.023558754,0.5838426],"study_design_scores_gemma":[0.0014952777,0.00057410245,0.000046096444,0.00029076784,0.000087607004,0.00062522094,0.0010904364,0.004453549,0.00096602,0.07317533,0.91648173,0.0007138683],"about_ca_topic_score_codex":0.000016170045,"about_ca_topic_score_gemma":0.0000050048616,"teacher_disagreement_score":0.89292294,"about_ca_system_score_codex":0.000019428624,"about_ca_system_score_gemma":0.000015318283,"threshold_uncertainty_score":0.64125264},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028317524,0.0016638134,0.9821607,0.00054425496,0.0002979279,0.00064220355,4.1254913e-7,0.00018172173,0.014225811],"genre_scores_gemma":[0.64574295,0.000055947166,0.35347325,0.00040284236,0.00008481142,0.000086290514,0.0000012591138,0.000007987086,0.00014468188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984192,0.0004053317,0.0003886872,0.0003338454,0.00013793858,0.0003149454],"domain_scores_gemma":[0.9972494,0.0014946203,0.00040568842,0.00033540558,0.00043951883,0.000075364784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069034738,0.00014971211,0.00023696061,0.00006624723,0.00017625249,0.00008911722,0.0004613305,0.00009684583,0.000006852295],"category_scores_gemma":[0.004483556,0.000112323825,0.000070206755,0.00016742334,0.0001368624,0.00074217404,0.00016939954,0.00010341497,0.0000051839415],"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.00016028639,0.0000724763,0.000053338346,0.00006881302,0.000033351705,0.0000065770746,0.0017085173,3.2127357e-7,0.00013635764,0.7470669,0.00003633468,0.25065672],"study_design_scores_gemma":[0.0005766394,0.0011752431,0.000034940425,0.000017531735,0.000088015964,0.00028403781,0.0020521502,0.00035701535,0.0017861637,0.88731337,0.106015466,0.00029942783],"about_ca_topic_score_codex":0.000024667028,"about_ca_topic_score_gemma":0.0000014933128,"teacher_disagreement_score":0.6454598,"about_ca_system_score_codex":0.000007327535,"about_ca_system_score_gemma":0.00003569953,"threshold_uncertainty_score":0.53675586},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022136135,0.001003668,0.95771456,0.00067512185,0.00069218635,0.0010600502,0.0000010100127,0.00030713744,0.016410153],"genre_scores_gemma":[0.69881517,0.000037201,0.3004388,0.00019288722,0.00011349354,0.00010340246,0.000005377173,0.000009566267,0.0002840987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842554,0.00030168088,0.00029088976,0.00040215117,0.00016432852,0.0004153841],"domain_scores_gemma":[0.99699,0.001860851,0.0003517139,0.00040518452,0.00027209808,0.00012013989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050412216,0.00019090474,0.00024019113,0.00007290127,0.000270231,0.00028387882,0.00051740784,0.00016269529,0.000009115125],"category_scores_gemma":[0.003184022,0.00014565594,0.00009830386,0.00023963895,0.0002183441,0.0014089709,0.0001901031,0.0002917756,0.000009637207],"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.00014050498,0.00018408938,0.000056597088,0.000049878425,0.000018410448,0.000004033173,0.0008314827,4.3955134e-7,0.0018522274,0.6047624,0.000010009303,0.39208993],"study_design_scores_gemma":[0.00097331294,0.0016850706,0.00008963304,0.000043096035,0.00011725036,0.00041347014,0.0012469084,0.0013092627,0.0020521895,0.9026319,0.08901595,0.00042194678],"about_ca_topic_score_codex":0.000008319423,"about_ca_topic_score_gemma":0.000009387642,"teacher_disagreement_score":0.6766791,"about_ca_system_score_codex":0.000011071119,"about_ca_system_score_gemma":0.000051149673,"threshold_uncertainty_score":0.5939677},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10545456,0.0032871559,0.8269292,0.0018792745,0.00032450748,0.002264937,7.903252e-7,0.0003822388,0.05947733],"genre_scores_gemma":[0.9243308,0.000050677456,0.07517866,0.00009216335,0.000034146426,0.00014473444,0.000005450094,0.000007920621,0.00015545895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794716,0.0007775653,0.00028284654,0.00043789207,0.00020085256,0.00035368995],"domain_scores_gemma":[0.9980209,0.0009892159,0.0003273072,0.00036364805,0.00021049978,0.00008841317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025360638,0.0001810824,0.00024361463,0.00008978956,0.00013684924,0.00026175505,0.0003867737,0.00009190808,0.000015027269],"category_scores_gemma":[0.0007133224,0.00012461678,0.000042091415,0.0004391669,0.00027521784,0.0015167099,0.0001490585,0.00022027525,0.000030216801],"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.00018420785,0.0004100859,0.0007962462,0.00003936485,0.000022732074,0.000012165163,0.0020946201,0.000004271251,0.00024291595,0.6211054,0.00000396661,0.37508404],"study_design_scores_gemma":[0.0029410955,0.0048961523,0.0124901,0.0003491075,0.00018575281,0.00071343785,0.014963889,0.0029181808,0.0017766347,0.94735426,0.010123068,0.001288314],"about_ca_topic_score_codex":0.00009863941,"about_ca_topic_score_gemma":0.000013832788,"teacher_disagreement_score":0.8188762,"about_ca_system_score_codex":0.000023496124,"about_ca_system_score_gemma":0.00004720388,"threshold_uncertainty_score":0.5081725},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021452181,0.02962647,0.92416084,0.00072056474,0.00033354305,0.00087165623,9.1144113e-7,0.00041340644,0.022420453],"genre_scores_gemma":[0.8729743,0.00018234493,0.12630184,0.00017413158,0.00015983451,0.00003288687,0.000004274857,0.000012476328,0.00015794241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974947,0.0008233932,0.00039112824,0.0005504954,0.00020281592,0.00053745724],"domain_scores_gemma":[0.997085,0.001850425,0.0004222284,0.0003815815,0.00013573848,0.00012503534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003766489,0.00027237667,0.00033926524,0.00009069207,0.00031362005,0.0003225193,0.00042985173,0.0001634318,0.0000067231904],"category_scores_gemma":[0.0007184548,0.00021726638,0.00006896337,0.00038078337,0.00038976906,0.0006663576,0.00036590802,0.00028220942,0.0000042097518],"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.00010107885,0.00019811602,0.001601396,0.000054479635,0.0000282474,0.000049861716,0.00039438432,0.000051420287,0.00011564015,0.61868554,0.000016311626,0.3787035],"study_design_scores_gemma":[0.0027609114,0.0034482814,0.0051600495,0.0002560006,0.00044800446,0.00259715,0.0027460633,0.009645984,0.0006651934,0.8379268,0.13240331,0.0019422246],"about_ca_topic_score_codex":0.00005990064,"about_ca_topic_score_gemma":0.0000107175,"teacher_disagreement_score":0.8515221,"about_ca_system_score_codex":0.000015714772,"about_ca_system_score_gemma":0.00003899661,"threshold_uncertainty_score":0.8859866},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0110424375,0.0005592517,0.9803291,0.0007364479,0.00003993015,0.0007559055,0.0000046961745,0.00012301859,0.0064091934],"genre_scores_gemma":[0.66886556,0.00006502579,0.3307571,0.00019648168,0.000018281708,0.000025662137,0.000009719033,0.000005817638,0.00005631245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986306,0.00021919707,0.0003277468,0.00032186147,0.00016747127,0.0003331568],"domain_scores_gemma":[0.9978802,0.0009198694,0.0004859722,0.00032491225,0.00029797468,0.000091031216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019894068,0.00018319424,0.00031992336,0.00006910827,0.00016160638,0.000110239234,0.0003531287,0.000092120594,0.0000023018774],"category_scores_gemma":[0.00053761905,0.0001339542,0.00006377524,0.00028749727,0.00028126992,0.00084103656,0.00007098726,0.00014815018,6.67314e-7],"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.00024931665,0.00048226633,0.000050802628,0.000095983705,0.000041528838,0.000006745801,0.0015299743,0.000043263524,0.0008015021,0.8674662,0.0000019457798,0.12923042],"study_design_scores_gemma":[0.0015938999,0.0047498513,0.00013537296,0.00026642994,0.00029279536,0.0004127726,0.0017681743,0.036817502,0.0033598084,0.9464263,0.0035507497,0.0006263899],"about_ca_topic_score_codex":0.0000019574359,"about_ca_topic_score_gemma":6.882073e-7,"teacher_disagreement_score":0.65782315,"about_ca_system_score_codex":0.000009834886,"about_ca_system_score_gemma":0.00012550889,"threshold_uncertainty_score":0.5462494},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3126939,0.013832278,0.65923816,0.00044478505,0.00020987846,0.0013869021,0.0000051816337,0.00029111316,0.011897815],"genre_scores_gemma":[0.8271622,0.00015873698,0.17256732,0.000042964908,0.000023928385,0.000022393771,8.3583615e-7,0.000011508744,0.000010080859],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99807394,0.0012080659,0.0002918148,0.00014271536,0.00010455018,0.000178902],"domain_scores_gemma":[0.98892885,0.010698754,0.00017143204,0.00010518949,0.000043292457,0.00005245439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004479704,0.00014079176,0.00022690176,0.00012795736,0.000039121336,0.000043216674,0.000077059936,0.00008759645,0.000030642583],"category_scores_gemma":[0.0060426756,0.00012640869,0.000019580251,0.00020333327,0.00006755524,0.00059713575,0.000019165598,0.00021310203,0.0000016107603],"study_design_candidate":"design_other","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.0008489597,0.00014919863,0.000035515983,0.0002217663,0.00008958632,0.000013793091,0.017917337,0.0018205368,0.072252125,0.009949676,0.000016309972,0.8966852],"study_design_scores_gemma":[0.002686839,0.0016943812,0.00092029327,0.0010131728,0.0010389927,0.0011722798,0.22894001,0.033472,0.708762,0.013891952,0.004602015,0.0018060931],"about_ca_topic_score_codex":0.000015528582,"about_ca_topic_score_gemma":0.000005623874,"teacher_disagreement_score":0.8948791,"about_ca_system_score_codex":0.000018809133,"about_ca_system_score_gemma":0.000035443387,"threshold_uncertainty_score":0.7234084},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009653869,0.000431237,0.9832374,0.002057549,0.000057850604,0.00024446455,0.0000014658647,0.00006387176,0.004252291],"genre_scores_gemma":[0.7451688,0.000027192487,0.25458667,0.0001853515,0.000011641264,0.000006407611,0.0000018530251,0.000001964298,0.000010111617],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990759,0.0003169816,0.00024583947,0.00014030893,0.00011636068,0.00010464468],"domain_scores_gemma":[0.9984817,0.0009138409,0.00030622268,0.00015449074,0.000109598004,0.000034185257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016254693,0.00006801859,0.00010503509,0.00007684382,0.00006831531,0.000034348734,0.00010814477,0.000030288074,0.00007136279],"category_scores_gemma":[0.00035521275,0.00006142981,0.000031817737,0.00017315717,0.00009201096,0.00063298614,0.000036183097,0.000060636758,0.0000019995346],"study_design_candidate":"design_other","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.000051610088,0.000058006837,0.00013021822,0.000019733332,0.000010751948,7.490373e-7,0.0006038233,0.00008977704,0.0004635085,0.3028919,0.0000022720278,0.69567764],"study_design_scores_gemma":[0.023482747,0.011812025,0.03157512,0.00096885103,0.0016384614,0.001698005,0.0755849,0.087072544,0.2148538,0.2908972,0.25603244,0.0043839156],"about_ca_topic_score_codex":0.000014415755,"about_ca_topic_score_gemma":0.000009157323,"teacher_disagreement_score":0.73551494,"about_ca_system_score_codex":0.000010358266,"about_ca_system_score_gemma":0.000068627356,"threshold_uncertainty_score":0.2505035},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006169232,0.0017620343,0.96756995,0.00056527276,0.0003877122,0.00037548062,4.3661197e-7,0.00032932995,0.022840574],"genre_scores_gemma":[0.6992174,0.000039524017,0.3001001,0.0003206552,0.00015703021,0.000021605769,0.0000028235083,0.000013897151,0.00012702215],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706364,0.001096943,0.00039445978,0.00056735397,0.00030347749,0.0005741104],"domain_scores_gemma":[0.9955725,0.0030144525,0.0004458024,0.00055923517,0.00022758565,0.00018043643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008151505,0.00027347068,0.00035785374,0.00011431853,0.00033943812,0.00032053475,0.0006769043,0.00016150156,0.00002007946],"category_scores_gemma":[0.0034042224,0.00022207158,0.00010596505,0.0004047373,0.00026195968,0.0014362246,0.00039824005,0.00036856846,0.000034520956],"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.00008839485,0.00012776267,0.00013714259,0.00006035323,0.000042925505,0.000012344915,0.0020929573,0.000012910475,0.0003813942,0.48365656,0.0000082306815,0.51337904],"study_design_scores_gemma":[0.0024650476,0.00282045,0.0003289783,0.00033015644,0.0004249663,0.0013415081,0.0048758667,0.016030798,0.0042683724,0.53040814,0.43486974,0.0018360039],"about_ca_topic_score_codex":0.000019050003,"about_ca_topic_score_gemma":0.0000028901916,"teacher_disagreement_score":0.6930481,"about_ca_system_score_codex":0.000019945353,"about_ca_system_score_gemma":0.00004766856,"threshold_uncertainty_score":0.90558165},"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002840779,0.00055213587,0.014563443,0.00063043553,0.8742723,0.0007508134,0.00001215989,0.00026827576,0.10894758],"genre_scores_gemma":[0.0003718351,0.00080981164,0.034886867,0.00010692686,0.96145505,0.00013855714,0.000087657405,0.000039972365,0.0021033143],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99429405,0.0015052662,0.0007824065,0.0012016293,0.0014546481,0.00076200685],"domain_scores_gemma":[0.98780704,0.008219194,0.0014780558,0.0008212465,0.0014228352,0.00025160794],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006518774,0.00068932585,0.000836451,0.00025373045,0.00034035835,0.0012617855,0.0022891725,0.0011513582,0.00031259935],"category_scores_gemma":[0.01620956,0.0005606003,0.00020046071,0.00033330216,0.0004686707,0.0015434589,0.0009277885,0.0017831733,0.00023293882],"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.0003410202,0.0003063042,9.661426e-7,0.000091923604,0.000114477945,0.000027835791,0.0009845032,9.147891e-7,0.000010006215,0.36441246,0.44103816,0.19267143],"study_design_scores_gemma":[0.0006219131,0.0010875781,6.956873e-7,0.0002250123,0.00011254783,0.000027932276,0.00061577104,0.000051650048,0.000023000843,0.07659996,0.9200534,0.0005805203],"about_ca_topic_score_codex":0.00005170527,"about_ca_topic_score_gemma":0.00000672277,"teacher_disagreement_score":0.47901526,"about_ca_system_score_codex":0.000120050376,"about_ca_system_score_gemma":0.0004621762,"threshold_uncertainty_score":0.999775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008074726,0.004449002,0.96754473,0.00027140533,0.00023170389,0.0008581387,5.3719015e-7,0.00014034564,0.018429413],"genre_scores_gemma":[0.5822746,0.00007771058,0.41739976,0.00011130234,0.000022431324,0.000080437356,0.0000012220885,0.0000052005826,0.000027339334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976472,0.0009857331,0.00034209498,0.00043542677,0.00015479435,0.00043470834],"domain_scores_gemma":[0.99331695,0.0058264155,0.00032159797,0.00031328332,0.000135693,0.00008604146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060313195,0.00018931433,0.0003086524,0.0000882634,0.00016412087,0.00018771981,0.00045392112,0.00015156566,0.000007116456],"category_scores_gemma":[0.0071250983,0.00014690576,0.00006856693,0.00041611886,0.00018241737,0.0006593638,0.00011104534,0.00027718514,0.0000034937625],"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.000110263674,0.00026529474,0.00046598536,0.000073841125,0.000017450573,0.0000069537014,0.0020805649,0.000005352369,0.000023408822,0.7730833,0.0000010882816,0.22386646],"study_design_scores_gemma":[0.000406282,0.00072199845,0.000065276436,0.0001243337,0.000028732891,0.00007510544,0.0022698478,0.00024822308,0.00024161545,0.9860529,0.009545353,0.00022036568],"about_ca_topic_score_codex":0.000006881708,"about_ca_topic_score_gemma":0.0000052615874,"teacher_disagreement_score":0.57419986,"about_ca_system_score_codex":0.0000170168,"about_ca_system_score_gemma":0.000068069254,"threshold_uncertainty_score":0.8529923},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026268348,0.0031727282,0.96639156,0.001242838,0.00009902334,0.0007103803,9.999494e-7,0.00011632665,0.0019977877],"genre_scores_gemma":[0.7784219,0.0010165507,0.21984929,0.00039232094,0.000064986256,0.00010475085,0.0000025027396,0.000009114169,0.00013859314],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987384,0.00032016606,0.00019474408,0.0003414788,0.00015036586,0.00025484787],"domain_scores_gemma":[0.9974229,0.0019066236,0.00023321863,0.00028146955,0.00008059647,0.00007520063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023256177,0.00014067319,0.00017095527,0.00005672891,0.00026769153,0.00019036597,0.00018710954,0.00004115126,0.000009052228],"category_scores_gemma":[0.00016732376,0.00011264327,0.000012361261,0.0003425501,0.00016118285,0.0006572531,0.0002522206,0.00012576519,0.0000012005961],"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.0002238533,0.00009734075,0.00064391206,0.000044222495,0.00007238274,0.000053499774,0.0009745325,0.001254553,0.000012225684,0.2599085,0.000036825048,0.7366782],"study_design_scores_gemma":[0.0053580273,0.00445162,0.0034155895,0.00073522987,0.0008542787,0.0016280743,0.0068231365,0.043933872,0.00013123864,0.09667278,0.8341884,0.0018077288],"about_ca_topic_score_codex":0.000036412188,"about_ca_topic_score_gemma":0.000041087354,"teacher_disagreement_score":0.8341516,"about_ca_system_score_codex":0.00001138811,"about_ca_system_score_gemma":0.000017523698,"threshold_uncertainty_score":0.45934594},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31864715,0.16106603,0.22326458,0.11081762,0.0022378291,0.008406085,0.0000025174952,0.00053913996,0.17501906],"genre_scores_gemma":[0.9957966,0.00071217807,0.0027597374,0.00020584732,0.000028685417,0.000027173242,4.0746894e-8,0.000004443108,0.0004652617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978171,0.0014091096,0.00021641354,0.00017915551,0.00017362375,0.00020462098],"domain_scores_gemma":[0.99565357,0.0034207273,0.00034754054,0.0004412555,0.00010930492,0.000027573902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005000553,0.00011545778,0.00017130886,0.000012865744,0.0005366635,0.00013903782,0.0006707188,0.00005296443,0.0000031753696],"category_scores_gemma":[0.0029173065,0.0000427904,0.000048848935,0.00019810007,0.0016452563,0.00033876393,0.0004997678,0.00020447571,0.0000018830531],"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.00019702532,0.00006727378,0.00015524922,0.000044557375,0.00003993259,0.0000016904266,0.0074540917,0.000003958244,0.000076973105,0.88774997,0.000021295255,0.10418799],"study_design_scores_gemma":[0.0028940698,0.001022585,0.0007165351,0.00024966177,0.00050202035,0.0011964921,0.009258116,0.021877278,0.0034684956,0.87019503,0.088028625,0.00059108797],"about_ca_topic_score_codex":0.000009524386,"about_ca_topic_score_gemma":0.000004057089,"teacher_disagreement_score":0.6771495,"about_ca_system_score_codex":0.0000040649697,"about_ca_system_score_gemma":0.000015960293,"threshold_uncertainty_score":0.6062015},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008034783,0.044410814,0.8961394,0.005766044,0.0013164998,0.0018805346,0.000012935869,0.000381974,0.04205702],"genre_scores_gemma":[0.9905324,0.00040668505,0.008321623,0.00008179581,0.000066916524,0.000028629402,0.0000030709887,0.00000791855,0.00055096037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99757445,0.0009959445,0.00035733072,0.0004998312,0.0002584578,0.00031401086],"domain_scores_gemma":[0.99612945,0.0025747856,0.00031382052,0.0007579274,0.00013096812,0.00009306703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009440047,0.00015705296,0.0002870181,0.0000977805,0.00010120394,0.00019110572,0.0006247714,0.00010206935,0.0000061717647],"category_scores_gemma":[0.0029513321,0.00009846493,0.00001983799,0.00020725287,0.00025047574,0.0014847458,0.0006003919,0.0001151579,0.000007593143],"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.00006152227,0.00006257446,0.00079324236,0.00011230504,0.000020410127,0.00003932783,0.0008664022,9.451073e-8,0.000087483066,0.68710697,0.000027020089,0.31082264],"study_design_scores_gemma":[0.0033444948,0.0013561108,0.0011910168,0.00026460603,0.00016836915,0.0024025347,0.009815595,0.00071660784,0.00013841056,0.30565402,0.67388123,0.0010669745],"about_ca_topic_score_codex":0.00011610062,"about_ca_topic_score_gemma":0.000011118425,"teacher_disagreement_score":0.98249763,"about_ca_system_score_codex":0.000014253212,"about_ca_system_score_gemma":0.000040281688,"threshold_uncertainty_score":0.40152833},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023263706,0.00901609,0.38402706,0.0014782785,0.00075733656,0.0004463969,8.5731773e-7,0.00049670856,0.5805136],"genre_scores_gemma":[0.93424714,0.000052604686,0.065252945,0.00018610574,0.000077335026,0.000008320333,7.401818e-7,0.000005306927,0.00016950874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878514,0.00034747453,0.00019498577,0.0002510105,0.00017711126,0.00024430582],"domain_scores_gemma":[0.99749655,0.0016644151,0.00022720624,0.00030641168,0.00015492187,0.00015049557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005306801,0.00011934993,0.00016495804,0.000049892038,0.00009175191,0.00013256914,0.0004135053,0.00006908301,0.000008201406],"category_scores_gemma":[0.003490038,0.00009218481,0.000039146562,0.00018397141,0.00012159436,0.0009956666,0.00022856914,0.00016801682,0.0000325163],"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.000090719164,0.0001049625,0.0000796286,0.000021650256,0.000017756189,0.000027902195,0.002818306,0.0000030123758,0.000113531125,0.7403656,0.000041160718,0.25631577],"study_design_scores_gemma":[0.0012524432,0.0010126316,0.0010034004,0.00008368936,0.0000840477,0.0007636251,0.004378193,0.00026389962,0.0015642707,0.72281504,0.26618373,0.0005950312],"about_ca_topic_score_codex":0.000015222989,"about_ca_topic_score_gemma":0.0000011465019,"teacher_disagreement_score":0.91098344,"about_ca_system_score_codex":0.000013445042,"about_ca_system_score_gemma":0.000061499,"threshold_uncertainty_score":0.41781536},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033633433,0.005867482,0.6709941,0.0012943891,0.0016800667,0.0013686296,0.0000074098634,0.00036153334,0.28479296],"genre_scores_gemma":[0.9418387,0.000114486,0.056706753,0.00016486719,0.00019172337,0.00005771548,0.0000028914278,0.000012140888,0.0009107224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99824995,0.00051483535,0.0002744175,0.00042500978,0.00012948381,0.00040629943],"domain_scores_gemma":[0.9950375,0.0033723577,0.00045328867,0.0007376563,0.0002638125,0.00013536308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051047397,0.0002088943,0.00029241183,0.00006356534,0.0010367851,0.0006233546,0.0010602335,0.00008232352,0.000019591544],"category_scores_gemma":[0.0059431395,0.00016601903,0.00010244701,0.00007424824,0.00033284977,0.0019863073,0.0005072877,0.00018592805,0.000026438498],"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.00024152845,0.00022146881,0.00014243145,0.00008081319,0.000046545818,0.000017797573,0.0009958458,0.0000013263113,0.00012270086,0.71524656,0.00010669264,0.28277627],"study_design_scores_gemma":[0.0034903397,0.0032011247,0.00057697255,0.0002257375,0.00035194284,0.0008065033,0.0024423928,0.0032660118,0.011836339,0.2819418,0.69057983,0.0012809978],"about_ca_topic_score_codex":0.000017442053,"about_ca_topic_score_gemma":0.000006880715,"teacher_disagreement_score":0.9082053,"about_ca_system_score_codex":0.000017413427,"about_ca_system_score_gemma":0.00010238865,"threshold_uncertainty_score":0.79742175},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31100443,0.018448588,0.51338303,0.0012801719,0.00048895733,0.0017620141,0.0000015514933,0.00063457567,0.15299669],"genre_scores_gemma":[0.8467534,0.00043786576,0.1526505,0.000054890195,0.000025340505,0.000011466677,0.0000010778699,0.0000057474776,0.00005972158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849313,0.00055956765,0.00025183163,0.0003482669,0.000116635165,0.00023058178],"domain_scores_gemma":[0.99790436,0.0013034645,0.0003651165,0.00022279017,0.00010627013,0.0000980101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002831851,0.0001401747,0.00019300455,0.000055322325,0.00019909897,0.00014246715,0.0001544428,0.00008436918,0.000004296836],"category_scores_gemma":[0.0015573598,0.0001115691,0.000025786301,0.00016881939,0.00042766135,0.00093075813,0.00024007536,0.00017810163,0.0000015387113],"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.000061001614,0.000063957355,0.0017051494,0.000049124978,0.000028001756,0.00002765547,0.008124858,6.926162e-8,0.00014723273,0.56330407,9.940403e-7,0.4264879],"study_design_scores_gemma":[0.001736807,0.001864424,0.002441478,0.0004408512,0.00035190393,0.0031335808,0.01571382,0.0024215064,0.0039938996,0.9609499,0.0061447294,0.00080712704],"about_ca_topic_score_codex":0.000023536795,"about_ca_topic_score_gemma":0.0000023056912,"teacher_disagreement_score":0.53574896,"about_ca_system_score_codex":0.0000055179416,"about_ca_system_score_gemma":0.000022183533,"threshold_uncertainty_score":0.45496556},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24586877,0.0033197238,0.72087497,0.001111061,0.0003379782,0.00078904594,0.0000015213872,0.00019559554,0.027501335],"genre_scores_gemma":[0.82108885,0.000013206017,0.17849858,0.0002643738,0.000020790758,0.0000146214015,0.000002334296,0.0000069703347,0.000090301175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803185,0.0007538069,0.00028474384,0.00035098082,0.00022443083,0.00035417834],"domain_scores_gemma":[0.9958709,0.0034275868,0.00026927303,0.00030971112,0.00004909226,0.0000734618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006518561,0.000148119,0.00022428427,0.00012108366,0.00009403794,0.00013082467,0.00039876095,0.00009892987,0.00001900519],"category_scores_gemma":[0.0003992153,0.00013203254,0.00003630824,0.0002496791,0.00005631079,0.00088817574,0.0002076419,0.00037050617,0.00002060483],"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.0007130216,0.00016491432,0.007151572,0.000121544515,0.000047078207,0.00021422384,0.010621882,0.0030339493,0.00090197526,0.77393544,0.00001535134,0.20307904],"study_design_scores_gemma":[0.011367161,0.0070418357,0.008959646,0.0032850998,0.00024463068,0.0038449208,0.052448295,0.02178314,0.004464419,0.53607804,0.3464372,0.004045654],"about_ca_topic_score_codex":0.000019341634,"about_ca_topic_score_gemma":5.962787e-7,"teacher_disagreement_score":0.57522005,"about_ca_system_score_codex":0.000021896367,"about_ca_system_score_gemma":0.00005366557,"threshold_uncertainty_score":0.53841305},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04476538,0.0065205097,0.88770044,0.0018990481,0.00073948444,0.00035231173,0.000002191422,0.00016651658,0.057854127],"genre_scores_gemma":[0.9616517,0.00023603466,0.037810266,0.00012976854,0.00004635366,0.000012865697,0.0000020648517,0.0000046487007,0.000106342115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982585,0.0008720512,0.0002633564,0.00023510853,0.00017238672,0.00019864015],"domain_scores_gemma":[0.995612,0.003432293,0.00028629374,0.00038020354,0.00023997317,0.000049193066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032627003,0.000110509194,0.00019413674,0.000033325017,0.00021445983,0.00011146016,0.0003732821,0.00003904953,0.00001090969],"category_scores_gemma":[0.004014732,0.00007439628,0.000061364706,0.000354696,0.0002425537,0.0007652422,0.0003368063,0.0001807314,0.0000042853158],"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.000036852467,0.0001652067,0.000077618526,0.00005631386,0.000029736833,0.000032066826,0.0027590578,0.000008247606,0.00030897337,0.8499059,0.0000059121135,0.1466141],"study_design_scores_gemma":[0.00080807443,0.0010288203,0.00089038356,0.00021491108,0.00021150948,0.00086186,0.016468288,0.0006007338,0.013447721,0.91825694,0.046687935,0.0005228055],"about_ca_topic_score_codex":0.000010047498,"about_ca_topic_score_gemma":0.0000028546842,"teacher_disagreement_score":0.91688627,"about_ca_system_score_codex":0.00001010495,"about_ca_system_score_gemma":0.00008003926,"threshold_uncertainty_score":0.4806299},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017932486,0.002612885,0.96499294,0.0033161864,0.00011697166,0.0005947176,0.0000018477132,0.00043704748,0.009994945],"genre_scores_gemma":[0.7087453,0.000039089446,0.29033324,0.00071533106,0.00010009878,0.000022975039,0.0000031517757,0.000012922866,0.000027910459],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770236,0.0007037559,0.00030663115,0.00055399636,0.00027313235,0.0004601521],"domain_scores_gemma":[0.99729663,0.0016333058,0.00035309402,0.00031657238,0.000164029,0.000236355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003161098,0.0002495941,0.00033004768,0.000056290508,0.00024038219,0.00028783118,0.0005654435,0.00007086529,0.000013069329],"category_scores_gemma":[0.0021826914,0.00018573865,0.000068417925,0.00044380268,0.0002477286,0.0012474214,0.00023741007,0.00035582858,0.0000118705975],"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.0004937462,0.00014763883,0.0001510765,0.00014171576,0.00009199034,0.00016692308,0.009287698,0.000036467747,0.00035408334,0.44215748,0.000013543716,0.5469576],"study_design_scores_gemma":[0.009780251,0.018422453,0.00036381846,0.0010445216,0.0013307991,0.006867608,0.054401673,0.024638461,0.016716463,0.19571717,0.6655933,0.00512343],"about_ca_topic_score_codex":0.0000066571765,"about_ca_topic_score_gemma":0.000001129051,"teacher_disagreement_score":0.6908128,"about_ca_system_score_codex":0.000012690155,"about_ca_system_score_gemma":0.000087145556,"threshold_uncertainty_score":0.75742024},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005211781,0.00054968416,0.9926301,0.00048417036,0.000030690917,0.00039804055,0.000006829845,0.00005244012,0.00063626666],"genre_scores_gemma":[0.3368053,0.00003066596,0.6628402,0.00016776563,0.00005125802,0.0000677588,0.000024500287,0.0000038980565,0.000008660676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910176,0.00028659453,0.00017295446,0.00023621066,0.00009389369,0.00010857535],"domain_scores_gemma":[0.99878484,0.0008193642,0.00017463027,0.00010471211,0.00005217891,0.000064285385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069672044,0.00007791083,0.00012050504,0.000028963465,0.000119361655,0.000054010565,0.000080232654,0.000033806627,7.3871814e-7],"category_scores_gemma":[0.0011307318,0.000065586115,0.000018782888,0.00009555345,0.000096614225,0.0009449798,0.00009275349,0.00006577677,2.5583634e-7],"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.00044240354,0.00005453442,0.0000020293012,0.00011222366,0.000011290672,0.0000034946775,0.0040154294,0.000001932801,0.0033266584,0.81586224,0.0000039891456,0.17616375],"study_design_scores_gemma":[0.017349854,0.014779836,0.0006348654,0.00051050814,0.00065045897,0.0019296263,0.08695577,0.100780666,0.032721926,0.29968292,0.4409498,0.003053761],"about_ca_topic_score_codex":0.0000027290605,"about_ca_topic_score_gemma":5.372176e-8,"teacher_disagreement_score":0.5161793,"about_ca_system_score_codex":0.000004259082,"about_ca_system_score_gemma":0.000015136098,"threshold_uncertainty_score":0.26745242},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15453087,0.0018529276,0.0014743309,0.011572578,0.00056574756,0.00052233273,0.000011995122,0.000067803696,0.82940143],"genre_scores_gemma":[0.9547737,0.00005918975,0.0022773275,0.00075100776,0.00028502094,0.000009358293,5.830972e-7,0.0000056928816,0.041838083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885696,0.00044821677,0.00014180732,0.00014926174,0.00015747447,0.00024628002],"domain_scores_gemma":[0.9982661,0.0013033922,0.0001505473,0.00010615634,0.000057202284,0.00011657977],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003362397,0.00007360281,0.00013733575,0.000012329294,0.00021969639,0.00009043879,0.00009162536,0.00010047225,0.0031192938],"category_scores_gemma":[0.0028473767,0.000059544847,0.000021789238,0.00003984955,0.0005197341,0.0004255217,0.00004689022,0.00016992509,0.00033398496],"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.00019053894,0.00008115144,0.002034472,0.00005269657,0.000023945026,0.000008912071,0.005267866,8.897405e-8,0.00037797165,0.93155515,0.0016773613,0.05872983],"study_design_scores_gemma":[0.000112021895,0.00005534922,0.00096724526,0.000014938274,0.000027215947,0.000014819705,0.0015959798,0.0000020086936,0.000033532968,0.017586313,0.9795013,0.00008928517],"about_ca_topic_score_codex":0.0023708125,"about_ca_topic_score_gemma":0.00006675958,"teacher_disagreement_score":0.9778239,"about_ca_system_score_codex":0.000007470752,"about_ca_system_score_gemma":0.000028222872,"threshold_uncertainty_score":0.997792},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010959494,0.00915404,0.0017604963,0.0022604296,0.00041481823,0.00022483533,0.00004208511,0.000029964509,0.97515386],"genre_scores_gemma":[0.63334364,0.0007190333,0.006309302,0.001998429,0.00010955763,0.000008594133,0.0000051773013,0.000010313494,0.35749596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99917763,0.00004532822,0.00028377707,0.00028403013,0.000019581576,0.00018964744],"domain_scores_gemma":[0.9992307,0.00026451182,0.0002839177,0.00014951227,0.00002147766,0.000049926766],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0021841582,0.00010281944,0.0002668333,0.00006481253,0.000116845615,0.00009311559,0.000083821506,0.00005300958,0.015267101],"category_scores_gemma":[0.0004430887,0.00010246127,0.00003596435,0.000045949033,0.00016966053,0.0004789219,0.00006192156,0.000075354445,0.008050149],"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.0009804489,0.00038055814,0.00492203,0.00010753653,0.00027353046,0.000017750646,0.0070669604,0.00001584826,0.000028326727,0.7796635,0.09585141,0.11069209],"study_design_scores_gemma":[0.00029591145,0.00014693596,0.001067213,0.000009864824,0.000025677253,0.000018349408,0.0017837844,0.00004092535,0.000010459727,0.04226097,0.9541809,0.00015898973],"about_ca_topic_score_codex":0.000019204772,"about_ca_topic_score_gemma":1.4961168e-7,"teacher_disagreement_score":0.85832953,"about_ca_system_score_codex":0.000012010661,"about_ca_system_score_gemma":0.0000036102974,"threshold_uncertainty_score":0.9927222},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04509168,0.0032640991,0.0010796107,0.0013199671,0.0012199028,0.0002450773,0.00006522971,0.000030881143,0.9476836],"genre_scores_gemma":[0.63624156,0.00031476168,0.008539824,0.0008147855,0.00014988873,0.000017479273,0.0000050630906,0.00001556562,0.3539011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991841,0.000036745936,0.00027720135,0.00029372674,0.000019595067,0.00018868408],"domain_scores_gemma":[0.99904937,0.00039186346,0.00029605953,0.00018018701,0.000025890944,0.000056613935],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002685774,0.00010342274,0.00025304733,0.000064390166,0.00012871207,0.00010314218,0.00009758847,0.0000713441,0.032483622],"category_scores_gemma":[0.00071997615,0.00010203676,0.000035521818,0.000040876126,0.00030888678,0.00047303527,0.000120432596,0.00014106656,0.011093425],"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.00066363526,0.0002926191,0.015709693,0.00016133388,0.00032286966,0.000012626482,0.0063764555,0.00000431729,0.00013667325,0.8646359,0.062072463,0.049611453],"study_design_scores_gemma":[0.0002515608,0.00005777408,0.0006987247,0.0000050678846,0.000022485661,0.000021529722,0.0015319864,0.000035702393,0.000019852345,0.02155011,0.9756598,0.00014541406],"about_ca_topic_score_codex":0.00004365422,"about_ca_topic_score_gemma":0.0000010578765,"teacher_disagreement_score":0.91358733,"about_ca_system_score_codex":0.0000062292243,"about_ca_system_score_gemma":0.000004595501,"threshold_uncertainty_score":0.98967654},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08333913,0.0034560522,0.0037827317,0.0033391349,0.00030423736,0.0005025194,0.000008849282,0.00006341078,0.90520394],"genre_scores_gemma":[0.98055303,0.00011331572,0.0028868522,0.00077388994,0.00013058074,0.000009493302,3.4089766e-7,0.0000054902684,0.015527012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868214,0.0006320563,0.00014923878,0.00014675336,0.00013987067,0.00024993764],"domain_scores_gemma":[0.9988479,0.00074587966,0.00015877219,0.00009423271,0.00004559637,0.00010763586],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028649846,0.00007411742,0.00014207748,0.000012755118,0.00018493837,0.000045798424,0.00008826425,0.00007582202,0.0015851607],"category_scores_gemma":[0.0013239487,0.00005998943,0.000022163045,0.000040277853,0.00045073914,0.00045326308,0.00004776762,0.000083305604,0.00018698077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001694822,0.00008851701,0.007075773,0.000050122442,0.00002302622,0.0000123094815,0.016751356,3.4157555e-8,0.000022562817,0.9492517,0.0005891431,0.025965981],"study_design_scores_gemma":[0.00013073045,0.00008932104,0.0033697863,0.00003244627,0.00004424438,0.000015500724,0.0053602746,0.0000011334578,0.000034601453,0.03215947,0.9586508,0.00011169129],"about_ca_topic_score_codex":0.007983348,"about_ca_topic_score_gemma":0.000059433478,"teacher_disagreement_score":0.95806164,"about_ca_system_score_codex":0.000011959846,"about_ca_system_score_gemma":0.000022021766,"threshold_uncertainty_score":0.99932754},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03184924,0.0014492323,0.62592304,0.0028903931,0.0005888373,0.0006017241,0.0000024291407,0.00018374124,0.3365114],"genre_scores_gemma":[0.9204065,0.000046607096,0.072145864,0.002898976,0.00004937356,0.000011571485,0.0000010148786,0.0000043235573,0.0044357395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990304,0.0002739539,0.00022432684,0.00016865553,0.00013645626,0.00016622312],"domain_scores_gemma":[0.99911714,0.00031114975,0.00022182199,0.00023287437,0.000046198915,0.000070840884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022501163,0.00008543532,0.00012421541,0.00005185782,0.00010559769,0.00018574035,0.0003150177,0.000044191645,0.00045455442],"category_scores_gemma":[0.0001565591,0.000063808795,0.000019130111,0.00010599205,0.0001412334,0.0069269175,0.00019692494,0.00006926643,0.0004372086],"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.00026261856,0.00018893079,0.012966198,0.00020420033,0.000056830424,0.000028938122,0.09349451,0.0000027911624,0.0001823069,0.5639616,0.0041733435,0.32447767],"study_design_scores_gemma":[0.0005015637,0.0006153567,0.0038373184,0.0000670638,0.00002247289,0.0005701085,0.011485892,0.0012040847,0.0011782371,0.02987553,0.9502132,0.0004291703],"about_ca_topic_score_codex":0.000029548637,"about_ca_topic_score_gemma":1.1442622e-7,"teacher_disagreement_score":0.94603986,"about_ca_system_score_codex":0.0000031043323,"about_ca_system_score_gemma":0.000017726356,"threshold_uncertainty_score":0.5619578},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08409477,0.0034740875,0.0038126765,0.0033417726,0.00030636735,0.0005055086,0.000009018938,0.00006386644,0.90439194],"genre_scores_gemma":[0.9807893,0.000113356924,0.002884472,0.00077247946,0.00013040235,0.000009471143,3.433105e-7,0.000005482757,0.01529468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868274,0.0006314841,0.00014924018,0.00014673137,0.0001398615,0.00024991774],"domain_scores_gemma":[0.9988474,0.000746725,0.00015877577,0.000094248615,0.000045210974,0.00010761875],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028634104,0.000074109055,0.00014205414,0.000012755903,0.0001849622,0.000045796372,0.000088290326,0.00007582215,0.0015991355],"category_scores_gemma":[0.0013184741,0.00005998553,0.00002216167,0.00004026228,0.0004507091,0.0004532234,0.000047762933,0.00008328912,0.00018785306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017206284,0.00008844933,0.00714817,0.000050312257,0.000023119384,0.000012366078,0.016778946,3.4361513e-8,0.000022518432,0.9490608,0.0005917864,0.026051424],"study_design_scores_gemma":[0.00013096433,0.00009071059,0.0033432574,0.000032496042,0.000044304168,0.00001553831,0.0053582545,0.0000011507917,0.000034639987,0.032217547,0.9586193,0.00011185556],"about_ca_topic_score_codex":0.007828519,"about_ca_topic_score_gemma":0.000058181908,"teacher_disagreement_score":0.9580275,"about_ca_system_score_codex":0.000011972855,"about_ca_system_score_gemma":0.000021992731,"threshold_uncertainty_score":0.99931353},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08407779,0.0034513471,0.0037755973,0.0033723267,0.00030694882,0.00050630356,0.000009274563,0.00006401705,0.9044364],"genre_scores_gemma":[0.9804023,0.000112362555,0.0029327646,0.0007766426,0.00013096466,0.00000970904,3.5117975e-7,0.0000055158525,0.015629426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99868214,0.0006321855,0.00014911711,0.00014678085,0.00013984069,0.000249907],"domain_scores_gemma":[0.9988416,0.0007520363,0.00015872177,0.00009434139,0.000045674326,0.00010762162],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028623878,0.000074114425,0.00014200508,0.0000127541825,0.00018488441,0.000045675795,0.00008828062,0.00007582218,0.0016687136],"category_scores_gemma":[0.0013379216,0.000059989477,0.000022161359,0.00004028278,0.00045059377,0.00045280054,0.000047779547,0.00008330912,0.00018973852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017156238,0.00008967284,0.0072208475,0.000050541777,0.000023459279,0.000012341283,0.016993294,3.533003e-8,0.000023134695,0.9487341,0.0006331439,0.026047856],"study_design_scores_gemma":[0.00012902971,0.0000888475,0.0033311837,0.00003232814,0.00004415549,0.000015446916,0.005341303,0.0000011392575,0.000034447043,0.0316464,0.95922446,0.00011127064],"about_ca_topic_score_codex":0.0078099263,"about_ca_topic_score_gemma":0.00005754026,"teacher_disagreement_score":0.9585913,"about_ca_system_score_codex":0.000011971681,"about_ca_system_score_gemma":0.000022064844,"threshold_uncertainty_score":0.9992439},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043375906,0.0032197705,0.0010010576,0.0013014028,0.0012001322,0.00023789928,0.00006311324,0.000029870445,0.94957083],"genre_scores_gemma":[0.6170829,0.00032268584,0.008684049,0.0008336812,0.00015506646,0.000017868775,0.0000051916854,0.000015632886,0.37288293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991943,0.000036287754,0.00027382714,0.00029006822,0.000019254123,0.00018623915],"domain_scores_gemma":[0.99906296,0.00038487316,0.0002931062,0.0001778362,0.000025476116,0.000055734163],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0026882114,0.00010172834,0.000249717,0.000063396306,0.0001283082,0.000102055004,0.00009615656,0.00006919043,0.033108275],"category_scores_gemma":[0.00070947374,0.00010046365,0.000034934747,0.00004019006,0.00030500215,0.00046832234,0.00011893597,0.00013710436,0.011281918],"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.00065944943,0.00029006286,0.014893816,0.00016039998,0.00032081548,0.000012758499,0.0062861145,0.0000044821413,0.00012772581,0.8614612,0.06591249,0.04987067],"study_design_scores_gemma":[0.0002469818,0.000056521312,0.00066801434,0.0000049193072,0.000022320068,0.000021402368,0.001492295,0.000035799138,0.000018816268,0.021148989,0.97614187,0.00014208718],"about_ca_topic_score_codex":0.00004335267,"about_ca_topic_score_gemma":0.0000010340959,"teacher_disagreement_score":0.9102294,"about_ca_system_score_codex":0.0000061412047,"about_ca_system_score_gemma":0.000004517753,"threshold_uncertainty_score":0.9894879},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.212824,0.042954534,0.6493171,0.0045235474,0.0019492967,0.004212236,0.000013085791,0.00077620265,0.08343004],"genre_scores_gemma":[0.98073584,0.0000528652,0.018879093,0.00017483639,0.000019516205,0.000039705355,0.0000015540579,0.0000053530334,0.00009123213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815345,0.00090585306,0.00025135383,0.00026723993,0.00022154873,0.00020058268],"domain_scores_gemma":[0.9978527,0.001394744,0.00036769264,0.00027389766,0.000057107758,0.00005389036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050162193,0.00009517041,0.0002120608,0.00007138565,0.00016287826,0.00005120061,0.00033668493,0.000043712254,0.000013283493],"category_scores_gemma":[0.00067499944,0.000086780754,0.00003670726,0.00024210603,0.00019269355,0.00039185156,0.0005181984,0.00018969207,0.000001017904],"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.00010902484,0.00010182989,0.00015897884,0.000045326255,0.00002740046,0.00001909813,0.0026769338,0.0000036303431,0.00017173107,0.6760435,0.000008639822,0.3206339],"study_design_scores_gemma":[0.0010093903,0.0031549057,0.0006106451,0.0000072316625,0.00011326043,0.0010385008,0.008361899,0.00026784226,0.0004441296,0.80025995,0.18434213,0.00039008795],"about_ca_topic_score_codex":0.000025871988,"about_ca_topic_score_gemma":7.643512e-7,"teacher_disagreement_score":0.76791185,"about_ca_system_score_codex":0.000008429086,"about_ca_system_score_gemma":0.000036038797,"threshold_uncertainty_score":0.35388166},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005368618,0.0072337654,0.92112106,0.0017293426,0.00057250453,0.00077019376,0.000008179979,0.00019724578,0.06299909],"genre_scores_gemma":[0.97688234,0.00012131281,0.022326631,0.00014545061,0.00008147443,0.00006675212,0.000003197388,0.000009161635,0.00036369765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867743,0.00048896216,0.00024064719,0.00027391827,0.000110230845,0.00020881371],"domain_scores_gemma":[0.9791717,0.020137878,0.00017279247,0.00029895976,0.00017414683,0.000044552406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003566276,0.00012910276,0.0001790085,0.00007875188,0.00024889765,0.00020043508,0.00040504592,0.000039388076,0.000021086016],"category_scores_gemma":[0.00461995,0.00008253881,0.00009590036,0.00022393026,0.00021884505,0.00052678696,0.00015791187,0.00015214144,0.0000113986935],"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.00006179199,0.00010883853,0.0000040196887,0.00012150369,0.00005589883,0.0000039916476,0.0028368398,0.0000060640086,0.00029768285,0.85627604,0.00015833568,0.14006898],"study_design_scores_gemma":[0.00045795957,0.0014108302,0.000023499499,0.0004930122,0.00024278455,0.00017554552,0.0024840692,0.019144436,0.0051449984,0.6094537,0.36060748,0.00036171902],"about_ca_topic_score_codex":0.000004667952,"about_ca_topic_score_gemma":0.0000016323244,"teacher_disagreement_score":0.9715137,"about_ca_system_score_codex":0.000013575093,"about_ca_system_score_gemma":0.0000952749,"threshold_uncertainty_score":0.5530845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038812575,0.00127552,0.9680239,0.0021975706,0.0002196368,0.000105248655,0.0000016714608,0.00021359274,0.02408161],"genre_scores_gemma":[0.92009556,0.000057371293,0.079279326,0.00027687263,0.000032743294,0.000008678579,0.0000036327026,0.0000056884614,0.0002401177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893904,0.0003189091,0.00014855762,0.00028017856,0.00016613724,0.00014715876],"domain_scores_gemma":[0.99690604,0.0026694662,0.00008820849,0.00025938655,0.000034292112,0.000042590706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037222763,0.000089533394,0.000091806294,0.00007191816,0.000115801646,0.000322939,0.000227035,0.00004499543,0.0000074096215],"category_scores_gemma":[0.0014961892,0.000070479626,0.000027678978,0.00016529094,0.00006642007,0.000803737,0.00008917894,0.00021752139,0.000016634598],"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.0000986894,0.00004590618,0.0000021737735,0.000040180694,0.000011178157,0.000013206991,0.00060826703,0.00012005052,0.0002728272,0.7691452,0.000038303966,0.22960404],"study_design_scores_gemma":[0.0002096531,0.00076177577,0.000027855875,0.00021058378,0.00006960414,0.00019156553,0.0004943125,0.3623079,0.00015980628,0.5147851,0.120490104,0.00029169914],"about_ca_topic_score_codex":0.0000037628542,"about_ca_topic_score_gemma":2.0058036e-7,"teacher_disagreement_score":0.9162143,"about_ca_system_score_codex":0.000014186896,"about_ca_system_score_gemma":0.000040668245,"threshold_uncertainty_score":0.31141084},"labels":[],"label_agreement":null}]}