{"id":"W2963225177","doi":"","title":"Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in $\\mathbb{R}^d$.","year":2013,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"k-nearest neighbors algorithm; Graph; Nearest neighbor graph; Mathematics; Combinatorics; Kinetic energy; Computer science; Physics; 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.000126413,0.00008970364,0.00007654223,0.0001133688,0.0001157991,0.0001231129,0.0008082382,0.00003702151,0.00001462979],"category_scores_gemma":[0.00003545351,0.00007512038,0.00002234764,0.00048279,0.00004948473,0.0006210501,0.0003422771,0.0000725609,0.000008409937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001507808,"about_ca_system_score_gemma":0.00003018447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000200459,"about_ca_topic_score_gemma":0.0001223673,"domain_scores_codex":[0.9992762,0.00003661053,0.00008706736,0.0003915402,0.00004776385,0.0001608446],"domain_scores_gemma":[0.9990687,0.0002667521,0.00004579033,0.0005061472,0.0000553275,0.00005724849],"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.00001831159,0.00005040526,0.00577651,0.00002581419,0.00005790086,0.00001713588,0.0003480473,0.3637289,0.0003866756,0.6152371,0.003538351,0.01081483],"study_design_scores_gemma":[0.0003389688,0.00002999399,0.04194398,0.000004253669,0.00001280649,0.000003921755,0.00004242382,0.8991895,0.00004317183,0.0559046,0.002380522,0.0001058428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4095077,0.0001268097,0.5893564,0.0004334028,0.0001399133,0.00027691,0.000007022069,0.00003077342,0.0001210096],"genre_scores_gemma":[0.9974903,0.00006697363,0.001925236,0.0002677947,0.00003805689,0.000001282016,0.00001947668,0.00000386217,0.0001870455],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5879825,"threshold_uncertainty_score":0.306332,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08440288280805093,"score_gpt":0.1990807621344529,"score_spread":0.114677879326402,"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."}}