{"meta":{"query_hash":"f91994793ef2","filters":{"venue":"Bulletin of the Section of Logic"},"cohort_total":2,"direct_labels_cover":0,"predictions_cover":2,"exported":2,"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/f91994793ef2","api":"https://metacan.xera.ac/api/v1/cohort?venue=Bulletin+of+the+Section+of+Logic"},"results":[{"id":"W2345246322","doi":"10.18778/0138-0680.44.3.4.03","title":"A Short and Readable Proof of Cut Elimination for Two First-Order Modal Logics","year":2015,"lang":"en","type":"article","venue":"Bulletin of the Section of Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":2,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Modal logic; Mathematics; Proof theory; Modal; Normal modal logic; Structural proof theory; Extension (predicate logic); Calculus (dental); Algebra over a field; Discrete mathematics; Proof complexity; Order (exchange); Pure mathematics; Computer science; Programming language","score_opus":0.03953101584587338,"score_gpt":0.26363620212933087,"score_spread":0.2241051862834575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345246322","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.026752414,0.00060697744,0.9559663,0.003908476,0.001361255,0.0014665088,0.0000035902813,0.00007431648,0.0098601775],"genre_scores_gemma":[0.9921037,0.0000048945644,0.0070017073,0.00004274388,0.000059162383,0.00002646971,0.0000010799743,0.000004679942,0.0007555664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990971,0.000065637745,0.00027318398,0.00018057621,0.000266317,0.000117160795],"domain_scores_gemma":[0.9988288,0.00007129521,0.00024284494,0.00027162887,0.00055414793,0.000031274518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085423084,0.000083989056,0.00018451571,0.000049470873,0.000058409914,0.000015276375,0.00030737583,0.000068695044,0.0000067458573],"category_scores_gemma":[0.00024189442,0.00005591194,0.00006397659,0.00014186093,0.00008413135,0.000038125596,0.0001312185,0.00005216275,0.0000010208025],"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.00045023774,0.0014420927,0.0066259215,0.0016063022,0.0002084088,0.0000026168332,0.004315561,0.016766744,0.0031875449,0.877414,0.04441936,0.04356124],"study_design_scores_gemma":[0.005711627,0.007782661,0.0068449434,0.00015088325,0.00020248682,0.00023132918,0.0011870426,0.096594535,0.12173933,0.3154329,0.44306576,0.0010565076],"about_ca_topic_score_codex":0.00019521639,"about_ca_topic_score_gemma":0.000036621288,"teacher_disagreement_score":0.9653513,"about_ca_system_score_codex":0.000028180382,"about_ca_system_score_gemma":0.000038195074,"threshold_uncertainty_score":0.22800228},"labels":[],"label_agreement":null},{"id":"W3193790318","doi":"10.18778/0138-0680.2021.18","title":"An Arithmetically Complete Predicate Modal Logic","year":2021,"lang":"en","type":"article","venue":"Bulletin of the Section of Logic","topic":"Logic, Reasoning, and Knowledge","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":"York University","funders":"","keywords":"Predicate (mathematical logic); Modal; Completeness (order theory); Kripke semantics; Mathematics; Modal logic; First order; Extension (predicate logic); Algorithm; Computer science; Artificial intelligence; Multimodal logic; Programming language; Description logic; Applied mathematics","score_opus":0.02306834566345674,"score_gpt":0.24260116236419121,"score_spread":0.21953281670073446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193790318","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.08946986,0.0011615314,0.6855159,0.026638854,0.004572081,0.00068046636,0.00002890452,0.000519042,0.1914134],"genre_scores_gemma":[0.9753472,0.000026676544,0.0223711,0.00060520653,0.00013795713,0.00000641698,0.000002874126,0.0000073421247,0.0014951882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842584,0.0003307573,0.0003330797,0.00036674135,0.0003229324,0.00022063407],"domain_scores_gemma":[0.99847937,0.00011994988,0.00023606564,0.0007683556,0.00031811363,0.00007815968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044993483,0.00013440399,0.00025343618,0.000048919366,0.00013485823,0.00004208041,0.0010298918,0.00010795988,0.00037537882],"category_scores_gemma":[0.0002607411,0.00009265178,0.00017834379,0.00031184175,0.00019537486,0.000040338222,0.00038163245,0.00018833343,0.000045801105],"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.000062754756,0.0015152309,0.0023489418,0.00017292105,0.000116444986,0.00003349559,0.0007835462,0.0029913033,0.04751166,0.92435986,0.014059336,0.0060445024],"study_design_scores_gemma":[0.004104612,0.0037251646,0.15463156,0.00032754857,0.00019920334,0.0010285095,0.00041279985,0.07276444,0.101344615,0.36492395,0.294995,0.0015425613],"about_ca_topic_score_codex":0.00005001198,"about_ca_topic_score_gemma":0.000009530014,"teacher_disagreement_score":0.8858774,"about_ca_system_score_codex":0.000026734135,"about_ca_system_score_gemma":0.00008049546,"threshold_uncertainty_score":0.41101345},"labels":[],"label_agreement":null}]}