{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OKPTSP5S3CKCS6PERYVOTY6GA7","short_pith_number":"pith:OKPTSP5S","schema_version":"1.0","canonical_sha256":"729f393fb2d8942979e48e2ae9e3c607f2da0661ea0b4cebc79f985866b72d63","source":{"kind":"arxiv","id":"1108.5359","version":4},"attestation_state":"computed","paper":{"title":"Solving Principal Component Pursuit in Linear Time via $l_1$ Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.NA","authors_text":"Risheng Liu, Siming Wei, Zhixun Su, Zhouchen Lin","submitted_at":"2011-08-26T17:40:30Z","abstract_excerpt":"In the past decades, exactly recovering the intrinsic data structure from corrupted observations, which is known as robust principal component analysis (RPCA), has attracted tremendous interests and found many applications in computer vision. Recently, this problem has been formulated as recovering a low-rank component and a sparse component from the observed data matrix. It is proved that under some suitable conditions, this problem can be exactly solved by principal component pursuit (PCP), i.e., minimizing a combination of nuclear norm and $l_1$ norm. Most of the existing methods for solvin"},"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":"1108.5359","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2011-08-26T17:40:30Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"b719633bbd8e00ae36584c25b1427145e2255b7d00670e8b99c983c6d5afefe2","abstract_canon_sha256":"767d6a4339e2b13c292d084a52ab33445bf49e213722ad00defa1decd68c6027"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:22.545634Z","signature_b64":"FpBKOjEklc/6q/xjnyGLD6z1WxLs91bblfup/nCHLFa1McOPQVwV4YksfSZxzDl0x/06Lg0SFlPYV+RAhoe8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"729f393fb2d8942979e48e2ae9e3c607f2da0661ea0b4cebc79f985866b72d63","last_reissued_at":"2026-05-18T03:56:22.544973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:22.544973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Principal Component Pursuit in Linear Time via $l_1$ Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.NA","authors_text":"Risheng Liu, Siming Wei, Zhixun Su, Zhouchen Lin","submitted_at":"2011-08-26T17:40:30Z","abstract_excerpt":"In the past decades, exactly recovering the intrinsic data structure from corrupted observations, which is known as robust principal component analysis (RPCA), has attracted tremendous interests and found many applications in computer vision. Recently, this problem has been formulated as recovering a low-rank component and a sparse component from the observed data matrix. It is proved that under some suitable conditions, this problem can be exactly solved by principal component pursuit (PCP), i.e., minimizing a combination of nuclear norm and $l_1$ norm. Most of the existing methods for solvin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.5359","kind":"arxiv","version":4},"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":"1108.5359","created_at":"2026-05-18T03:56:22.545068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.5359v4","created_at":"2026-05-18T03:56:22.545068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.5359","created_at":"2026-05-18T03:56:22.545068+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKPTSP5S3CKC","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKPTSP5S3CKCS6PE","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKPTSP5S","created_at":"2026-05-18T12:26:37.096874+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/OKPTSP5S3CKCS6PERYVOTY6GA7","json":"https://pith.science/pith/OKPTSP5S3CKCS6PERYVOTY6GA7.json","graph_json":"https://pith.science/api/pith-number/OKPTSP5S3CKCS6PERYVOTY6GA7/graph.json","events_json":"https://pith.science/api/pith-number/OKPTSP5S3CKCS6PERYVOTY6GA7/events.json","paper":"https://pith.science/paper/OKPTSP5S"},"agent_actions":{"view_html":"https://pith.science/pith/OKPTSP5S3CKCS6PERYVOTY6GA7","download_json":"https://pith.science/pith/OKPTSP5S3CKCS6PERYVOTY6GA7.json","view_paper":"https://pith.science/paper/OKPTSP5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.5359&json=true","fetch_graph":"https://pith.science/api/pith-number/OKPTSP5S3CKCS6PERYVOTY6GA7/graph.json","fetch_events":"https://pith.science/api/pith-number/OKPTSP5S3CKCS6PERYVOTY6GA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKPTSP5S3CKCS6PERYVOTY6GA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKPTSP5S3CKCS6PERYVOTY6GA7/action/storage_attestation","attest_author":"https://pith.science/pith/OKPTSP5S3CKCS6PERYVOTY6GA7/action/author_attestation","sign_citation":"https://pith.science/pith/OKPTSP5S3CKCS6PERYVOTY6GA7/action/citation_signature","submit_replication":"https://pith.science/pith/OKPTSP5S3CKCS6PERYVOTY6GA7/action/replication_record"}},"created_at":"2026-05-18T03:56:22.545068+00:00","updated_at":"2026-05-18T03:56:22.545068+00:00"}