{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:J7LBGQY47RNMYLNPGMBAERAXKX","short_pith_number":"pith:J7LBGQY4","canonical_record":{"source":{"id":"2010.00712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-10-01T22:41:41Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"3f6d8ada09a27ec4cbe4620978f30387f7aedd5aaa48bd69a14bcabce192775b","abstract_canon_sha256":"e222938b30de13d0585ea967930df5e89c66fe2a0d7362d1930497b5708af5cb"},"schema_version":"1.0"},"canonical_sha256":"4fd613431cfc5acc2daf330202441755f34f145ccf6e044365ae44fdae0fc44c","source":{"kind":"arxiv","id":"2010.00712","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.00712","created_at":"2026-07-05T02:21:52Z"},{"alias_kind":"arxiv_version","alias_value":"2010.00712v2","created_at":"2026-07-05T02:21:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00712","created_at":"2026-07-05T02:21:52Z"},{"alias_kind":"pith_short_12","alias_value":"J7LBGQY47RNM","created_at":"2026-07-05T02:21:52Z"},{"alias_kind":"pith_short_16","alias_value":"J7LBGQY47RNMYLNP","created_at":"2026-07-05T02:21:52Z"},{"alias_kind":"pith_short_8","alias_value":"J7LBGQY4","created_at":"2026-07-05T02:21:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:J7LBGQY47RNMYLNPGMBAERAXKX","target":"record","payload":{"canonical_record":{"source":{"id":"2010.00712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-10-01T22:41:41Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"3f6d8ada09a27ec4cbe4620978f30387f7aedd5aaa48bd69a14bcabce192775b","abstract_canon_sha256":"e222938b30de13d0585ea967930df5e89c66fe2a0d7362d1930497b5708af5cb"},"schema_version":"1.0"},"canonical_sha256":"4fd613431cfc5acc2daf330202441755f34f145ccf6e044365ae44fdae0fc44c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:21:52.968616Z","signature_b64":"3fpkyyoBniafd2Mqk8+yW5BmSzbnn+ER2URqa33Tw4OehKzT63BS1AGdn9qWKMtDj1hSj6YocH9Dhw/tWC3gAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fd613431cfc5acc2daf330202441755f34f145ccf6e044365ae44fdae0fc44c","last_reissued_at":"2026-07-05T02:21:52.968143Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:21:52.968143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.00712","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-07-05T02:21:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uP59QH52dNMttKqxdEoxlX45leA6PIMC1h03fXtQnp93TKHWVauoLXtSah5QMx1LH8Bf1JLwP1RyDxLrdattCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T08:32:00.716510Z"},"content_sha256":"4fb68dc20247c17990e4f947116a57facf78f19fc198085fd15452881b343cd1","schema_version":"1.0","event_id":"sha256:4fb68dc20247c17990e4f947116a57facf78f19fc198085fd15452881b343cd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:J7LBGQY47RNMYLNPGMBAERAXKX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Binary Embeddings for Preserving Euclidean Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Jinjie Zhang, Rayan Saab","submitted_at":"2020-10-01T22:41:41Z","abstract_excerpt":"We propose a fast, distance-preserving, binary embedding algorithm to transform a high-dimensional dataset $\\mathcal{T}\\subseteq\\mathbb{R}^n$ into binary sequences in the cube $\\{\\pm 1\\}^m$. When $\\mathcal{T}$ consists of well-spread (i.e., non-sparse) vectors, our embedding method applies a stable noise-shaping quantization scheme to $A x$ where $A\\in\\mathbb{R}^{m\\times n}$ is a sparse Gaussian random matrix. This contrasts with most binary embedding methods, which usually use $x\\mapsto \\mathrm{sign}(Ax)$ for the embedding. Moreover, we show that Euclidean distances among the elements of $\\ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.00712","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.00712/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:21:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+stMhUEfe6oLR/r3uk8isgR9zuzOkxqmzQcdBKbnd9MvWtrLrhb3uQr6INGuVRLSW2PWJFsJT8+AjOPKN9TBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T08:32:00.717012Z"},"content_sha256":"53dc74515f0c555a029a15c6ba318e4fdf5ef46f06f16df71aa253a64142c2b7","schema_version":"1.0","event_id":"sha256:53dc74515f0c555a029a15c6ba318e4fdf5ef46f06f16df71aa253a64142c2b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J7LBGQY47RNMYLNPGMBAERAXKX/bundle.json","state_url":"https://pith.science/pith/J7LBGQY47RNMYLNPGMBAERAXKX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J7LBGQY47RNMYLNPGMBAERAXKX/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-08-08T08:32:00Z","links":{"resolver":"https://pith.science/pith/J7LBGQY47RNMYLNPGMBAERAXKX","bundle":"https://pith.science/pith/J7LBGQY47RNMYLNPGMBAERAXKX/bundle.json","state":"https://pith.science/pith/J7LBGQY47RNMYLNPGMBAERAXKX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J7LBGQY47RNMYLNPGMBAERAXKX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:J7LBGQY47RNMYLNPGMBAERAXKX","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":"e222938b30de13d0585ea967930df5e89c66fe2a0d7362d1930497b5708af5cb","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-10-01T22:41:41Z","title_canon_sha256":"3f6d8ada09a27ec4cbe4620978f30387f7aedd5aaa48bd69a14bcabce192775b"},"schema_version":"1.0","source":{"id":"2010.00712","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.00712","created_at":"2026-07-05T02:21:52Z"},{"alias_kind":"arxiv_version","alias_value":"2010.00712v2","created_at":"2026-07-05T02:21:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00712","created_at":"2026-07-05T02:21:52Z"},{"alias_kind":"pith_short_12","alias_value":"J7LBGQY47RNM","created_at":"2026-07-05T02:21:52Z"},{"alias_kind":"pith_short_16","alias_value":"J7LBGQY47RNMYLNP","created_at":"2026-07-05T02:21:52Z"},{"alias_kind":"pith_short_8","alias_value":"J7LBGQY4","created_at":"2026-07-05T02:21:52Z"}],"graph_snapshots":[{"event_id":"sha256:53dc74515f0c555a029a15c6ba318e4fdf5ef46f06f16df71aa253a64142c2b7","target":"graph","created_at":"2026-07-05T02:21:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.00712/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a fast, distance-preserving, binary embedding algorithm to transform a high-dimensional dataset $\\mathcal{T}\\subseteq\\mathbb{R}^n$ into binary sequences in the cube $\\{\\pm 1\\}^m$. When $\\mathcal{T}$ consists of well-spread (i.e., non-sparse) vectors, our embedding method applies a stable noise-shaping quantization scheme to $A x$ where $A\\in\\mathbb{R}^{m\\times n}$ is a sparse Gaussian random matrix. This contrasts with most binary embedding methods, which usually use $x\\mapsto \\mathrm{sign}(Ax)$ for the embedding. Moreover, we show that Euclidean distances among the elements of $\\ma","authors_text":"Jinjie Zhang, Rayan Saab","cross_cats":["cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-10-01T22:41:41Z","title":"Faster Binary Embeddings for Preserving Euclidean Distances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.00712","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:4fb68dc20247c17990e4f947116a57facf78f19fc198085fd15452881b343cd1","target":"record","created_at":"2026-07-05T02:21:52Z","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":"e222938b30de13d0585ea967930df5e89c66fe2a0d7362d1930497b5708af5cb","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-10-01T22:41:41Z","title_canon_sha256":"3f6d8ada09a27ec4cbe4620978f30387f7aedd5aaa48bd69a14bcabce192775b"},"schema_version":"1.0","source":{"id":"2010.00712","kind":"arxiv","version":2}},"canonical_sha256":"4fd613431cfc5acc2daf330202441755f34f145ccf6e044365ae44fdae0fc44c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fd613431cfc5acc2daf330202441755f34f145ccf6e044365ae44fdae0fc44c","first_computed_at":"2026-07-05T02:21:52.968143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:21:52.968143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3fpkyyoBniafd2Mqk8+yW5BmSzbnn+ER2URqa33Tw4OehKzT63BS1AGdn9qWKMtDj1hSj6YocH9Dhw/tWC3gAw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:21:52.968616Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.00712","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fb68dc20247c17990e4f947116a57facf78f19fc198085fd15452881b343cd1","sha256:53dc74515f0c555a029a15c6ba318e4fdf5ef46f06f16df71aa253a64142c2b7"],"state_sha256":"3e783d63147a88382933366053c0e3e5aa564b9f052500cc19c6bae931b85d8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yvzvnl3Acak0dCyL0xRT5Ni5rYTc7g+Bt9wMqfBs8yz6uwYknutFUhtr2zy8yazRaEo0W//w+NhMJcTwUpwMDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T08:32:00.721815Z","bundle_sha256":"089c9f022840d0f7df2b2ba268b541eaef95077362714a9d5cd64bf9dc660621"}}