{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TXKJ2Z65YM3P6TZJUI4L6ITA3I","short_pith_number":"pith:TXKJ2Z65","schema_version":"1.0","canonical_sha256":"9dd49d67ddc336ff4f29a238bf2260da1a496c53a037bbf3b00428ea648001d3","source":{"kind":"arxiv","id":"2108.08554","version":1},"attestation_state":"computed","paper":{"title":"Balanced Augmented Lagrangian Method for Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bingsheng He, Xiaoming Yuan","submitted_at":"2021-08-19T08:36:07Z","abstract_excerpt":"We consider the convex minimization model with both linear equality and inequality constraints, and reshape the classic augmented Lagrangian method (ALM) by balancing its subproblems. As a result, one of its subproblems decouples the objective function and the coefficient matrix without any extra condition, and the other subproblem becomes a positive definite system of linear equations or a positive definite linear complementary problem. The balanced ALM advances the classic ALM by enlarging its applicable range, balancing its subproblems, and improving its implementation. We also extend our d"},"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":"2108.08554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-08-19T08:36:07Z","cross_cats_sorted":[],"title_canon_sha256":"8c2db805f2226d89edcfc31c0f0fa39fedf766a5179f92cdcf5f3f25d9bb8fd6","abstract_canon_sha256":"648684e52a6822ec76bd9807b6d5ac2c321813e4e72c3312a4e28bc522df0742"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:07:11.091368Z","signature_b64":"w7uQmZ6mkAEnhDk6UP0+wldSBXLHoKyyWmAAESGT1+otsqJKx0WCdzoF652fMSkMk/skDpzsHb2ZvQ/dTwNcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9dd49d67ddc336ff4f29a238bf2260da1a496c53a037bbf3b00428ea648001d3","last_reissued_at":"2026-07-05T03:07:11.090958Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:07:11.090958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Balanced Augmented Lagrangian Method for Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bingsheng He, Xiaoming Yuan","submitted_at":"2021-08-19T08:36:07Z","abstract_excerpt":"We consider the convex minimization model with both linear equality and inequality constraints, and reshape the classic augmented Lagrangian method (ALM) by balancing its subproblems. As a result, one of its subproblems decouples the objective function and the coefficient matrix without any extra condition, and the other subproblem becomes a positive definite system of linear equations or a positive definite linear complementary problem. The balanced ALM advances the classic ALM by enlarging its applicable range, balancing its subproblems, and improving its implementation. We also extend our d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.08554","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/2108.08554/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":"2108.08554","created_at":"2026-07-05T03:07:11.091015+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.08554v1","created_at":"2026-07-05T03:07:11.091015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.08554","created_at":"2026-07-05T03:07:11.091015+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXKJ2Z65YM3P","created_at":"2026-07-05T03:07:11.091015+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXKJ2Z65YM3P6TZJ","created_at":"2026-07-05T03:07:11.091015+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXKJ2Z65","created_at":"2026-07-05T03:07:11.091015+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.07117","citing_title":"A Triple-Bregman Balanced Primal-Dual Algorithm for Saddle Point Problems","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TXKJ2Z65YM3P6TZJUI4L6ITA3I","json":"https://pith.science/pith/TXKJ2Z65YM3P6TZJUI4L6ITA3I.json","graph_json":"https://pith.science/api/pith-number/TXKJ2Z65YM3P6TZJUI4L6ITA3I/graph.json","events_json":"https://pith.science/api/pith-number/TXKJ2Z65YM3P6TZJUI4L6ITA3I/events.json","paper":"https://pith.science/paper/TXKJ2Z65"},"agent_actions":{"view_html":"https://pith.science/pith/TXKJ2Z65YM3P6TZJUI4L6ITA3I","download_json":"https://pith.science/pith/TXKJ2Z65YM3P6TZJUI4L6ITA3I.json","view_paper":"https://pith.science/paper/TXKJ2Z65","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.08554&json=true","fetch_graph":"https://pith.science/api/pith-number/TXKJ2Z65YM3P6TZJUI4L6ITA3I/graph.json","fetch_events":"https://pith.science/api/pith-number/TXKJ2Z65YM3P6TZJUI4L6ITA3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXKJ2Z65YM3P6TZJUI4L6ITA3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXKJ2Z65YM3P6TZJUI4L6ITA3I/action/storage_attestation","attest_author":"https://pith.science/pith/TXKJ2Z65YM3P6TZJUI4L6ITA3I/action/author_attestation","sign_citation":"https://pith.science/pith/TXKJ2Z65YM3P6TZJUI4L6ITA3I/action/citation_signature","submit_replication":"https://pith.science/pith/TXKJ2Z65YM3P6TZJUI4L6ITA3I/action/replication_record"}},"created_at":"2026-07-05T03:07:11.091015+00:00","updated_at":"2026-07-05T03:07:11.091015+00:00"}