{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VFM7UUBSYG3PKOR7GYOSGQPVMG","short_pith_number":"pith:VFM7UUBS","schema_version":"1.0","canonical_sha256":"a959fa5032c1b6f53a3f361d2341f561809c273a3b147a1d77294423ed297b98","source":{"kind":"arxiv","id":"1205.1580","version":2},"attestation_state":"computed","paper":{"title":"Sharp recovery bounds for convex demixing, with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joel A. Tropp, Michael B. McCoy","submitted_at":"2012-05-08T02:52:34Z","abstract_excerpt":"Demixing refers to the challenge of identifying two structured signals given only the sum of the two signals and prior information about their structures. Examples include the problem of separating a signal that is sparse with respect to one basis from a signal that is sparse with respect to a second basis, and the problem of decomposing an observed matrix into a low-rank matrix plus a sparse matrix. This paper describes and analyzes a framework, based on convex optimization, for solving these demixing problems, and many others. This work introduces a randomized signal model which ensures that"},"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":"1205.1580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-08T02:52:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"61376d998c8ebfc066a9b34d386d1a6f5eb60b9d0e3791b624b04b255d8c60ff","abstract_canon_sha256":"eedfe7afa4b6e8e669ebba5672139c915402993cfbc8b33f9c2d96f2817baf86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:10.525178Z","signature_b64":"zvIi9qu3NWK31MfM+sFbFN9ZT1HWoh35QkzDYrNaTMzCK2Qo8oqJhtTWBkiDOO3kDLIGUhJKCum/SeBvlSV1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a959fa5032c1b6f53a3f361d2341f561809c273a3b147a1d77294423ed297b98","last_reissued_at":"2026-05-18T02:21:10.524509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:10.524509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp recovery bounds for convex demixing, with applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Joel A. Tropp, Michael B. McCoy","submitted_at":"2012-05-08T02:52:34Z","abstract_excerpt":"Demixing refers to the challenge of identifying two structured signals given only the sum of the two signals and prior information about their structures. Examples include the problem of separating a signal that is sparse with respect to one basis from a signal that is sparse with respect to a second basis, and the problem of decomposing an observed matrix into a low-rank matrix plus a sparse matrix. This paper describes and analyzes a framework, based on convex optimization, for solving these demixing problems, and many others. This work introduces a randomized signal model which ensures that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1580","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.1580","created_at":"2026-05-18T02:21:10.524597+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1580v2","created_at":"2026-05-18T02:21:10.524597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1580","created_at":"2026-05-18T02:21:10.524597+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFM7UUBSYG3P","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFM7UUBSYG3PKOR7","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFM7UUBS","created_at":"2026-05-18T12:27:25.539911+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/VFM7UUBSYG3PKOR7GYOSGQPVMG","json":"https://pith.science/pith/VFM7UUBSYG3PKOR7GYOSGQPVMG.json","graph_json":"https://pith.science/api/pith-number/VFM7UUBSYG3PKOR7GYOSGQPVMG/graph.json","events_json":"https://pith.science/api/pith-number/VFM7UUBSYG3PKOR7GYOSGQPVMG/events.json","paper":"https://pith.science/paper/VFM7UUBS"},"agent_actions":{"view_html":"https://pith.science/pith/VFM7UUBSYG3PKOR7GYOSGQPVMG","download_json":"https://pith.science/pith/VFM7UUBSYG3PKOR7GYOSGQPVMG.json","view_paper":"https://pith.science/paper/VFM7UUBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1580&json=true","fetch_graph":"https://pith.science/api/pith-number/VFM7UUBSYG3PKOR7GYOSGQPVMG/graph.json","fetch_events":"https://pith.science/api/pith-number/VFM7UUBSYG3PKOR7GYOSGQPVMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFM7UUBSYG3PKOR7GYOSGQPVMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFM7UUBSYG3PKOR7GYOSGQPVMG/action/storage_attestation","attest_author":"https://pith.science/pith/VFM7UUBSYG3PKOR7GYOSGQPVMG/action/author_attestation","sign_citation":"https://pith.science/pith/VFM7UUBSYG3PKOR7GYOSGQPVMG/action/citation_signature","submit_replication":"https://pith.science/pith/VFM7UUBSYG3PKOR7GYOSGQPVMG/action/replication_record"}},"created_at":"2026-05-18T02:21:10.524597+00:00","updated_at":"2026-05-18T02:21:10.524597+00:00"}