{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008375383,0.0003589109,0.0003159958,0.0005911464,0.0009518783,0.001921126,0.0009749361,0.0006073577,0.005948593],"category_scores_gemma":[0.001122755,0.0002381686,0.0009030307,0.0004703319,0.002629638,0.004246803,0.002007984,0.001948453,0.0006089653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001475797,"about_ca_system_score_gemma":0.0009662041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00171748,"about_ca_topic_score_gemma":0.001636414,"domain_scores_codex":[0.9994771,0.0001099085,0.00002254422,0.0001259007,0.0001720461,0.00009252399],"domain_scores_gemma":[0.9994826,0.0002623845,0.00003819454,0.00007341171,0.0001060411,0.00003728039],"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.00002548587,0.00001177907,0.00005916991,0.00003532138,0.000004174579,0.00005109713,0.000138618,0.001740966,0.001182715,0.9916489,0.0005280515,0.004573727],"study_design_scores_gemma":[0.00002553966,0.00004086663,0.0001581413,0.00002239166,0.00001251597,0.0001146783,0.00009525139,0.01373513,0.002885699,0.9578494,0.02504593,0.00001439169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1887833,0.0008597623,0.6147414,0.003131337,0.0001837427,0.000112737,0.001139524,0.001936485,0.1891117],"genre_scores_gemma":[0.8907139,0.0002967418,0.08457814,0.0006755078,0.0001096167,0.00006331038,0.0006279589,0.0001202851,0.02281452],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005948593,"threshold_uncertainty_score":0.01990008,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002545292,0.003466158,0.00128346,0.003047955,0.00214266,0.002783776,0.002421675,0.002325771,0.02994153],"category_scores_gemma":[0.008159937,0.001367108,0.00331131,0.002760492,0.002915176,0.005748346,0.005235672,0.01130871,0.00875188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002958783,"about_ca_system_score_gemma":0.001535268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002179802,"about_ca_topic_score_gemma":0.002860168,"domain_scores_codex":[0.9976011,0.0004280204,0.0001412573,0.0003524163,0.001272164,0.000205129],"domain_scores_gemma":[0.9960491,0.002390333,0.000206598,0.0003357638,0.0008559274,0.0001622505],"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.0001761323,0.0003341707,0.00040233,0.002029953,0.0001894004,0.001616189,0.000821194,0.004799104,0.01404683,0.6653033,0.1223847,0.1878967],"study_design_scores_gemma":[0.0001186406,0.0001227223,0.001093653,0.0004110191,0.0001161073,0.0008098952,0.00008147077,0.006972271,0.006891816,0.7943127,0.1889314,0.0001382938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003147531,0.01054434,0.9065759,0.008149386,0.00553025,0.000520966,0.001962538,0.003525193,0.06004397],"genre_scores_gemma":[0.1422051,0.009800372,0.7536458,0.01526333,0.007141072,0.002277366,0.003635055,0.002373217,0.06365861],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02994153,"threshold_uncertainty_score":0.1001644,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}