{"id":"W2048794017","doi":"10.1145/1367064.1367070","title":"Optimal branch-decomposition of planar graphs in <i>O</i> ( <i>n</i> <sup>3</sup> ) Time","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar; Decomposition; Planar graph; Mathematics; Graph; Discrete mathematics; Computer science","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.0003074253,0.0002276971,0.0003159742,0.0006550967,0.0002353424,0.00002515784,0.001296845,0.0001171508,0.00006403303],"category_scores_gemma":[0.00001741068,0.0002377803,0.0001787759,0.001503573,0.0002388793,0.0007169305,0.00002129399,0.0004591224,0.0001447128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006056275,"about_ca_system_score_gemma":0.00007456481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004148658,"about_ca_topic_score_gemma":0.00000363188,"domain_scores_codex":[0.9978721,0.0001736254,0.0004108738,0.0005315916,0.0005430895,0.0004687759],"domain_scores_gemma":[0.9982444,0.0003453964,0.00007647786,0.001088836,0.00009759999,0.0001472828],"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.0007529713,0.004273756,0.0004559498,0.0001090006,0.0003055932,0.0005855556,0.007468311,0.4673488,0.02826498,0.01228552,0.0008100294,0.4773395],"study_design_scores_gemma":[0.01071189,0.003678638,0.004876269,0.0004087151,0.00006082281,0.001655062,0.0002991588,0.6008521,0.2401721,0.1319506,0.002755299,0.002579401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08109193,0.00008483,0.9172496,0.0005011362,0.00008656245,0.000310883,0.00004667007,0.0001753458,0.0004530845],"genre_scores_gemma":[0.6677212,0.0002327561,0.3313138,0.0002442293,0.0000261848,0.00007519386,0.00001208446,0.00003633905,0.0003382768],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5866292,"threshold_uncertainty_score":0.96964,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01770934675867425,"score_gpt":0.2716123867468868,"score_spread":0.2539030399882126,"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."}}