{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:25R3UQAPWL65MBBFX5HKQIEUFV","short_pith_number":"pith:25R3UQAP","canonical_record":{"source":{"id":"1807.00112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-30T02:33:15Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"9d0a1e998834cdb5d20e84ec2fbd189044528dac8761074a127498f673990249","abstract_canon_sha256":"e0cc0c08c75fb2ae303545c07cf857df07190d51a3aeab4948a86228a824fded"},"schema_version":"1.0"},"canonical_sha256":"d763ba400fb2fdd60425bf4ea820942d42904c84e7c0a2fac09ab0f6ce130543","source":{"kind":"arxiv","id":"1807.00112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00112","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00112v1","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00112","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"pith_short_12","alias_value":"25R3UQAPWL65","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"25R3UQAPWL65MBBF","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"25R3UQAP","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:25R3UQAPWL65MBBFX5HKQIEUFV","target":"record","payload":{"canonical_record":{"source":{"id":"1807.00112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-30T02:33:15Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"9d0a1e998834cdb5d20e84ec2fbd189044528dac8761074a127498f673990249","abstract_canon_sha256":"e0cc0c08c75fb2ae303545c07cf857df07190d51a3aeab4948a86228a824fded"},"schema_version":"1.0"},"canonical_sha256":"d763ba400fb2fdd60425bf4ea820942d42904c84e7c0a2fac09ab0f6ce130543","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:56.064411Z","signature_b64":"P55kBkmeg5RR/7/hAxUAwdJu9TICNANZi9uG/yJ99ujy5aUHN10Kq3hjAsgtg448uEFo0T+TM8IvEhoOLipLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d763ba400fb2fdd60425bf4ea820942d42904c84e7c0a2fac09ab0f6ce130543","last_reissued_at":"2026-05-18T00:11:56.063870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:56.063870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.00112","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sMeHD9DHeGHhND2/AztAvBgrzYU/zvpcGoraw2cBAiZnnXYIEQRq1G4DzjrJsqbylAdOhZbuF58ewmLNwmGiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:54:20.800751Z"},"content_sha256":"3b2f08ff3feb4652f89c2fde82b626ea6e160d7996783d4ee5beac28b2b61550","schema_version":"1.0","event_id":"sha256:3b2f08ff3feb4652f89c2fde82b626ea6e160d7996783d4ee5beac28b2b61550"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:25R3UQAPWL65MBBFX5HKQIEUFV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Nearest Neighbors in Limited Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Piotr Indyk, Tal Wagner","submitted_at":"2018-06-30T02:33:15Z","abstract_excerpt":"We consider the $(1+\\epsilon)$-approximate nearest neighbor search problem: given a set $X$ of $n$ points in a $d$-dimensional space, build a data structure that, given any query point $y$, finds a point $x \\in X$ whose distance to $y$ is at most $(1+\\epsilon) \\min_{x \\in X} \\|x-y\\|$ for an accuracy parameter $\\epsilon \\in (0,1)$. Our main result is a data structure that occupies only $O(\\epsilon^{-2} n \\log(n) \\log(1/\\epsilon))$ bits of space, assuming all point coordinates are integers in the range $\\{-n^{O(1)} \\ldots n^{O(1)}\\}$, i.e., the coordinates have $O(\\log n)$ bits of precision. Thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00112","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l/5qNOuv6lhdwRredzNUmDm5Ug/qzByZwneM4jZyefq/gUo1vV9NacR+eqtaU3LzsBAa+be6n7CpuMRjhLy/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:54:20.801083Z"},"content_sha256":"c6c6101e56f4d4772268d5c1d4b1b8c9d62ea5f00e9ea0088d2afd26054ea244","schema_version":"1.0","event_id":"sha256:c6c6101e56f4d4772268d5c1d4b1b8c9d62ea5f00e9ea0088d2afd26054ea244"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25R3UQAPWL65MBBFX5HKQIEUFV/bundle.json","state_url":"https://pith.science/pith/25R3UQAPWL65MBBFX5HKQIEUFV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25R3UQAPWL65MBBFX5HKQIEUFV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T06:54:20Z","links":{"resolver":"https://pith.science/pith/25R3UQAPWL65MBBFX5HKQIEUFV","bundle":"https://pith.science/pith/25R3UQAPWL65MBBFX5HKQIEUFV/bundle.json","state":"https://pith.science/pith/25R3UQAPWL65MBBFX5HKQIEUFV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25R3UQAPWL65MBBFX5HKQIEUFV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:25R3UQAPWL65MBBFX5HKQIEUFV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e0cc0c08c75fb2ae303545c07cf857df07190d51a3aeab4948a86228a824fded","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-30T02:33:15Z","title_canon_sha256":"9d0a1e998834cdb5d20e84ec2fbd189044528dac8761074a127498f673990249"},"schema_version":"1.0","source":{"id":"1807.00112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00112","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00112v1","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00112","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"pith_short_12","alias_value":"25R3UQAPWL65","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"25R3UQAPWL65MBBF","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"25R3UQAP","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:c6c6101e56f4d4772268d5c1d4b1b8c9d62ea5f00e9ea0088d2afd26054ea244","target":"graph","created_at":"2026-05-18T00:11:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider the $(1+\\epsilon)$-approximate nearest neighbor search problem: given a set $X$ of $n$ points in a $d$-dimensional space, build a data structure that, given any query point $y$, finds a point $x \\in X$ whose distance to $y$ is at most $(1+\\epsilon) \\min_{x \\in X} \\|x-y\\|$ for an accuracy parameter $\\epsilon \\in (0,1)$. Our main result is a data structure that occupies only $O(\\epsilon^{-2} n \\log(n) \\log(1/\\epsilon))$ bits of space, assuming all point coordinates are integers in the range $\\{-n^{O(1)} \\ldots n^{O(1)}\\}$, i.e., the coordinates have $O(\\log n)$ bits of precision. Thi","authors_text":"Piotr Indyk, Tal Wagner","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-30T02:33:15Z","title":"Approximate Nearest Neighbors in Limited Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00112","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3b2f08ff3feb4652f89c2fde82b626ea6e160d7996783d4ee5beac28b2b61550","target":"record","created_at":"2026-05-18T00:11:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e0cc0c08c75fb2ae303545c07cf857df07190d51a3aeab4948a86228a824fded","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-30T02:33:15Z","title_canon_sha256":"9d0a1e998834cdb5d20e84ec2fbd189044528dac8761074a127498f673990249"},"schema_version":"1.0","source":{"id":"1807.00112","kind":"arxiv","version":1}},"canonical_sha256":"d763ba400fb2fdd60425bf4ea820942d42904c84e7c0a2fac09ab0f6ce130543","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d763ba400fb2fdd60425bf4ea820942d42904c84e7c0a2fac09ab0f6ce130543","first_computed_at":"2026-05-18T00:11:56.063870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:56.063870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P55kBkmeg5RR/7/hAxUAwdJu9TICNANZi9uG/yJ99ujy5aUHN10Kq3hjAsgtg448uEFo0T+TM8IvEhoOLipLDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:56.064411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.00112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b2f08ff3feb4652f89c2fde82b626ea6e160d7996783d4ee5beac28b2b61550","sha256:c6c6101e56f4d4772268d5c1d4b1b8c9d62ea5f00e9ea0088d2afd26054ea244"],"state_sha256":"2b64945ff29de2a1b2822a373c619fcf1bd73889223f622a6ef9a95c33f44dac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aN/HggW6P0/vAakrx7aetpJAGJxrDI652c8HNrO2rD0ztSf9iq0jWTnChRluKH4zW848JtwGqoCvwFpKCnIdDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:54:20.802971Z","bundle_sha256":"9e32ec7613979e429b878a7ab6b909b998c1717a51982a232e4c4970954f932a"}}