{"id":"W2566851301","doi":"10.1007/s00454-018-0001-5","title":"On Planar Greedy Drawings of 3-Connected Planar Graphs","year":2018,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"H2020 Marie Skłodowska-Curie Actions; Ministero dell’Istruzione, dell’Università e della Ricerca; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Planar straight-line graph; Greedy algorithm; Embedding; Conjecture; Discrete mathematics; Graph; Pathwidth; Computer science; Line graph; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.000441028,0.001300027,0.0007970968,0.001766535,0.0008103919,0.001982125,0.001521608,0.001324373,0.01396349],"category_scores_gemma":[0.004398565,0.0009620521,0.0008246723,0.002514101,0.001136354,0.001890964,0.002339351,0.001593829,0.002326176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009793148,"about_ca_system_score_gemma":0.0005666693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002705186,"about_ca_topic_score_gemma":0.004805851,"domain_scores_codex":[0.9993674,0.0001881293,0.00002708166,0.00009384158,0.0002341005,0.00008952309],"domain_scores_gemma":[0.9986032,0.0006852483,0.0002059363,0.0001689208,0.0002176653,0.00011907],"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.0001825152,0.00007968101,0.001003213,0.0003178211,0.00004596392,0.0004046619,0.0004633845,0.1903913,0.00801341,0.6611903,0.01599105,0.1219167],"study_design_scores_gemma":[0.00007170249,0.00007953768,0.000658408,0.0001024265,0.00004126758,0.0003067022,0.0003151454,0.3450598,0.002892103,0.6306337,0.01980077,0.00003838558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1193598,0.0007505252,0.8263723,0.0006881344,0.0001673986,0.0002263887,0.000850008,0.0007888017,0.05079662],"genre_scores_gemma":[0.4988604,0.002620773,0.4574004,0.0003921506,0.0001578485,0.0002895585,0.003093456,0.0006903072,0.03649516],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01396349,"threshold_uncertainty_score":0.04671252,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01216774622532041,"score_gpt":0.2531643707748612,"score_spread":0.2409966245495408,"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."}}