{"meta":{"query_hash":"46a3bb0a6d2a","filters":{"venue":"Conference on Computational Complexity"},"cohort_total":1,"direct_labels_cover":0,"predictions_cover":1,"exported":1,"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/46a3bb0a6d2a","api":"https://metacan.xera.ac/api/v1/cohort?venue=Conference+on+Computational+Complexity"},"results":[{"id":"W2139730493","doi":"10.1109/ccc.2004.36","title":"The Complexity of Treelike Systems over -Local Formulae","year":2004,"lang":"en","type":"article","venue":"Conference on Computational Complexity","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Generalization; Lambda; Sequent; Mathematics; Satisfiability; Sequent calculus; Discrete mathematics; Resolution (logic); Space (punctuation); Cut-elimination theorem; Exponential function; Combinatorics; Computer science; Linear logic; Mathematical proof; Proof calculus; Physics","score_opus":0.12383376920691673,"score_gpt":0.3041765956225064,"score_spread":0.18034282641558963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139730493","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.0074413954,0.00013420612,0.9820209,0.001003542,0.0008940916,0.00046114175,0.000013721765,0.00018355099,0.007847433],"genre_scores_gemma":[0.9943113,0.0000040671644,0.0053030998,0.00014164064,0.00009534558,0.000028773125,0.000030538336,0.000010803838,0.0000744608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973981,0.00019844067,0.00061920605,0.00048958865,0.00086604065,0.0004286632],"domain_scores_gemma":[0.9979815,0.00029184064,0.00037236832,0.00065302436,0.0005454284,0.00015584672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005547785,0.00026936713,0.00038733057,0.00009314569,0.0005773593,0.00036513704,0.0014005015,0.00008895581,0.000015773356],"category_scores_gemma":[0.000046607554,0.00019373815,0.00015726598,0.00036417483,0.0012229196,0.0002680335,0.000277608,0.00024555842,0.000093831775],"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.000028101227,0.00012788265,0.00013125694,0.00003210539,0.000033174005,0.000004843564,0.00028937683,0.011255471,0.000013358011,0.98352426,0.00014237854,0.0044178036],"study_design_scores_gemma":[0.00083399605,0.00024973007,0.010062176,0.000020097603,0.0000050480517,0.000022970638,0.00011619078,0.1997049,0.000053052947,0.78714436,0.0015707762,0.00021671211],"about_ca_topic_score_codex":0.0006754618,"about_ca_topic_score_gemma":0.00023397329,"teacher_disagreement_score":0.9868699,"about_ca_system_score_codex":0.00015319797,"about_ca_system_score_gemma":0.0003778142,"threshold_uncertainty_score":0.7900412},"labels":[],"label_agreement":null}]}