{"id":"W1810559539","doi":"10.1007/978-3-642-22300-6_46","title":"Closest Pair and the Post Office Problem for Stochastic Points","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Euclidean space; Point (geometry); Set (abstract data type); Euclidean distance; Stochastic geometry; Computer science; Euclidean geometry; Combinatorics; k-nearest neighbors algorithm; Point process; Stochastic process; Space (punctuation); Algorithm; Discrete mathematics; Mathematics; Artificial intelligence; Statistics; Geometry","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.003210697,0.001163409,0.003012216,0.001998241,0.002392848,0.003715605,0.004247395,0.006285064,0.01590173],"category_scores_gemma":[0.02332044,0.001283167,0.002246958,0.002823289,0.002962994,0.008314324,0.005736447,0.004774624,0.001605892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001900726,"about_ca_system_score_gemma":0.001702572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003706334,"about_ca_topic_score_gemma":0.003012786,"domain_scores_codex":[0.9977692,0.0008648277,0.0001285407,0.0004725921,0.0005195269,0.000245251],"domain_scores_gemma":[0.9911302,0.006524011,0.0007229891,0.0005809059,0.0004600433,0.0005817772],"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.0003300961,0.0001336511,0.0007723465,0.0002025611,0.00005959182,0.0002524683,0.0002600374,0.1959911,0.0005829488,0.7623932,0.008516802,0.03050511],"study_design_scores_gemma":[0.00005939046,0.00006938206,0.0001830085,0.00004151591,0.00002064063,0.0001416773,0.0001505454,0.3745508,0.0004012557,0.6203192,0.004029857,0.00003268946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0870551,0.001152903,0.8863273,0.002126766,0.0002748772,0.000158763,0.0005910294,0.0002681936,0.02204499],"genre_scores_gemma":[0.6047027,0.002245884,0.3179042,0.0003493609,0.0007442137,0.0005731318,0.002210083,0.0006617722,0.07060866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01590173,"threshold_uncertainty_score":0.05319655,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01711217188203807,"score_gpt":0.2304949142624519,"score_spread":0.2133827423804138,"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."}}