{"id":"W2058678665","doi":"10.1007/s00454-009-9149-3","title":"Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Combinatorics; Planar graph; Mathematics; Book embedding; Embedding; Planar; Planar straight-line graph; Enhanced Data Rates for GSM Evolution; 1-planar graph; Point (geometry); Outerplanar graph; Plane (geometry); Graph; Discrete mathematics; Pathwidth; Chordal graph; Geometry; Computer science; Line graph; Computer graphics (images)","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.0007430688,0.0007539913,0.001173001,0.002112802,0.001988222,0.00317423,0.002390781,0.001833035,0.008795505],"category_scores_gemma":[0.005295218,0.00121175,0.00130127,0.001768417,0.002372839,0.003351161,0.004202615,0.001912725,0.001181913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001747867,"about_ca_system_score_gemma":0.0005592236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001642814,"about_ca_topic_score_gemma":0.00188458,"domain_scores_codex":[0.9985629,0.0001991783,0.0001344256,0.0003715687,0.0004418592,0.0002901288],"domain_scores_gemma":[0.997449,0.001124012,0.0003849961,0.0004418213,0.0002773853,0.0003227588],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00026617,0.00008472609,0.001407332,0.0001617389,0.00002749012,0.0002729239,0.0009466263,0.01824513,0.003534915,0.9266908,0.003455033,0.04490711],"study_design_scores_gemma":[0.00006965514,0.00007346496,0.001505205,0.0001390909,0.00004539571,0.0003349895,0.0006055025,0.04977284,0.005475841,0.9319155,0.01000621,0.00005641032],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.46488,0.0005897942,0.4471799,0.0005417792,0.000148742,0.000210658,0.001740951,0.0008467279,0.0838614],"genre_scores_gemma":[0.8835155,0.0005004483,0.09822534,0.000183735,0.00004793362,0.0003081766,0.001900733,0.0003870259,0.01493101],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008795505,"threshold_uncertainty_score":0.02942389,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01397936658932336,"score_gpt":0.2536207482553113,"score_spread":0.239641381665988,"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."}}