{"meta":{"query_hash":"b2a3274ecdc5","filters":{"venue":"The Journal of Logic Programming"},"cohort_total":3,"direct_labels_cover":0,"predictions_cover":3,"exported":3,"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/b2a3274ecdc5","api":"https://metacan.xera.ac/api/v1/cohort?venue=The+Journal+of+Logic+Programming"},"results":[{"id":"W2016680799","doi":"10.1016/s0743-1066(99)00002-3","title":"Ultrametric spaces and logic programming","year":2000,"lang":"en","type":"article","venue":"The Journal of Logic Programming","topic":"Fixed Point Theorems Analysis","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Ultrametric space; Mathematics; Fixed-point theorem; Generalization; Metric space; Fixed point; Least fixed point; Discrete mathematics; Point (geometry); Brouwer fixed-point theorem; Pure mathematics; Algebra over a field; Schauder fixed point theorem; Mathematical analysis","score_opus":0.038630596306972596,"score_gpt":0.3020598992817101,"score_spread":0.26342930297473754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016680799","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.98195255,0.004582429,0.008646678,0.0019997365,0.00011489231,0.00050767354,0.0000010771092,0.00011677299,0.0020781788],"genre_scores_gemma":[0.8839594,0.0005292425,0.11469504,0.00012290302,0.00021442097,0.000005480628,5.271739e-7,0.000031786058,0.00044115566],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977439,0.00033156775,0.00076329656,0.0001615639,0.0005212164,0.00047847562],"domain_scores_gemma":[0.9975106,0.0011476505,0.00069097156,0.00032791856,0.00017343907,0.00014940048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003767856,0.00025172622,0.0005391878,0.00027689655,0.00025459274,0.00020157348,0.0004999785,0.00010993867,0.00025171775],"category_scores_gemma":[0.000987568,0.0001406357,0.00023540598,0.0009422773,0.00028547074,0.00022394992,0.000057492154,0.0005502286,0.00001768488],"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.00015010418,0.0003212209,0.000951481,0.00010713259,0.00038570253,0.00009317032,0.0026465622,0.00007058652,0.0002698052,0.027069699,0.0002814031,0.96765316],"study_design_scores_gemma":[0.0022566032,0.002644923,0.001129613,0.00052868895,0.0027815497,0.0057946253,0.008601351,0.00059332175,0.0009959871,0.91964364,0.05397959,0.0010501324],"about_ca_topic_score_codex":0.00003054776,"about_ca_topic_score_gemma":0.000014717088,"teacher_disagreement_score":0.966603,"about_ca_system_score_codex":0.000055693334,"about_ca_system_score_gemma":0.000033370117,"threshold_uncertainty_score":0.57349575},"labels":[],"label_agreement":null},{"id":"W2058110750","doi":"10.1016/s0743-1066(99)00071-0","title":"Abducing through negation as failure: stable models within the independent choice logic","year":2000,"lang":"en","type":"article","venue":"The Journal of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Negation; Stable model semantics; Semantics (computer science); Proposition; Logic program; Computer science; Programming language; Higher-order logic; Set (abstract data type); Circumscription; Simple (philosophy); Theoretical computer science; Non-monotonic logic; Game semantics; Logic programming; Mathematics; Description logic; Epistemology; Operational semantics; Denotational semantics","score_opus":0.03285870710316814,"score_gpt":0.26981322105363487,"score_spread":0.23695451395046674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058110750","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.11473381,0.0048208456,0.8515945,0.0075734905,0.0008827786,0.0007651308,5.1815084e-7,0.00020724908,0.019421699],"genre_scores_gemma":[0.9624177,0.00016355798,0.03570784,0.00078522786,0.0003581346,0.000008081798,4.333625e-7,0.000012525525,0.00054645323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975625,0.00042503182,0.00060955074,0.00023412122,0.0006943527,0.0004744203],"domain_scores_gemma":[0.99802023,0.00040698948,0.0006730884,0.00054923084,0.00025304925,0.000097388845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030431382,0.00022804343,0.00028437414,0.00005526739,0.00066113897,0.0004901626,0.0020527856,0.00010295551,0.0000612198],"category_scores_gemma":[0.00019890214,0.00010956778,0.00015430304,0.0005671472,0.00012794096,0.0014786967,0.00020303969,0.0007248148,0.000055030436],"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.0001595145,0.00055833487,0.00047151023,0.00005434445,0.00028642302,0.00014222636,0.054921117,0.12530671,0.00082422455,0.47652155,0.0014274099,0.33932662],"study_design_scores_gemma":[0.0015353336,0.0012919613,0.0005036068,0.0002342516,0.00018571372,0.0028993958,0.0032852495,0.07509162,0.001795997,0.89087033,0.02166567,0.0006408462],"about_ca_topic_score_codex":0.00021501789,"about_ca_topic_score_gemma":0.00007658671,"teacher_disagreement_score":0.84768397,"about_ca_system_score_codex":0.00011553,"about_ca_system_score_gemma":0.00018448662,"threshold_uncertainty_score":0.50850135},"labels":[],"label_agreement":null},{"id":"W2078711049","doi":"10.1016/s0743-1066(99)00074-6","title":"An abductive approach to disjunctive logic programming","year":2000,"lang":"en","type":"article","venue":"The Journal of Logic Programming","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Abductive reasoning; Programming language; Computer science; Logic programming; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.0271003463705564,"score_gpt":0.27402904815734697,"score_spread":0.24692870178679058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078711049","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.038193297,0.0013840835,0.94568074,0.000888752,0.00048011227,0.000930057,7.417758e-7,0.00024007395,0.0122021455],"genre_scores_gemma":[0.7436815,0.00004350634,0.25516817,0.00034152975,0.00048216293,0.000026459413,0.0000010578175,0.000018247447,0.00023739638],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707735,0.0005085671,0.00059933914,0.00041333688,0.00061630196,0.00078512134],"domain_scores_gemma":[0.9979346,0.00017563075,0.00043264392,0.00068040064,0.00038930666,0.00038746727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002634881,0.00033658478,0.00046715487,0.00017418989,0.00048703386,0.00043364204,0.0025807866,0.00011487673,0.000025042107],"category_scores_gemma":[0.00015915526,0.0001911845,0.00022225906,0.00101301,0.00019634017,0.0009831123,0.00020150766,0.0006143548,0.00006222889],"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.00014155722,0.000933229,0.00027071263,0.000016723045,0.00009723776,0.000049247432,0.014196391,0.0012025399,0.00018637243,0.04106504,0.00015238581,0.94168854],"study_design_scores_gemma":[0.010460658,0.044893485,0.020418832,0.0009882691,0.0015343142,0.020026196,0.042883914,0.05564692,0.003951499,0.45017412,0.341297,0.0077247918],"about_ca_topic_score_codex":0.000028639233,"about_ca_topic_score_gemma":0.000005874207,"teacher_disagreement_score":0.9339638,"about_ca_system_score_codex":0.00014562666,"about_ca_system_score_gemma":0.00012855369,"threshold_uncertainty_score":0.7796278},"labels":[],"label_agreement":null}]}