{"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":"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.0031475308,0.010544341,0.90657586,0.008149386,0.0055302503,0.00052096596,0.001962538,0.003525193,0.060043972],"genre_scores_gemma":[0.14220509,0.009800372,0.75364584,0.015263328,0.007141072,0.0022773664,0.0036350552,0.0023732171,0.06365861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976011,0.00042802043,0.00014125726,0.00035241627,0.0012721637,0.00020512902],"domain_scores_gemma":[0.9960491,0.0023903328,0.00020659802,0.00033576376,0.0008559274,0.00016225052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025452925,0.0034661584,0.0012834602,0.0030479552,0.0021426599,0.0027837763,0.002421675,0.0023257711,0.02994153],"category_scores_gemma":[0.008159937,0.0013671076,0.0033113097,0.0027604918,0.002915176,0.0057483464,0.0052356715,0.011308709,0.00875188],"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.0001761323,0.0003341707,0.00040233004,0.0020299526,0.00018940041,0.0016161889,0.000821194,0.0047991043,0.014046826,0.66530335,0.1223847,0.1878967],"study_design_scores_gemma":[0.000118640615,0.00012272227,0.0010936531,0.00041101914,0.00011610726,0.00080989517,0.000081470775,0.0069722715,0.0068918164,0.7943127,0.18893142,0.00013829376],"about_ca_topic_score_codex":0.0021798024,"about_ca_topic_score_gemma":0.0028601682,"teacher_disagreement_score":0.02994153,"about_ca_system_score_codex":0.0029587832,"about_ca_system_score_gemma":0.001535268,"threshold_uncertainty_score":0.10016441},"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":"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.18878335,0.0008597623,0.6147414,0.0031313375,0.00018374273,0.00011273701,0.0011395237,0.0019364846,0.18911168],"genre_scores_gemma":[0.8907139,0.0002967418,0.08457814,0.00067550776,0.00010961672,0.000063310385,0.0006279589,0.00012028506,0.022814522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994771,0.00010990849,0.000022544222,0.00012590068,0.00017204612,0.000092523995],"domain_scores_gemma":[0.99948263,0.00026238448,0.00003819454,0.00007341171,0.00010604113,0.000037280388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083753833,0.0003589109,0.00031599583,0.00059114635,0.0009518783,0.0019211264,0.0009749361,0.0006073577,0.005948593],"category_scores_gemma":[0.0011227545,0.00023816856,0.0009030307,0.0004703319,0.0026296384,0.0042468025,0.0020079843,0.0019484533,0.00060896535],"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.000025485868,0.000011779067,0.000059169906,0.000035321384,0.000004174579,0.000051097133,0.000138618,0.0017409655,0.0011827151,0.9916489,0.00052805146,0.0045737266],"study_design_scores_gemma":[0.000025539663,0.000040866635,0.00015814132,0.000022391658,0.000012515969,0.00011467825,0.000095251395,0.013735129,0.0028856986,0.95784944,0.025045931,0.00001439169],"about_ca_topic_score_codex":0.0017174801,"about_ca_topic_score_gemma":0.0016364143,"teacher_disagreement_score":0.005948593,"about_ca_system_score_codex":0.0014757968,"about_ca_system_score_gemma":0.0009662041,"threshold_uncertainty_score":0.019900084},"labels":[],"label_agreement":null}]}