{"id":"W1906705979","doi":"10.1109/lics.2004.1319632","title":"VTC/sup O/: a second-order theory for TC/sup 0/","year":2004,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Order (exchange); Combinatorics; Physics; Mathematics; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007089914,0.0004775608,0.0003441659,0.001501108,0.001176259,0.002718829,0.001114156,0.0007934727,0.003861045],"category_scores_gemma":[0.00117688,0.0002860751,0.0009250945,0.0009241276,0.003213113,0.003012198,0.001508105,0.002027785,0.0005444206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003154424,"about_ca_system_score_gemma":0.001591295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007393437,"about_ca_topic_score_gemma":0.005100653,"domain_scores_codex":[0.9990119,0.0001226019,0.00005655122,0.0002026224,0.0003861423,0.0002201905],"domain_scores_gemma":[0.9990963,0.0002627662,0.00009218582,0.0001304625,0.0002946015,0.0001236774],"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.00001117833,0.000009627787,0.0002539032,0.00002123249,0.000003722698,0.00005982058,0.000192683,0.0004332189,0.00123719,0.9944921,0.000546433,0.002738888],"study_design_scores_gemma":[0.00003313907,0.00008329935,0.0008876254,0.00004525851,0.00002903309,0.0003411855,0.0003732045,0.01698544,0.009090601,0.8988619,0.07323245,0.00003694674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2215222,0.001653818,0.5946367,0.002116412,0.000543264,0.0002088712,0.001000479,0.001357554,0.1769608],"genre_scores_gemma":[0.8765132,0.0003625274,0.08992672,0.0007227069,0.0002371207,0.0001426294,0.001065649,0.0002252494,0.03080421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007393437,"threshold_uncertainty_score":0.02288705,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01973239725385295,"score_gpt":0.2514702293808242,"score_spread":0.2317378321269712,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}