{"id":"W4296289779","doi":"10.48550/arxiv.0812.0146","title":"Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact\\n Similarity Search in High Dimensions","year":2008,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Omega; Combinatorics; Nearest neighbor search; Tree (set theory); Search engine indexing; Dimension (graph theory); Context (archaeology); Metric (unit); Metric space; Intrinsic dimension; Discrete mathematics; Upper and lower bounds; Curse of dimensionality; Computer science; Artificial intelligence; Statistics; Mathematical analysis","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.01791254,0.002381648,0.003863714,0.002826016,0.002587563,0.007378317,0.006137359,0.004744171,0.008052928],"category_scores_gemma":[0.1109217,0.00114878,0.001949501,0.005822327,0.004788495,0.0185913,0.009951455,0.004371116,0.002763386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007749323,"about_ca_system_score_gemma":0.006718721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003655773,"about_ca_topic_score_gemma":0.004478643,"domain_scores_codex":[0.9808091,0.006101526,0.001685159,0.002937555,0.005901768,0.002564906],"domain_scores_gemma":[0.8919812,0.07488582,0.005429346,0.02137086,0.004047075,0.002285642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003621412,0.0007260736,0.00817458,0.001739177,0.0003308533,0.0002199874,0.0005862353,0.5131612,0.0133078,0.2577232,0.0199279,0.1804816],"study_design_scores_gemma":[0.00008038637,0.0003581703,0.0008692503,0.0001056307,0.00005526386,0.0001991427,0.0001042919,0.9073458,0.002786652,0.08591783,0.002114787,0.00006283346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.200104,0.01880261,0.7268177,0.01096963,0.000889993,0.0007434652,0.002784656,0.004796761,0.03409118],"genre_scores_gemma":[0.8392391,0.004462477,0.1443297,0.001441278,0.0008059826,0.0006940037,0.002497373,0.0007684082,0.005761716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01791254,"threshold_uncertainty_score":0.09473169,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09612717945864159,"score_gpt":0.2153419356837935,"score_spread":0.1192147562251519,"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."}}