{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002770213,0.0001887778,0.0002000565,0.0003362792,0.00007087105,0.0001376904,0.0006907137,0.00008727908,0.00004759656],"category_scores_gemma":[0.00001323829,0.0001783714,0.00009353019,0.0009090364,0.00002122242,0.0004361829,0.0001405135,0.0001689649,0.000361501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000583012,"about_ca_system_score_gemma":0.0000870386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005625756,"about_ca_topic_score_gemma":0.00001247479,"domain_scores_codex":[0.9983007,0.0000759792,0.0002780882,0.0005592823,0.0004783701,0.0003076015],"domain_scores_gemma":[0.9989501,0.0001076476,0.00008075672,0.0007019776,0.00006057488,0.00009894884],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006600439,0.001653897,0.01910266,0.0004311272,0.0005605876,0.0005866165,0.01797285,0.2713339,0.05242255,0.4067499,0.1812798,0.04724601],"study_design_scores_gemma":[0.003623961,0.001100681,0.01178139,0.0001405119,0.00001473636,0.00004598148,0.0001089107,0.9017927,0.01430708,0.03880893,0.02717084,0.001104295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4964783,0.0007509053,0.4358565,0.03076671,0.005905982,0.00241138,0.0004440217,0.0006547869,0.02673146],"genre_scores_gemma":[0.9217901,0.0001685311,0.06408221,0.006011158,0.0005631305,0.00009705785,0.0002076927,0.00005054774,0.007029602],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6304587,"threshold_uncertainty_score":0.7273776,"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."}}