{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002519842,0.0001710628,0.0002848707,0.0005630005,0.0001137338,0.00004926249,0.0004513509,0.00005747078,0.00001110724],"category_scores_gemma":[0.00004759851,0.0001638952,0.0001197942,0.001227153,0.00007890062,0.0005778644,0.00004145953,0.00007814867,0.000002629682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002754461,"about_ca_system_score_gemma":0.0001651455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001218367,"about_ca_topic_score_gemma":0.000002476627,"domain_scores_codex":[0.9983564,0.00004416192,0.0003980366,0.0003689898,0.0006120955,0.0002203379],"domain_scores_gemma":[0.9985271,0.0003854979,0.0003078745,0.0002147762,0.0004707035,0.00009408026],"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.0002923624,0.000326016,0.001512836,0.0001150707,0.0001873222,0.000005073652,0.0007900565,0.1418076,0.001284922,0.8343402,0.0003515565,0.01898699],"study_design_scores_gemma":[0.003906511,0.002770755,0.2136619,0.0002343953,0.0001151866,0.00003444738,0.0002103519,0.3388751,0.008953794,0.4299712,0.0005220644,0.0007442615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3209837,0.00008784315,0.6775479,0.0006528552,0.00007984243,0.0002121162,0.00005164552,0.00003783829,0.0003462422],"genre_scores_gemma":[0.7841117,0.000003113113,0.2154883,0.0001872503,0.00002336915,0.000003583388,0.000152562,0.000006281685,0.00002380712],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4631279,"threshold_uncertainty_score":0.668345,"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."}}