{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:A2ZSDT34GEMDW4AJUNZFKJTAVG","short_pith_number":"pith:A2ZSDT34","canonical_record":{"source":{"id":"1006.3128","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-16T03:24:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e6d41fff1aa3963709b7168ac48fb4fdd0e4d62e873222cd2cfbfd7a97c2dc77","abstract_canon_sha256":"d59fa0ef0727302aa0b7d1ac1553b1713e6f18264182c49c6b44236d395daa7c"},"schema_version":"1.0"},"canonical_sha256":"06b321cf7c31183b7009a372552660a98475af9efd6bbd736c7d925e436d4cf1","source":{"kind":"arxiv","id":"1006.3128","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.3128","created_at":"2026-05-18T03:52:51Z"},{"alias_kind":"arxiv_version","alias_value":"1006.3128v2","created_at":"2026-05-18T03:52:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3128","created_at":"2026-05-18T03:52:51Z"},{"alias_kind":"pith_short_12","alias_value":"A2ZSDT34GEMD","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"A2ZSDT34GEMDW4AJ","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"A2ZSDT34","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:A2ZSDT34GEMDW4AJUNZFKJTAVG","target":"record","payload":{"canonical_record":{"source":{"id":"1006.3128","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-16T03:24:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e6d41fff1aa3963709b7168ac48fb4fdd0e4d62e873222cd2cfbfd7a97c2dc77","abstract_canon_sha256":"d59fa0ef0727302aa0b7d1ac1553b1713e6f18264182c49c6b44236d395daa7c"},"schema_version":"1.0"},"canonical_sha256":"06b321cf7c31183b7009a372552660a98475af9efd6bbd736c7d925e436d4cf1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:51.578126Z","signature_b64":"DMlgVulhrJ+utZhssL5FEyJF37X6RquLIWQQw35MKtoFBwisrLfjKcbaco/5RyUAnNSxi7Mo0Z3ctf4XLR2BDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06b321cf7c31183b7009a372552660a98475af9efd6bbd736c7d925e436d4cf1","last_reissued_at":"2026-05-18T03:52:51.577252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:51.577252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.3128","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-18T03:52:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMuQxc6U9lXl/MJM0hhbmwRaxM0IfRUlUif2kSR2DxGhxjqbsweebtP9Je9bHTUPfbqkHJ19iZQ04zieWX4kCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:12:49.591851Z"},"content_sha256":"42f5a350e2e540c6b7917334cfb8ad9ed11e85d30868b3b45ee25137a5035f10","schema_version":"1.0","event_id":"sha256:42f5a350e2e540c6b7917334cfb8ad9ed11e85d30868b3b45ee25137a5035f10"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:A2ZSDT34GEMDW4AJUNZFKJTAVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Sampling Rate-Distortion Tradeoff for Sparsity Pattern Recovery in Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Galen Reeves, Michael Gastpar","submitted_at":"2010-06-16T03:24:19Z","abstract_excerpt":"Recovery of the sparsity pattern (or support) of an unknown sparse vector from a limited number of noisy linear measurements is an important problem in compressed sensing. In the high-dimensional setting, it is known that recovery with a vanishing fraction of errors is impossible if the measurement rate and the per-sample signal-to-noise ratio (SNR) are finite constants, independent of the vector length. In this paper, it is shown that recovery with an arbitrarily small but constant fraction of errors is, however, possible, and that in some cases computationally simple estimators are near-opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3128","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-18T03:52:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GZkfOaQS05BdC3eBU9w4Bigtc5JNZEVWmWWzUKNz+6z5ansBCHjDQ8ETTQbZItVoyxjZvS2n0vSOylEzWKxxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:12:49.592236Z"},"content_sha256":"0cd8f58a0e04f14c3220b604ae1908462ae321733228ee856c6f9d1795f2cacd","schema_version":"1.0","event_id":"sha256:0cd8f58a0e04f14c3220b604ae1908462ae321733228ee856c6f9d1795f2cacd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A2ZSDT34GEMDW4AJUNZFKJTAVG/bundle.json","state_url":"https://pith.science/pith/A2ZSDT34GEMDW4AJUNZFKJTAVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A2ZSDT34GEMDW4AJUNZFKJTAVG/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-27T22:12:49Z","links":{"resolver":"https://pith.science/pith/A2ZSDT34GEMDW4AJUNZFKJTAVG","bundle":"https://pith.science/pith/A2ZSDT34GEMDW4AJUNZFKJTAVG/bundle.json","state":"https://pith.science/pith/A2ZSDT34GEMDW4AJUNZFKJTAVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A2ZSDT34GEMDW4AJUNZFKJTAVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:A2ZSDT34GEMDW4AJUNZFKJTAVG","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":"d59fa0ef0727302aa0b7d1ac1553b1713e6f18264182c49c6b44236d395daa7c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-16T03:24:19Z","title_canon_sha256":"e6d41fff1aa3963709b7168ac48fb4fdd0e4d62e873222cd2cfbfd7a97c2dc77"},"schema_version":"1.0","source":{"id":"1006.3128","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.3128","created_at":"2026-05-18T03:52:51Z"},{"alias_kind":"arxiv_version","alias_value":"1006.3128v2","created_at":"2026-05-18T03:52:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3128","created_at":"2026-05-18T03:52:51Z"},{"alias_kind":"pith_short_12","alias_value":"A2ZSDT34GEMD","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"A2ZSDT34GEMDW4AJ","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"A2ZSDT34","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:0cd8f58a0e04f14c3220b604ae1908462ae321733228ee856c6f9d1795f2cacd","target":"graph","created_at":"2026-05-18T03:52:51Z","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":"Recovery of the sparsity pattern (or support) of an unknown sparse vector from a limited number of noisy linear measurements is an important problem in compressed sensing. In the high-dimensional setting, it is known that recovery with a vanishing fraction of errors is impossible if the measurement rate and the per-sample signal-to-noise ratio (SNR) are finite constants, independent of the vector length. In this paper, it is shown that recovery with an arbitrarily small but constant fraction of errors is, however, possible, and that in some cases computationally simple estimators are near-opti","authors_text":"Galen Reeves, Michael Gastpar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-16T03:24:19Z","title":"The Sampling Rate-Distortion Tradeoff for Sparsity Pattern Recovery in Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3128","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:42f5a350e2e540c6b7917334cfb8ad9ed11e85d30868b3b45ee25137a5035f10","target":"record","created_at":"2026-05-18T03:52:51Z","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":"d59fa0ef0727302aa0b7d1ac1553b1713e6f18264182c49c6b44236d395daa7c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-16T03:24:19Z","title_canon_sha256":"e6d41fff1aa3963709b7168ac48fb4fdd0e4d62e873222cd2cfbfd7a97c2dc77"},"schema_version":"1.0","source":{"id":"1006.3128","kind":"arxiv","version":2}},"canonical_sha256":"06b321cf7c31183b7009a372552660a98475af9efd6bbd736c7d925e436d4cf1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06b321cf7c31183b7009a372552660a98475af9efd6bbd736c7d925e436d4cf1","first_computed_at":"2026-05-18T03:52:51.577252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:51.577252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DMlgVulhrJ+utZhssL5FEyJF37X6RquLIWQQw35MKtoFBwisrLfjKcbaco/5RyUAnNSxi7Mo0Z3ctf4XLR2BDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:51.578126Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.3128","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42f5a350e2e540c6b7917334cfb8ad9ed11e85d30868b3b45ee25137a5035f10","sha256:0cd8f58a0e04f14c3220b604ae1908462ae321733228ee856c6f9d1795f2cacd"],"state_sha256":"07b34812b2ce28760d67ac170ccc2ff55a3cf9850748b4cc71f8a955b58ab0a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZTVUdwweBsYfSb8qMj44lf1CgH1FMJkirmO3o9h7f8977E1IlMxk90EVDzHM9RjnNe792ufRclS92iw6UF6DCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:12:49.594906Z","bundle_sha256":"9f92b602b8a89e6328a40e9f754ed072ecacf51073c8146bf7a7f2cb94ea5281"}}