{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:EJPSVSN3SY25MSBKXV42C4LZYE","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":"9dd912b5d8a01f42e2ae1158c754f657fa598d0e5ce7fea7c98311089e1eebd4","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-14T19:53:07Z","title_canon_sha256":"c412ecf6582f5ebb7b22121859eb0faea2a6b971cb862181e8a8abfd1c41cdfa"},"schema_version":"1.0","source":{"id":"2505.09765","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.09765","created_at":"2026-07-05T11:03:28Z"},{"alias_kind":"arxiv_version","alias_value":"2505.09765v1","created_at":"2026-07-05T11:03:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09765","created_at":"2026-07-05T11:03:28Z"},{"alias_kind":"pith_short_12","alias_value":"EJPSVSN3SY25","created_at":"2026-07-05T11:03:28Z"},{"alias_kind":"pith_short_16","alias_value":"EJPSVSN3SY25MSBK","created_at":"2026-07-05T11:03:28Z"},{"alias_kind":"pith_short_8","alias_value":"EJPSVSN3","created_at":"2026-07-05T11:03:28Z"}],"graph_snapshots":[{"event_id":"sha256:e37ae2500f96507acb777ec7d719510bce1139682d721541d16d5d836b34ac5e","target":"graph","created_at":"2026-07-05T11:03:28Z","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/2505.09765/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that a broad range of convex optimization algorithms, including alternating projection, operator splitting, and multiplier methods, can be systematically derived from the framework of subspace correction methods via convex duality. To formalize this connection, we introduce the notion of dualization, a process that transforms an iterative method for the dual problem into an equivalent method for the primal problem. This concept establishes new connections across these algorithmic classes, encompassing both well-known and new methods. In particular, we show that classical algorithms suc","authors_text":"Boou Jiang, Jinchao Xu, Jongho Park","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-14T19:53:07Z","title":"Connections between convex optimization algorithms and subspace correction methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.09765","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:772f47cf19d1fdfe27602b3fcb89110525667cf60db3a2e1db9f2ec615ebcf8c","target":"record","created_at":"2026-07-05T11:03:28Z","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":"9dd912b5d8a01f42e2ae1158c754f657fa598d0e5ce7fea7c98311089e1eebd4","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-14T19:53:07Z","title_canon_sha256":"c412ecf6582f5ebb7b22121859eb0faea2a6b971cb862181e8a8abfd1c41cdfa"},"schema_version":"1.0","source":{"id":"2505.09765","kind":"arxiv","version":1}},"canonical_sha256":"225f2ac9bb9635d6482abd79a17179c134addc7f2417570c0a48c9f2ed9ccef7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"225f2ac9bb9635d6482abd79a17179c134addc7f2417570c0a48c9f2ed9ccef7","first_computed_at":"2026-07-05T11:03:28.143390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:03:28.143390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nFYHG2LWbYdXSXPJKgc7BA4Sv0sWUtH1apEPdnGRpUvm36IasGjsh9yeuKs5tD8EVJXMxpSqUaVLEUdJR6fxBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:03:28.143909Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.09765","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:772f47cf19d1fdfe27602b3fcb89110525667cf60db3a2e1db9f2ec615ebcf8c","sha256:e37ae2500f96507acb777ec7d719510bce1139682d721541d16d5d836b34ac5e"],"state_sha256":"9cd03c78b807f9760137e0dff77f6ff3cbbf617ea85aad79747417399bc77af4"}