{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:33XE6FFBIL3XMYBEULXZVW3TVR","short_pith_number":"pith:33XE6FFB","schema_version":"1.0","canonical_sha256":"deee4f14a142f7766024a2ef9adb73ac5458089f8ecf658fe20571871953aa80","source":{"kind":"arxiv","id":"1406.1089","version":1},"attestation_state":"computed","paper":{"title":"A variational approach to stable principal component pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Aleksandr Aravkin, Peder Olsen, Stephen Becker, Volkan Cevher","submitted_at":"2014-06-04T16:10:49Z","abstract_excerpt":"We introduce a new convex formulation for stable principal component pursuit (SPCP) to decompose noisy signals into low-rank and sparse representations. For numerical solutions of our SPCP formulation, we first develop a convex variational framework and then accelerate it with quasi-Newton methods. We show, via synthetic and real data experiments, that our approach offers advantages over the classical SPCP formulations in scalability and practical parameter selection."},"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":"1406.1089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-04T16:10:49Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bac654e1d74736ab4c9a1e3e378cebd5243cb45b8447922562ee4a8c7211e609","abstract_canon_sha256":"5894961c7034ffa711c5a9c85b83407ddf76f3a7bf6fbeb234889b1e324bd462"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:23.823651Z","signature_b64":"umArY9R+QL6mkGUukab9YRLC6yB4NYWPdM62/z9Bc4+ej0gCUcyC+JdBzzyzcEsnXClJ+tVKEO80dt1C5OBnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deee4f14a142f7766024a2ef9adb73ac5458089f8ecf658fe20571871953aa80","last_reissued_at":"2026-05-18T02:50:23.823079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:23.823079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A variational approach to stable principal component pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Aleksandr Aravkin, Peder Olsen, Stephen Becker, Volkan Cevher","submitted_at":"2014-06-04T16:10:49Z","abstract_excerpt":"We introduce a new convex formulation for stable principal component pursuit (SPCP) to decompose noisy signals into low-rank and sparse representations. For numerical solutions of our SPCP formulation, we first develop a convex variational framework and then accelerate it with quasi-Newton methods. We show, via synthetic and real data experiments, that our approach offers advantages over the classical SPCP formulations in scalability and practical parameter selection."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1089","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":"1406.1089","created_at":"2026-05-18T02:50:23.823148+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.1089v1","created_at":"2026-05-18T02:50:23.823148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1089","created_at":"2026-05-18T02:50:23.823148+00:00"},{"alias_kind":"pith_short_12","alias_value":"33XE6FFBIL3X","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"33XE6FFBIL3XMYBE","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"33XE6FFB","created_at":"2026-05-18T12:28:11.866339+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/33XE6FFBIL3XMYBEULXZVW3TVR","json":"https://pith.science/pith/33XE6FFBIL3XMYBEULXZVW3TVR.json","graph_json":"https://pith.science/api/pith-number/33XE6FFBIL3XMYBEULXZVW3TVR/graph.json","events_json":"https://pith.science/api/pith-number/33XE6FFBIL3XMYBEULXZVW3TVR/events.json","paper":"https://pith.science/paper/33XE6FFB"},"agent_actions":{"view_html":"https://pith.science/pith/33XE6FFBIL3XMYBEULXZVW3TVR","download_json":"https://pith.science/pith/33XE6FFBIL3XMYBEULXZVW3TVR.json","view_paper":"https://pith.science/paper/33XE6FFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.1089&json=true","fetch_graph":"https://pith.science/api/pith-number/33XE6FFBIL3XMYBEULXZVW3TVR/graph.json","fetch_events":"https://pith.science/api/pith-number/33XE6FFBIL3XMYBEULXZVW3TVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/33XE6FFBIL3XMYBEULXZVW3TVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/33XE6FFBIL3XMYBEULXZVW3TVR/action/storage_attestation","attest_author":"https://pith.science/pith/33XE6FFBIL3XMYBEULXZVW3TVR/action/author_attestation","sign_citation":"https://pith.science/pith/33XE6FFBIL3XMYBEULXZVW3TVR/action/citation_signature","submit_replication":"https://pith.science/pith/33XE6FFBIL3XMYBEULXZVW3TVR/action/replication_record"}},"created_at":"2026-05-18T02:50:23.823148+00:00","updated_at":"2026-05-18T02:50:23.823148+00:00"}