{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IHPG7DJ7DATKQY5A3ZWC45RW6U","short_pith_number":"pith:IHPG7DJ7","schema_version":"1.0","canonical_sha256":"41de6f8d3f1826a863a0de6c2e7636f52d725001adbfe14454b1c2faec31a432","source":{"kind":"arxiv","id":"2606.11800","version":1},"attestation_state":"computed","paper":{"title":"Accelerated Implicit GDA Schemes: Theoretical Guarantees and Application to Proximal Augmented Lagrangian Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Bin Shi, Jiaqi Liu","submitted_at":"2026-06-10T08:34:15Z","abstract_excerpt":"Convex optimization problems with linear equality constraints arise ubiquitously in scientific computing, machine learning, and control theory. Classical Krylov methods are effective but rely on problem-specific preconditioners and high memory. Conversely, gradient-based methods like the augmented Lagrangian method (ALM) avoid these issues yet suffer from slow outer iterations. Developing accelerated outer-iteration schemes, therefore, remains a critical research objective. In this study, we demonstrate that incorporating a proximal operation into the augmented Lagrangian framework yields the "},"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":"2606.11800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-10T08:34:15Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"afc4c9875a300c4e9dac668916e91383c15fc59a92e040000fa042a70ad82255","abstract_canon_sha256":"48a52d7c059049bc57c2b25e37debadbd96077d1e89b26d59b65ed99454fc4b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:08.660256Z","signature_b64":"M6yVKN4gokpjw1qnOS9SsbMV8oMYUG9k+uuNZYixBXvgiYIZ4KdposaRqr5LvxSZlXn4OMz296bRvoafXw4FBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41de6f8d3f1826a863a0de6c2e7636f52d725001adbfe14454b1c2faec31a432","last_reissued_at":"2026-06-11T01:10:08.659396Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:08.659396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Implicit GDA Schemes: Theoretical Guarantees and Application to Proximal Augmented Lagrangian Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Bin Shi, Jiaqi Liu","submitted_at":"2026-06-10T08:34:15Z","abstract_excerpt":"Convex optimization problems with linear equality constraints arise ubiquitously in scientific computing, machine learning, and control theory. Classical Krylov methods are effective but rely on problem-specific preconditioners and high memory. Conversely, gradient-based methods like the augmented Lagrangian method (ALM) avoid these issues yet suffer from slow outer iterations. Developing accelerated outer-iteration schemes, therefore, remains a critical research objective. In this study, we demonstrate that incorporating a proximal operation into the augmented Lagrangian framework yields the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11800","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/2606.11800/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":"2606.11800","created_at":"2026-06-11T01:10:08.659544+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11800v1","created_at":"2026-06-11T01:10:08.659544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11800","created_at":"2026-06-11T01:10:08.659544+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHPG7DJ7DATK","created_at":"2026-06-11T01:10:08.659544+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHPG7DJ7DATKQY5A","created_at":"2026-06-11T01:10:08.659544+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHPG7DJ7","created_at":"2026-06-11T01:10:08.659544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.29206","citing_title":"Modern Theory of Gradient-Based Optimization","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IHPG7DJ7DATKQY5A3ZWC45RW6U","json":"https://pith.science/pith/IHPG7DJ7DATKQY5A3ZWC45RW6U.json","graph_json":"https://pith.science/api/pith-number/IHPG7DJ7DATKQY5A3ZWC45RW6U/graph.json","events_json":"https://pith.science/api/pith-number/IHPG7DJ7DATKQY5A3ZWC45RW6U/events.json","paper":"https://pith.science/paper/IHPG7DJ7"},"agent_actions":{"view_html":"https://pith.science/pith/IHPG7DJ7DATKQY5A3ZWC45RW6U","download_json":"https://pith.science/pith/IHPG7DJ7DATKQY5A3ZWC45RW6U.json","view_paper":"https://pith.science/paper/IHPG7DJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11800&json=true","fetch_graph":"https://pith.science/api/pith-number/IHPG7DJ7DATKQY5A3ZWC45RW6U/graph.json","fetch_events":"https://pith.science/api/pith-number/IHPG7DJ7DATKQY5A3ZWC45RW6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHPG7DJ7DATKQY5A3ZWC45RW6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHPG7DJ7DATKQY5A3ZWC45RW6U/action/storage_attestation","attest_author":"https://pith.science/pith/IHPG7DJ7DATKQY5A3ZWC45RW6U/action/author_attestation","sign_citation":"https://pith.science/pith/IHPG7DJ7DATKQY5A3ZWC45RW6U/action/citation_signature","submit_replication":"https://pith.science/pith/IHPG7DJ7DATKQY5A3ZWC45RW6U/action/replication_record"}},"created_at":"2026-06-11T01:10:08.659544+00:00","updated_at":"2026-06-11T01:10:08.659544+00:00"}