{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KNPO3T2TCEBH44BFW7VJKO52CD","short_pith_number":"pith:KNPO3T2T","canonical_record":{"source":{"id":"1704.05902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-19T19:14:45Z","cross_cats_sorted":[],"title_canon_sha256":"61869fe39264c2ab4d7c48fe88af99f36fc2b4d66b1be42dd6843b19801aa289","abstract_canon_sha256":"13c660c48f89be43cbf0b795cea414be8a3d1cc746faae9b15fcfd4170d9d648"},"schema_version":"1.0"},"canonical_sha256":"535eedcf5311027e7025b7ea953bba10cd91f99d3b9a2e815356f8a704b244b2","source":{"kind":"arxiv","id":"1704.05902","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05902","created_at":"2026-05-18T00:46:03Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05902v1","created_at":"2026-05-18T00:46:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05902","created_at":"2026-05-18T00:46:03Z"},{"alias_kind":"pith_short_12","alias_value":"KNPO3T2TCEBH","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KNPO3T2TCEBH44BF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KNPO3T2T","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KNPO3T2TCEBH44BFW7VJKO52CD","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-19T19:14:45Z","cross_cats_sorted":[],"title_canon_sha256":"61869fe39264c2ab4d7c48fe88af99f36fc2b4d66b1be42dd6843b19801aa289","abstract_canon_sha256":"13c660c48f89be43cbf0b795cea414be8a3d1cc746faae9b15fcfd4170d9d648"},"schema_version":"1.0"},"canonical_sha256":"535eedcf5311027e7025b7ea953bba10cd91f99d3b9a2e815356f8a704b244b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:03.811235Z","signature_b64":"TxOxJssEq+QNlAfv4XCc8ETv55JVwWS4SU5D7HdCo0+EIpXwtLU3o1OMMY2nawwBgn1ORFPYDwFetllUVCABDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"535eedcf5311027e7025b7ea953bba10cd91f99d3b9a2e815356f8a704b244b2","last_reissued_at":"2026-05-18T00:46:03.810817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:03.810817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05902","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:46:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"znV8//D55aXHFhd8abI3z1tedlsV0ht8syoQzIZEFyGxU502YBM+Lb1NjxDTKLxkIYUr+yLUPmV/NW1cGTz0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:42:18.289265Z"},"content_sha256":"bb6f9769112c2878b5539c65b56e43d5da07d3f9d2879b03cd26531a4ef0271a","schema_version":"1.0","event_id":"sha256:bb6f9769112c2878b5539c65b56e43d5da07d3f9d2879b03cd26531a4ef0271a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KNPO3T2TCEBH44BFW7VJKO52CD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On fast bounded locality sensitive hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Piotr Wygocki","submitted_at":"2017-04-19T19:14:45Z","abstract_excerpt":"In this paper, we examine the hash functions expressed as scalar products, i.e., $f(x)=<v,x>$, for some bounded random vector $v$. Such hash functions have numerous applications, but often there is a need to optimize the choice of the distribution of $v$. In the present work, we focus on so-called anti-concentration bounds, i.e. the upper bounds of $\\mathbb{P}\\left[|<v,x>| < \\alpha \\right]$. In many applications, $v$ is a vector of independent random variables with standard normal distribution. In such case, the distribution of $<v,x>$ is also normal and it is easy to approximate $\\mathbb{P}\\l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05902","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:46:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PIeE3R59yQKWv9Sth3Ah+l8UPSIVfhqD8q5+kMKNiwSGY8VncWuLEP1vIlkA8C3nWbhqtDSSnUYt8R7TWz3uAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:42:18.290059Z"},"content_sha256":"753d46244481bfb4f0e3d428266ce691816f76f219932a6d0939d7e51c32089f","schema_version":"1.0","event_id":"sha256:753d46244481bfb4f0e3d428266ce691816f76f219932a6d0939d7e51c32089f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNPO3T2TCEBH44BFW7VJKO52CD/bundle.json","state_url":"https://pith.science/pith/KNPO3T2TCEBH44BFW7VJKO52CD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNPO3T2TCEBH44BFW7VJKO52CD/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-06T06:42:18Z","links":{"resolver":"https://pith.science/pith/KNPO3T2TCEBH44BFW7VJKO52CD","bundle":"https://pith.science/pith/KNPO3T2TCEBH44BFW7VJKO52CD/bundle.json","state":"https://pith.science/pith/KNPO3T2TCEBH44BFW7VJKO52CD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNPO3T2TCEBH44BFW7VJKO52CD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KNPO3T2TCEBH44BFW7VJKO52CD","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":"13c660c48f89be43cbf0b795cea414be8a3d1cc746faae9b15fcfd4170d9d648","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-19T19:14:45Z","title_canon_sha256":"61869fe39264c2ab4d7c48fe88af99f36fc2b4d66b1be42dd6843b19801aa289"},"schema_version":"1.0","source":{"id":"1704.05902","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05902","created_at":"2026-05-18T00:46:03Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05902v1","created_at":"2026-05-18T00:46:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05902","created_at":"2026-05-18T00:46:03Z"},{"alias_kind":"pith_short_12","alias_value":"KNPO3T2TCEBH","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KNPO3T2TCEBH44BF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KNPO3T2T","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:753d46244481bfb4f0e3d428266ce691816f76f219932a6d0939d7e51c32089f","target":"graph","created_at":"2026-05-18T00:46:03Z","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 examine the hash functions expressed as scalar products, i.e., $f(x)=<v,x>$, for some bounded random vector $v$. Such hash functions have numerous applications, but often there is a need to optimize the choice of the distribution of $v$. In the present work, we focus on so-called anti-concentration bounds, i.e. the upper bounds of $\\mathbb{P}\\left[|<v,x>| < \\alpha \\right]$. In many applications, $v$ is a vector of independent random variables with standard normal distribution. In such case, the distribution of $<v,x>$ is also normal and it is easy to approximate $\\mathbb{P}\\l","authors_text":"Piotr Wygocki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-19T19:14:45Z","title":"On fast bounded locality sensitive hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05902","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:bb6f9769112c2878b5539c65b56e43d5da07d3f9d2879b03cd26531a4ef0271a","target":"record","created_at":"2026-05-18T00:46:03Z","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":"13c660c48f89be43cbf0b795cea414be8a3d1cc746faae9b15fcfd4170d9d648","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-19T19:14:45Z","title_canon_sha256":"61869fe39264c2ab4d7c48fe88af99f36fc2b4d66b1be42dd6843b19801aa289"},"schema_version":"1.0","source":{"id":"1704.05902","kind":"arxiv","version":1}},"canonical_sha256":"535eedcf5311027e7025b7ea953bba10cd91f99d3b9a2e815356f8a704b244b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"535eedcf5311027e7025b7ea953bba10cd91f99d3b9a2e815356f8a704b244b2","first_computed_at":"2026-05-18T00:46:03.810817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:03.810817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TxOxJssEq+QNlAfv4XCc8ETv55JVwWS4SU5D7HdCo0+EIpXwtLU3o1OMMY2nawwBgn1ORFPYDwFetllUVCABDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:03.811235Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05902","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb6f9769112c2878b5539c65b56e43d5da07d3f9d2879b03cd26531a4ef0271a","sha256:753d46244481bfb4f0e3d428266ce691816f76f219932a6d0939d7e51c32089f"],"state_sha256":"f9827bc300ca4efe24fd99db4c72fde719a3c57d2a098f5291de14e00bbb5507"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ywzv4L2sgMxUHG+RL7JHvwA+uEvTIOYkSzfe+59qyTsSzBf8sG83R7CMvZXmY5QkkW6Lzap/lrbK3L47WCCnBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:42:18.294255Z","bundle_sha256":"0fe2eb134b68eb4bf546a5ada23e7ad36190d49903835e599cfffe4b0d9ed8fe"}}