{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"David Poole","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007431868,0.001083454,0.001520672,0.001724848,0.001838056,0.005809215,0.004138215,0.00362758,0.005173996],"category_scores_gemma":[0.02356012,0.001142552,0.002628063,0.001838419,0.008707115,0.01487834,0.005295293,0.00480477,0.0006563244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00230217,"about_ca_system_score_gemma":0.002578319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005105812,"about_ca_topic_score_gemma":0.00438761,"domain_scores_codex":[0.9949321,0.002295669,0.0003064387,0.0006667484,0.00128405,0.0005149861],"domain_scores_gemma":[0.9775133,0.0163601,0.00125563,0.002488033,0.001631872,0.0007511654],"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.00008054402,0.00002856851,0.0003266728,0.00003119207,0.00002985059,0.0001006319,0.0002572331,0.0248244,0.0002030938,0.9692922,0.0004458986,0.004379781],"study_design_scores_gemma":[0.00001481956,0.000008216062,0.00001831428,0.000006272066,0.000008226286,0.00001397586,0.00002228334,0.05744035,0.0001272697,0.9420254,0.000307235,0.000007733011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0858872,0.0008348009,0.8803279,0.005123602,0.0001041606,0.00008251346,0.0002606577,0.0003123656,0.02706679],"genre_scores_gemma":[0.908682,0.0006178126,0.08174131,0.0003415389,0.0001385442,0.000111469,0.0002762571,0.0001275583,0.007963535],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007431868,"threshold_uncertainty_score":0.0393039,"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","authors":[{"name":"Sibylla Prieß-Crampe","is_ca":false},{"name":"Paulo Ribenboim","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003498618,0.001096449,0.001543857,0.003439831,0.002455798,0.006166996,0.001780147,0.002829652,0.007215747],"category_scores_gemma":[0.008241787,0.001088939,0.001440046,0.003880307,0.01063633,0.01757417,0.003366712,0.008292555,0.0006185471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003364311,"about_ca_system_score_gemma":0.0009694476,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001063415,"about_ca_topic_score_gemma":0.0009419224,"domain_scores_codex":[0.9975607,0.001322745,0.000125157,0.0003369966,0.000508532,0.0001459668],"domain_scores_gemma":[0.9919274,0.006383248,0.0004745183,0.0004240515,0.0004645774,0.000326133],"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.000004566031,0.000005872699,0.00004825007,0.00001650785,0.000004598913,0.00001105095,0.00006641772,0.0001986876,0.00002862266,0.9977989,0.0003892533,0.001427387],"study_design_scores_gemma":[0.000002967123,0.000003840731,0.00003264241,0.00000740672,0.000002936179,0.00001841572,0.00002958523,0.0006579489,0.00002207018,0.997475,0.001744467,0.000002761562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1048021,0.09436678,0.5522569,0.06424414,0.002476402,0.00005757692,0.0004793807,0.0004726161,0.180844],"genre_scores_gemma":[0.8699068,0.02017389,0.07087737,0.003087293,0.004714897,0.0001569478,0.0003172657,0.0001494756,0.03061605],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007215747,"threshold_uncertainty_score":0.02440989,"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","authors":[{"name":"Jia-Huai You","is_ca":true},{"name":"Li Yan Yuan","is_ca":true},{"name":"Randy Goebel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004604106,0.0009581954,0.001079316,0.00247248,0.001221771,0.004060639,0.004559489,0.001809282,0.006152004],"category_scores_gemma":[0.01434945,0.001003661,0.001882796,0.002362697,0.003716685,0.005496581,0.003850504,0.004940936,0.0007010027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001329956,"about_ca_system_score_gemma":0.00149949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003187823,"about_ca_topic_score_gemma":0.005344678,"domain_scores_codex":[0.9961333,0.001276457,0.0003780567,0.000464868,0.001548957,0.0001983569],"domain_scores_gemma":[0.9916461,0.006069058,0.0002433093,0.0008617673,0.001028101,0.0001516716],"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.00009371076,0.0001650432,0.0005243777,0.0003205918,0.0001098977,0.0002424581,0.0005071665,0.0342805,0.001352346,0.7854224,0.003906716,0.1730747],"study_design_scores_gemma":[0.00003530589,0.00002132718,0.00009226694,0.0000973736,0.0000557074,0.0001152112,0.00008971016,0.1871142,0.001106803,0.8042243,0.007029152,0.00001876341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002419903,0.0005098287,0.9885548,0.001047435,0.00008238252,0.00008325925,0.0000800017,0.0002405228,0.006981911],"genre_scores_gemma":[0.1018415,0.0007444073,0.8926217,0.0004338633,0.000221371,0.0001222092,0.0002119286,0.0000488781,0.003754024],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006152004,"threshold_uncertainty_score":0.02434909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}