{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N72D775UI2Q2N56WNC6EMNFGNM","short_pith_number":"pith:N72D775U","schema_version":"1.0","canonical_sha256":"6ff43fffb446a1a6f7d668bc4634a66b2f9c8b38dc3c95a9e5f6c296ad9aff6b","source":{"kind":"arxiv","id":"1812.09924","version":1},"attestation_state":"computed","paper":{"title":"Dual Principal Component Pursuit: Probability Analysis and Efficient Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.OC"],"primary_cat":"cs.LG","authors_text":"Daniel P. Robinson, Daniel Q. Naiman, Manolis C. Tsakiris, Rene Vidal, Yifan Wang, Zhihui Zhu","submitted_at":"2018-12-24T14:07:18Z","abstract_excerpt":"Recent methods for learning a linear subspace from data corrupted by outliers are based on convex $\\ell_1$ and nuclear norm optimization and require the dimension of the subspace and the number of outliers to be sufficiently small. In sharp contrast, the recently proposed Dual Principal Component Pursuit (DPCP) method can provably handle subspaces of high dimension by solving a non-convex $\\ell_1$ optimization problem on the sphere. However, its geometric analysis is based on quantities that are difficult to interpret and are not amenable to statistical analysis. In this paper we provide a ref"},"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":"1812.09924","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-24T14:07:18Z","cross_cats_sorted":["cs.CV","math.OC"],"title_canon_sha256":"8a11b470879a528d5d7d1edff413ca6dcc7e969f1cd8f02ec39cee934035238f","abstract_canon_sha256":"b3fccfccbb0031d25b4cf6df61f158d001c61ac2b57e1f66726a0f11e05080d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:26.375567Z","signature_b64":"Jt/Kw36swRWcSQOz8J/QV5DiWwZp7ephazCA7gA27bRf0wyj83tacOrMJX5/urDXFEyh9i86iZv2Ec+C+u+UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ff43fffb446a1a6f7d668bc4634a66b2f9c8b38dc3c95a9e5f6c296ad9aff6b","last_reissued_at":"2026-05-17T23:57:26.374805Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:26.374805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dual Principal Component Pursuit: Probability Analysis and Efficient Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.OC"],"primary_cat":"cs.LG","authors_text":"Daniel P. Robinson, Daniel Q. Naiman, Manolis C. Tsakiris, Rene Vidal, Yifan Wang, Zhihui Zhu","submitted_at":"2018-12-24T14:07:18Z","abstract_excerpt":"Recent methods for learning a linear subspace from data corrupted by outliers are based on convex $\\ell_1$ and nuclear norm optimization and require the dimension of the subspace and the number of outliers to be sufficiently small. In sharp contrast, the recently proposed Dual Principal Component Pursuit (DPCP) method can provably handle subspaces of high dimension by solving a non-convex $\\ell_1$ optimization problem on the sphere. However, its geometric analysis is based on quantities that are difficult to interpret and are not amenable to statistical analysis. In this paper we provide a ref"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09924","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":"1812.09924","created_at":"2026-05-17T23:57:26.374940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.09924v1","created_at":"2026-05-17T23:57:26.374940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09924","created_at":"2026-05-17T23:57:26.374940+00:00"},{"alias_kind":"pith_short_12","alias_value":"N72D775UI2Q2","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N72D775UI2Q2N56W","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N72D775U","created_at":"2026-05-18T12:32:40.477152+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/N72D775UI2Q2N56WNC6EMNFGNM","json":"https://pith.science/pith/N72D775UI2Q2N56WNC6EMNFGNM.json","graph_json":"https://pith.science/api/pith-number/N72D775UI2Q2N56WNC6EMNFGNM/graph.json","events_json":"https://pith.science/api/pith-number/N72D775UI2Q2N56WNC6EMNFGNM/events.json","paper":"https://pith.science/paper/N72D775U"},"agent_actions":{"view_html":"https://pith.science/pith/N72D775UI2Q2N56WNC6EMNFGNM","download_json":"https://pith.science/pith/N72D775UI2Q2N56WNC6EMNFGNM.json","view_paper":"https://pith.science/paper/N72D775U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.09924&json=true","fetch_graph":"https://pith.science/api/pith-number/N72D775UI2Q2N56WNC6EMNFGNM/graph.json","fetch_events":"https://pith.science/api/pith-number/N72D775UI2Q2N56WNC6EMNFGNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N72D775UI2Q2N56WNC6EMNFGNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N72D775UI2Q2N56WNC6EMNFGNM/action/storage_attestation","attest_author":"https://pith.science/pith/N72D775UI2Q2N56WNC6EMNFGNM/action/author_attestation","sign_citation":"https://pith.science/pith/N72D775UI2Q2N56WNC6EMNFGNM/action/citation_signature","submit_replication":"https://pith.science/pith/N72D775UI2Q2N56WNC6EMNFGNM/action/replication_record"}},"created_at":"2026-05-17T23:57:26.374940+00:00","updated_at":"2026-05-17T23:57:26.374940+00:00"}