{"id":"W2015391423","doi":"10.1145/2462356.2462378","title":"Kinetic data structures for all nearest neighbors and closest pair in the plane","year":2013,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; k-nearest neighbors algorithm; Plane (geometry); Mathematics; Algebraic number; Function (biology); Amortized analysis; Binary logarithm; Degree (music); Trajectory; Kinetic energy; Discrete mathematics; Data structure; Algorithm; Physics; Computer science; Mathematical analysis; Geometry; Artificial intelligence","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.0001707354,0.00007316386,0.00006223639,0.00003625283,0.00003791428,0.0005010873,0.00177492,0.00001628808,0.000029061],"category_scores_gemma":[0.00001844434,0.00004226286,0.000006872018,0.00009387264,0.0000255872,0.0007882306,0.0006283001,0.00004500635,0.00001552841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002123696,"about_ca_system_score_gemma":0.000005034125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005128974,"about_ca_topic_score_gemma":0.0001534041,"domain_scores_codex":[0.9993466,0.00001782713,0.00009484596,0.0002696721,0.0001069383,0.0001641719],"domain_scores_gemma":[0.9990288,0.0001047991,0.00002164243,0.000809831,0.000008509332,0.00002638809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003712297,0.00006731557,0.008788737,0.00005114539,0.00002626009,0.00001460766,0.0005149517,0.00002110593,0.00003592818,0.2864527,0.429558,0.2744655],"study_design_scores_gemma":[0.0007912335,0.0001479511,0.2609814,0.000009027031,0.00001211475,0.00001038215,0.0002201015,0.3996817,0.00003613247,0.03464796,0.3031657,0.0002962715],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1979335,0.0007490983,0.6987944,0.07687669,0.001487528,0.005585121,0.0003378369,0.0005409711,0.01769491],"genre_scores_gemma":[0.8930453,0.00003332729,0.1013307,0.004519125,0.0001436093,0.00004534499,0.0003641657,0.000008124287,0.0005103486],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6951118,"threshold_uncertainty_score":0.4831997,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04426051183283414,"score_gpt":0.2701916494062924,"score_spread":0.2259311375734582,"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."}}