{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003739625,0.0002735048,0.0003081719,0.0009973727,0.0003007301,0.0001191301,0.0007655464,0.0001045437,0.0001152471],"category_scores_gemma":[0.0001759806,0.0002691259,0.0001613434,0.002317004,0.0001872955,0.0004646705,0.00009525564,0.000178404,0.0001880412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004745646,"about_ca_system_score_gemma":0.0001538332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003047026,"about_ca_topic_score_gemma":0.000006065543,"domain_scores_codex":[0.9974353,0.000106866,0.0005466191,0.0006339664,0.0009235764,0.0003536841],"domain_scores_gemma":[0.9979312,0.0006565021,0.0002877722,0.0004152754,0.0005436895,0.0001655372],"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.00009829587,0.0001821017,0.001008771,0.00003256095,0.0001279089,0.0000148379,0.0005602118,0.02921388,0.00106387,0.9531603,0.004980302,0.009556985],"study_design_scores_gemma":[0.001888938,0.001648423,0.1111559,0.0001303354,0.00003561721,0.00007657907,0.00007313177,0.3032483,0.004284464,0.5739875,0.002581022,0.0008898479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3522832,0.00007398011,0.6429672,0.0005534042,0.0006232118,0.0001918531,0.00005260311,0.0001606592,0.003093881],"genre_scores_gemma":[0.9504847,0.000002752443,0.04793729,0.000941917,0.0002023423,0.0000103778,0.00025813,0.00001710139,0.0001454279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5982015,"threshold_uncertainty_score":0.9999761,"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."}}