{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:M7TD56Y335GZKEON26LWQ3N7FK","short_pith_number":"pith:M7TD56Y3","canonical_record":{"source":{"id":"1801.08639","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-26T00:16:53Z","cross_cats_sorted":["eess.SP","math.IT","stat.ML"],"title_canon_sha256":"e95000b0829df40ae96096f5ae3322d1b68650fb88e396b33b587806e06e90c7","abstract_canon_sha256":"51d0993d41a829a1154d8587ed8e3956124d5030963c1556511f630dff3c45cc"},"schema_version":"1.0"},"canonical_sha256":"67e63efb1bdf4d9511cdd797686dbf2a964ffebc4e33a24428c48431d640b00d","source":{"kind":"arxiv","id":"1801.08639","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08639","created_at":"2026-05-18T00:10:28Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08639v2","created_at":"2026-05-18T00:10:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08639","created_at":"2026-05-18T00:10:28Z"},{"alias_kind":"pith_short_12","alias_value":"M7TD56Y335GZ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M7TD56Y335GZKEON","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M7TD56Y3","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:M7TD56Y335GZKEON26LWQ3N7FK","target":"record","payload":{"canonical_record":{"source":{"id":"1801.08639","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-26T00:16:53Z","cross_cats_sorted":["eess.SP","math.IT","stat.ML"],"title_canon_sha256":"e95000b0829df40ae96096f5ae3322d1b68650fb88e396b33b587806e06e90c7","abstract_canon_sha256":"51d0993d41a829a1154d8587ed8e3956124d5030963c1556511f630dff3c45cc"},"schema_version":"1.0"},"canonical_sha256":"67e63efb1bdf4d9511cdd797686dbf2a964ffebc4e33a24428c48431d640b00d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:28.179555Z","signature_b64":"Gcuk7hfdQDHynOmZ+A4hHU9PxjbwWsdtuUhp1HHKlrzYqM2d3LJvm7kcmYLmSb70dKYcjjIKtK1u15KiitPEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67e63efb1bdf4d9511cdd797686dbf2a964ffebc4e33a24428c48431d640b00d","last_reissued_at":"2026-05-18T00:10:28.178897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:28.178897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.08639","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-18T00:10:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pfJKhs7EpJ6yrmIqiKDWrs8Lq1uq34viY7xwJ8jwl9ALQiQLbeKk/Yl6XPbdvFYwuV6vvClb7o/NhU608JQ3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:05:17.812226Z"},"content_sha256":"fab931534a3da4980f35ca61ea384ae14d6e2ca5a92deada739a01b9772c9a0c","schema_version":"1.0","event_id":"sha256:fab931534a3da4980f35ca61ea384ae14d6e2ca5a92deada739a01b9772c9a0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:M7TD56Y335GZKEON26LWQ3N7FK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast binary embeddings, and quantized compressed sensing with structured matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Rayan Saab, Thang Huynh","submitted_at":"2018-01-26T00:16:53Z","abstract_excerpt":"This paper deals with two related problems, namely distance-preserving binary embeddings and quantization for compressed sensing . First, we propose fast methods to replace points from a subset $\\mathcal{X} \\subset \\mathbb{R}^n$, associated with the Euclidean metric, with points in the cube $\\{\\pm 1\\}^m$ and we associate the cube with a pseudo-metric that approximates Euclidean distance among points in $\\mathcal{X}$. Our methods rely on quantizing fast Johnson-Lindenstrauss embeddings based on bounded orthonormal systems and partial circulant ensembles, both of which admit fast transforms. Our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08639","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-18T00:10:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1FZQLs047YDbEdmh+/YVQnoHnZQfbnRn0WblyLtv8U4kdzIPV/+dkFgV7gtGUbVvOq8eBNUi9HRW4/V2XUqOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:05:17.812597Z"},"content_sha256":"dfa8ae3d1a85ab9b13d31bcb89b0eb6dd8b33423c3b8d8e033c94f5566dc34b3","schema_version":"1.0","event_id":"sha256:dfa8ae3d1a85ab9b13d31bcb89b0eb6dd8b33423c3b8d8e033c94f5566dc34b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M7TD56Y335GZKEON26LWQ3N7FK/bundle.json","state_url":"https://pith.science/pith/M7TD56Y335GZKEON26LWQ3N7FK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M7TD56Y335GZKEON26LWQ3N7FK/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-08T10:05:17Z","links":{"resolver":"https://pith.science/pith/M7TD56Y335GZKEON26LWQ3N7FK","bundle":"https://pith.science/pith/M7TD56Y335GZKEON26LWQ3N7FK/bundle.json","state":"https://pith.science/pith/M7TD56Y335GZKEON26LWQ3N7FK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M7TD56Y335GZKEON26LWQ3N7FK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:M7TD56Y335GZKEON26LWQ3N7FK","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":"51d0993d41a829a1154d8587ed8e3956124d5030963c1556511f630dff3c45cc","cross_cats_sorted":["eess.SP","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-26T00:16:53Z","title_canon_sha256":"e95000b0829df40ae96096f5ae3322d1b68650fb88e396b33b587806e06e90c7"},"schema_version":"1.0","source":{"id":"1801.08639","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08639","created_at":"2026-05-18T00:10:28Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08639v2","created_at":"2026-05-18T00:10:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08639","created_at":"2026-05-18T00:10:28Z"},{"alias_kind":"pith_short_12","alias_value":"M7TD56Y335GZ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"M7TD56Y335GZKEON","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"M7TD56Y3","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:dfa8ae3d1a85ab9b13d31bcb89b0eb6dd8b33423c3b8d8e033c94f5566dc34b3","target":"graph","created_at":"2026-05-18T00:10: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":"This paper deals with two related problems, namely distance-preserving binary embeddings and quantization for compressed sensing . First, we propose fast methods to replace points from a subset $\\mathcal{X} \\subset \\mathbb{R}^n$, associated with the Euclidean metric, with points in the cube $\\{\\pm 1\\}^m$ and we associate the cube with a pseudo-metric that approximates Euclidean distance among points in $\\mathcal{X}$. Our methods rely on quantizing fast Johnson-Lindenstrauss embeddings based on bounded orthonormal systems and partial circulant ensembles, both of which admit fast transforms. Our","authors_text":"Rayan Saab, Thang Huynh","cross_cats":["eess.SP","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-26T00:16:53Z","title":"Fast binary embeddings, and quantized compressed sensing with structured matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08639","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:fab931534a3da4980f35ca61ea384ae14d6e2ca5a92deada739a01b9772c9a0c","target":"record","created_at":"2026-05-18T00:10: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":"51d0993d41a829a1154d8587ed8e3956124d5030963c1556511f630dff3c45cc","cross_cats_sorted":["eess.SP","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-26T00:16:53Z","title_canon_sha256":"e95000b0829df40ae96096f5ae3322d1b68650fb88e396b33b587806e06e90c7"},"schema_version":"1.0","source":{"id":"1801.08639","kind":"arxiv","version":2}},"canonical_sha256":"67e63efb1bdf4d9511cdd797686dbf2a964ffebc4e33a24428c48431d640b00d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67e63efb1bdf4d9511cdd797686dbf2a964ffebc4e33a24428c48431d640b00d","first_computed_at":"2026-05-18T00:10:28.178897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:28.178897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gcuk7hfdQDHynOmZ+A4hHU9PxjbwWsdtuUhp1HHKlrzYqM2d3LJvm7kcmYLmSb70dKYcjjIKtK1u15KiitPEAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:28.179555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.08639","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fab931534a3da4980f35ca61ea384ae14d6e2ca5a92deada739a01b9772c9a0c","sha256:dfa8ae3d1a85ab9b13d31bcb89b0eb6dd8b33423c3b8d8e033c94f5566dc34b3"],"state_sha256":"043541b5d620addd97df919b0a14aeb7a37ea96b34dc85a5b259cad622c5e9a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gdC3wLDIgNBDqhzo89HhPuSubwOFyfnq0CMf6lgrOiJeNOH9h7GPLLvRcOJYjM9UMm3zmz4rzumAyIiuOF6lBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T10:05:17.814500Z","bundle_sha256":"ae681db6fda0b69f76a83079b0d48c864dc61d54b2933e62b573305454a4e7d6"}}