{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BY6FGMIRKG32622YKXWJDSTXN4","short_pith_number":"pith:BY6FGMIR","canonical_record":{"source":{"id":"1611.09317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T20:11:11Z","cross_cats_sorted":[],"title_canon_sha256":"394de1eea2ff84721e0bf21b6219a86ba1d7ad2009b8461c4ebf73e990b6695c","abstract_canon_sha256":"2cea819c8fadb79bd3008d0d658ceae502a9353abda579e84f7c511aec06937a"},"schema_version":"1.0"},"canonical_sha256":"0e3c53311151b7af6b5855ec91ca776f086a42596a558bf450f39e1038106d98","source":{"kind":"arxiv","id":"1611.09317","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09317","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09317v1","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09317","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"pith_short_12","alias_value":"BY6FGMIRKG32","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BY6FGMIRKG32622Y","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BY6FGMIR","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BY6FGMIRKG32622YKXWJDSTXN4","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T20:11:11Z","cross_cats_sorted":[],"title_canon_sha256":"394de1eea2ff84721e0bf21b6219a86ba1d7ad2009b8461c4ebf73e990b6695c","abstract_canon_sha256":"2cea819c8fadb79bd3008d0d658ceae502a9353abda579e84f7c511aec06937a"},"schema_version":"1.0"},"canonical_sha256":"0e3c53311151b7af6b5855ec91ca776f086a42596a558bf450f39e1038106d98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:28.528780Z","signature_b64":"hAkr0+e6S/jHxN7pl/DjqBRrGc2d2PgCPjFDdMCBJ4KjOnCZXzATaDOPYrS1dsYRXk0hmr4Gff4oAPTeDS7lBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e3c53311151b7af6b5855ec91ca776f086a42596a558bf450f39e1038106d98","last_reissued_at":"2026-05-18T00:56:28.528060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:28.528060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09317","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:56:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"69NIgD4y7mguh85khIoDsfms7Fu8pYT6xffDxkJAlNRCIyWwUmOcx0qzWkeRoUbPDOyatIaRMLTvcILqSHhxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:06:03.580933Z"},"content_sha256":"9173a6cff7b29fcdb33ff75533278347d0bb24bf43636605acb03caf3725206c","schema_version":"1.0","event_id":"sha256:9173a6cff7b29fcdb33ff75533278347d0bb24bf43636605acb03caf3725206c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BY6FGMIRKG32622YKXWJDSTXN4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Locality-Sensitive Hashing without False Negatives for l_p","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrzej Pacuk, Karol Wegrzycki, Piotr Sankowski, Piotr Wygocki","submitted_at":"2016-11-28T20:11:11Z","abstract_excerpt":"In this paper, we show a construction of locality-sensitive hash functions without false negatives, i.e., which ensure collision for every pair of points within a given radius $R$ in $d$ dimensional space equipped with $l_p$ norm when $p \\in [1,\\infty]$. Furthermore, we show how to use these hash functions to solve the $c$-approximate nearest neighbor search problem without false negatives. Namely, if there is a point at distance $R$, we will certainly report it and points at distance greater than $cR$ will not be reported for $c=\\Omega(\\sqrt{d},d^{1-\\frac{1}{p}})$. The constructed algorithms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09317","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:56:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VQLwv+jA5YfTQrK3tZ423SdBQTv87aJmGH0Odhz0of+EskEIWXm6id8FfqYkjWXwBBga+W5p+SvEjjbThsJmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:06:03.581284Z"},"content_sha256":"97182bde8d47aff7e1a253c1c72a653cb77f05c7fd49b3a2121eb2a11b17a467","schema_version":"1.0","event_id":"sha256:97182bde8d47aff7e1a253c1c72a653cb77f05c7fd49b3a2121eb2a11b17a467"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BY6FGMIRKG32622YKXWJDSTXN4/bundle.json","state_url":"https://pith.science/pith/BY6FGMIRKG32622YKXWJDSTXN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BY6FGMIRKG32622YKXWJDSTXN4/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-05T14:06:03Z","links":{"resolver":"https://pith.science/pith/BY6FGMIRKG32622YKXWJDSTXN4","bundle":"https://pith.science/pith/BY6FGMIRKG32622YKXWJDSTXN4/bundle.json","state":"https://pith.science/pith/BY6FGMIRKG32622YKXWJDSTXN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BY6FGMIRKG32622YKXWJDSTXN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BY6FGMIRKG32622YKXWJDSTXN4","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":"2cea819c8fadb79bd3008d0d658ceae502a9353abda579e84f7c511aec06937a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T20:11:11Z","title_canon_sha256":"394de1eea2ff84721e0bf21b6219a86ba1d7ad2009b8461c4ebf73e990b6695c"},"schema_version":"1.0","source":{"id":"1611.09317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09317","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09317v1","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09317","created_at":"2026-05-18T00:56:28Z"},{"alias_kind":"pith_short_12","alias_value":"BY6FGMIRKG32","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BY6FGMIRKG32622Y","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BY6FGMIR","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:97182bde8d47aff7e1a253c1c72a653cb77f05c7fd49b3a2121eb2a11b17a467","target":"graph","created_at":"2026-05-18T00:56:28Z","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":"In this paper, we show a construction of locality-sensitive hash functions without false negatives, i.e., which ensure collision for every pair of points within a given radius $R$ in $d$ dimensional space equipped with $l_p$ norm when $p \\in [1,\\infty]$. Furthermore, we show how to use these hash functions to solve the $c$-approximate nearest neighbor search problem without false negatives. Namely, if there is a point at distance $R$, we will certainly report it and points at distance greater than $cR$ will not be reported for $c=\\Omega(\\sqrt{d},d^{1-\\frac{1}{p}})$. The constructed algorithms ","authors_text":"Andrzej Pacuk, Karol Wegrzycki, Piotr Sankowski, Piotr Wygocki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T20:11:11Z","title":"Locality-Sensitive Hashing without False Negatives for l_p"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09317","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:9173a6cff7b29fcdb33ff75533278347d0bb24bf43636605acb03caf3725206c","target":"record","created_at":"2026-05-18T00:56:28Z","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":"2cea819c8fadb79bd3008d0d658ceae502a9353abda579e84f7c511aec06937a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T20:11:11Z","title_canon_sha256":"394de1eea2ff84721e0bf21b6219a86ba1d7ad2009b8461c4ebf73e990b6695c"},"schema_version":"1.0","source":{"id":"1611.09317","kind":"arxiv","version":1}},"canonical_sha256":"0e3c53311151b7af6b5855ec91ca776f086a42596a558bf450f39e1038106d98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e3c53311151b7af6b5855ec91ca776f086a42596a558bf450f39e1038106d98","first_computed_at":"2026-05-18T00:56:28.528060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:28.528060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hAkr0+e6S/jHxN7pl/DjqBRrGc2d2PgCPjFDdMCBJ4KjOnCZXzATaDOPYrS1dsYRXk0hmr4Gff4oAPTeDS7lBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:28.528780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9173a6cff7b29fcdb33ff75533278347d0bb24bf43636605acb03caf3725206c","sha256:97182bde8d47aff7e1a253c1c72a653cb77f05c7fd49b3a2121eb2a11b17a467"],"state_sha256":"81e8ff13acb3873db0fa2f7497b3a2c28f543636a37dbf2dfec9a825162e6b2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"20vgvF8TdZ6stahZa7OdEAgzEUnPg7eq26mQyXVqvUqMEf/Ve1SBA72ruufTJmz6ylFbauELvPF59Obk+fz5Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:06:03.583201Z","bundle_sha256":"baab936d39a627637f8de62649a9de68d984325ff2bdd6071bbea79f53dbef56"}}