{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003314542,0.001761616,0.002029904,0.00148726,0.001631541,0.005221198,0.003459922,0.002587478,0.01223429],"category_scores_gemma":[0.02720974,0.001299147,0.002990415,0.00341035,0.003199416,0.009260004,0.002855378,0.006915293,0.001374067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003721907,"about_ca_system_score_gemma":0.00208773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005043775,"about_ca_topic_score_gemma":0.00473605,"domain_scores_codex":[0.9964954,0.00113961,0.0001391567,0.0009264599,0.0006835731,0.0006159388],"domain_scores_gemma":[0.9526215,0.04138625,0.002074549,0.002074535,0.00104454,0.0007985989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001098714,0.0009307956,0.005165049,0.001922039,0.0003944036,0.0005367409,0.001136992,0.5312829,0.005691001,0.3121072,0.05433548,0.0853987],"study_design_scores_gemma":[0.0001201341,0.0001055438,0.0006746975,0.0001031696,0.00008751183,0.0003007707,0.0002017657,0.3560019,0.001659472,0.6367345,0.003980359,0.00003029489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2640684,0.007486341,0.6588402,0.01890223,0.0006045329,0.0004591101,0.00461676,0.002065999,0.04295653],"genre_scores_gemma":[0.7507228,0.005518791,0.2172926,0.002917214,0.001365607,0.0007503043,0.00459942,0.0009666825,0.01586667],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01223429,"threshold_uncertainty_score":0.04092783,"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."}}