{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DSDD3LU2OHX2ENZIDEDLH4AVIB","short_pith_number":"pith:DSDD3LU2","canonical_record":{"source":{"id":"1104.3160","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-15T21:14:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8300a484ec5b38a86485cf004cd7ee3273fd48da1344c0daf1c004c1fbe310e0","abstract_canon_sha256":"cb20bb6368023513c2d572cff776c67be6727f8cc5a46cb42f9f67c2b62b3fe4"},"schema_version":"1.0"},"canonical_sha256":"1c863dae9a71efa237281906b3f0154070f20e09e8111add8e8b36107aaa6f62","source":{"kind":"arxiv","id":"1104.3160","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3160","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3160v4","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3160","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"DSDD3LU2OHX2","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DSDD3LU2OHX2ENZI","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DSDD3LU2","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DSDD3LU2OHX2ENZIDEDLH4AVIB","target":"record","payload":{"canonical_record":{"source":{"id":"1104.3160","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-15T21:14:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8300a484ec5b38a86485cf004cd7ee3273fd48da1344c0daf1c004c1fbe310e0","abstract_canon_sha256":"cb20bb6368023513c2d572cff776c67be6727f8cc5a46cb42f9f67c2b62b3fe4"},"schema_version":"1.0"},"canonical_sha256":"1c863dae9a71efa237281906b3f0154070f20e09e8111add8e8b36107aaa6f62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:06.394411Z","signature_b64":"NrPnFMgSZsC1Hra02MsHZ9fxAorQ+p2kdn1iGU6jPD+UAcUOHsn+krZN5i+YaznB8D9oDfECMdlTPbqDhRdPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c863dae9a71efa237281906b3f0154070f20e09e8111add8e8b36107aaa6f62","last_reissued_at":"2026-05-18T01:28:06.393715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:06.393715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.3160","source_version":4,"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-18T01:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"apaZY0t99Z4ViXHEccAfd9NUzockXcJnNJNPFOuwBW9ZM2D5V6zgb/p4JZHRekHXVbqDqEEKtxhvC0r0LihoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T16:15:43.511566Z"},"content_sha256":"bab85c96a27468c13f69bc35f861c9ce0ff492548080d20f7dd311141393c1b6","schema_version":"1.0","event_id":"sha256:bab85c96a27468c13f69bc35f861c9ce0ff492548080d20f7dd311141393c1b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DSDD3LU2OHX2ENZIDEDLH4AVIB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jason N. Laska, Laurent Jacques, Petros T. Boufounos, Richard G. Baraniuk","submitted_at":"2011-04-15T21:14:05Z","abstract_excerpt":"The Compressive Sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse signals. Practical ADCs not only sample but also quantize each measurement to a finite number of bits; moreover, there is an inverse relationship between the achievable sampling rate and the bit depth. In this paper, we investigate an alternative CS approach that shifts the emphasis from the sampling rate to the number of bits per measurement. In particular, we explore the extreme case of 1-bit CS measurements, which c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3160","kind":"arxiv","version":4},"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-18T01:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KmesB3oMVNGjglcwHLTII9Zlg8mph8HJ1WSaXEdUYGsyKcK4BE2YnZaQSVhFOGWaQ2FtqFBiT3qmQ0GKtRHwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T16:15:43.511929Z"},"content_sha256":"9236c31c8178aea46e67ebe85d746658a482b878b64d85b6c8627122a854f8fd","schema_version":"1.0","event_id":"sha256:9236c31c8178aea46e67ebe85d746658a482b878b64d85b6c8627122a854f8fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DSDD3LU2OHX2ENZIDEDLH4AVIB/bundle.json","state_url":"https://pith.science/pith/DSDD3LU2OHX2ENZIDEDLH4AVIB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DSDD3LU2OHX2ENZIDEDLH4AVIB/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-05-18T16:15:43Z","links":{"resolver":"https://pith.science/pith/DSDD3LU2OHX2ENZIDEDLH4AVIB","bundle":"https://pith.science/pith/DSDD3LU2OHX2ENZIDEDLH4AVIB/bundle.json","state":"https://pith.science/pith/DSDD3LU2OHX2ENZIDEDLH4AVIB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DSDD3LU2OHX2ENZIDEDLH4AVIB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DSDD3LU2OHX2ENZIDEDLH4AVIB","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":"cb20bb6368023513c2d572cff776c67be6727f8cc5a46cb42f9f67c2b62b3fe4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-15T21:14:05Z","title_canon_sha256":"8300a484ec5b38a86485cf004cd7ee3273fd48da1344c0daf1c004c1fbe310e0"},"schema_version":"1.0","source":{"id":"1104.3160","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3160","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3160v4","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3160","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"DSDD3LU2OHX2","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DSDD3LU2OHX2ENZI","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DSDD3LU2","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:9236c31c8178aea46e67ebe85d746658a482b878b64d85b6c8627122a854f8fd","target":"graph","created_at":"2026-05-18T01:28:06Z","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":"The Compressive Sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse signals. Practical ADCs not only sample but also quantize each measurement to a finite number of bits; moreover, there is an inverse relationship between the achievable sampling rate and the bit depth. In this paper, we investigate an alternative CS approach that shifts the emphasis from the sampling rate to the number of bits per measurement. In particular, we explore the extreme case of 1-bit CS measurements, which c","authors_text":"Jason N. Laska, Laurent Jacques, Petros T. Boufounos, Richard G. Baraniuk","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-15T21:14:05Z","title":"Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3160","kind":"arxiv","version":4},"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:bab85c96a27468c13f69bc35f861c9ce0ff492548080d20f7dd311141393c1b6","target":"record","created_at":"2026-05-18T01:28:06Z","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":"cb20bb6368023513c2d572cff776c67be6727f8cc5a46cb42f9f67c2b62b3fe4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-15T21:14:05Z","title_canon_sha256":"8300a484ec5b38a86485cf004cd7ee3273fd48da1344c0daf1c004c1fbe310e0"},"schema_version":"1.0","source":{"id":"1104.3160","kind":"arxiv","version":4}},"canonical_sha256":"1c863dae9a71efa237281906b3f0154070f20e09e8111add8e8b36107aaa6f62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c863dae9a71efa237281906b3f0154070f20e09e8111add8e8b36107aaa6f62","first_computed_at":"2026-05-18T01:28:06.393715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:06.393715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NrPnFMgSZsC1Hra02MsHZ9fxAorQ+p2kdn1iGU6jPD+UAcUOHsn+krZN5i+YaznB8D9oDfECMdlTPbqDhRdPDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:06.394411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3160","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bab85c96a27468c13f69bc35f861c9ce0ff492548080d20f7dd311141393c1b6","sha256:9236c31c8178aea46e67ebe85d746658a482b878b64d85b6c8627122a854f8fd"],"state_sha256":"b0551c4269b0491bb5dacfe317eb1911abbe429d925bb6d9f6f0fe1454eb4f6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BCS6hUB+3sMRrEjYczFmXi7qdkGhLxVwkGiSvQWewCtbGTz8dhQbAUxB0/Xpqwm00Ay5rEAMpeEKxV2bHCZzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T16:15:43.513886Z","bundle_sha256":"e364d138a6b75d1a6817b7e013e0bb9ea85523d922102de5dcb594c956a7e3a2"}}