{"id":"W2950539700","doi":"10.48550/arxiv.1407.6761","title":"Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs","year":2014,"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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Planar; Treewidth; Constant (computer programming); Minor (academic); Graph; Discrete mathematics; Physics; 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.0004365961,0.002922666,0.001415766,0.001351729,0.0009928842,0.001999463,0.003083684,0.001130894,0.02187781],"category_scores_gemma":[0.002239999,0.0007482418,0.001715252,0.002642833,0.0007263487,0.004616456,0.002851242,0.002415525,0.008790344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002487472,"about_ca_system_score_gemma":0.002314053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01030134,"about_ca_topic_score_gemma":0.01459237,"domain_scores_codex":[0.9988445,0.00009951286,0.00005179209,0.0003175156,0.000306838,0.0003797574],"domain_scores_gemma":[0.9987788,0.000345654,0.00009569967,0.0004282281,0.0002093866,0.00014219],"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.002241497,0.0007257488,0.002757628,0.001338875,0.0001918357,0.0003576697,0.0008070389,0.09829661,0.04345404,0.04041812,0.09047385,0.718937],"study_design_scores_gemma":[0.0008203943,0.0004939749,0.001822005,0.0001559791,0.0002458656,0.0006779962,0.0006950939,0.8040445,0.03108907,0.1132973,0.04657218,0.00008572078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1027026,0.00231522,0.8273689,0.002009176,0.0002543954,0.0005877123,0.004126215,0.02619689,0.03443898],"genre_scores_gemma":[0.2952505,0.0009614042,0.6695915,0.0006305529,0.0001050983,0.0005756003,0.01313142,0.002178623,0.01757526],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02187781,"threshold_uncertainty_score":0.07318854,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04802291551903676,"score_gpt":0.2327109696470523,"score_spread":0.1846880541280156,"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."}}