{"id":"W2295501631","doi":"","title":"Inapproximability of Treewidth and Related Problems (Extended Abstract)","year":2015,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Partial k-tree; Pathwidth; Tree-depth; Tree decomposition; Graphical model; Combinatorics; Mathematics; 1-planar graph; Discrete mathematics; Computer science; Chordal graph; Graph; Artificial intelligence; Line graph","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.001124024,0.0001888914,0.0002448749,0.0002944048,0.00005463566,0.0001506813,0.001036678,0.00008882886,0.0001269794],"category_scores_gemma":[0.0008228947,0.0001726524,0.00007015526,0.0003718101,0.0004557728,0.0005793126,0.0003443467,0.0003378095,0.0001154893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009338659,"about_ca_system_score_gemma":0.0002027901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005997113,"about_ca_topic_score_gemma":0.00002853731,"domain_scores_codex":[0.9975703,0.0001061736,0.0006978919,0.0005825079,0.0007638478,0.0002792426],"domain_scores_gemma":[0.9979274,0.0001779168,0.0002566747,0.0005239302,0.0009011194,0.000212992],"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.00004975378,0.0002297692,0.00008987402,0.000009289079,0.00002129643,0.000009180439,0.0008797866,0.0004354446,0.004484724,0.8289623,0.00001359764,0.1648149],"study_design_scores_gemma":[0.00007475964,0.0002740962,0.001213917,0.00006984016,0.000002122509,0.00001888497,0.000271184,0.08130623,0.03770104,0.8788021,0.00009201463,0.0001738278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2188362,0.00009980863,0.7023021,0.008250425,0.001583896,0.0009709318,0.0000325553,0.0003201182,0.06760392],"genre_scores_gemma":[0.9931064,0.000029353,0.006566548,0.00004669325,0.00002501234,0.00002565821,0.000004809048,0.000009039332,0.000186527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7742701,"threshold_uncertainty_score":0.7040561,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1653506738906726,"score_gpt":0.3547262290617658,"score_spread":0.1893755551710931,"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."}}