{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CENEYSE5X64ZTSIEYCTWZ5RTTC","short_pith_number":"pith:CENEYSE5","canonical_record":{"source":{"id":"1602.02620","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-08T16:03:11Z","cross_cats_sorted":["cs.DS","cs.IR"],"title_canon_sha256":"15278adf6f4d6b898e90b5fc402b267557f3877307262bd1bcdf674b37d3c60b","abstract_canon_sha256":"d05d48dccf5dddaf50a81a20a9d5cfd8a4e168e2a46fe53bd899342948e001f0"},"schema_version":"1.0"},"canonical_sha256":"111a4c489dbfb999c904c0a76cf6339894a519d90fec6591fae9b8b73b374d7c","source":{"kind":"arxiv","id":"1602.02620","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02620","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02620v2","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02620","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"CENEYSE5X64Z","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CENEYSE5X64ZTSIE","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CENEYSE5","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CENEYSE5X64ZTSIEYCTWZ5RTTC","target":"record","payload":{"canonical_record":{"source":{"id":"1602.02620","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-08T16:03:11Z","cross_cats_sorted":["cs.DS","cs.IR"],"title_canon_sha256":"15278adf6f4d6b898e90b5fc402b267557f3877307262bd1bcdf674b37d3c60b","abstract_canon_sha256":"d05d48dccf5dddaf50a81a20a9d5cfd8a4e168e2a46fe53bd899342948e001f0"},"schema_version":"1.0"},"canonical_sha256":"111a4c489dbfb999c904c0a76cf6339894a519d90fec6591fae9b8b73b374d7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:28.856493Z","signature_b64":"f0tj5UqUXZfVUQBvsMeTW/T8g2tc1YKFTi8LIe/dHvxA7hFLZ02Le7RtLrIXTzS6ekz6tdaCxSozMmrixk6ZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"111a4c489dbfb999c904c0a76cf6339894a519d90fec6591fae9b8b73b374d7c","last_reissued_at":"2026-05-18T01:08:28.856086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:28.856086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.02620","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-18T01:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Om8fHQsSThMafHwz+BCoBzlQrgT+jdJHKQlhqNJE2PlDvN8EazqxvKuO9T8WLDHVWG+qTMvuDUIJvwUvztVKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T21:24:21.848097Z"},"content_sha256":"5e44b862223708db7f27ed19d4dac501335ea2d28bd3f13fab054a1f313361d2","schema_version":"1.0","event_id":"sha256:5e44b862223708db7f27ed19d4dac501335ea2d28bd3f13fab054a1f313361d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CENEYSE5X64ZTSIEYCTWZ5RTTC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalability and Total Recall with Fast CoveringLSH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IR"],"primary_cat":"cs.DB","authors_text":"Ninh Pham, Rasmus Pagh","submitted_at":"2016-02-08T16:03:11Z","abstract_excerpt":"Locality-sensitive hashing (LSH) has emerged as the dominant algorithmic technique for similarity search with strong performance guarantees in high-dimensional spaces. A drawback of traditional LSH schemes is that they may have \\emph{false negatives}, i.e., the recall is less than 100\\%. This limits the applicability of LSH in settings requiring precise performance guarantees. Building on the recent theoretical \"CoveringLSH\" construction that eliminates false negatives, we propose a fast and practical covering LSH scheme for Hamming space called \\emph{Fast CoveringLSH (fcLSH)}. Inheriting the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02620","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-18T01:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+3cwSmCSW0g6uSGHcP4ZGJQoCTQvWYPE22CRLdVPy/yl/sMV/tYxQsa1KMlZdWoBaUmHdlfhFTE5wLL/Mkj5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T21:24:21.848468Z"},"content_sha256":"5e50bf9510ff94abbaae2ffe5a36366c4bcf615e215f115aaece92b4df51ad86","schema_version":"1.0","event_id":"sha256:5e50bf9510ff94abbaae2ffe5a36366c4bcf615e215f115aaece92b4df51ad86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CENEYSE5X64ZTSIEYCTWZ5RTTC/bundle.json","state_url":"https://pith.science/pith/CENEYSE5X64ZTSIEYCTWZ5RTTC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CENEYSE5X64ZTSIEYCTWZ5RTTC/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-26T21:24:21Z","links":{"resolver":"https://pith.science/pith/CENEYSE5X64ZTSIEYCTWZ5RTTC","bundle":"https://pith.science/pith/CENEYSE5X64ZTSIEYCTWZ5RTTC/bundle.json","state":"https://pith.science/pith/CENEYSE5X64ZTSIEYCTWZ5RTTC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CENEYSE5X64ZTSIEYCTWZ5RTTC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CENEYSE5X64ZTSIEYCTWZ5RTTC","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":"d05d48dccf5dddaf50a81a20a9d5cfd8a4e168e2a46fe53bd899342948e001f0","cross_cats_sorted":["cs.DS","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-08T16:03:11Z","title_canon_sha256":"15278adf6f4d6b898e90b5fc402b267557f3877307262bd1bcdf674b37d3c60b"},"schema_version":"1.0","source":{"id":"1602.02620","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02620","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02620v2","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02620","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"CENEYSE5X64Z","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CENEYSE5X64ZTSIE","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CENEYSE5","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:5e50bf9510ff94abbaae2ffe5a36366c4bcf615e215f115aaece92b4df51ad86","target":"graph","created_at":"2026-05-18T01:08: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":"Locality-sensitive hashing (LSH) has emerged as the dominant algorithmic technique for similarity search with strong performance guarantees in high-dimensional spaces. A drawback of traditional LSH schemes is that they may have \\emph{false negatives}, i.e., the recall is less than 100\\%. This limits the applicability of LSH in settings requiring precise performance guarantees. Building on the recent theoretical \"CoveringLSH\" construction that eliminates false negatives, we propose a fast and practical covering LSH scheme for Hamming space called \\emph{Fast CoveringLSH (fcLSH)}. Inheriting the ","authors_text":"Ninh Pham, Rasmus Pagh","cross_cats":["cs.DS","cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-08T16:03:11Z","title":"Scalability and Total Recall with Fast CoveringLSH"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02620","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:5e44b862223708db7f27ed19d4dac501335ea2d28bd3f13fab054a1f313361d2","target":"record","created_at":"2026-05-18T01:08: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":"d05d48dccf5dddaf50a81a20a9d5cfd8a4e168e2a46fe53bd899342948e001f0","cross_cats_sorted":["cs.DS","cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-02-08T16:03:11Z","title_canon_sha256":"15278adf6f4d6b898e90b5fc402b267557f3877307262bd1bcdf674b37d3c60b"},"schema_version":"1.0","source":{"id":"1602.02620","kind":"arxiv","version":2}},"canonical_sha256":"111a4c489dbfb999c904c0a76cf6339894a519d90fec6591fae9b8b73b374d7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"111a4c489dbfb999c904c0a76cf6339894a519d90fec6591fae9b8b73b374d7c","first_computed_at":"2026-05-18T01:08:28.856086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:28.856086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f0tj5UqUXZfVUQBvsMeTW/T8g2tc1YKFTi8LIe/dHvxA7hFLZ02Le7RtLrIXTzS6ekz6tdaCxSozMmrixk6ZBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:28.856493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02620","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e44b862223708db7f27ed19d4dac501335ea2d28bd3f13fab054a1f313361d2","sha256:5e50bf9510ff94abbaae2ffe5a36366c4bcf615e215f115aaece92b4df51ad86"],"state_sha256":"69a843187b04799361d53572b4e9a876caac236d4e2eeaa907d9fd40082c71b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cbG2NynI6qZxCi2AFq0L3XPacWzqSCr73SqP4qTKf480ZYbAauKQYxqyzI8akpWAF4y5DJh7VSV1rg6UzK6wAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T21:24:21.850427Z","bundle_sha256":"4ee2a7ec212b9e80eaf24ecdf12b5df8afda180e8e0be47db3fe33e712956889"}}