{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NAKK73HB3YU6A5I7JHRPU4FCEX","short_pith_number":"pith:NAKK73HB","schema_version":"1.0","canonical_sha256":"6814afece1de29e0751f49e2fa70a225e992fb997959309291f889c058cfd8a1","source":{"kind":"arxiv","id":"1309.6553","version":3},"attestation_state":"computed","paper":{"title":"An Alternating Direction Method with Increasing Penalty for Stable Principal Component Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Garud Iyengar, Necdet Serhat Aybat","submitted_at":"2013-09-25T16:09:14Z","abstract_excerpt":"The stable principal component pursuit (SPCP) is a non-smooth convex optimization problem, the solution of which enables one to reliably recover the low rank and sparse components of a data matrix which is corrupted by a dense noise matrix, even when only a fraction of data entries are observable. In this paper, we propose a new algorithm for solving SPCP. The proposed algorithm is a modification of the alternating direction method of multipliers (ADMM) where we use an increasing sequence of penalty parameters instead of a fixed penalty. The algorithm is based on partial variable splitting and"},"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":"1309.6553","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-25T16:09:14Z","cross_cats_sorted":[],"title_canon_sha256":"761bdb4c2df58e9f042b11e45543b59e4bf57b9e0a79aebcf8fd216be9d6a8a2","abstract_canon_sha256":"0dadaf00adde68f66ede8e386ed773d4c8df178d8e60c4a7ec3b5efa53ef97d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:44.878523Z","signature_b64":"1ZyZ8m+KXdhIMY9bgvX1zGwzMbaSkhfv/1M5+75bku1lzF845Ox7DtNQoprQ3kPXLfvtLPKIbEEFv8tHghOmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6814afece1de29e0751f49e2fa70a225e992fb997959309291f889c058cfd8a1","last_reissued_at":"2026-05-18T02:27:44.878101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:44.878101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Alternating Direction Method with Increasing Penalty for Stable Principal Component Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Garud Iyengar, Necdet Serhat Aybat","submitted_at":"2013-09-25T16:09:14Z","abstract_excerpt":"The stable principal component pursuit (SPCP) is a non-smooth convex optimization problem, the solution of which enables one to reliably recover the low rank and sparse components of a data matrix which is corrupted by a dense noise matrix, even when only a fraction of data entries are observable. In this paper, we propose a new algorithm for solving SPCP. The proposed algorithm is a modification of the alternating direction method of multipliers (ADMM) where we use an increasing sequence of penalty parameters instead of a fixed penalty. The algorithm is based on partial variable splitting and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6553","kind":"arxiv","version":3},"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":"1309.6553","created_at":"2026-05-18T02:27:44.878159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6553v3","created_at":"2026-05-18T02:27:44.878159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6553","created_at":"2026-05-18T02:27:44.878159+00:00"},{"alias_kind":"pith_short_12","alias_value":"NAKK73HB3YU6","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NAKK73HB3YU6A5I7","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NAKK73HB","created_at":"2026-05-18T12:27:52.871228+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/NAKK73HB3YU6A5I7JHRPU4FCEX","json":"https://pith.science/pith/NAKK73HB3YU6A5I7JHRPU4FCEX.json","graph_json":"https://pith.science/api/pith-number/NAKK73HB3YU6A5I7JHRPU4FCEX/graph.json","events_json":"https://pith.science/api/pith-number/NAKK73HB3YU6A5I7JHRPU4FCEX/events.json","paper":"https://pith.science/paper/NAKK73HB"},"agent_actions":{"view_html":"https://pith.science/pith/NAKK73HB3YU6A5I7JHRPU4FCEX","download_json":"https://pith.science/pith/NAKK73HB3YU6A5I7JHRPU4FCEX.json","view_paper":"https://pith.science/paper/NAKK73HB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6553&json=true","fetch_graph":"https://pith.science/api/pith-number/NAKK73HB3YU6A5I7JHRPU4FCEX/graph.json","fetch_events":"https://pith.science/api/pith-number/NAKK73HB3YU6A5I7JHRPU4FCEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NAKK73HB3YU6A5I7JHRPU4FCEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NAKK73HB3YU6A5I7JHRPU4FCEX/action/storage_attestation","attest_author":"https://pith.science/pith/NAKK73HB3YU6A5I7JHRPU4FCEX/action/author_attestation","sign_citation":"https://pith.science/pith/NAKK73HB3YU6A5I7JHRPU4FCEX/action/citation_signature","submit_replication":"https://pith.science/pith/NAKK73HB3YU6A5I7JHRPU4FCEX/action/replication_record"}},"created_at":"2026-05-18T02:27:44.878159+00:00","updated_at":"2026-05-18T02:27:44.878159+00:00"}