{"paper":{"title":"Finding the Farthest in High Dimensions: Dynamic Diameter and Farthest-Neighbor Search","arxiv_id":"2611.17050","primary_cat":"cs.DS","submitted_at":"2026-11-12T16:32:35+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":1.0,"id":"s0","own":true,"role":"contribution","text":"We give faster algorithms for diameter and farthest-neighbor search in high-dimensional Euclidean space.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.75,"quantitative":false,"quantitative_p":0.08,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":1.0,"interpretation":0.0}},{"i":1,"p":0.64,"id":"s1","own":true,"role":"contribution","text":"For every fixed $1<c<\\sqrt2$, we maintain an actual factor-$c$ diameter pair under arbitrary point insertions and deletions, with worst-case update time $n^{2/c^2-1}\\poly(d,\\log n)$ and space $n^{2/c^2}\\poly(d,\\log n)$, suppressing logarithmic dependence on the execution length and failure probability.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.37,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.36,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.64,"interpretation":0.0}},{"i":2,"p":0.7,"id":"s2","own":false,"role":"background","text":"Here $n$ bounds the number of active points.","hedge":{"p":0.81,"label":"asserted"},"own_p":0.16,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.44,"role_probabilities":{"gap":0.0,"method":0.04,"result":0.05,"background":0.7,"limitation":0.0,"future_work":0.0,"contribution":0.03,"interpretation":0.18}},{"i":3,"p":0.46,"id":"s3","own":true,"role":"result","text":"The update exponent improves Indyk's algorithm~\\cite{indyk} (SODA'03) bound from $1/c^2$ to $2/c^2-1$, while the space exponent improves from $1+1/c^2$ to $2/c^2$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.73,"main_claim_p":0.15,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.46,"background":0.01,"limitation":0.0,"future_work":0.0,"contribution":0.45,"interpretation":0.08}},{"i":4,"p":0.95,"id":"s4","own":true,"role":"result","text":"At $c=\\sqrt{3/2}$, the update exponent decreases from $2/3$ to $1/3$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.82,"main_claim_p":0.07,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.95,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.04}},{"i":5,"p":0.54,"id":"s5","own":true,"role":"contribution","text":"A separate construction achieves approximation exactly $\\sqrt2$ with update time polynomial in $d$ and $\\log n$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.9,"main_claim_p":0.07,"quantitative":true,"quantitative_p":0.95,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.46,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.54,"interpretation":0.0}},{"i":6,"p":0.68,"id":"s6","own":true,"role":"result","text":"All these guarantees hold against adaptive updates, even when every previous random choice is exposed.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.88,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.1,"role_probabilities":{"gap":0.0,"method":0.01,"result":0.68,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.3,"interpretation":0.01}},{"i":7,"p":0.8,"id":"s7","own":true,"role":"contribution","text":"We also improve the time--space tradeoff near linear space.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.91,"main_claim_p":0.07,"quantitative":false,"quantitative_p":0.13,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.2,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.8,"interpretation":0.0}},{"i":8,"p":0.72,"id":"s8","own":true,"role":"contribution","text":"This construction has an always-correct variant with expected amortized update bounds and requires no advance bound on the number of updates.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.9,"main_claim_p":0.05,"quantitative":true,"quantitative_p":0.5,"role_probabilities":{"gap":0.0,"method":0.09,"result":0.19,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.72,"interpretation":0.0}},{"i":9,"p":0.66,"id":"s9","own":true,"role":"result","text":"The dynamic structures store a current answer, so reporting its two point identifiers takes constant time.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.91,"main_claim_p":0.04,"quantitative":true,"quantitative_p":0.86,"role_probabilities":{"gap":0.0,"method":0.06,"result":0.66,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.27,"interpretation":0.01}},{"i":10,"p":0.9,"id":"s10","own":true,"role":"contribution","text":"The geometric method also gives static diameter algorithms and a farthest-neighbor structure for a fixed set that answers arbitrary adaptive queries.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.94,"main_claim_p":0.08,"quantitative":false,"quantitative_p":0.11,"role_probabilities":{"gap":0.0,"method":0.02,"result":0.08,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.9,"interpretation":0.0}},{"i":11,"p":0.87,"id":"s11","own":true,"role":"result","text":"At approximation $\\sqrt2-\\varepsilon$, the diameter time is $n^{1+O(\\varepsilon)}$, and the query time is $n^{O(\\varepsilon)+o(1)}$ with near-linear preprocessing and space, up to polynomial input-parameter factors.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.91,"main_claim_p":0.1,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.87,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.13,"interpretation":0.0}},{"i":12,"p":0.74,"id":"s12","own":true,"role":"result","text":"On binary points, this improves the $n^{O(\\sqrt\\theta)}$ overhead of the algorithm that Andoni, Jiang, and Zharkov~\\cite{ajz2026} (STOC'26) for Hamming approximation $2-\\theta$ to $n^{O(\\theta)+o(1)}$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.79,"main_claim_p":0.06,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.74,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.26,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":1.0,"text":"We give faster algorithms for diameter and farthest-neighbor search in high-dimensional Euclidean space.","location":"abstract s0","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":9793,"cost_usd_reported":0.0},"compiled_at":"2026-11-13","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.05,"states_limitation":0.42,"human_participants":0.01,"controlled_comparison":0.09,"randomized_assignment":0.04,"states_quantitative_result":0.98,"compares_with_prior_results":0.98,"mentions_code_or_data_availability":0.02},"evidential_basis":{"p":1.0,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":1.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.0}},"contribution_type":{"p":0.86,"value":"method or tool","probabilities":{"review":0.0,"method_or_tool":0.86,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.14,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.85,"text":"We give faster algorithms for diameter and farthest-neighbor search in high-dimensional Euclidean space.","location":"abstract s0"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":13,"sentences_in_abstract":13},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448,"review_comments_judged":{"judged_by":["gpt-5.6-luna","grok-4.7"],"judged_against":"Pith's own text copy of each paper: text extracted from the PDF, the first 90,000 characters","measured_on":"2026-10-04","accurate":113,"decided":149,"sampled_reviews":200,"split_by_lane":false,"by_lane":"https://pith.science/accuracy#by-lane"}}}