{"id":"W2339879713","doi":"10.1016/j.comgeo.2016.04.001","title":"Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"k-nearest neighbors algorithm; Mathematics; Nearest-neighbor chain algorithm; Combinatorics; Computer science; Artificial intelligence; Statistics","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.0005490861,0.0001673191,0.0001976716,0.0001729622,0.0002697806,0.0001542947,0.0004996394,0.00004678054,0.0000135219],"category_scores_gemma":[0.0003829754,0.000106978,0.00006649912,0.0008781488,0.0001862786,0.000605787,0.0002321533,0.00009072899,0.00001268686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003395103,"about_ca_system_score_gemma":0.0001035042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005208044,"about_ca_topic_score_gemma":0.000003281318,"domain_scores_codex":[0.9982754,0.0001017732,0.0004728608,0.0004053937,0.0005179342,0.000226617],"domain_scores_gemma":[0.9974096,0.001650802,0.0002968019,0.0002741119,0.0002835658,0.0000850743],"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.00005079012,0.0002106574,0.02273,0.0001576897,0.00009868119,0.00001026019,0.0009255566,0.0327515,0.001567859,0.5775143,0.0009926597,0.3629901],"study_design_scores_gemma":[0.00128534,0.0002070233,0.1604994,0.0002577544,0.00002015653,0.00005316572,0.0001146915,0.7229593,0.001447815,0.1075384,0.005077024,0.0005398825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2117108,0.0005193944,0.7845389,0.002615243,0.0002203973,0.0001386267,0.00002329026,0.00005533335,0.0001779571],"genre_scores_gemma":[0.9175466,0.0000123155,0.08183907,0.0002255743,0.0001461791,0.00001330477,0.00001247728,0.000009199251,0.000195262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7058358,"threshold_uncertainty_score":0.4362436,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01216303096800642,"score_gpt":0.2329168146598109,"score_spread":0.2207537836918045,"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."}}