{"id":"W2114909581","doi":"10.7155/jgaa.00256","title":"Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Algorithms and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Planar straight-line graph; Planar graph; Combinatorics; Vertex (graph theory); Planar; Graph; Outerplanar graph; Computer science; Mathematics; 1-planar graph; Pathwidth; Line graph; Computer graphics (images)","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.0007182645,0.00009772216,0.0002226056,0.0001899062,0.0002373706,0.00003001208,0.0004887167,0.00003983051,0.00000385806],"category_scores_gemma":[0.00001954754,0.00006924185,0.0001310923,0.0009311523,0.0002667111,0.0004480588,0.0000392753,0.000222839,0.000001154407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007823473,"about_ca_system_score_gemma":0.00004798123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007480608,"about_ca_topic_score_gemma":0.000001613866,"domain_scores_codex":[0.9988262,0.0000705243,0.0004687526,0.0001081961,0.0003072518,0.0002190584],"domain_scores_gemma":[0.9985543,0.000377965,0.0003902236,0.0002952454,0.0002542479,0.0001280035],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003975823,0.0008219864,0.004757102,0.00007194843,0.0002766655,0.000002892483,0.003971402,0.00008629855,0.01525648,0.9089746,0.0002804664,0.06546035],"study_design_scores_gemma":[0.003626715,0.0005875665,0.0221235,0.0003799707,0.000328007,0.00208389,0.007052348,0.01245841,0.008656466,0.9349847,0.006966367,0.0007520357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05727512,0.001274085,0.9400798,0.0007119135,0.00005447134,0.0002165386,0.000024565,0.000009092199,0.00035443],"genre_scores_gemma":[0.7717257,0.0003067516,0.2277542,0.00005823413,0.00008817756,0.00004035694,0.000001242581,0.000009459171,0.00001588212],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7144505,"threshold_uncertainty_score":0.28236,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02824495418211327,"score_gpt":0.3234862292229718,"score_spread":0.2952412750408586,"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."}}