{"id":"W4243982841","doi":"10.1145/2493132.2462378","title":"Kinetic data structures for all nearest neighbors and closest pair in the plane","year":2013,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"k-nearest neighbors algorithm; Plane (geometry); Combinatorics; Mathematics; Function (biology); Algebraic number; Binary logarithm; Trajectory; Amortized analysis; Degree (music); Discrete mathematics; Data structure; 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.0002221634,0.00007725255,0.00006993927,0.0000342025,0.00005344709,0.000217389,0.001261374,0.00002661803,0.00002482112],"category_scores_gemma":[0.00002401674,0.00004356157,0.00001093585,0.0001019949,0.0000473045,0.0003453687,0.0002258331,0.0000659228,0.000007591083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001539041,"about_ca_system_score_gemma":0.00000777372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001863355,"about_ca_topic_score_gemma":0.00006243359,"domain_scores_codex":[0.9993632,0.00004291423,0.00009658236,0.0002458029,0.00008320838,0.0001683295],"domain_scores_gemma":[0.9990457,0.0002370701,0.00002131139,0.0006486445,0.00001183597,0.00003546076],"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.000006598282,0.00005915441,0.006174385,0.00002709014,0.0000170017,0.00001077302,0.001457671,0.00004410949,0.0001952012,0.9012682,0.01641295,0.07432684],"study_design_scores_gemma":[0.0008130117,0.0002367059,0.2212957,0.00001155673,0.000009261166,0.00006027632,0.0003549894,0.1726998,0.000282716,0.5796358,0.02427745,0.0003227234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7909362,0.0004388012,0.1903944,0.01348898,0.0005458297,0.001575686,0.0000629432,0.0001841036,0.002373043],"genre_scores_gemma":[0.9772699,0.00000553578,0.02105653,0.001534368,0.00004226432,0.00001708017,0.00002148386,0.000003280188,0.00004948466],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3216324,"threshold_uncertainty_score":0.2343967,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03229127608139164,"score_gpt":0.2595002029662812,"score_spread":0.2272089268848896,"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."}}