{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SPHZVXDZPC5WZKQC2GFWEEVCW6","short_pith_number":"pith:SPHZVXDZ","schema_version":"1.0","canonical_sha256":"93cf9adc7978bb6caa02d18b6212a2b7adfd8be5ff38fe3acb6479f27038ba63","source":{"kind":"arxiv","id":"1008.1480","version":1},"attestation_state":"computed","paper":{"title":"Fast, precise and dynamic distance queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lee-Ad Gottlieb, Liam Roditty, Moshe Lewenstein, Tsvi Kopelowitz, Yair Bartal","submitted_at":"2010-08-09T10:21:33Z","abstract_excerpt":"We present an approximate distance oracle for a point set S with n points and doubling dimension {\\lambda}. For every {\\epsilon}>0, the oracle supports (1+{\\epsilon})-approximate distance queries in (universal) constant time, occupies space [{\\epsilon}^{-O({\\lambda})} + 2^{O({\\lambda} log {\\lambda})}]n, and can be constructed in [2^{O({\\lambda})} log3 n + {\\epsilon}^{-O({\\lambda})} + 2^{O({\\lambda} log {\\lambda})}]n expected time. This improves upon the best previously known constructions, presented by Har-Peled and Mendel. Furthermore, the oracle can be made fully dynamic with expected O(1) q"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1008.1480","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-08-09T10:21:33Z","cross_cats_sorted":[],"title_canon_sha256":"95b5d8f8ca5158e435a91f99e5df7c7cca52702885cad34d0434aa23530e4449","abstract_canon_sha256":"eb36de143c7644f43364cbbae25591a78675f0b4fdaa986e80384c242f2311ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:24.124282Z","signature_b64":"Km1GH7qMES0x2YkYismzQUjXkeDLMCVz7E5Oui5lmCA61yNvVsdut+J+sRxwURbG36q0iNx0rg4r3NSVke5LCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93cf9adc7978bb6caa02d18b6212a2b7adfd8be5ff38fe3acb6479f27038ba63","last_reissued_at":"2026-05-18T04:42:24.123847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:24.123847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast, precise and dynamic distance queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lee-Ad Gottlieb, Liam Roditty, Moshe Lewenstein, Tsvi Kopelowitz, Yair Bartal","submitted_at":"2010-08-09T10:21:33Z","abstract_excerpt":"We present an approximate distance oracle for a point set S with n points and doubling dimension {\\lambda}. For every {\\epsilon}>0, the oracle supports (1+{\\epsilon})-approximate distance queries in (universal) constant time, occupies space [{\\epsilon}^{-O({\\lambda})} + 2^{O({\\lambda} log {\\lambda})}]n, and can be constructed in [2^{O({\\lambda})} log3 n + {\\epsilon}^{-O({\\lambda})} + 2^{O({\\lambda} log {\\lambda})}]n expected time. This improves upon the best previously known constructions, presented by Har-Peled and Mendel. Furthermore, the oracle can be made fully dynamic with expected O(1) q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1480","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1008.1480","created_at":"2026-05-18T04:42:24.123912+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.1480v1","created_at":"2026-05-18T04:42:24.123912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1480","created_at":"2026-05-18T04:42:24.123912+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPHZVXDZPC5W","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPHZVXDZPC5WZKQC","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPHZVXDZ","created_at":"2026-05-18T12:26:13.927090+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SPHZVXDZPC5WZKQC2GFWEEVCW6","json":"https://pith.science/pith/SPHZVXDZPC5WZKQC2GFWEEVCW6.json","graph_json":"https://pith.science/api/pith-number/SPHZVXDZPC5WZKQC2GFWEEVCW6/graph.json","events_json":"https://pith.science/api/pith-number/SPHZVXDZPC5WZKQC2GFWEEVCW6/events.json","paper":"https://pith.science/paper/SPHZVXDZ"},"agent_actions":{"view_html":"https://pith.science/pith/SPHZVXDZPC5WZKQC2GFWEEVCW6","download_json":"https://pith.science/pith/SPHZVXDZPC5WZKQC2GFWEEVCW6.json","view_paper":"https://pith.science/paper/SPHZVXDZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.1480&json=true","fetch_graph":"https://pith.science/api/pith-number/SPHZVXDZPC5WZKQC2GFWEEVCW6/graph.json","fetch_events":"https://pith.science/api/pith-number/SPHZVXDZPC5WZKQC2GFWEEVCW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPHZVXDZPC5WZKQC2GFWEEVCW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPHZVXDZPC5WZKQC2GFWEEVCW6/action/storage_attestation","attest_author":"https://pith.science/pith/SPHZVXDZPC5WZKQC2GFWEEVCW6/action/author_attestation","sign_citation":"https://pith.science/pith/SPHZVXDZPC5WZKQC2GFWEEVCW6/action/citation_signature","submit_replication":"https://pith.science/pith/SPHZVXDZPC5WZKQC2GFWEEVCW6/action/replication_record"}},"created_at":"2026-05-18T04:42:24.123912+00:00","updated_at":"2026-05-18T04:42:24.123912+00:00"}