{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TJ5SDFOVGZ23PXXEAFQM57VTB3","short_pith_number":"pith:TJ5SDFOV","canonical_record":{"source":{"id":"1111.5893","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-25T05:23:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"dcb1fdfa33b49824f8d7658376ab06498d46bcf0080452376b64d81e373e5ccd","abstract_canon_sha256":"87a02f69fa16b264606d469a2c6ed961615d41f8fb88b8053d9daf4d0f5123c4"},"schema_version":"1.0"},"canonical_sha256":"9a7b2195d53675b7dee40160cefeb30ec777ee01765e29a3b325e28432877df6","source":{"kind":"arxiv","id":"1111.5893","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5893","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5893v2","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5893","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"TJ5SDFOVGZ23","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TJ5SDFOVGZ23PXXE","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TJ5SDFOV","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TJ5SDFOVGZ23PXXEAFQM57VTB3","target":"record","payload":{"canonical_record":{"source":{"id":"1111.5893","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-25T05:23:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"dcb1fdfa33b49824f8d7658376ab06498d46bcf0080452376b64d81e373e5ccd","abstract_canon_sha256":"87a02f69fa16b264606d469a2c6ed961615d41f8fb88b8053d9daf4d0f5123c4"},"schema_version":"1.0"},"canonical_sha256":"9a7b2195d53675b7dee40160cefeb30ec777ee01765e29a3b325e28432877df6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:39.156545Z","signature_b64":"z7BRA+WIkcWAGA0eovSWwMK9YIZ4akN1PpnlYOA1G9Bdxahj46HRRAjyAULVX0HE3tXqMcvsUYJ7YvwkoHcqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a7b2195d53675b7dee40160cefeb30ec777ee01765e29a3b325e28432877df6","last_reissued_at":"2026-05-18T02:49:39.156214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:39.156214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.5893","source_version":2,"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-18T02:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QVMdI+s1F+7b0lpclUYApPS3+KQyE9hO9x41MjpXlmX6HuTsDZzm3Pt5OTrFHVxgrVFhwe2Dwz0cFsK1YP7WCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:05:55.352419Z"},"content_sha256":"2bcd9dae37a5c3da48690c923b833036a7ecdd878fcde276766edab1620ffadd","schema_version":"1.0","event_id":"sha256:2bcd9dae37a5c3da48690c923b833036a7ecdd878fcde276766edab1620ffadd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TJ5SDFOVGZ23PXXEAFQM57VTB3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ANN queries: covering Voronoi diagram with hyperboxes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Rajasekhar Inkulu, Sanjiv Kapoor","submitted_at":"2011-11-25T05:23:06Z","abstract_excerpt":"Given a set $S$ of $n$ points in $d$-dimensional Euclidean metric space $X$ and a small positive real number $\\epsilon$, we present an algorithm to preprocess $S$ and answer queries that require finding a set $S' \\subseteq S$ of $\\epsilon$-approximate nearest neighbors (ANNs) to a given query point $q \\in X$. The following are the characteristics of points belonging to set $S'$:\n  - $\\forall s \\in S'$, $\\exists$ a point $p \\in X$ such that $|pq| \\le \\epsilon$ and the nearest neighbor of $p$ is $s$, and\n  - $\\exists$ a $s' \\in S'$ such that $s'$ is a nearest neighbor of $q$.\n  During the prepro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5893","kind":"arxiv","version":2},"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-18T02:49:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EqJ5qoNPTNv/hdo42O5pbzlHkrajr2gCIrTsS28QRsf9Hy9pGW61XcMIIQRm+1bfamctgfRtFYBaZpA262sSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:05:55.352833Z"},"content_sha256":"03d9991b23a7c28bb9ceadcd6158111d4eb7024ad6b6784d7898d631397782f5","schema_version":"1.0","event_id":"sha256:03d9991b23a7c28bb9ceadcd6158111d4eb7024ad6b6784d7898d631397782f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJ5SDFOVGZ23PXXEAFQM57VTB3/bundle.json","state_url":"https://pith.science/pith/TJ5SDFOVGZ23PXXEAFQM57VTB3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJ5SDFOVGZ23PXXEAFQM57VTB3/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-05-28T03:05:55Z","links":{"resolver":"https://pith.science/pith/TJ5SDFOVGZ23PXXEAFQM57VTB3","bundle":"https://pith.science/pith/TJ5SDFOVGZ23PXXEAFQM57VTB3/bundle.json","state":"https://pith.science/pith/TJ5SDFOVGZ23PXXEAFQM57VTB3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJ5SDFOVGZ23PXXEAFQM57VTB3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TJ5SDFOVGZ23PXXEAFQM57VTB3","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":"87a02f69fa16b264606d469a2c6ed961615d41f8fb88b8053d9daf4d0f5123c4","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-25T05:23:06Z","title_canon_sha256":"dcb1fdfa33b49824f8d7658376ab06498d46bcf0080452376b64d81e373e5ccd"},"schema_version":"1.0","source":{"id":"1111.5893","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5893","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5893v2","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5893","created_at":"2026-05-18T02:49:39Z"},{"alias_kind":"pith_short_12","alias_value":"TJ5SDFOVGZ23","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TJ5SDFOVGZ23PXXE","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TJ5SDFOV","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:03d9991b23a7c28bb9ceadcd6158111d4eb7024ad6b6784d7898d631397782f5","target":"graph","created_at":"2026-05-18T02:49:39Z","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":"Given a set $S$ of $n$ points in $d$-dimensional Euclidean metric space $X$ and a small positive real number $\\epsilon$, we present an algorithm to preprocess $S$ and answer queries that require finding a set $S' \\subseteq S$ of $\\epsilon$-approximate nearest neighbors (ANNs) to a given query point $q \\in X$. The following are the characteristics of points belonging to set $S'$:\n  - $\\forall s \\in S'$, $\\exists$ a point $p \\in X$ such that $|pq| \\le \\epsilon$ and the nearest neighbor of $p$ is $s$, and\n  - $\\exists$ a $s' \\in S'$ such that $s'$ is a nearest neighbor of $q$.\n  During the prepro","authors_text":"Rajasekhar Inkulu, Sanjiv Kapoor","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-25T05:23:06Z","title":"ANN queries: covering Voronoi diagram with hyperboxes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5893","kind":"arxiv","version":2},"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:2bcd9dae37a5c3da48690c923b833036a7ecdd878fcde276766edab1620ffadd","target":"record","created_at":"2026-05-18T02:49:39Z","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":"87a02f69fa16b264606d469a2c6ed961615d41f8fb88b8053d9daf4d0f5123c4","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-25T05:23:06Z","title_canon_sha256":"dcb1fdfa33b49824f8d7658376ab06498d46bcf0080452376b64d81e373e5ccd"},"schema_version":"1.0","source":{"id":"1111.5893","kind":"arxiv","version":2}},"canonical_sha256":"9a7b2195d53675b7dee40160cefeb30ec777ee01765e29a3b325e28432877df6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a7b2195d53675b7dee40160cefeb30ec777ee01765e29a3b325e28432877df6","first_computed_at":"2026-05-18T02:49:39.156214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:39.156214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z7BRA+WIkcWAGA0eovSWwMK9YIZ4akN1PpnlYOA1G9Bdxahj46HRRAjyAULVX0HE3tXqMcvsUYJ7YvwkoHcqBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:39.156545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.5893","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bcd9dae37a5c3da48690c923b833036a7ecdd878fcde276766edab1620ffadd","sha256:03d9991b23a7c28bb9ceadcd6158111d4eb7024ad6b6784d7898d631397782f5"],"state_sha256":"36e7a1fb4a072884cb1c2fd5bc56e45c4644df9a489531ded45905caa369ca6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BIXvCb7MA5k9hHy5UU8GL055GDKWGBHEj3v6svOqeabCNilVu9+aJcLvZPQY9sogLnHk2XEdl454RMg2O4CcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:05:55.354837Z","bundle_sha256":"9dd237027d5f8e2d96ca64598b2196611c7d88933a95b83ceac3a6dd93e719d2"}}