{"id":"W3000817392","doi":"10.1007/978-3-030-39219-2_5","title":"Approximating Modular Decomposition Is Hard","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Agence Nationale de la Recherche","keywords":"Modular design; Computer science; Modular decomposition; Decomposition; Algebraic number; Graph; Time complexity; Data structure; Neighbourhood (mathematics); Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Line graph; Pathwidth","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.0009954972,0.0005700538,0.0006004386,0.000841452,0.0003924389,0.0007097639,0.00475886,0.000281045,0.00003082982],"category_scores_gemma":[0.000131499,0.0005595598,0.0001910422,0.001041773,0.0007268594,0.001014689,0.002395282,0.001291887,0.0001568217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003110171,"about_ca_system_score_gemma":0.0003611947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000431787,"about_ca_topic_score_gemma":0.000003340124,"domain_scores_codex":[0.9947979,0.00006398843,0.0006051451,0.002188963,0.001532981,0.0008109887],"domain_scores_gemma":[0.9969808,0.000417835,0.0003070518,0.001699749,0.0002833885,0.00031112],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001380833,0.00003130035,0.00002829828,0.00010954,0.00002391711,0.0002160646,0.00145158,0.03072646,0.003009755,0.1710898,0.00003561832,0.7932639],"study_design_scores_gemma":[0.0001357425,0.0001058306,0.00001663057,0.0001815424,0.000002990731,0.00004126027,9.478151e-8,0.5329179,0.004414849,0.4613247,0.0004451796,0.0004133235],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006505517,0.0003386172,0.9929659,0.002194094,0.0006715955,0.0004981135,0.000007577446,0.0002815868,0.002977458],"genre_scores_gemma":[0.05644467,0.00002794996,0.9394647,0.003406239,0.0003870364,0.00001608478,0.000007042228,0.00005533818,0.0001908886],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7928506,"threshold_uncertainty_score":0.9996856,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02567637745108079,"score_gpt":0.2885644326627407,"score_spread":0.2628880552116599,"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."}}