{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TTAQSDYPQ6XMCEYLS6FIQ7TPWH","short_pith_number":"pith:TTAQSDYP","schema_version":"1.0","canonical_sha256":"9cc1090f0f87aec1130b978a887e6fb1f5e9e7e2f1c3ec6adc2d2771b3579fd4","source":{"kind":"arxiv","id":"2303.06893","version":1},"attestation_state":"computed","paper":{"title":"On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Kuang-Yu Ding, Xin-Yee Lam","submitted_at":"2023-03-13T06:43:12Z","abstract_excerpt":"We design inexact proximal augmented Lagrangian based decomposition methods for convex composite programming problems with dual block-angular structures. Our methods are particularly well suited for convex quadratic programming problems arising from stochastic programming models. The algorithmic framework is based on the application of the abstract inexact proximal ADMM framework developed in [Chen, Sun, Toh, Math. Prog. 161:237--270] to the dual of the target problem, as well as the application of the recently developed symmetric Gauss-Seidel decomposition theorem for solving a proximal multi"},"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":"2303.06893","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-03-13T06:43:12Z","cross_cats_sorted":[],"title_canon_sha256":"0ea1671dc3faf18c8aa19a7952cfc32978bb9b094600360cc78deb29ea4e0baf","abstract_canon_sha256":"05c0b31c9f5a94b6701f3942d4d26d463b20c333f19199b4867a7c1cac89e385"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:50:24.197639Z","signature_b64":"ZpYClR+MtYMnneElqYEfuf92Zr6TUoIL4M86nftjYacp/gTbK5NXwNoU8GylKDoZl/rozo29o8t6vW5eKgx2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cc1090f0f87aec1130b978a887e6fb1f5e9e7e2f1c3ec6adc2d2771b3579fd4","last_reissued_at":"2026-07-05T05:50:24.197202Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:50:24.197202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kim-Chuan Toh, Kuang-Yu Ding, Xin-Yee Lam","submitted_at":"2023-03-13T06:43:12Z","abstract_excerpt":"We design inexact proximal augmented Lagrangian based decomposition methods for convex composite programming problems with dual block-angular structures. Our methods are particularly well suited for convex quadratic programming problems arising from stochastic programming models. The algorithmic framework is based on the application of the abstract inexact proximal ADMM framework developed in [Chen, Sun, Toh, Math. Prog. 161:237--270] to the dual of the target problem, as well as the application of the recently developed symmetric Gauss-Seidel decomposition theorem for solving a proximal multi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.06893","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.06893/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2303.06893","created_at":"2026-07-05T05:50:24.197285+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.06893v1","created_at":"2026-07-05T05:50:24.197285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.06893","created_at":"2026-07-05T05:50:24.197285+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTAQSDYPQ6XM","created_at":"2026-07-05T05:50:24.197285+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTAQSDYPQ6XMCEYL","created_at":"2026-07-05T05:50:24.197285+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTAQSDYP","created_at":"2026-07-05T05:50:24.197285+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/TTAQSDYPQ6XMCEYLS6FIQ7TPWH","json":"https://pith.science/pith/TTAQSDYPQ6XMCEYLS6FIQ7TPWH.json","graph_json":"https://pith.science/api/pith-number/TTAQSDYPQ6XMCEYLS6FIQ7TPWH/graph.json","events_json":"https://pith.science/api/pith-number/TTAQSDYPQ6XMCEYLS6FIQ7TPWH/events.json","paper":"https://pith.science/paper/TTAQSDYP"},"agent_actions":{"view_html":"https://pith.science/pith/TTAQSDYPQ6XMCEYLS6FIQ7TPWH","download_json":"https://pith.science/pith/TTAQSDYPQ6XMCEYLS6FIQ7TPWH.json","view_paper":"https://pith.science/paper/TTAQSDYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.06893&json=true","fetch_graph":"https://pith.science/api/pith-number/TTAQSDYPQ6XMCEYLS6FIQ7TPWH/graph.json","fetch_events":"https://pith.science/api/pith-number/TTAQSDYPQ6XMCEYLS6FIQ7TPWH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTAQSDYPQ6XMCEYLS6FIQ7TPWH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTAQSDYPQ6XMCEYLS6FIQ7TPWH/action/storage_attestation","attest_author":"https://pith.science/pith/TTAQSDYPQ6XMCEYLS6FIQ7TPWH/action/author_attestation","sign_citation":"https://pith.science/pith/TTAQSDYPQ6XMCEYLS6FIQ7TPWH/action/citation_signature","submit_replication":"https://pith.science/pith/TTAQSDYPQ6XMCEYLS6FIQ7TPWH/action/replication_record"}},"created_at":"2026-07-05T05:50:24.197285+00:00","updated_at":"2026-07-05T05:50:24.197285+00:00"}