{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VFM7UUBSYG3PKOR7GYOSGQPVMG","short_pith_number":"pith:VFM7UUBS","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"},"canonical_sha256":"a959fa5032c1b6f53a3f361d2341f561809c273a3b147a1d77294423ed297b98","source":{"kind":"arxiv","id":"1205.1580","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1580","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1580v2","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1580","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"VFM7UUBSYG3P","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VFM7UUBSYG3PKOR7","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VFM7UUBS","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VFM7UUBSYG3PKOR7GYOSGQPVMG","target":"record","payload":{"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"},"canonical_sha256":"a959fa5032c1b6f53a3f361d2341f561809c273a3b147a1d77294423ed297b98","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"},"source_kind":"arxiv","source_id":"1205.1580","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-18T02:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b5hi3Sl3GJtDf1bC4VFbk+SsHLL2pf0vrLIPMMCNNZ1/yReOJaqmcHAXLP+gugWlI0eKOBbzD7yOq4nxhNHNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:55:29.232785Z"},"content_sha256":"26eefd7d864f932955a073412c867073ef2ec2a0f896386f86e4dca1da5c9f8e","schema_version":"1.0","event_id":"sha256:26eefd7d864f932955a073412c867073ef2ec2a0f896386f86e4dca1da5c9f8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VFM7UUBSYG3PKOR7GYOSGQPVMG","target":"graph","payload":{"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"},"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-18T02:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P4NNMHb7jLCKOcOBte87EPqNRScVyVG1M4FaHjH/6KkfhDIuqic1RD41dL2R8HixtHSN342NfK/92fsi1aacDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:55:29.233542Z"},"content_sha256":"21649180d7168c436002dde178fa0e0b2af6515786dac9b1674bc45bc51b6e39","schema_version":"1.0","event_id":"sha256:21649180d7168c436002dde178fa0e0b2af6515786dac9b1674bc45bc51b6e39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VFM7UUBSYG3PKOR7GYOSGQPVMG/bundle.json","state_url":"https://pith.science/pith/VFM7UUBSYG3PKOR7GYOSGQPVMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VFM7UUBSYG3PKOR7GYOSGQPVMG/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-09T02:55:29Z","links":{"resolver":"https://pith.science/pith/VFM7UUBSYG3PKOR7GYOSGQPVMG","bundle":"https://pith.science/pith/VFM7UUBSYG3PKOR7GYOSGQPVMG/bundle.json","state":"https://pith.science/pith/VFM7UUBSYG3PKOR7GYOSGQPVMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VFM7UUBSYG3PKOR7GYOSGQPVMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VFM7UUBSYG3PKOR7GYOSGQPVMG","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":"eedfe7afa4b6e8e669ebba5672139c915402993cfbc8b33f9c2d96f2817baf86","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-08T02:52:34Z","title_canon_sha256":"61376d998c8ebfc066a9b34d386d1a6f5eb60b9d0e3791b624b04b255d8c60ff"},"schema_version":"1.0","source":{"id":"1205.1580","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1580","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1580v2","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1580","created_at":"2026-05-18T02:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"VFM7UUBSYG3P","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VFM7UUBSYG3PKOR7","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VFM7UUBS","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:21649180d7168c436002dde178fa0e0b2af6515786dac9b1674bc45bc51b6e39","target":"graph","created_at":"2026-05-18T02:21:10Z","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":"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","authors_text":"Joel A. Tropp, Michael B. McCoy","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-08T02:52:34Z","title":"Sharp recovery bounds for convex demixing, with applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1580","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:26eefd7d864f932955a073412c867073ef2ec2a0f896386f86e4dca1da5c9f8e","target":"record","created_at":"2026-05-18T02:21:10Z","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":"eedfe7afa4b6e8e669ebba5672139c915402993cfbc8b33f9c2d96f2817baf86","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-05-08T02:52:34Z","title_canon_sha256":"61376d998c8ebfc066a9b34d386d1a6f5eb60b9d0e3791b624b04b255d8c60ff"},"schema_version":"1.0","source":{"id":"1205.1580","kind":"arxiv","version":2}},"canonical_sha256":"a959fa5032c1b6f53a3f361d2341f561809c273a3b147a1d77294423ed297b98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a959fa5032c1b6f53a3f361d2341f561809c273a3b147a1d77294423ed297b98","first_computed_at":"2026-05-18T02:21:10.524509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:10.524509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zvIi9qu3NWK31MfM+sFbFN9ZT1HWoh35QkzDYrNaTMzCK2Qo8oqJhtTWBkiDOO3kDLIGUhJKCum/SeBvlSV1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:10.525178Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1580","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26eefd7d864f932955a073412c867073ef2ec2a0f896386f86e4dca1da5c9f8e","sha256:21649180d7168c436002dde178fa0e0b2af6515786dac9b1674bc45bc51b6e39"],"state_sha256":"da285a225a1ebce6108cb73d6b3f4d734f49d1a996472577eb36582b21c8d875"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IcD1UrvkcomK0jVwfSWwB5n3KmdGIufgRpHin09AefL3He3Sykxu+Hl3BGjB1T9cucsy3nUyv0fl7H/LRwXqAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:55:29.238169Z","bundle_sha256":"b7cff88d65fdded0bb0543c22c5643e7b4c676fec581b979d2f9d63a15327ae6"}}