{"id":"W2949808087","doi":"10.1142/s1793830920500056","title":"Plane and planarity thresholds for random geometric graphs","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics Algorithms and Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; University of Windsor","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planarity testing; Random geometric graph; Euclidean geometry; Unit square; Plane (geometry); Clique; Spatial network; Square (algebra); Graph; Random graph; Euclidean distance; Unit disk graph; Discrete mathematics; Geometry; Line graph; Computer science","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.0004216637,0.0002629703,0.000393749,0.0003259187,0.0002570746,0.0004466568,0.000432619,0.0001798762,0.000002948524],"category_scores_gemma":[0.00003257464,0.000240728,0.0000977664,0.0003756056,0.00005508315,0.0001227882,0.0005552912,0.0002090472,0.000005001261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001669363,"about_ca_system_score_gemma":0.00006882058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001050055,"about_ca_topic_score_gemma":0.000002600362,"domain_scores_codex":[0.9985029,0.00001742652,0.0003923945,0.0006300543,0.0002464077,0.0002108835],"domain_scores_gemma":[0.9984169,0.0004850107,0.0002566549,0.000583288,0.0001401925,0.0001179642],"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.00001102152,0.0002228212,0.0001296867,0.001540997,0.000199295,7.75472e-7,0.0007116849,0.005330939,0.0000572139,0.9050764,0.001286301,0.0854328],"study_design_scores_gemma":[0.0007911392,0.00004736272,0.0003322949,0.00005312915,0.00007035595,0.00001774139,0.00004042498,0.5912514,0.0001039018,0.4002019,0.006706977,0.0003834169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002670851,0.001290804,0.992562,0.0005253331,0.0001474745,0.001941821,0.000345321,0.00008533328,0.0004310659],"genre_scores_gemma":[0.1560119,0.001289949,0.837437,0.0002284464,0.0003849265,0.002634922,0.001337713,0.0000477004,0.0006274675],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5859204,"threshold_uncertainty_score":0.9816601,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02200798055860665,"score_gpt":0.2754168138140871,"score_spread":0.2534088332554805,"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."}}