{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10480215,0.09436678,0.55225694,0.064244136,0.0024764023,0.000057576923,0.00047938072,0.0004726161,0.180844],"genre_scores_gemma":[0.86990684,0.020173894,0.070877366,0.0030872931,0.004714897,0.00015694785,0.00031726566,0.00014947559,0.03061605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756074,0.0013227452,0.00012515696,0.00033699663,0.000508532,0.00014596681],"domain_scores_gemma":[0.9919274,0.0063832477,0.0004745183,0.00042405148,0.0004645774,0.00032613304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034986176,0.001096449,0.0015438566,0.003439831,0.0024557984,0.0061669955,0.0017801472,0.0028296516,0.0072157467],"category_scores_gemma":[0.008241787,0.0010889387,0.0014400458,0.0038803073,0.010636326,0.017574167,0.0033667118,0.008292555,0.00061854714],"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.0000045660313,0.0000058726987,0.000048250065,0.000016507847,0.0000045989127,0.000011050951,0.00006641772,0.00019868762,0.000028622655,0.99779886,0.00038925325,0.0014273865],"study_design_scores_gemma":[0.0000029671228,0.000003840731,0.000032642412,0.0000074067198,0.000002936179,0.000018415722,0.000029585233,0.0006579489,0.000022070182,0.99747497,0.0017444672,0.0000027615617],"about_ca_topic_score_codex":0.0010634146,"about_ca_topic_score_gemma":0.0009419224,"teacher_disagreement_score":0.0072157467,"about_ca_system_score_codex":0.003364311,"about_ca_system_score_gemma":0.0009694476,"threshold_uncertainty_score":0.02440989},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0858872,0.0008348009,0.88032794,0.005123602,0.000104160565,0.000082513456,0.0002606577,0.00031236562,0.027066793],"genre_scores_gemma":[0.908682,0.00061781256,0.08174131,0.00034153892,0.00013854422,0.000111469046,0.00027625714,0.00012755832,0.007963535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949321,0.0022956692,0.00030643868,0.00066674844,0.0012840496,0.00051498605],"domain_scores_gemma":[0.97751325,0.016360097,0.0012556299,0.002488033,0.0016318725,0.00075116544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074318685,0.0010834535,0.001520672,0.0017248482,0.0018380563,0.005809215,0.0041382145,0.0036275801,0.005173996],"category_scores_gemma":[0.023560122,0.0011425519,0.002628063,0.0018384192,0.008707115,0.01487834,0.005295293,0.0048047705,0.0006563244],"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.00008054402,0.000028568507,0.00032667277,0.000031192074,0.000029850586,0.00010063194,0.00025723307,0.024824403,0.00020309376,0.96929216,0.00044589856,0.0043797814],"study_design_scores_gemma":[0.000014819563,0.000008216062,0.000018314278,0.000006272066,0.000008226286,0.0000139758595,0.000022283342,0.05744035,0.00012726967,0.94202536,0.000307235,0.000007733011],"about_ca_topic_score_codex":0.005105812,"about_ca_topic_score_gemma":0.0043876097,"teacher_disagreement_score":0.0074318685,"about_ca_system_score_codex":0.0023021705,"about_ca_system_score_gemma":0.002578319,"threshold_uncertainty_score":0.0393039},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002419903,0.00050982874,0.9885548,0.0010474352,0.000082382525,0.00008325925,0.0000800017,0.00024052284,0.0069819107],"genre_scores_gemma":[0.10184155,0.0007444073,0.8926217,0.0004338633,0.00022137095,0.00012220918,0.00021192856,0.000048878097,0.003754024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961333,0.0012764569,0.0003780567,0.00046486803,0.0015489573,0.00019835691],"domain_scores_gemma":[0.9916461,0.006069058,0.0002433093,0.0008617673,0.0010281012,0.00015167156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004604106,0.0009581954,0.0010793158,0.0024724796,0.0012217712,0.004060639,0.0045594885,0.0018092815,0.0061520035],"category_scores_gemma":[0.014349448,0.0010036611,0.001882796,0.0023626967,0.0037166853,0.005496581,0.0038505043,0.004940936,0.00070100266],"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.00009371076,0.00016504321,0.0005243777,0.00032059182,0.000109897715,0.0002424581,0.0005071665,0.034280498,0.0013523459,0.78542244,0.003906716,0.17307469],"study_design_scores_gemma":[0.000035305886,0.00002132718,0.00009226694,0.000097373595,0.0000557074,0.000115211194,0.000089710156,0.1871142,0.0011068026,0.80422425,0.0070291525,0.000018763407],"about_ca_topic_score_codex":0.0031878233,"about_ca_topic_score_gemma":0.005344678,"teacher_disagreement_score":0.0061520035,"about_ca_system_score_codex":0.0013299558,"about_ca_system_score_gemma":0.00149949,"threshold_uncertainty_score":0.024349093},"labels":[],"label_agreement":null}]}