{"id":"W2443199731","doi":"","title":"Inapproximability of treewidth and related problems","year":2015,"lang":"en","type":"article","venue":"International 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; Graphical model; Tree decomposition; Combinatorics; Computer science; Mathematics; 1-planar graph; Inference; Discrete mathematics; Graph; Chordal graph; Theoretical computer science; 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.0008374954,0.0001337515,0.0001663063,0.0002130728,0.00004300589,0.0001085156,0.001072858,0.00006395599,0.00007025305],"category_scores_gemma":[0.000574454,0.0001222083,0.00004250528,0.000374254,0.0003674854,0.0004455078,0.0003009449,0.0002273653,0.00007571125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006111022,"about_ca_system_score_gemma":0.0001311574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003595819,"about_ca_topic_score_gemma":0.00002105346,"domain_scores_codex":[0.9982125,0.0001235433,0.0004431432,0.0004442677,0.0005804764,0.0001961041],"domain_scores_gemma":[0.9984549,0.0001459792,0.0001440831,0.0004138488,0.0006858453,0.0001553106],"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.00003883191,0.0001194854,0.0002119492,0.000005303242,0.00001281962,0.000003781215,0.0008568929,0.0004521437,0.001683325,0.8976069,0.000008285831,0.09900025],"study_design_scores_gemma":[0.00004326793,0.000231415,0.0001499383,0.00003476041,0.000001202428,0.000009157118,0.0001764574,0.1479452,0.01788501,0.8333384,0.00007663423,0.0001084953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1233896,0.00008069753,0.8048034,0.005162706,0.0009673504,0.0005196997,0.00001505309,0.0001787467,0.06488273],"genre_scores_gemma":[0.9926159,0.0000205946,0.007087782,0.00003759974,0.00001798519,0.00001876718,0.000002807058,0.000006097141,0.0001924136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8692264,"threshold_uncertainty_score":0.498351,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1818545937339058,"score_gpt":0.3737240228359098,"score_spread":0.191869429102004,"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."}}