{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WB3C3SB7UCIG6ESP2WUJTXQ7UM","short_pith_number":"pith:WB3C3SB7","canonical_record":{"source":{"id":"1902.08171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-21T18:16:18Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"9387e73687db4ad6aa7c513b190c5c4c35ad6a08ea0d1e709cb6c9438f66f708","abstract_canon_sha256":"d334e9c51364e889f6c6d2c70307d716b4c8f4369450d5578d580c7c935f22d5"},"schema_version":"1.0"},"canonical_sha256":"b0762dc83fa0906f124fd5a899de1fa3288c2c11b024290647f22cf56ef1c126","source":{"kind":"arxiv","id":"1902.08171","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08171","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08171v1","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08171","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"pith_short_12","alias_value":"WB3C3SB7UCIG","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WB3C3SB7UCIG6ESP","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WB3C3SB7","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WB3C3SB7UCIG6ESP2WUJTXQ7UM","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-21T18:16:18Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"9387e73687db4ad6aa7c513b190c5c4c35ad6a08ea0d1e709cb6c9438f66f708","abstract_canon_sha256":"d334e9c51364e889f6c6d2c70307d716b4c8f4369450d5578d580c7c935f22d5"},"schema_version":"1.0"},"canonical_sha256":"b0762dc83fa0906f124fd5a899de1fa3288c2c11b024290647f22cf56ef1c126","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:01.908078Z","signature_b64":"gGe2uWHuElXPuLF51lfhujHLFppW9wuf1jsOu4Z/Go7b+k+Iii1h3v/GlS5jYBVJiRmEJEnAxA9Hjmet5wbcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0762dc83fa0906f124fd5a899de1fa3288c2c11b024290647f22cf56ef1c126","last_reissued_at":"2026-05-17T23:53:01.907597Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:01.907597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08171","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-17T23:53:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCH40RXD8KQIMyLfVa/7f3wmKLE7W3g5NnWtHRjEj4W62PxHcBzwBuossjWLAvMGnN0+ZVwre72GbBWxhQweCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:24:42.496141Z"},"content_sha256":"6b2b9fdb36428bb7a5c6bf3bf8c596bc43a6af93d29362b08007cfdbe6539f66","schema_version":"1.0","event_id":"sha256:6b2b9fdb36428bb7a5c6bf3bf8c596bc43a6af93d29362b08007cfdbe6539f66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WB3C3SB7UCIG6ESP2WUJTXQ7UM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Dictionary Based Generalization of Robust PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jarvis Haupt, Sirisha Rambhatla, Xingguo Li","submitted_at":"2019-02-21T18:16:18Z","abstract_excerpt":"We analyze the decomposition of a data matrix, assumed to be a superposition of a low-rank component and a component which is sparse in a known dictionary, using a convex demixing method. We provide a unified analysis, encompassing both undercomplete and overcomplete dictionary cases, and show that the constituent components can be successfully recovered under some relatively mild assumptions up to a certain $\\textit{global}$ sparsity level. Further, we corroborate our theoretical results by presenting empirical evaluations in terms of phase transitions in rank and sparsity for various diction"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08171","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-17T23:53:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xIKLgwu57nqkBiupgs/C1HwlqH4GjYaUln/CGUv04qtAWuFHceM+xDwtx9RmCaRqrhDfdLuugk7JBH4aoKtKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:24:42.496830Z"},"content_sha256":"f55b9f874a234e57424b5598e20795574d8ea3dd32d2012e8d0341d255d6fd63","schema_version":"1.0","event_id":"sha256:f55b9f874a234e57424b5598e20795574d8ea3dd32d2012e8d0341d255d6fd63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WB3C3SB7UCIG6ESP2WUJTXQ7UM/bundle.json","state_url":"https://pith.science/pith/WB3C3SB7UCIG6ESP2WUJTXQ7UM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WB3C3SB7UCIG6ESP2WUJTXQ7UM/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-25T23:24:42Z","links":{"resolver":"https://pith.science/pith/WB3C3SB7UCIG6ESP2WUJTXQ7UM","bundle":"https://pith.science/pith/WB3C3SB7UCIG6ESP2WUJTXQ7UM/bundle.json","state":"https://pith.science/pith/WB3C3SB7UCIG6ESP2WUJTXQ7UM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WB3C3SB7UCIG6ESP2WUJTXQ7UM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WB3C3SB7UCIG6ESP2WUJTXQ7UM","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":"d334e9c51364e889f6c6d2c70307d716b4c8f4369450d5578d580c7c935f22d5","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-21T18:16:18Z","title_canon_sha256":"9387e73687db4ad6aa7c513b190c5c4c35ad6a08ea0d1e709cb6c9438f66f708"},"schema_version":"1.0","source":{"id":"1902.08171","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08171","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08171v1","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08171","created_at":"2026-05-17T23:53:01Z"},{"alias_kind":"pith_short_12","alias_value":"WB3C3SB7UCIG","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WB3C3SB7UCIG6ESP","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WB3C3SB7","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:f55b9f874a234e57424b5598e20795574d8ea3dd32d2012e8d0341d255d6fd63","target":"graph","created_at":"2026-05-17T23:53:01Z","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":"We analyze the decomposition of a data matrix, assumed to be a superposition of a low-rank component and a component which is sparse in a known dictionary, using a convex demixing method. We provide a unified analysis, encompassing both undercomplete and overcomplete dictionary cases, and show that the constituent components can be successfully recovered under some relatively mild assumptions up to a certain $\\textit{global}$ sparsity level. Further, we corroborate our theoretical results by presenting empirical evaluations in terms of phase transitions in rank and sparsity for various diction","authors_text":"Jarvis Haupt, Sirisha Rambhatla, Xingguo Li","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-21T18:16:18Z","title":"A Dictionary Based Generalization of Robust PCA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08171","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:6b2b9fdb36428bb7a5c6bf3bf8c596bc43a6af93d29362b08007cfdbe6539f66","target":"record","created_at":"2026-05-17T23:53:01Z","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":"d334e9c51364e889f6c6d2c70307d716b4c8f4369450d5578d580c7c935f22d5","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-21T18:16:18Z","title_canon_sha256":"9387e73687db4ad6aa7c513b190c5c4c35ad6a08ea0d1e709cb6c9438f66f708"},"schema_version":"1.0","source":{"id":"1902.08171","kind":"arxiv","version":1}},"canonical_sha256":"b0762dc83fa0906f124fd5a899de1fa3288c2c11b024290647f22cf56ef1c126","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0762dc83fa0906f124fd5a899de1fa3288c2c11b024290647f22cf56ef1c126","first_computed_at":"2026-05-17T23:53:01.907597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:01.907597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gGe2uWHuElXPuLF51lfhujHLFppW9wuf1jsOu4Z/Go7b+k+Iii1h3v/GlS5jYBVJiRmEJEnAxA9Hjmet5wbcBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:01.908078Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08171","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b2b9fdb36428bb7a5c6bf3bf8c596bc43a6af93d29362b08007cfdbe6539f66","sha256:f55b9f874a234e57424b5598e20795574d8ea3dd32d2012e8d0341d255d6fd63"],"state_sha256":"7682d038979c4446abcc51df7d1ec265f2ecea941ef09e8dd70f1479cd1aed29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hkuOOfxFQx7SP59EkYD4f5YPjzwZHTD5qq7K0tJhhNqvTUCKImDj7Fgn/Puf/vqGeNIhtnQT/gIv0SsmggWiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:24:42.500739Z","bundle_sha256":"0e79d748f685d26acd647e5e9e50da4ace8bbf90fe516b7c76f20a0b2dc59345"}}