{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":1,"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":"46a3bb0a6d2a","filters":{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nicola Galesi","is_ca":false},{"name":"Neil Thapen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1238337692069167,"gpt":0.3041765956225064,"spread":0.1803428264155896,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005547785,0.0002693671,0.0003873306,0.00009314569,0.0005773593,0.000365137,0.001400501,0.00008895581,0.00001577336],"category_scores_gemma":[0.00004660755,0.0001937381,0.000157266,0.0003641748,0.00122292,0.0002680335,0.000277608,0.0002455584,0.00009383178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000153198,"about_ca_system_score_gemma":0.0003778142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006754618,"about_ca_topic_score_gemma":0.0002339733,"domain_scores_codex":[0.9973981,0.0001984407,0.0006192061,0.0004895887,0.0008660406,0.0004286632],"domain_scores_gemma":[0.9979815,0.0002918406,0.0003723683,0.0006530244,0.0005454284,0.0001558467],"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.00002810123,0.0001278827,0.0001312569,0.00003210539,0.000033174,0.000004843564,0.0002893768,0.01125547,0.00001335801,0.9835243,0.0001423785,0.004417804],"study_design_scores_gemma":[0.000833996,0.0002497301,0.01006218,0.0000200976,0.000005048052,0.00002297064,0.0001161908,0.1997049,0.00005305295,0.7871444,0.001570776,0.0002167121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007441395,0.0001342061,0.9820209,0.001003542,0.0008940916,0.0004611418,0.00001372176,0.000183551,0.007847433],"genre_scores_gemma":[0.9943113,0.000004067164,0.0053031,0.0001416406,0.00009534558,0.00002877313,0.00003053834,0.00001080384,0.0000744608],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9868699,"threshold_uncertainty_score":0.7900412,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}