{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5HH5QF3EUDZ5VENHIRKUTPBO5E","short_pith_number":"pith:5HH5QF3E","schema_version":"1.0","canonical_sha256":"e9cfd81764a0f3da91a7445549bc2ee9309bd2a9cfd8a634468783789a25fb79","source":{"kind":"arxiv","id":"1309.7478","version":1},"attestation_state":"computed","paper":{"title":"The achievable performance of convex demixing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Joel A. Tropp, Michael B. McCoy","submitted_at":"2013-09-28T17:01:13Z","abstract_excerpt":"Demixing is the problem of identifying multiple structured signals from a superimposed, undersampled, and noisy observation. This work analyzes a general framework, based on convex optimization, for solving demixing problems. When the constituent signals follow a generic incoherence model, this analysis leads to precise recovery guarantees. These results admit an attractive interpretation: each signal possesses an intrinsic degrees-of-freedom parameter, and demixing can succeed if and only if the dimension of the observation exceeds the total degrees of freedom present in the observation."},"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":"1309.7478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-09-28T17:01:13Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"16c07c7d5420b3934559bee4081168f7c5e4e9fcd76d81ce4dccbcc6239c80db","abstract_canon_sha256":"53e8ef20f9074b318ac6551887401fd95e5df68adea213fc051da2a587539e81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:58.575960Z","signature_b64":"9qEae4CwEnHSJB2OljWNpEx8ymdaeJD/aMHKhMJwj8LAvcCh4b+WcqTulC1sQftNYp6cNpD+/w0TRk9WG5FoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9cfd81764a0f3da91a7445549bc2ee9309bd2a9cfd8a634468783789a25fb79","last_reissued_at":"2026-05-18T03:11:58.575381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:58.575381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The achievable performance of convex demixing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Joel A. Tropp, Michael B. McCoy","submitted_at":"2013-09-28T17:01:13Z","abstract_excerpt":"Demixing is the problem of identifying multiple structured signals from a superimposed, undersampled, and noisy observation. This work analyzes a general framework, based on convex optimization, for solving demixing problems. When the constituent signals follow a generic incoherence model, this analysis leads to precise recovery guarantees. These results admit an attractive interpretation: each signal possesses an intrinsic degrees-of-freedom parameter, and demixing can succeed if and only if the dimension of the observation exceeds the total degrees of freedom present in the observation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7478","kind":"arxiv","version":1},"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":"1309.7478","created_at":"2026-05-18T03:11:58.575486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7478v1","created_at":"2026-05-18T03:11:58.575486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7478","created_at":"2026-05-18T03:11:58.575486+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HH5QF3EUDZ5","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HH5QF3EUDZ5VENH","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HH5QF3E","created_at":"2026-05-18T12:27:34.582898+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/5HH5QF3EUDZ5VENHIRKUTPBO5E","json":"https://pith.science/pith/5HH5QF3EUDZ5VENHIRKUTPBO5E.json","graph_json":"https://pith.science/api/pith-number/5HH5QF3EUDZ5VENHIRKUTPBO5E/graph.json","events_json":"https://pith.science/api/pith-number/5HH5QF3EUDZ5VENHIRKUTPBO5E/events.json","paper":"https://pith.science/paper/5HH5QF3E"},"agent_actions":{"view_html":"https://pith.science/pith/5HH5QF3EUDZ5VENHIRKUTPBO5E","download_json":"https://pith.science/pith/5HH5QF3EUDZ5VENHIRKUTPBO5E.json","view_paper":"https://pith.science/paper/5HH5QF3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7478&json=true","fetch_graph":"https://pith.science/api/pith-number/5HH5QF3EUDZ5VENHIRKUTPBO5E/graph.json","fetch_events":"https://pith.science/api/pith-number/5HH5QF3EUDZ5VENHIRKUTPBO5E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HH5QF3EUDZ5VENHIRKUTPBO5E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HH5QF3EUDZ5VENHIRKUTPBO5E/action/storage_attestation","attest_author":"https://pith.science/pith/5HH5QF3EUDZ5VENHIRKUTPBO5E/action/author_attestation","sign_citation":"https://pith.science/pith/5HH5QF3EUDZ5VENHIRKUTPBO5E/action/citation_signature","submit_replication":"https://pith.science/pith/5HH5QF3EUDZ5VENHIRKUTPBO5E/action/replication_record"}},"created_at":"2026-05-18T03:11:58.575486+00:00","updated_at":"2026-05-18T03:11:58.575486+00:00"}