{"id":"W2963846312","doi":"10.5555/3310435.3310527","title":"Every collinear set in a planar graph is free","year":2019,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Planarity testing; Planar graph; Combinatorics; Planar; Graph; Plane (geometry); Mathematics; Planar straight-line graph; Set (abstract data type); Graph drawing; Discrete mathematics; Computer science; Geometry; Line graph; 1-planar graph; Computer graphics (images)","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.0004397029,0.0009608232,0.0008344476,0.001686469,0.001729037,0.002214158,0.001621791,0.0008758261,0.009605356],"category_scores_gemma":[0.00248553,0.0009880988,0.001092648,0.002400934,0.002905539,0.003621491,0.003309779,0.001876369,0.00115456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006059108,"about_ca_system_score_gemma":0.0004105496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001425704,"about_ca_topic_score_gemma":0.001383037,"domain_scores_codex":[0.9986761,0.0001419031,0.00007410327,0.0005043046,0.000380295,0.0002233252],"domain_scores_gemma":[0.9974123,0.001146654,0.0004091542,0.0004956644,0.0003060207,0.0002301991],"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.000147735,0.0000589325,0.001306314,0.0003351271,0.00008022106,0.0007243265,0.0009816586,0.01864747,0.01150614,0.9024231,0.004255208,0.0595338],"study_design_scores_gemma":[0.00004835539,0.000124993,0.001121514,0.00006980729,0.0001090367,0.001187484,0.0004017695,0.02608632,0.01398213,0.908549,0.04824677,0.00007291189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.343309,0.0009857517,0.5998617,0.0008775893,0.0001952165,0.0001045584,0.001117441,0.001013956,0.05253479],"genre_scores_gemma":[0.8548332,0.0009504624,0.1271117,0.0002669501,0.0001377302,0.000156313,0.001623227,0.0003828382,0.01453764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009605356,"threshold_uncertainty_score":0.0321331,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01115712590858707,"score_gpt":0.2442797482895461,"score_spread":0.233122622380959,"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."}}