{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":2,"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":"f91994793ef2","filters":{"venue":"Bulletin of the Section of Logic"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yunge Hao","is_ca":true},{"name":"George Tourlakis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02306834566345674,"gpt":0.2426011623641912,"spread":0.2195328167007345,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004499348,0.000134404,0.0002534362,0.00004891937,0.0001348582,0.00004208041,0.001029892,0.0001079599,0.0003753788],"category_scores_gemma":[0.0002607411,0.00009265178,0.0001783438,0.0003118418,0.0001953749,0.00004033822,0.0003816324,0.0001883334,0.00004580111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002673413,"about_ca_system_score_gemma":0.00008049546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005001198,"about_ca_topic_score_gemma":0.000009530014,"domain_scores_codex":[0.9984258,0.0003307573,0.0003330797,0.0003667414,0.0003229324,0.0002206341],"domain_scores_gemma":[0.9984794,0.0001199499,0.0002360656,0.0007683556,0.0003181136,0.00007815968],"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.00006275476,0.001515231,0.002348942,0.000172921,0.000116445,0.00003349559,0.0007835462,0.002991303,0.04751166,0.9243599,0.01405934,0.006044502],"study_design_scores_gemma":[0.004104612,0.003725165,0.1546316,0.0003275486,0.0001992033,0.001028509,0.0004127999,0.07276444,0.1013446,0.364924,0.294995,0.001542561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08946986,0.001161531,0.6855159,0.02663885,0.004572081,0.0006804664,0.00002890452,0.000519042,0.1914134],"genre_scores_gemma":[0.9753472,0.00002667654,0.0223711,0.0006052065,0.0001379571,0.00000641698,0.000002874126,0.000007342125,0.001495188],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8858774,"threshold_uncertainty_score":0.4110135,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Feng Gao","is_ca":false},{"name":"George Tourlakis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03953101584587338,"gpt":0.2636362021293309,"spread":0.2241051862834575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008542308,0.00008398906,0.0001845157,0.00004947087,0.00005840991,0.00001527638,0.0003073758,0.00006869504,0.000006745857],"category_scores_gemma":[0.0002418944,0.00005591194,0.00006397659,0.0001418609,0.00008413135,0.0000381256,0.0001312185,0.00005216275,0.000001020803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002818038,"about_ca_system_score_gemma":0.00003819507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001952164,"about_ca_topic_score_gemma":0.00003662129,"domain_scores_codex":[0.9990971,0.00006563775,0.000273184,0.0001805762,0.000266317,0.0001171608],"domain_scores_gemma":[0.9988288,0.00007129521,0.0002428449,0.0002716289,0.0005541479,0.00003127452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004502377,0.001442093,0.006625921,0.001606302,0.0002084088,0.000002616833,0.004315561,0.01676674,0.003187545,0.877414,0.04441936,0.04356124],"study_design_scores_gemma":[0.005711627,0.007782661,0.006844943,0.0001508833,0.0002024868,0.0002313292,0.001187043,0.09659453,0.1217393,0.3154329,0.4430658,0.001056508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02675241,0.0006069774,0.9559663,0.003908476,0.001361255,0.001466509,0.000003590281,0.00007431648,0.009860178],"genre_scores_gemma":[0.9921037,0.000004894564,0.007001707,0.00004274388,0.00005916238,0.00002646971,0.000001079974,0.000004679942,0.0007555664],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9653513,"threshold_uncertainty_score":0.2280023,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}