{"id":"W2950389635","doi":"10.48550/arxiv.1104.3283","title":"Practical and Efficient Split Decomposition via Graph-Labelled Trees","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Ackermann function; Lexicographical order; Decomposition; Graph; Modular decomposition; Mathematics; Combinatorics; Context (archaeology); Graph factorization; Inverse; Algorithm; Computer science; Discrete mathematics; Voltage graph; 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.0005523104,0.0004345416,0.0005465579,0.0009110529,0.0005746739,0.001195711,0.0009163635,0.0006286911,0.004350822],"category_scores_gemma":[0.002538675,0.0004349076,0.0006517609,0.001093009,0.0008366849,0.002746682,0.001754674,0.001127992,0.001886245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000678906,"about_ca_system_score_gemma":0.0008070359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001184896,"about_ca_topic_score_gemma":0.002313444,"domain_scores_codex":[0.9992028,0.0001547141,0.00004567638,0.0001920837,0.0002903809,0.0001143843],"domain_scores_gemma":[0.9987916,0.0004992186,0.00008678362,0.0003689933,0.000165137,0.00008824623],"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.0003771637,0.0001782535,0.001512041,0.0003594394,0.00004196531,0.0003095779,0.0008305044,0.06635121,0.06269047,0.2153769,0.01231692,0.6396555],"study_design_scores_gemma":[0.00007696014,0.0001509565,0.000728239,0.00004609106,0.00003334328,0.0003783733,0.0002853532,0.5763687,0.04613282,0.3551068,0.02065032,0.00004204074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02716389,0.0001097525,0.9667976,0.0001106022,0.0000207808,0.00006808487,0.0001261365,0.001875488,0.003727683],"genre_scores_gemma":[0.2065298,0.0001135504,0.7884349,0.00009716001,0.00002297673,0.00009578358,0.0007791737,0.0004248679,0.003501903],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004350822,"threshold_uncertainty_score":0.01455492,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08764214792040059,"score_gpt":0.2542323115714228,"score_spread":0.1665901636510222,"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."}}