{"id":"W3036487380","doi":"10.1145/3470869","title":"On the Parameterized Approximability of Contraction to Classes of Chordal Graphs","year":2021,"lang":"en","type":"preprint","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Department of Science and Technology, Ministry of Science and Technology, India; European Commission","keywords":"Parameterized complexity; Combinatorics; Chordal graph; Mathematics; Bounded function; Contraction (grammar); Treewidth; Time complexity; Discrete mathematics; Graph; Pathwidth; Line graph; Mathematical analysis","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002012935,0.0003298189,0.0005708598,0.0005539198,0.000198136,0.0001116836,0.001742214,0.000211755,0.00006590761],"category_scores_gemma":[0.0008896879,0.0002727696,0.000444034,0.001031496,0.0003350536,0.0002237981,0.0001370931,0.0009995409,0.00000836236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001021389,"about_ca_system_score_gemma":0.0002501735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002045346,"about_ca_topic_score_gemma":0.000007202373,"domain_scores_codex":[0.9954554,0.001942671,0.0007292805,0.0008250651,0.000763055,0.0002845327],"domain_scores_gemma":[0.9885243,0.008115385,0.0004437087,0.002155731,0.0006518618,0.0001090596],"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.001225342,0.00143255,0.000009493684,0.0002828304,0.0004191883,0.000004513611,0.002253511,0.4138373,0.006621842,0.3636274,0.00001686407,0.2102692],"study_design_scores_gemma":[0.0004690406,0.0004249037,0.0005466683,0.0002098449,0.00003923522,0.000004503517,0.0003612255,0.01604087,0.04765717,0.9339731,0.0000108047,0.0002625883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2205996,0.00002938455,0.7768423,0.0007826886,0.0005457511,0.0009268991,0.0000442774,0.00009493029,0.0001341751],"genre_scores_gemma":[0.9236124,0.00002609839,0.07586382,0.0001995711,0.0000106303,0.0002214167,0.00001420773,0.00002352324,0.00002828454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7030129,"threshold_uncertainty_score":0.9999725,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0400114360570754,"score_gpt":0.3237282170312386,"score_spread":0.2837167809741632,"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."}}