{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AO3INE2NS67EFMAC5VIPS6KW7V","short_pith_number":"pith:AO3INE2N","schema_version":"1.0","canonical_sha256":"03b686934d97be42b002ed50f97956fd562dec4d962c6c2905116c9f8bacc4d6","source":{"kind":"arxiv","id":"1706.09087","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.09087","created_at":"2026-05-18T00:19:30.010295+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.09087v3","created_at":"2026-05-18T00:19:30.010295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09087","created_at":"2026-05-18T00:19:30.010295+00:00"},{"alias_kind":"pith_short_12","alias_value":"AO3INE2NS67E","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AO3INE2NS67EFMAC","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AO3INE2N","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AO3INE2NS67EFMAC5VIPS6KW7V","json":"https://pith.science/pith/AO3INE2NS67EFMAC5VIPS6KW7V.json","graph_json":"https://pith.science/api/pith-number/AO3INE2NS67EFMAC5VIPS6KW7V/graph.json","events_json":"https://pith.science/api/pith-number/AO3INE2NS67EFMAC5VIPS6KW7V/events.json","paper":"https://pith.science/paper/AO3INE2N"},"agent_actions":{"view_html":"https://pith.science/pith/AO3INE2NS67EFMAC5VIPS6KW7V","download_json":"https://pith.science/pith/AO3INE2NS67EFMAC5VIPS6KW7V.json","view_paper":"https://pith.science/paper/AO3INE2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.09087&json=true","fetch_graph":"https://pith.science/api/pith-number/AO3INE2NS67EFMAC5VIPS6KW7V/graph.json","fetch_events":"https://pith.science/api/pith-number/AO3INE2NS67EFMAC5VIPS6KW7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AO3INE2NS67EFMAC5VIPS6KW7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AO3INE2NS67EFMAC5VIPS6KW7V/action/storage_attestation","attest_author":"https://pith.science/pith/AO3INE2NS67EFMAC5VIPS6KW7V/action/author_attestation","sign_citation":"https://pith.science/pith/AO3INE2NS67EFMAC5VIPS6KW7V/action/citation_signature","submit_replication":"https://pith.science/pith/AO3INE2NS67EFMAC5VIPS6KW7V/action/replication_record"}},"created_at":"2026-05-18T00:19:30.010295+00:00","updated_at":"2026-05-18T00:19:30.010295+00:00"}