{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HPP6T7NCSRNZDD3ESM55F2WWFO","short_pith_number":"pith:HPP6T7NC","canonical_record":{"source":{"id":"1511.05133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-14T13:14:42Z","cross_cats_sorted":["cs.LG","cs.NA"],"title_canon_sha256":"43e45bea55c9a2ad992078845177131189506298d2592dd22257f82dd8c90f44","abstract_canon_sha256":"fb9b3d88f41f900f0552f99a3549de13ef9d0ffe1109bd0750c2c7e95c8a9a71"},"schema_version":"1.0"},"canonical_sha256":"3bdfe9fda2945b918f64933bd2ead62bad997795420cd14cbee90135954d8897","source":{"kind":"arxiv","id":"1511.05133","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05133","created_at":"2026-05-18T01:26:49Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05133v1","created_at":"2026-05-18T01:26:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05133","created_at":"2026-05-18T01:26:49Z"},{"alias_kind":"pith_short_12","alias_value":"HPP6T7NCSRNZ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HPP6T7NCSRNZDD3E","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HPP6T7NC","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HPP6T7NCSRNZDD3ESM55F2WWFO","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-14T13:14:42Z","cross_cats_sorted":["cs.LG","cs.NA"],"title_canon_sha256":"43e45bea55c9a2ad992078845177131189506298d2592dd22257f82dd8c90f44","abstract_canon_sha256":"fb9b3d88f41f900f0552f99a3549de13ef9d0ffe1109bd0750c2c7e95c8a9a71"},"schema_version":"1.0"},"canonical_sha256":"3bdfe9fda2945b918f64933bd2ead62bad997795420cd14cbee90135954d8897","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:49.955445Z","signature_b64":"zpgNYGq1PT1W+8neRNB50Pwn3jpcEOkDzm5JpLCnuJnuUZBvMnrD+DHeBDQHEJV085IOgYHdmkugA7F9+X7pDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bdfe9fda2945b918f64933bd2ead62bad997795420cd14cbee90135954d8897","last_reissued_at":"2026-05-18T01:26:49.954720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:49.954720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05133","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:26:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"igDBypRCzqW2vCvtVM3k04U4hTfpMrS7Xh+Nt7iOHyrJHG6c1f+seuYT60MbZYkqWDLcMhRMz8+WO/uqHHpCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:58:00.203859Z"},"content_sha256":"381277194bc19e5f9fdf22185cf1859dcf7626fd8876623e395db156a50fafff","schema_version":"1.0","event_id":"sha256:381277194bc19e5f9fdf22185cf1859dcf7626fd8876623e395db156a50fafff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HPP6T7NCSRNZDD3ESM55F2WWFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Proximal Linearized Alternating Direction Method of Multiplier with Parallel Splitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA"],"primary_cat":"math.OC","authors_text":"Canyi Lu, Huan Li, Shuicheng Yan, Zhouchen Lin","submitted_at":"2015-11-14T13:14:42Z","abstract_excerpt":"The Augmented Lagragian Method (ALM) and Alternating Direction Method of Multiplier (ADMM) have been powerful optimization methods for general convex programming subject to linear constraint. We consider the convex problem whose objective consists of a smooth part and a nonsmooth but simple part. We propose the Fast Proximal Augmented Lagragian Method (Fast PALM) which achieves the convergence rate $O(1/K^2)$, compared with $O(1/K)$ by the traditional PALM. In order to further reduce the per-iteration complexity and handle the multi-blocks problem, we propose the Fast Proximal ADMM with Parall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05133","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:26:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sOjau/vianpMemR08Z61gIvncV7HQXF6ob0EFglNq52+dqZ9JpAnW9mpI1Vx4eauDRkGxuNZlCQxB1rhZ//mCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:58:00.204549Z"},"content_sha256":"79a8e987d8b4a7c496a2929609828392e8e893fc90631a75b4745c4ca0fb9943","schema_version":"1.0","event_id":"sha256:79a8e987d8b4a7c496a2929609828392e8e893fc90631a75b4745c4ca0fb9943"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HPP6T7NCSRNZDD3ESM55F2WWFO/bundle.json","state_url":"https://pith.science/pith/HPP6T7NCSRNZDD3ESM55F2WWFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HPP6T7NCSRNZDD3ESM55F2WWFO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T01:58:00Z","links":{"resolver":"https://pith.science/pith/HPP6T7NCSRNZDD3ESM55F2WWFO","bundle":"https://pith.science/pith/HPP6T7NCSRNZDD3ESM55F2WWFO/bundle.json","state":"https://pith.science/pith/HPP6T7NCSRNZDD3ESM55F2WWFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HPP6T7NCSRNZDD3ESM55F2WWFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HPP6T7NCSRNZDD3ESM55F2WWFO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fb9b3d88f41f900f0552f99a3549de13ef9d0ffe1109bd0750c2c7e95c8a9a71","cross_cats_sorted":["cs.LG","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-14T13:14:42Z","title_canon_sha256":"43e45bea55c9a2ad992078845177131189506298d2592dd22257f82dd8c90f44"},"schema_version":"1.0","source":{"id":"1511.05133","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05133","created_at":"2026-05-18T01:26:49Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05133v1","created_at":"2026-05-18T01:26:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05133","created_at":"2026-05-18T01:26:49Z"},{"alias_kind":"pith_short_12","alias_value":"HPP6T7NCSRNZ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HPP6T7NCSRNZDD3E","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HPP6T7NC","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:79a8e987d8b4a7c496a2929609828392e8e893fc90631a75b4745c4ca0fb9943","target":"graph","created_at":"2026-05-18T01:26:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The Augmented Lagragian Method (ALM) and Alternating Direction Method of Multiplier (ADMM) have been powerful optimization methods for general convex programming subject to linear constraint. We consider the convex problem whose objective consists of a smooth part and a nonsmooth but simple part. We propose the Fast Proximal Augmented Lagragian Method (Fast PALM) which achieves the convergence rate $O(1/K^2)$, compared with $O(1/K)$ by the traditional PALM. In order to further reduce the per-iteration complexity and handle the multi-blocks problem, we propose the Fast Proximal ADMM with Parall","authors_text":"Canyi Lu, Huan Li, Shuicheng Yan, Zhouchen Lin","cross_cats":["cs.LG","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-14T13:14:42Z","title":"Fast Proximal Linearized Alternating Direction Method of Multiplier with Parallel Splitting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05133","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:381277194bc19e5f9fdf22185cf1859dcf7626fd8876623e395db156a50fafff","target":"record","created_at":"2026-05-18T01:26:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fb9b3d88f41f900f0552f99a3549de13ef9d0ffe1109bd0750c2c7e95c8a9a71","cross_cats_sorted":["cs.LG","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-14T13:14:42Z","title_canon_sha256":"43e45bea55c9a2ad992078845177131189506298d2592dd22257f82dd8c90f44"},"schema_version":"1.0","source":{"id":"1511.05133","kind":"arxiv","version":1}},"canonical_sha256":"3bdfe9fda2945b918f64933bd2ead62bad997795420cd14cbee90135954d8897","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bdfe9fda2945b918f64933bd2ead62bad997795420cd14cbee90135954d8897","first_computed_at":"2026-05-18T01:26:49.954720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:49.954720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zpgNYGq1PT1W+8neRNB50Pwn3jpcEOkDzm5JpLCnuJnuUZBvMnrD+DHeBDQHEJV085IOgYHdmkugA7F9+X7pDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:49.955445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05133","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:381277194bc19e5f9fdf22185cf1859dcf7626fd8876623e395db156a50fafff","sha256:79a8e987d8b4a7c496a2929609828392e8e893fc90631a75b4745c4ca0fb9943"],"state_sha256":"c679ece3c683ef36250f031ae451c018695fcc552fff8ad548bcbf71272357a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S9ERsn2PfvAXmbSub16ed2x0Y1GrnB/dnU/0BOqRCmmPR/NcZdsUR86o+ZJgxlWjv5lQgaqnrPc/CGKkHgZfBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:58:00.208244Z","bundle_sha256":"4e6584726f268c78d581f271478fa1897c91d90b3b31da52449f681d2896df16"}}