{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AO3INE2NS67EFMAC5VIPS6KW7V","short_pith_number":"pith:AO3INE2N","canonical_record":{"source":{"id":"1706.09087","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-28T00:46:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f1d7c40c5f2cce14d2a87c66a0f876b3060cfb534a813178046bb92d88d0e2e5","abstract_canon_sha256":"76d8e86ffcc40c8a37f0fe3403494039c900ec1edff8b0aa5afb13b0ec228ad1"},"schema_version":"1.0"},"canonical_sha256":"03b686934d97be42b002ed50f97956fd562dec4d962c6c2905116c9f8bacc4d6","source":{"kind":"arxiv","id":"1706.09087","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09087","created_at":"2026-05-18T00:19:30Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09087v3","created_at":"2026-05-18T00:19:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09087","created_at":"2026-05-18T00:19:30Z"},{"alias_kind":"pith_short_12","alias_value":"AO3INE2NS67E","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AO3INE2NS67EFMAC","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AO3INE2N","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AO3INE2NS67EFMAC5VIPS6KW7V","target":"record","payload":{"canonical_record":{"source":{"id":"1706.09087","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-28T00:46:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f1d7c40c5f2cce14d2a87c66a0f876b3060cfb534a813178046bb92d88d0e2e5","abstract_canon_sha256":"76d8e86ffcc40c8a37f0fe3403494039c900ec1edff8b0aa5afb13b0ec228ad1"},"schema_version":"1.0"},"canonical_sha256":"03b686934d97be42b002ed50f97956fd562dec4d962c6c2905116c9f8bacc4d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:30.010742Z","signature_b64":"XiknVslvjGgPrJlLhuYzDgFnYgXfHYPtR7flXYgyJqLelT+FR+JGLltEUCkP+f88NuO5LwCIff0w/Ljvo6ncCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03b686934d97be42b002ed50f97956fd562dec4d962c6c2905116c9f8bacc4d6","last_reissued_at":"2026-05-18T00:19:30.010208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:30.010208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.09087","source_version":3,"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:19:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8yYW1qQY5LqnLu/liD6bxeqZQW1e5Bzt+VxWD70LBE0GyxFWXqmfAXnBYJo0UFn8Xjx7Emn72D1DjQdZ3+uwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:13:52.023758Z"},"content_sha256":"b2cc0a1f212addf482b2c892cdebf17c4db800d72a734a59fd09d1e43c33aff0","schema_version":"1.0","event_id":"sha256:b2cc0a1f212addf482b2c892cdebf17c4db800d72a734a59fd09d1e43c33aff0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AO3INE2NS67EFMAC5VIPS6KW7V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Ling, Lu Gan, Peng Zhang, Sumei Sun","submitted_at":"2017-06-28T00:46:01Z","abstract_excerpt":"We study the problem of recovering an $s$-sparse signal $\\mathbf{x}^{\\star}\\in\\mathbb{C}^n$ from corrupted measurements $\\mathbf{y} = \\mathbf{A}\\mathbf{x}^{\\star}+\\mathbf{z}^{\\star}+\\mathbf{w}$, where $\\mathbf{z}^{\\star}\\in\\mathbb{C}^m$ is a $k$-sparse corruption vector whose nonzero entries may be arbitrarily large and $\\mathbf{w}\\in\\mathbb{C}^m$ is a dense noise with bounded energy. The aim is to exactly and stably recover the sparse signal with tractable optimization programs. In this paper, we prove the uniform recovery guarantee of this problem for two classes of structured sensing matric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09087","kind":"arxiv","version":3},"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:19:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMW58DWRTawZugz54NBHReIa5WvDHHzT0M33vlN7wbHe8uIKQHVpf8MKPqkDZAW+9ZOIHRkUGSZUPlhXs096BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:13:52.024855Z"},"content_sha256":"4475e7e67b5d4c3fa1964b2f02daa5b0e77cb72453e3c68cec4d791fa874128f","schema_version":"1.0","event_id":"sha256:4475e7e67b5d4c3fa1964b2f02daa5b0e77cb72453e3c68cec4d791fa874128f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AO3INE2NS67EFMAC5VIPS6KW7V/bundle.json","state_url":"https://pith.science/pith/AO3INE2NS67EFMAC5VIPS6KW7V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AO3INE2NS67EFMAC5VIPS6KW7V/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-01T04:13:52Z","links":{"resolver":"https://pith.science/pith/AO3INE2NS67EFMAC5VIPS6KW7V","bundle":"https://pith.science/pith/AO3INE2NS67EFMAC5VIPS6KW7V/bundle.json","state":"https://pith.science/pith/AO3INE2NS67EFMAC5VIPS6KW7V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AO3INE2NS67EFMAC5VIPS6KW7V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AO3INE2NS67EFMAC5VIPS6KW7V","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":"76d8e86ffcc40c8a37f0fe3403494039c900ec1edff8b0aa5afb13b0ec228ad1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-28T00:46:01Z","title_canon_sha256":"f1d7c40c5f2cce14d2a87c66a0f876b3060cfb534a813178046bb92d88d0e2e5"},"schema_version":"1.0","source":{"id":"1706.09087","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09087","created_at":"2026-05-18T00:19:30Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09087v3","created_at":"2026-05-18T00:19:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09087","created_at":"2026-05-18T00:19:30Z"},{"alias_kind":"pith_short_12","alias_value":"AO3INE2NS67E","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AO3INE2NS67EFMAC","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AO3INE2N","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:4475e7e67b5d4c3fa1964b2f02daa5b0e77cb72453e3c68cec4d791fa874128f","target":"graph","created_at":"2026-05-18T00:19:30Z","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":"We study the problem of recovering an $s$-sparse signal $\\mathbf{x}^{\\star}\\in\\mathbb{C}^n$ from corrupted measurements $\\mathbf{y} = \\mathbf{A}\\mathbf{x}^{\\star}+\\mathbf{z}^{\\star}+\\mathbf{w}$, where $\\mathbf{z}^{\\star}\\in\\mathbb{C}^m$ is a $k$-sparse corruption vector whose nonzero entries may be arbitrarily large and $\\mathbf{w}\\in\\mathbb{C}^m$ is a dense noise with bounded energy. The aim is to exactly and stably recover the sparse signal with tractable optimization programs. In this paper, we prove the uniform recovery guarantee of this problem for two classes of structured sensing matric","authors_text":"Cong Ling, Lu Gan, Peng Zhang, Sumei Sun","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-28T00:46:01Z","title":"Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09087","kind":"arxiv","version":3},"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:b2cc0a1f212addf482b2c892cdebf17c4db800d72a734a59fd09d1e43c33aff0","target":"record","created_at":"2026-05-18T00:19:30Z","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":"76d8e86ffcc40c8a37f0fe3403494039c900ec1edff8b0aa5afb13b0ec228ad1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-28T00:46:01Z","title_canon_sha256":"f1d7c40c5f2cce14d2a87c66a0f876b3060cfb534a813178046bb92d88d0e2e5"},"schema_version":"1.0","source":{"id":"1706.09087","kind":"arxiv","version":3}},"canonical_sha256":"03b686934d97be42b002ed50f97956fd562dec4d962c6c2905116c9f8bacc4d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03b686934d97be42b002ed50f97956fd562dec4d962c6c2905116c9f8bacc4d6","first_computed_at":"2026-05-18T00:19:30.010208Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:30.010208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XiknVslvjGgPrJlLhuYzDgFnYgXfHYPtR7flXYgyJqLelT+FR+JGLltEUCkP+f88NuO5LwCIff0w/Ljvo6ncCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:30.010742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09087","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2cc0a1f212addf482b2c892cdebf17c4db800d72a734a59fd09d1e43c33aff0","sha256:4475e7e67b5d4c3fa1964b2f02daa5b0e77cb72453e3c68cec4d791fa874128f"],"state_sha256":"cbe6f79027db16746c277b1bf8d478553763d536cef8f7fdf27aa51ed6a4e235"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Dx8dtDurNtUgnfU2RGoTy8Dq5Cpv4g8vchC2CFxl89V2b9HzGgJ41uk8uY3sd8sQ6uUxJNFiLPeA3HZbQcVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:13:52.028467Z","bundle_sha256":"62a080154ee53c288d7f122c10104578abc95b9ab59002df5fe07e5978f3104b"}}