{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004121566,0.0008480525,0.001279922,0.001646314,0.002127348,0.007693284,0.004000614,0.002488473,0.01135281],"category_scores_gemma":[0.02606447,0.001275643,0.001867609,0.002377986,0.003821979,0.01772659,0.005008314,0.004691643,0.0007874205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004826542,"about_ca_system_score_gemma":0.002014401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003608904,"about_ca_topic_score_gemma":0.004266263,"domain_scores_codex":[0.9937637,0.001357799,0.0003682786,0.00119235,0.001999573,0.001318291],"domain_scores_gemma":[0.9591267,0.03195845,0.002620724,0.003375377,0.001429418,0.001489365],"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.0003909742,0.0001421296,0.00367975,0.0004999186,0.0001192706,0.0002950848,0.0009651285,0.0845404,0.004241337,0.8849068,0.002897237,0.01732201],"study_design_scores_gemma":[0.00004314192,0.00003052634,0.0005738855,0.00002999901,0.00005380366,0.0001167294,0.00009255199,0.2043257,0.002003914,0.79104,0.001657569,0.00003215038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5383385,0.001164938,0.4323311,0.004392952,0.00008879104,0.000189641,0.001469751,0.001116571,0.02090767],"genre_scores_gemma":[0.9219714,0.0005061841,0.06877266,0.0004217465,0.0001586094,0.0002207305,0.001162745,0.000287911,0.006497906],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01135281,"threshold_uncertainty_score":0.03797895,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}