{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:W5FNVPUVU3ZTQXSMIRYEMP5V36","short_pith_number":"pith:W5FNVPUV","canonical_record":{"source":{"id":"1812.06579","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-17T02:00:13Z","cross_cats_sorted":[],"title_canon_sha256":"8e93b6cb3e66f34d468ed97adb75bd8f65ea366ef926178fd35070c0f3b31ca7","abstract_canon_sha256":"1c7ab9df1a1620a3dca6ffc3932d2ae7f525b9791d4c52e7d3b494ea42600495"},"schema_version":"1.0"},"canonical_sha256":"b74adabe95a6f3385e4c4470463fb5df8c49f4da1d7d288ca6070b7eac4e246e","source":{"kind":"arxiv","id":"1812.06579","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06579","created_at":"2026-07-05T01:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06579v2","created_at":"2026-07-05T01:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06579","created_at":"2026-07-05T01:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"W5FNVPUVU3ZT","created_at":"2026-07-05T01:08:22Z"},{"alias_kind":"pith_short_16","alias_value":"W5FNVPUVU3ZTQXSM","created_at":"2026-07-05T01:08:22Z"},{"alias_kind":"pith_short_8","alias_value":"W5FNVPUV","created_at":"2026-07-05T01:08:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:W5FNVPUVU3ZTQXSMIRYEMP5V36","target":"record","payload":{"canonical_record":{"source":{"id":"1812.06579","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-17T02:00:13Z","cross_cats_sorted":[],"title_canon_sha256":"8e93b6cb3e66f34d468ed97adb75bd8f65ea366ef926178fd35070c0f3b31ca7","abstract_canon_sha256":"1c7ab9df1a1620a3dca6ffc3932d2ae7f525b9791d4c52e7d3b494ea42600495"},"schema_version":"1.0"},"canonical_sha256":"b74adabe95a6f3385e4c4470463fb5df8c49f4da1d7d288ca6070b7eac4e246e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:08:22.444264Z","signature_b64":"H/cix8HFXVm0uCrfBFEjJvOxQg+JvTqr1XpWq/6OrV/Jp0tCX/S9iAwoHlyXi1xaxWdfzRIn7pJYAN5nv25RAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b74adabe95a6f3385e4c4470463fb5df8c49f4da1d7d288ca6070b7eac4e246e","last_reissued_at":"2026-07-05T01:08:22.443850Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:08:22.443850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.06579","source_version":2,"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-07-05T01:08:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fze0YnkHbvA1rafcm4KDwI5uA8UBncfbWmLSbhciWbU/cTvMrK3wxacJIw5q/ehEs7Ms9DFX+Febq3lV0W3zDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T22:46:40.441409Z"},"content_sha256":"60444d50b99684f9a5fbce3ed12ca915e137a80c9b5f34541fcd85f881b3ddae","schema_version":"1.0","event_id":"sha256:60444d50b99684f9a5fbce3ed12ca915e137a80c9b5f34541fcd85f881b3ddae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:W5FNVPUVU3ZTQXSMIRYEMP5V36","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unified Algorithmic Framework of Symmetric Gauss-Seidel Decomposition based Proximal ADMMs for Convex Composite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Liang Chen, Ning Zhang","submitted_at":"2018-12-17T02:00:13Z","abstract_excerpt":"This paper aims to present a fairly accessible generalization of several symmetric Gauss-Seidel decomposition based multi-block proximal alternating direction methods of multipliers (ADMMs) for convex composite optimization problems. The proposed method unifies and refines many constructive techniques that were separately developed for the computational efficiency of multi-block ADMM-type algorithms. Specifically, the majorized augmented Lagrangian functions, the indefinite proximal terms, the inexact symmetric Gauss-Seidel decomposition theorem, the tolerance criteria of approximately solving"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06579","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1812.06579/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:08:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SI2CH6P0wOLJQX0c0o9sXh8DGmf1k73bxdM51yfRmHlkVtzl9gE1+5fkoXsYH2Z+F0AiUk72IUcXuz7va4J8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T22:46:40.441898Z"},"content_sha256":"dcdffebd0620c2edff00793cdc7f3df59ef434b61c339d8a8da13dc0b62cce58","schema_version":"1.0","event_id":"sha256:dcdffebd0620c2edff00793cdc7f3df59ef434b61c339d8a8da13dc0b62cce58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5FNVPUVU3ZTQXSMIRYEMP5V36/bundle.json","state_url":"https://pith.science/pith/W5FNVPUVU3ZTQXSMIRYEMP5V36/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5FNVPUVU3ZTQXSMIRYEMP5V36/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-08-17T22:46:40Z","links":{"resolver":"https://pith.science/pith/W5FNVPUVU3ZTQXSMIRYEMP5V36","bundle":"https://pith.science/pith/W5FNVPUVU3ZTQXSMIRYEMP5V36/bundle.json","state":"https://pith.science/pith/W5FNVPUVU3ZTQXSMIRYEMP5V36/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5FNVPUVU3ZTQXSMIRYEMP5V36/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:W5FNVPUVU3ZTQXSMIRYEMP5V36","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":"1c7ab9df1a1620a3dca6ffc3932d2ae7f525b9791d4c52e7d3b494ea42600495","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-17T02:00:13Z","title_canon_sha256":"8e93b6cb3e66f34d468ed97adb75bd8f65ea366ef926178fd35070c0f3b31ca7"},"schema_version":"1.0","source":{"id":"1812.06579","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06579","created_at":"2026-07-05T01:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06579v2","created_at":"2026-07-05T01:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06579","created_at":"2026-07-05T01:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"W5FNVPUVU3ZT","created_at":"2026-07-05T01:08:22Z"},{"alias_kind":"pith_short_16","alias_value":"W5FNVPUVU3ZTQXSM","created_at":"2026-07-05T01:08:22Z"},{"alias_kind":"pith_short_8","alias_value":"W5FNVPUV","created_at":"2026-07-05T01:08:22Z"}],"graph_snapshots":[{"event_id":"sha256:dcdffebd0620c2edff00793cdc7f3df59ef434b61c339d8a8da13dc0b62cce58","target":"graph","created_at":"2026-07-05T01:08:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1812.06579/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper aims to present a fairly accessible generalization of several symmetric Gauss-Seidel decomposition based multi-block proximal alternating direction methods of multipliers (ADMMs) for convex composite optimization problems. The proposed method unifies and refines many constructive techniques that were separately developed for the computational efficiency of multi-block ADMM-type algorithms. Specifically, the majorized augmented Lagrangian functions, the indefinite proximal terms, the inexact symmetric Gauss-Seidel decomposition theorem, the tolerance criteria of approximately solving","authors_text":"Defeng Sun, Kim-Chuan Toh, Liang Chen, Ning Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-17T02:00:13Z","title":"A Unified Algorithmic Framework of Symmetric Gauss-Seidel Decomposition based Proximal ADMMs for Convex Composite Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06579","kind":"arxiv","version":2},"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:60444d50b99684f9a5fbce3ed12ca915e137a80c9b5f34541fcd85f881b3ddae","target":"record","created_at":"2026-07-05T01:08:22Z","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":"1c7ab9df1a1620a3dca6ffc3932d2ae7f525b9791d4c52e7d3b494ea42600495","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-12-17T02:00:13Z","title_canon_sha256":"8e93b6cb3e66f34d468ed97adb75bd8f65ea366ef926178fd35070c0f3b31ca7"},"schema_version":"1.0","source":{"id":"1812.06579","kind":"arxiv","version":2}},"canonical_sha256":"b74adabe95a6f3385e4c4470463fb5df8c49f4da1d7d288ca6070b7eac4e246e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b74adabe95a6f3385e4c4470463fb5df8c49f4da1d7d288ca6070b7eac4e246e","first_computed_at":"2026-07-05T01:08:22.443850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:08:22.443850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H/cix8HFXVm0uCrfBFEjJvOxQg+JvTqr1XpWq/6OrV/Jp0tCX/S9iAwoHlyXi1xaxWdfzRIn7pJYAN5nv25RAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:08:22.444264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06579","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60444d50b99684f9a5fbce3ed12ca915e137a80c9b5f34541fcd85f881b3ddae","sha256:dcdffebd0620c2edff00793cdc7f3df59ef434b61c339d8a8da13dc0b62cce58"],"state_sha256":"93f0a70d9d7f22e3c345257b7944a39ab069bd384ac6067eb5a55c48af99d160"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yKDsv4SmwW07L/T5dQt181DFRBFUlCv2j7Mmm1GVBHGQgj7UmK+Skjo+RwbzE1+R2f4xbkTyL538amZU6R1LDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T22:46:40.446058Z","bundle_sha256":"97efbcc10bd03401fe7cd528e699947308be07762b9c96cbe0ce5c6df2dcdd7f"}}