{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:TSW3JHKXTAUZWYFQ4LRZBO7QQF","short_pith_number":"pith:TSW3JHKX","canonical_record":{"source":{"id":"0906.2220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-06-11T21:47:33Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"f145e4d0d2fd0bfb682d130a1ac13a3e7e8d9866f5c1b23ba3763f87f6fa9859","abstract_canon_sha256":"e7c1c13d5dfa65d2ddf6e5315805a3659b6110f495f132824a1e14a7bf4d8279"},"schema_version":"1.0"},"canonical_sha256":"9cadb49d5798299b60b0e2e390bbf08145c1cf1fd9b4132414d2692739087abd","source":{"kind":"arxiv","id":"0906.2220","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.2220","created_at":"2026-05-18T04:16:10Z"},{"alias_kind":"arxiv_version","alias_value":"0906.2220v1","created_at":"2026-05-18T04:16:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.2220","created_at":"2026-05-18T04:16:10Z"},{"alias_kind":"pith_short_12","alias_value":"TSW3JHKXTAUZ","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"TSW3JHKXTAUZWYFQ","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"TSW3JHKX","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:TSW3JHKXTAUZWYFQ4LRZBO7QQF","target":"record","payload":{"canonical_record":{"source":{"id":"0906.2220","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-06-11T21:47:33Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"f145e4d0d2fd0bfb682d130a1ac13a3e7e8d9866f5c1b23ba3763f87f6fa9859","abstract_canon_sha256":"e7c1c13d5dfa65d2ddf6e5315805a3659b6110f495f132824a1e14a7bf4d8279"},"schema_version":"1.0"},"canonical_sha256":"9cadb49d5798299b60b0e2e390bbf08145c1cf1fd9b4132414d2692739087abd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:10.818986Z","signature_b64":"EmAlJEop/yHWxoJLMNofhx0CE/nRAWw59oGc5zKwhASV6EnJlEDyERSMrcpSy73fUE9qZHWqMsZC0WSIA490BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cadb49d5798299b60b0e2e390bbf08145c1cf1fd9b4132414d2692739087abd","last_reissued_at":"2026-05-18T04:16:10.818423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:10.818423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0906.2220","source_version":1,"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-18T04:16:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lpkPohZptZibIZfzvpFtcGJIWUjkboxoR5hUQfZdgK/26NHO5gljd2xxsAkSLdR5+jZlWSwlWkvkSo36h/W2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:18:14.721573Z"},"content_sha256":"32cf6d15b1f586ccd1ff0a7f00ee5b0a38889ea9cf04ab71118de03fe5c6def8","schema_version":"1.0","event_id":"sha256:32cf6d15b1f586ccd1ff0a7f00ee5b0a38889ea9cf04ab71118de03fe5c6def8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:TSW3JHKXTAUZWYFQ4LRZBO7QQF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rank-Sparsity Incoherence for Matrix Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Alan S. Willsky, Pablo A. Parrilo, Sujay Sanghavi, Venkat Chandrasekaran","submitted_at":"2009-06-11T21:47:33Z","abstract_excerpt":"Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-rank components. Such a problem arises in a number of applications in model and system identification, and is NP-hard in general. In this paper we consider a convex optimization formulation to splitting the specified matrix into its components, by minimizing a linear combination of the $\\ell_1$ norm and the nuclear norm of the components. We develop a notion of \\emph{rank-sparsity incoherence}, expressed as an uncertain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.2220","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"},"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-18T04:16:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0SdMvlvxAea9fFW7rjR3VmCJmWi+DR2qaAcXUdBGXdy7e1pY4o6rRZVMbO1ucXDUasPbf//3Y0D3Wz8OQoB7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:18:14.721920Z"},"content_sha256":"36bdd073235c4fde942a67e63e68c6f1526ef1921cfbc3e56220ac40c4484c98","schema_version":"1.0","event_id":"sha256:36bdd073235c4fde942a67e63e68c6f1526ef1921cfbc3e56220ac40c4484c98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSW3JHKXTAUZWYFQ4LRZBO7QQF/bundle.json","state_url":"https://pith.science/pith/TSW3JHKXTAUZWYFQ4LRZBO7QQF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSW3JHKXTAUZWYFQ4LRZBO7QQF/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-05-30T11:18:14Z","links":{"resolver":"https://pith.science/pith/TSW3JHKXTAUZWYFQ4LRZBO7QQF","bundle":"https://pith.science/pith/TSW3JHKXTAUZWYFQ4LRZBO7QQF/bundle.json","state":"https://pith.science/pith/TSW3JHKXTAUZWYFQ4LRZBO7QQF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSW3JHKXTAUZWYFQ4LRZBO7QQF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:TSW3JHKXTAUZWYFQ4LRZBO7QQF","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":"e7c1c13d5dfa65d2ddf6e5315805a3659b6110f495f132824a1e14a7bf4d8279","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-06-11T21:47:33Z","title_canon_sha256":"f145e4d0d2fd0bfb682d130a1ac13a3e7e8d9866f5c1b23ba3763f87f6fa9859"},"schema_version":"1.0","source":{"id":"0906.2220","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.2220","created_at":"2026-05-18T04:16:10Z"},{"alias_kind":"arxiv_version","alias_value":"0906.2220v1","created_at":"2026-05-18T04:16:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.2220","created_at":"2026-05-18T04:16:10Z"},{"alias_kind":"pith_short_12","alias_value":"TSW3JHKXTAUZ","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"TSW3JHKXTAUZWYFQ","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"TSW3JHKX","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:36bdd073235c4fde942a67e63e68c6f1526ef1921cfbc3e56220ac40c4484c98","target":"graph","created_at":"2026-05-18T04:16: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":"Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-rank components. Such a problem arises in a number of applications in model and system identification, and is NP-hard in general. In this paper we consider a convex optimization formulation to splitting the specified matrix into its components, by minimizing a linear combination of the $\\ell_1$ norm and the nuclear norm of the components. We develop a notion of \\emph{rank-sparsity incoherence}, expressed as an uncertain","authors_text":"Alan S. Willsky, Pablo A. Parrilo, Sujay Sanghavi, Venkat Chandrasekaran","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-06-11T21:47:33Z","title":"Rank-Sparsity Incoherence for Matrix Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.2220","kind":"arxiv","version":1},"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:32cf6d15b1f586ccd1ff0a7f00ee5b0a38889ea9cf04ab71118de03fe5c6def8","target":"record","created_at":"2026-05-18T04:16: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":"e7c1c13d5dfa65d2ddf6e5315805a3659b6110f495f132824a1e14a7bf4d8279","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2009-06-11T21:47:33Z","title_canon_sha256":"f145e4d0d2fd0bfb682d130a1ac13a3e7e8d9866f5c1b23ba3763f87f6fa9859"},"schema_version":"1.0","source":{"id":"0906.2220","kind":"arxiv","version":1}},"canonical_sha256":"9cadb49d5798299b60b0e2e390bbf08145c1cf1fd9b4132414d2692739087abd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cadb49d5798299b60b0e2e390bbf08145c1cf1fd9b4132414d2692739087abd","first_computed_at":"2026-05-18T04:16:10.818423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:10.818423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EmAlJEop/yHWxoJLMNofhx0CE/nRAWw59oGc5zKwhASV6EnJlEDyERSMrcpSy73fUE9qZHWqMsZC0WSIA490BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:10.818986Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.2220","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32cf6d15b1f586ccd1ff0a7f00ee5b0a38889ea9cf04ab71118de03fe5c6def8","sha256:36bdd073235c4fde942a67e63e68c6f1526ef1921cfbc3e56220ac40c4484c98"],"state_sha256":"2c8a4ca0f1c974bc50bb481ec2ed6861a63e09c4a1a317fa56e6be22fa313283"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1diWRY+aMAOWYJY1wrS0ZI6zluFisvspBpSedBm/nH49EnP9m6jXsg83CASOos96UUq6suodQRIGQy/Uje1Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:18:14.724003Z","bundle_sha256":"9d0bd3dda66123f13591913759d280ac3434027ba01d3f221658a0153d42f48c"}}