{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001108045,0.000667482,0.0009080999,0.002470084,0.0005266487,0.0001829944,0.003490157,0.0004255524,0.00003886887],"category_scores_gemma":[0.0001193384,0.0007878465,0.00040794,0.004344786,0.0004428488,0.001628233,0.004443107,0.001166403,0.00004283594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004864463,"about_ca_system_score_gemma":0.0003908605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003284204,"about_ca_topic_score_gemma":0.00005345243,"domain_scores_codex":[0.9954789,0.0002131296,0.0006582165,0.002206959,0.0004271047,0.001015714],"domain_scores_gemma":[0.9960802,0.0005426156,0.0004986848,0.00222763,0.000395959,0.000254863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001643013,0.004625625,0.07767809,0.001631931,0.0008501667,0.001030092,0.0009124405,0.6378244,0.0000781697,0.2230852,0.0007944811,0.04984646],"study_design_scores_gemma":[0.002400941,0.0008281998,0.0221236,0.000465233,0.0001092448,0.000002002637,0.00008157729,0.9686996,0.0008082665,0.001564727,0.002038944,0.0008776546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8367705,0.00005305362,0.1592054,0.00008427386,0.0009338993,0.0009824571,0.00007500921,0.00007193993,0.001823476],"genre_scores_gemma":[0.9903504,0.002778983,0.004061936,0.00007699549,0.00008777122,0.000003718248,0.00006839453,0.0000343737,0.002537468],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3308752,"threshold_uncertainty_score":0.9994572,"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."}}