{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003042189,0.001136128,0.001126493,0.0007801069,0.0005761846,0.001193292,0.0009247511,0.0008166653,0.008687625],"category_scores_gemma":[0.001361853,0.0005698554,0.0009843821,0.001268467,0.0004666717,0.002157553,0.001625892,0.001191138,0.002858077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006380015,"about_ca_system_score_gemma":0.0007178057,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001547959,"about_ca_topic_score_gemma":0.003320026,"domain_scores_codex":[0.9996754,0.00004830675,0.00001833017,0.00007147007,0.00008910106,0.00009732266],"domain_scores_gemma":[0.9994868,0.0002096506,0.00005681672,0.0001112128,0.00006282515,0.0000727031],"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.001258836,0.0003232629,0.002589683,0.001165727,0.0001199964,0.0003667648,0.0006210859,0.1457901,0.08544161,0.04970964,0.03341749,0.6791958],"study_design_scores_gemma":[0.0004637433,0.0004343305,0.002622217,0.0001716712,0.0001393802,0.0005897657,0.0007021396,0.706715,0.04577343,0.2220821,0.02024752,0.00005877715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2117887,0.0009976897,0.757351,0.0008073091,0.00007801437,0.0002837073,0.001416344,0.003803969,0.02347323],"genre_scores_gemma":[0.2555512,0.0006547854,0.7319876,0.0001857003,0.00003686003,0.0002611397,0.003968653,0.0006295289,0.006724501],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008687625,"threshold_uncertainty_score":0.02906299,"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."}}