{"meta":{"query_hash":"20e707919542","filters":{"venue":"Logic in Computer Science"},"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/20e707919542","api":"https://metacan.xera.ac/api/v1/cohort?venue=Logic+in+Computer+Science"},"results":[{"id":"W1563709510","doi":"10.1109/lics.2002.10000","title":"Complexity Classes, Propositional Proof Systems, and Formal Theories","year":2002,"lang":"en","type":"article","venue":"Logic in Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Proof complexity; Propositional variable; Computer science; Well-formed formula; Proof theory; Structural proof theory; Propositional calculus; Propositional formula; Theoretical computer science; Formal proof; Programming language; Calculus (dental); Mathematics; Mathematical proof; Description logic; Intermediate logic","score_opus":0.04573939859099665,"score_gpt":0.2577300465221016,"score_spread":0.21199064793110492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563709510","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.11878638,0.1007872,0.5103732,0.06356239,0.0015536773,0.00022821214,0.0014682716,0.00088713487,0.20235354],"genre_scores_gemma":[0.8661392,0.026886689,0.07796577,0.00298153,0.0036688382,0.00042718768,0.0015039416,0.000279182,0.020147612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693537,0.0010673346,0.0002008473,0.00048370348,0.0009980449,0.00031470112],"domain_scores_gemma":[0.9807053,0.015741201,0.0012253211,0.0009921192,0.0007656982,0.00057035073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00321809,0.0010368115,0.0012583133,0.004153953,0.0026852244,0.009493337,0.0020001924,0.0028618046,0.009326075],"category_scores_gemma":[0.015911425,0.00092904543,0.001082636,0.00425585,0.0103816055,0.022010371,0.0032031133,0.008225627,0.0009232734],"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.0000137837305,0.000019752137,0.00016071742,0.000070492555,0.000008726225,0.000013926925,0.000121808116,0.00078784896,0.000056246176,0.9901779,0.002517773,0.006051],"study_design_scores_gemma":[0.0000069524394,0.0000017230992,0.000071469105,0.000015217315,0.0000043268674,0.000014338246,0.00003102391,0.00094126054,0.000035355923,0.9964741,0.0023995608,0.0000045062898],"about_ca_topic_score_codex":0.0026496588,"about_ca_topic_score_gemma":0.0016195718,"teacher_disagreement_score":0.009493337,"about_ca_system_score_codex":0.00478529,"about_ca_system_score_gemma":0.0017075943,"threshold_uncertainty_score":0.034719825},"labels":[],"label_agreement":null}]}