{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WB3C3SB7UCIG6ESP2WUJTXQ7UM","short_pith_number":"pith:WB3C3SB7","schema_version":"1.0","canonical_sha256":"b0762dc83fa0906f124fd5a899de1fa3288c2c11b024290647f22cf56ef1c126","source":{"kind":"arxiv","id":"1902.08171","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.08171","created_at":"2026-05-17T23:53:01.907667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08171v1","created_at":"2026-05-17T23:53:01.907667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08171","created_at":"2026-05-17T23:53:01.907667+00:00"},{"alias_kind":"pith_short_12","alias_value":"WB3C3SB7UCIG","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"WB3C3SB7UCIG6ESP","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"WB3C3SB7","created_at":"2026-05-18T12:33:30.264802+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/WB3C3SB7UCIG6ESP2WUJTXQ7UM","json":"https://pith.science/pith/WB3C3SB7UCIG6ESP2WUJTXQ7UM.json","graph_json":"https://pith.science/api/pith-number/WB3C3SB7UCIG6ESP2WUJTXQ7UM/graph.json","events_json":"https://pith.science/api/pith-number/WB3C3SB7UCIG6ESP2WUJTXQ7UM/events.json","paper":"https://pith.science/paper/WB3C3SB7"},"agent_actions":{"view_html":"https://pith.science/pith/WB3C3SB7UCIG6ESP2WUJTXQ7UM","download_json":"https://pith.science/pith/WB3C3SB7UCIG6ESP2WUJTXQ7UM.json","view_paper":"https://pith.science/paper/WB3C3SB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08171&json=true","fetch_graph":"https://pith.science/api/pith-number/WB3C3SB7UCIG6ESP2WUJTXQ7UM/graph.json","fetch_events":"https://pith.science/api/pith-number/WB3C3SB7UCIG6ESP2WUJTXQ7UM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WB3C3SB7UCIG6ESP2WUJTXQ7UM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WB3C3SB7UCIG6ESP2WUJTXQ7UM/action/storage_attestation","attest_author":"https://pith.science/pith/WB3C3SB7UCIG6ESP2WUJTXQ7UM/action/author_attestation","sign_citation":"https://pith.science/pith/WB3C3SB7UCIG6ESP2WUJTXQ7UM/action/citation_signature","submit_replication":"https://pith.science/pith/WB3C3SB7UCIG6ESP2WUJTXQ7UM/action/replication_record"}},"created_at":"2026-05-17T23:53:01.907667+00:00","updated_at":"2026-05-17T23:53:01.907667+00:00"}