{"id":"W1861909104","doi":"10.1007/s00453-013-9752-9","title":"Practical and Efficient Split Decomposition via Graph-Labelled Trees","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ackermann function; Lexicographical order; Graph; Modular decomposition; Decomposition; Mathematics; Algorithm; Combinatorics; Computer science; Inverse; 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":[],"consensus_categories":[],"category_scores_codex":[0.0002712564,0.0001461664,0.0001567339,0.0001713548,0.0002015716,0.0001862036,0.0003876914,0.00006279756,0.0000748129],"category_scores_gemma":[0.00005195731,0.0001281005,0.00004870555,0.0004462637,0.0001681895,0.0004783284,0.0003310594,0.0002124926,0.0002915754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002748556,"about_ca_system_score_gemma":0.00003302489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003158602,"about_ca_topic_score_gemma":0.000002294867,"domain_scores_codex":[0.998462,0.0001407824,0.0001901934,0.0004626885,0.0003365601,0.0004077939],"domain_scores_gemma":[0.9987576,0.0003628976,0.00005595233,0.0004803231,0.0001269459,0.000216297],"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.00003915374,0.0006306348,0.0002171205,0.00002619449,0.00009397348,0.00009209893,0.0005736495,0.00024746,0.03236589,0.3776856,0.001793584,0.5862346],"study_design_scores_gemma":[0.0009290697,0.0003292209,0.005997948,0.00002082844,0.00001174734,0.0002460679,0.00004239663,0.8027433,0.01156023,0.1771172,0.0005896151,0.0004124167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0608126,0.0001012323,0.9344589,0.003368123,0.0001171002,0.0003703589,0.000001281413,0.0001497901,0.0006206923],"genre_scores_gemma":[0.59227,0.00001603993,0.407323,0.0001651334,0.00004466296,0.00006420911,0.000002624029,0.00001229835,0.0001020075],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8024958,"threshold_uncertainty_score":0.5223787,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01497166397480179,"score_gpt":0.3110584400324188,"score_spread":0.296086776057617,"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."}}