{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001722237,0.000615015,0.001030717,0.003096585,0.0009329346,0.002707511,0.001858568,0.001547164,0.005385],"category_scores_gemma":[0.02426153,0.0005933588,0.0007984271,0.001699545,0.002830102,0.004250308,0.002590113,0.002206287,0.0006274158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002363665,"about_ca_system_score_gemma":0.0005605879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00108394,"about_ca_topic_score_gemma":0.0006184157,"domain_scores_codex":[0.9980811,0.0004717531,0.00008733539,0.0004913009,0.0005366718,0.0003317707],"domain_scores_gemma":[0.9775344,0.01462913,0.003317868,0.001651851,0.001247757,0.001619053],"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.0005368593,0.000138864,0.004195656,0.0002426443,0.00006651606,0.0002680832,0.0003987049,0.1089194,0.007751345,0.8522168,0.005319327,0.01994579],"study_design_scores_gemma":[0.00008764568,0.0001447018,0.003183112,0.00006079672,0.00005358629,0.0004882346,0.0001992216,0.3273464,0.005275114,0.6591259,0.003971315,0.00006387382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.668217,0.002572923,0.282864,0.00382158,0.0001356075,0.0001960136,0.001132429,0.0008897544,0.04017074],"genre_scores_gemma":[0.9711053,0.0006725292,0.0233026,0.0003423102,0.0001202455,0.0001845366,0.0006029134,0.000178695,0.003490778],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005385,"threshold_uncertainty_score":0.01801467,"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."}}