{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":3,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":3,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"b2a3274ecdc5","filters":{"venue":"The Journal of Logic Programming"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03285870710316814,"gpt":0.2698132210536349,"spread":0.2369545139504667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003043138,0.0002280434,0.0002843741,0.00005526739,0.000661139,0.0004901626,0.002052786,0.0001029555,0.0000612198],"category_scores_gemma":[0.0001989021,0.0001095678,0.000154303,0.0005671472,0.000127941,0.001478697,0.0002030397,0.0007248148,0.00005503044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00011553,"about_ca_system_score_gemma":0.0001844866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002150179,"about_ca_topic_score_gemma":0.00007658671,"domain_scores_codex":[0.9975625,0.0004250318,0.0006095507,0.0002341212,0.0006943527,0.0004744203],"domain_scores_gemma":[0.9980202,0.0004069895,0.0006730884,0.0005492308,0.0002530492,0.00009738885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001595145,0.0005583349,0.0004715102,0.00005434445,0.000286423,0.0001422264,0.05492112,0.1253067,0.0008242246,0.4765216,0.00142741,0.3393266],"study_design_scores_gemma":[0.001535334,0.001291961,0.0005036068,0.0002342516,0.0001857137,0.002899396,0.003285249,0.07509162,0.001795997,0.8908703,0.02166567,0.0006408462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1147338,0.004820846,0.8515945,0.00757349,0.0008827786,0.0007651308,5.181508e-7,0.0002072491,0.0194217],"genre_scores_gemma":[0.9624177,0.000163558,0.03570784,0.0007852279,0.0003581346,0.000008081798,4.333625e-7,0.00001252552,0.0005464532],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.847684,"threshold_uncertainty_score":0.5085014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0386305963069726,"gpt":0.3020598992817101,"spread":0.2634293029747375,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003767856,0.0002517262,0.0005391878,0.0002768965,0.0002545927,0.0002015735,0.0004999785,0.0001099387,0.0002517177],"category_scores_gemma":[0.0009875681,0.0001406357,0.000235406,0.0009422773,0.0002854707,0.0002239499,0.00005749215,0.0005502286,0.00001768488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005569333,"about_ca_system_score_gemma":0.00003337012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003054776,"about_ca_topic_score_gemma":0.00001471709,"domain_scores_codex":[0.9977439,0.0003315677,0.0007632966,0.0001615639,0.0005212164,0.0004784756],"domain_scores_gemma":[0.9975106,0.001147651,0.0006909716,0.0003279186,0.0001734391,0.0001494005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001501042,0.0003212209,0.000951481,0.0001071326,0.0003857025,0.00009317032,0.002646562,0.00007058652,0.0002698052,0.0270697,0.0002814031,0.9676532],"study_design_scores_gemma":[0.002256603,0.002644923,0.001129613,0.0005286889,0.00278155,0.005794625,0.008601351,0.0005933217,0.0009959871,0.9196436,0.05397959,0.001050132],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9819525,0.004582429,0.008646678,0.001999737,0.0001148923,0.0005076735,0.000001077109,0.000116773,0.002078179],"genre_scores_gemma":[0.8839594,0.0005292425,0.114695,0.000122903,0.000214421,0.000005480628,5.271739e-7,0.00003178606,0.0004411557],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.966603,"threshold_uncertainty_score":0.5734957,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Abductive reasoning; Programming language; Computer science; Logic programming; Mathematics; Theoretical computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0271003463705564,"gpt":0.274029048157347,"spread":0.2469287017867906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002634881,0.0003365848,0.0004671549,0.0001741899,0.0004870339,0.000433642,0.002580787,0.0001148767,0.00002504211],"category_scores_gemma":[0.0001591553,0.0001911845,0.0002222591,0.00101301,0.0001963402,0.0009831123,0.0002015077,0.0006143548,0.00006222889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001456267,"about_ca_system_score_gemma":0.0001285537,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002863923,"about_ca_topic_score_gemma":0.000005874207,"domain_scores_codex":[0.9970773,0.0005085671,0.0005993391,0.0004133369,0.000616302,0.0007851213],"domain_scores_gemma":[0.9979346,0.0001756307,0.0004326439,0.0006804006,0.0003893067,0.0003874673],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001415572,0.000933229,0.0002707126,0.00001672304,0.00009723776,0.00004924743,0.01419639,0.00120254,0.0001863724,0.04106504,0.0001523858,0.9416885],"study_design_scores_gemma":[0.01046066,0.04489348,0.02041883,0.0009882691,0.001534314,0.0200262,0.04288391,0.05564692,0.003951499,0.4501741,0.341297,0.007724792],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0381933,0.001384084,0.9456807,0.000888752,0.0004801123,0.000930057,7.417758e-7,0.0002400739,0.01220215],"genre_scores_gemma":[0.7436815,0.00004350634,0.2551682,0.0003415298,0.0004821629,0.00002645941,0.000001057817,0.00001824745,0.0002373964],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9339638,"threshold_uncertainty_score":0.7796278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}