{"id":"W2950684605","doi":"10.48550/arxiv.1612.09277","title":"On Planar Greedy Drawings of 3-Connected Planar Graphs","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Embedding; Conjecture; Greedy algorithm; Planar straight-line graph; Euclidean geometry; Regular polygon; Graph drawing; Discrete mathematics; Graph; Computer science; Pathwidth; Line graph; Geometry; Algorithm","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.0003741175,0.001100649,0.0005461258,0.001482626,0.0009068763,0.002019786,0.001234171,0.001244373,0.008113826],"category_scores_gemma":[0.004515225,0.0007653378,0.0007263273,0.002514453,0.002134497,0.002556873,0.0022831,0.001592716,0.001681556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001186327,"about_ca_system_score_gemma":0.00033246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002060646,"about_ca_topic_score_gemma":0.002072247,"domain_scores_codex":[0.9992132,0.0002217777,0.00003424159,0.0001693759,0.0002436235,0.0001177983],"domain_scores_gemma":[0.9984016,0.0007192282,0.0003603888,0.0002481129,0.000152847,0.0001179271],"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.0000778215,0.00002528172,0.0008080491,0.0001203882,0.0000205078,0.0002715923,0.0003005216,0.06097957,0.002797827,0.8870679,0.006437665,0.04109297],"study_design_scores_gemma":[0.00003565059,0.00004289771,0.0005544546,0.00005486397,0.00002080758,0.0003344944,0.0001681204,0.1049684,0.001730943,0.8712762,0.02078357,0.00002972433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1881256,0.001594223,0.7377917,0.001208426,0.0001511761,0.0001736845,0.001113953,0.001080864,0.06876023],"genre_scores_gemma":[0.7448871,0.003236708,0.2251405,0.0005551176,0.0002626417,0.0003488171,0.003205776,0.0004745846,0.02188863],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008113826,"threshold_uncertainty_score":0.02714348,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0450492770512331,"score_gpt":0.1806634261169417,"score_spread":0.1356141490657086,"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."}}