{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:J7LBGQY47RNMYLNPGMBAERAXKX","short_pith_number":"pith:J7LBGQY4","schema_version":"1.0","canonical_sha256":"4fd613431cfc5acc2daf330202441755f34f145ccf6e044365ae44fdae0fc44c","source":{"kind":"arxiv","id":"2010.00712","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2010.00712","created_at":"2026-07-05T02:21:52.968200+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.00712v2","created_at":"2026-07-05T02:21:52.968200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.00712","created_at":"2026-07-05T02:21:52.968200+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7LBGQY47RNM","created_at":"2026-07-05T02:21:52.968200+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7LBGQY47RNMYLNP","created_at":"2026-07-05T02:21:52.968200+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7LBGQY4","created_at":"2026-07-05T02:21:52.968200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07361","citing_title":"Word2Spike: Poisson Rate Coding for Associative Memories and Neuromorphic Algorithms","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J7LBGQY47RNMYLNPGMBAERAXKX","json":"https://pith.science/pith/J7LBGQY47RNMYLNPGMBAERAXKX.json","graph_json":"https://pith.science/api/pith-number/J7LBGQY47RNMYLNPGMBAERAXKX/graph.json","events_json":"https://pith.science/api/pith-number/J7LBGQY47RNMYLNPGMBAERAXKX/events.json","paper":"https://pith.science/paper/J7LBGQY4"},"agent_actions":{"view_html":"https://pith.science/pith/J7LBGQY47RNMYLNPGMBAERAXKX","download_json":"https://pith.science/pith/J7LBGQY47RNMYLNPGMBAERAXKX.json","view_paper":"https://pith.science/paper/J7LBGQY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.00712&json=true","fetch_graph":"https://pith.science/api/pith-number/J7LBGQY47RNMYLNPGMBAERAXKX/graph.json","fetch_events":"https://pith.science/api/pith-number/J7LBGQY47RNMYLNPGMBAERAXKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7LBGQY47RNMYLNPGMBAERAXKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7LBGQY47RNMYLNPGMBAERAXKX/action/storage_attestation","attest_author":"https://pith.science/pith/J7LBGQY47RNMYLNPGMBAERAXKX/action/author_attestation","sign_citation":"https://pith.science/pith/J7LBGQY47RNMYLNPGMBAERAXKX/action/citation_signature","submit_replication":"https://pith.science/pith/J7LBGQY47RNMYLNPGMBAERAXKX/action/replication_record"}},"created_at":"2026-07-05T02:21:52.968200+00:00","updated_at":"2026-07-05T02:21:52.968200+00:00"}