{"id":"W2030552895","doi":"10.1007/s00224-007-1325-3","title":"Algorithms in the W-Hierarchy","year":2007,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hierarchy; Intersection (aeronautics); Mathematical proof; Extension (predicate logic); Set (abstract data type); Mathematics; Upper and lower bounds; Algorithm; Computer science; State (computer science); Discrete mathematics; Finite-state machine; Combinatorics; Theoretical computer science; Programming language; Engineering","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01654583,0.0001333609,0.0002459705,0.0003307572,0.0001255843,0.00007114197,0.002212098,0.00005271568,0.000001485282],"category_scores_gemma":[0.0001520359,0.00009459269,0.00006947896,0.001089584,0.0002112043,0.0001710147,0.0002581284,0.0002992691,0.00001705233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000384807,"about_ca_system_score_gemma":0.00003659208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001986322,"about_ca_topic_score_gemma":0.000002099279,"domain_scores_codex":[0.9970555,0.001033359,0.0005058944,0.0003007109,0.0005857681,0.0005187675],"domain_scores_gemma":[0.9959509,0.002870103,0.0001696096,0.00085435,0.00009783893,0.00005717433],"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.00001767899,0.00004590408,0.0003462298,0.00003486409,0.000009150084,0.00003348552,0.005394362,0.001171428,0.0003340599,0.9578153,0.00002273586,0.03477478],"study_design_scores_gemma":[0.001720655,0.0005234107,0.02229135,0.0005994526,0.000008610391,0.0004718994,0.007499062,0.149294,0.003389346,0.8106446,0.002784571,0.0007730476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.113554,0.0004779067,0.8770537,0.00007344604,0.0003913057,0.0003174102,5.864129e-7,0.00008309704,0.008048524],"genre_scores_gemma":[0.9920801,0.000002229294,0.007611573,0.00007377514,0.0001151011,0.000002898566,4.664228e-7,0.000009789998,0.0001040628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.878526,"threshold_uncertainty_score":0.5734488,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0302898493409319,"score_gpt":0.3155309478931336,"score_spread":0.2852410985522017,"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."}}