{"id":"W2170069407","doi":"10.1145/1187436.1210588","title":"Partitioning planar graphs with costs and weights","year":2007,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Graph partition; Book embedding; Planar graph; Combinatorics; Planar straight-line graph; Bounded function; Partition (number theory); Computer science; Graph; Outerplanar graph; Mathematics; Discrete mathematics; Pathwidth; Line graph","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.000573101,0.0001266327,0.0001684497,0.0002381688,0.0001669998,0.00009280671,0.0006948364,0.00003784795,0.000004923612],"category_scores_gemma":[0.0000301345,0.00009660966,0.00004671745,0.0003179099,0.0001611756,0.0008090399,0.0001559222,0.0002412754,0.000002429983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008341191,"about_ca_system_score_gemma":0.00003782572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005135993,"about_ca_topic_score_gemma":0.000002622003,"domain_scores_codex":[0.9987394,0.00004137028,0.0002866052,0.0001731677,0.00045256,0.0003068897],"domain_scores_gemma":[0.9989657,0.0001885634,0.0001888236,0.0002885933,0.0001343399,0.0002339858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001081837,0.0009666643,0.02108388,0.00001913849,0.000425875,0.004171349,0.005973684,0.00004489014,0.1321826,0.7098251,0.0005383314,0.1236866],"study_design_scores_gemma":[0.004961801,0.004892641,0.01013682,0.0003011757,0.00002465471,0.00920005,0.00367027,0.001914692,0.8055413,0.1565134,0.001987427,0.0008558162],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6814688,0.002646539,0.3148119,0.0002039314,0.0002229626,0.0001018315,0.000001487008,0.00002680364,0.000515643],"genre_scores_gemma":[0.6954819,0.00007503462,0.3042468,0.0001018817,0.00006955996,0.000001184631,5.518529e-7,0.000009640866,0.00001340708],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6733587,"threshold_uncertainty_score":0.3939628,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01649643846463986,"score_gpt":0.2993828352694884,"score_spread":0.2828863968048486,"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."}}