{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6CSHX7DOTLI6YT73LMWMLMDVA4","short_pith_number":"pith:6CSHX7DO","canonical_record":{"source":{"id":"1505.03190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-12T23:29:42Z","cross_cats_sorted":[],"title_canon_sha256":"3fbe704a1684a6077398748daff1af237d199e108fd12f9536c536fea5af512d","abstract_canon_sha256":"3679e1fb0de24eaec21bcf585a318eba57b5d054109ec878c2b61f1ff30fc4c4"},"schema_version":"1.0"},"canonical_sha256":"f0a47bfc6e9ad1ec4ffb5b2cc5b0750711107d428e86c8ecdc5af53869eed6b9","source":{"kind":"arxiv","id":"1505.03190","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03190","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03190v1","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03190","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"6CSHX7DOTLI6","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6CSHX7DOTLI6YT73","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6CSHX7DO","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6CSHX7DOTLI6YT73LMWMLMDVA4","target":"record","payload":{"canonical_record":{"source":{"id":"1505.03190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-12T23:29:42Z","cross_cats_sorted":[],"title_canon_sha256":"3fbe704a1684a6077398748daff1af237d199e108fd12f9536c536fea5af512d","abstract_canon_sha256":"3679e1fb0de24eaec21bcf585a318eba57b5d054109ec878c2b61f1ff30fc4c4"},"schema_version":"1.0"},"canonical_sha256":"f0a47bfc6e9ad1ec4ffb5b2cc5b0750711107d428e86c8ecdc5af53869eed6b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:10.211015Z","signature_b64":"NMACyi3EYaKBJjUCJ2tKUD0U7yh4rq4hrCRZ4Djf9GCBgRGbMBEVtRFVdomrMImZKnxtsy1i+Kmy5fYn5YOqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0a47bfc6e9ad1ec4ffb5b2cc5b0750711107d428e86c8ecdc5af53869eed6b9","last_reissued_at":"2026-05-18T02:12:10.210227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:10.210227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.03190","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-18T02:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q7NAxUT1lWJeZZlh6J9q/eUVAvTqekkDoWkx1PtdbHBFuPCp7DKiZRaKZTIXKf1HXVDykKb7MEP5uOwTH+5SDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:33:05.935945Z"},"content_sha256":"584d68fd729fab36d9d61e6847e7aa8fe760f69d221c2c0311401d3d47a69ce9","schema_version":"1.0","event_id":"sha256:584d68fd729fab36d9d61e6847e7aa8fe760f69d221c2c0311401d3d47a69ce9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6CSHX7DOTLI6YT73LMWMLMDVA4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient data hashing with structured binary embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Krzysztof Choromanski","submitted_at":"2015-05-12T23:29:42Z","abstract_excerpt":"We present here new mechanisms for hashing data via binary embeddings. Contrary to most of the techniques presented before, the embedding matrix of our mechanism is highly structured. That enables us to perform hashing more efficiently and use less memory. What is crucial and nonintuitive is the fact that imposing structured mechanism does not affect the quality of the produced hash. To the best of our knowledge, we are the first to give strong theoretical guarantees of the proposed binary hashing method by proving the efficiency of the mechanism for several classes of structured projection ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03190","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-18T02:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NA/80E84kZXEwqSioomLw0xoOrgdrb8j0Q1dyCYYUVQo8ukpzVzWf5CuDQW69V/Q56dGGMxoLjFtlimorlJuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:33:05.936351Z"},"content_sha256":"e3b770024db5344304be8ff5d122eb75f160072494e21d42728883f5dc065d83","schema_version":"1.0","event_id":"sha256:e3b770024db5344304be8ff5d122eb75f160072494e21d42728883f5dc065d83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CSHX7DOTLI6YT73LMWMLMDVA4/bundle.json","state_url":"https://pith.science/pith/6CSHX7DOTLI6YT73LMWMLMDVA4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CSHX7DOTLI6YT73LMWMLMDVA4/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-12T09:33:05Z","links":{"resolver":"https://pith.science/pith/6CSHX7DOTLI6YT73LMWMLMDVA4","bundle":"https://pith.science/pith/6CSHX7DOTLI6YT73LMWMLMDVA4/bundle.json","state":"https://pith.science/pith/6CSHX7DOTLI6YT73LMWMLMDVA4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CSHX7DOTLI6YT73LMWMLMDVA4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6CSHX7DOTLI6YT73LMWMLMDVA4","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":"3679e1fb0de24eaec21bcf585a318eba57b5d054109ec878c2b61f1ff30fc4c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-12T23:29:42Z","title_canon_sha256":"3fbe704a1684a6077398748daff1af237d199e108fd12f9536c536fea5af512d"},"schema_version":"1.0","source":{"id":"1505.03190","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03190","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03190v1","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03190","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"6CSHX7DOTLI6","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6CSHX7DOTLI6YT73","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6CSHX7DO","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:e3b770024db5344304be8ff5d122eb75f160072494e21d42728883f5dc065d83","target":"graph","created_at":"2026-05-18T02:12:10Z","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 present here new mechanisms for hashing data via binary embeddings. Contrary to most of the techniques presented before, the embedding matrix of our mechanism is highly structured. That enables us to perform hashing more efficiently and use less memory. What is crucial and nonintuitive is the fact that imposing structured mechanism does not affect the quality of the produced hash. To the best of our knowledge, we are the first to give strong theoretical guarantees of the proposed binary hashing method by proving the efficiency of the mechanism for several classes of structured projection ma","authors_text":"Krzysztof Choromanski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-12T23:29:42Z","title":"Efficient data hashing with structured binary embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03190","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:584d68fd729fab36d9d61e6847e7aa8fe760f69d221c2c0311401d3d47a69ce9","target":"record","created_at":"2026-05-18T02:12:10Z","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":"3679e1fb0de24eaec21bcf585a318eba57b5d054109ec878c2b61f1ff30fc4c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-12T23:29:42Z","title_canon_sha256":"3fbe704a1684a6077398748daff1af237d199e108fd12f9536c536fea5af512d"},"schema_version":"1.0","source":{"id":"1505.03190","kind":"arxiv","version":1}},"canonical_sha256":"f0a47bfc6e9ad1ec4ffb5b2cc5b0750711107d428e86c8ecdc5af53869eed6b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0a47bfc6e9ad1ec4ffb5b2cc5b0750711107d428e86c8ecdc5af53869eed6b9","first_computed_at":"2026-05-18T02:12:10.210227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:12:10.210227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NMACyi3EYaKBJjUCJ2tKUD0U7yh4rq4hrCRZ4Djf9GCBgRGbMBEVtRFVdomrMImZKnxtsy1i+Kmy5fYn5YOqAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:12:10.211015Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.03190","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:584d68fd729fab36d9d61e6847e7aa8fe760f69d221c2c0311401d3d47a69ce9","sha256:e3b770024db5344304be8ff5d122eb75f160072494e21d42728883f5dc065d83"],"state_sha256":"c55b590cdd29bde89ffb6baaeca1295c9e760c043dd672f65bbabb92c300a570"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4skw2Y2G0srCO45PctqMS3p3pq5vDLZLyD/zPuBfCe2wtj1SMLxKZt4fnmxuJugBKfmlPCYGvuDKv58cUAZ9DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:33:05.938340Z","bundle_sha256":"f41d62b051dc0287a673f5f2947f7d7b008bf22eab098c2f910d94d4fbf9b9f9"}}