{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008052725,0.0008157868,0.000857589,0.0008622146,0.0009137139,0.001829364,0.001442558,0.001050483,0.0143526],"category_scores_gemma":[0.003456264,0.0006199027,0.001009791,0.001168325,0.0008873779,0.003310511,0.003345272,0.001875917,0.004456331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007001704,"about_ca_system_score_gemma":0.001489254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009730745,"about_ca_topic_score_gemma":0.003517958,"domain_scores_codex":[0.9989781,0.0002248189,0.00005519648,0.000216999,0.0003280884,0.0001968026],"domain_scores_gemma":[0.9981629,0.0007172485,0.00008945152,0.0006088617,0.0002413934,0.0001800477],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00136915,0.0008352495,0.001869103,0.0007736831,0.0001200245,0.0004454014,0.000924395,0.08774496,0.0573494,0.1871806,0.0465349,0.6148531],"study_design_scores_gemma":[0.000284999,0.0002124495,0.0007115716,0.00008975814,0.00009508654,0.0003064813,0.0005427236,0.4617202,0.01859301,0.4999626,0.01743872,0.00004228878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04417786,0.0001954411,0.9406567,0.0004387754,0.0001001394,0.0001904603,0.0006397324,0.002506161,0.01109473],"genre_scores_gemma":[0.2129201,0.0001705068,0.7752615,0.0001953901,0.00005876397,0.0002204613,0.00200407,0.0008133984,0.008355737],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0143526,"threshold_uncertainty_score":0.04801422,"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."}}