{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009283517,0.000560709,0.0007997187,0.0007188753,0.000156478,0.00003504735,0.001136924,0.0005341156,0.0007100216],"category_scores_gemma":[0.00004893653,0.0005308873,0.0003716704,0.0006581643,0.0009163488,0.00008157615,0.0006077407,0.0005829835,0.00006849992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005855444,"about_ca_system_score_gemma":0.0003944096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000157665,"about_ca_topic_score_gemma":0.00003872092,"domain_scores_codex":[0.9978142,0.00002580422,0.0004558006,0.0007234139,0.0004216883,0.0005590639],"domain_scores_gemma":[0.9982877,0.00009152296,0.0003098366,0.001001979,0.0001996213,0.0001093389],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007852398,0.0004602063,0.0003052915,0.0001727336,0.0008027173,0.000005448557,0.00001107222,0.0004139482,0.0001630261,0.7441671,0.2294989,0.023921],"study_design_scores_gemma":[0.003105669,0.0002456272,0.0001252245,0.001157226,0.000291868,0.00000120883,0.00006943781,0.001195839,0.003793318,0.238779,0.7503226,0.000912989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00697496,0.001880955,0.1554249,0.02074022,0.004389069,0.005752536,0.02515387,0.002575292,0.7771083],"genre_scores_gemma":[0.4429878,0.00002528758,0.04705334,0.0003826463,0.002063097,0.0006156617,0.003198204,0.0008962693,0.5027777],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.5208237,"threshold_uncertainty_score":0.9997143,"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."}}