{"id":"W1559047461","doi":"","title":"Simple, Linear-Time Modular Decomposition","year":2007,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Modular decomposition; Modular design; Computer science; Simple (philosophy); Time complexity; Decomposition; Undirected graph; Graph theory; Algorithm; Theoretical computer science; Graph; Tree decomposition; Linear programming; Mathematical optimization; Mathematics; Line graph; Combinatorics; 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":[],"consensus_categories":[],"category_scores_codex":[0.0005207052,0.0001335046,0.0001274112,0.000272001,0.0002251612,0.0000341618,0.001017255,0.00007414017,0.0000519555],"category_scores_gemma":[0.00002822749,0.0001546781,0.00009234783,0.001226394,0.0001058259,0.0007893745,0.0003455502,0.0001845445,0.0005174802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001053189,"about_ca_system_score_gemma":0.00003112534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001158452,"about_ca_topic_score_gemma":0.000005872671,"domain_scores_codex":[0.998697,0.00008256111,0.0001203484,0.0005314782,0.0001066046,0.0004619642],"domain_scores_gemma":[0.9987378,0.0001698554,0.00005917987,0.0006934694,0.0001291762,0.0002105765],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001142161,0.0001466349,0.003182807,0.000009885198,0.00004115988,0.0009535347,0.0001261791,0.06307223,0.01790236,0.9099613,0.0001374717,0.004352194],"study_design_scores_gemma":[0.000724362,0.0001475336,0.004929905,0.00001018915,0.00001013633,0.00001941805,0.0000404185,0.7605192,0.01155648,0.2198533,0.001792074,0.000396922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3602124,0.000009690035,0.6375071,0.00002238893,0.00004101599,0.00008498428,0.000001290017,0.0001626321,0.001958495],"genre_scores_gemma":[0.9921622,0.00001155169,0.0064302,0.00009321205,0.00004014413,1.393257e-7,0.00000489016,0.00001074937,0.001246969],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.697447,"threshold_uncertainty_score":0.6651334,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04160974537892125,"score_gpt":0.2305874513763769,"score_spread":0.1889777059974557,"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."}}