{"id":"W7074240961","doi":"","title":"CLEANN: Lock-Free Augmented Trees for Low-Dimensional k-Nearest Neighbor Search","year":2025,"lang":"en","type":"other","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Matching (statistics); Feature (linguistics); Tree (set theory); Object (grammar); Set (abstract data type)","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.001362346,0.001551138,0.001885142,0.001371022,0.001275136,0.002112809,0.004260168,0.001999821,0.0289176],"category_scores_gemma":[0.00935342,0.0009317385,0.00106523,0.002176374,0.0007578246,0.00283052,0.003244197,0.00254727,0.01772502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007727716,"about_ca_system_score_gemma":0.001543315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009727217,"about_ca_topic_score_gemma":0.0264188,"domain_scores_codex":[0.9982969,0.0003998819,0.0001208663,0.0003344846,0.000696055,0.0001517111],"domain_scores_gemma":[0.997993,0.0006808274,0.00007195543,0.0007769519,0.0003635504,0.000113716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001023222,0.0003545734,0.000612879,0.0004485702,0.0001701077,0.0001279827,0.0001433485,0.08012973,0.004101803,0.02136238,0.2437764,0.6477489],"study_design_scores_gemma":[0.0002226636,0.00008211554,0.0001909338,0.00005372096,0.00002390478,0.00007041937,0.00004363553,0.9212588,0.002446208,0.04018274,0.03539215,0.00003264126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006281502,0.001514918,0.9250989,0.0005096294,0.0007666292,0.0002457218,0.003645409,0.05281248,0.009124782],"genre_scores_gemma":[0.06137075,0.0004818469,0.9075271,0.0005091925,0.0001402606,0.0004396659,0.01398087,0.003839394,0.01171103],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0289176,"threshold_uncertainty_score":0.09673905,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006937396724880885,"score_gpt":0.2443105927489232,"score_spread":0.2373731960240423,"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."}}