{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NPRQOSCV2U4FJL6NYAXLDINIEA","short_pith_number":"pith:NPRQOSCV","schema_version":"1.0","canonical_sha256":"6be3074855d53854afcdc02eb1a1a82036c8a17e59adad649309c7ee18d94286","source":{"kind":"arxiv","id":"2202.09610","version":5},"attestation_state":"computed","paper":{"title":"The global linear convergence rate of the proximal version of the generalized alternating direction method of multipliers for separable convex programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dexi Liu, Jen-Chih Yao, Jianwen Peng, Xueqing Zhang","submitted_at":"2022-02-19T14:12:09Z","abstract_excerpt":"To solve the separable convex optimization problem with linear constraints, Eckstein and Bertsekas introduced the generalized alternating direction method of multipliers (in short, GADMM), which is an efficient and simple acceleration scheme of the aternating direction method of multipliers. Recently, \\textbf{Fang et. al} proposed the linearized version of generalized alternating direction method of multipliers (in short, L-GADMM), where one of its subproblems is approximated by a linearization strategy, and proved its worst-case $\\mathcal{O}(1/t)$ convergence rate measured by the iteration co"},"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":"2202.09610","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-02-19T14:12:09Z","cross_cats_sorted":[],"title_canon_sha256":"392c074b510c602f56ee7123319ed9b812fd08eec3e5b8cdee45b59c645a8ff7","abstract_canon_sha256":"3f66b811365fa2027885490cd86dde0b682c08486eee1dad12a955efac987b80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:16:32.547581Z","signature_b64":"mhiLiPoBXL2437NiBrxpLkTNoS1w7IFy7690oF13LsFS1KQPk7CkqjC0kV5xxAse+eZAdHi5bUwJzQLR4UHDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6be3074855d53854afcdc02eb1a1a82036c8a17e59adad649309c7ee18d94286","last_reissued_at":"2026-07-05T05:16:32.547234Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:16:32.547234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The global linear convergence rate of the proximal version of the generalized alternating direction method of multipliers for separable convex programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dexi Liu, Jen-Chih Yao, Jianwen Peng, Xueqing Zhang","submitted_at":"2022-02-19T14:12:09Z","abstract_excerpt":"To solve the separable convex optimization problem with linear constraints, Eckstein and Bertsekas introduced the generalized alternating direction method of multipliers (in short, GADMM), which is an efficient and simple acceleration scheme of the aternating direction method of multipliers. Recently, \\textbf{Fang et. al} proposed the linearized version of generalized alternating direction method of multipliers (in short, L-GADMM), where one of its subproblems is approximated by a linearization strategy, and proved its worst-case $\\mathcal{O}(1/t)$ convergence rate measured by the iteration co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.09610","kind":"arxiv","version":5},"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/2202.09610/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":"2202.09610","created_at":"2026-07-05T05:16:32.547291+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.09610v5","created_at":"2026-07-05T05:16:32.547291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.09610","created_at":"2026-07-05T05:16:32.547291+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPRQOSCV2U4F","created_at":"2026-07-05T05:16:32.547291+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPRQOSCV2U4FJL6N","created_at":"2026-07-05T05:16:32.547291+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPRQOSCV","created_at":"2026-07-05T05:16:32.547291+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/NPRQOSCV2U4FJL6NYAXLDINIEA","json":"https://pith.science/pith/NPRQOSCV2U4FJL6NYAXLDINIEA.json","graph_json":"https://pith.science/api/pith-number/NPRQOSCV2U4FJL6NYAXLDINIEA/graph.json","events_json":"https://pith.science/api/pith-number/NPRQOSCV2U4FJL6NYAXLDINIEA/events.json","paper":"https://pith.science/paper/NPRQOSCV"},"agent_actions":{"view_html":"https://pith.science/pith/NPRQOSCV2U4FJL6NYAXLDINIEA","download_json":"https://pith.science/pith/NPRQOSCV2U4FJL6NYAXLDINIEA.json","view_paper":"https://pith.science/paper/NPRQOSCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.09610&json=true","fetch_graph":"https://pith.science/api/pith-number/NPRQOSCV2U4FJL6NYAXLDINIEA/graph.json","fetch_events":"https://pith.science/api/pith-number/NPRQOSCV2U4FJL6NYAXLDINIEA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPRQOSCV2U4FJL6NYAXLDINIEA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPRQOSCV2U4FJL6NYAXLDINIEA/action/storage_attestation","attest_author":"https://pith.science/pith/NPRQOSCV2U4FJL6NYAXLDINIEA/action/author_attestation","sign_citation":"https://pith.science/pith/NPRQOSCV2U4FJL6NYAXLDINIEA/action/citation_signature","submit_replication":"https://pith.science/pith/NPRQOSCV2U4FJL6NYAXLDINIEA/action/replication_record"}},"created_at":"2026-07-05T05:16:32.547291+00:00","updated_at":"2026-07-05T05:16:32.547291+00:00"}