{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SRBAZE2T3VCHK33FT5VY2FE2JT","short_pith_number":"pith:SRBAZE2T","schema_version":"1.0","canonical_sha256":"94420c9353dd44756f659f6b8d149a4cd7941ec9b734c5ef41d3ebeb8d8827a5","source":{"kind":"arxiv","id":"2505.15775","version":1},"attestation_state":"computed","paper":{"title":"New Understandings and Computation on Augmented Lagrangian Methods for Low-Rank Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haihao Lu, Jinwen Yang, Lijun Ding","submitted_at":"2025-05-21T17:27:04Z","abstract_excerpt":"Augmented Lagrangian Method (ALM) combined with Burer-Monteiro (BM) factorization, dubbed ALM-BM, offers a powerful approach for solving large-scale low-rank semidefinite programs (SDPs). Despite its empirical success, the theoretical understandings of the resulting non-convex ALM-BM subproblems, particularly concerning their structural properties and efficient subproblem solvability by first-order methods, still remain limited. This work addresses these notable gaps by providing a rigorous theoretical analysis. We demonstrate that, under appropriate regularity of the original SDP, termed as p"},"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":"2505.15775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-21T17:27:04Z","cross_cats_sorted":[],"title_canon_sha256":"efd45b9d6a1f9a78660df7b1c129cf079959b650e78d60334eae78f662e08633","abstract_canon_sha256":"3e32fd488a6c9fe0e06b633513696722954e2b6b602e8244e1714c9fa69e8693"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:57.771745Z","signature_b64":"BfJCA3Gd9WaJf8mjyJu6IrairAOesQAs0XFJjoaOHomF6+xjTIhJsfRdMhEW+517UahSHmkTRSjgP7Ml+/CRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94420c9353dd44756f659f6b8d149a4cd7941ec9b734c5ef41d3ebeb8d8827a5","last_reissued_at":"2026-07-05T11:06:57.771284Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:57.771284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Understandings and Computation on Augmented Lagrangian Methods for Low-Rank Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haihao Lu, Jinwen Yang, Lijun Ding","submitted_at":"2025-05-21T17:27:04Z","abstract_excerpt":"Augmented Lagrangian Method (ALM) combined with Burer-Monteiro (BM) factorization, dubbed ALM-BM, offers a powerful approach for solving large-scale low-rank semidefinite programs (SDPs). Despite its empirical success, the theoretical understandings of the resulting non-convex ALM-BM subproblems, particularly concerning their structural properties and efficient subproblem solvability by first-order methods, still remain limited. This work addresses these notable gaps by providing a rigorous theoretical analysis. We demonstrate that, under appropriate regularity of the original SDP, termed as p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.15775","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/2505.15775/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":"2505.15775","created_at":"2026-07-05T11:06:57.771347+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.15775v1","created_at":"2026-07-05T11:06:57.771347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.15775","created_at":"2026-07-05T11:06:57.771347+00:00"},{"alias_kind":"pith_short_12","alias_value":"SRBAZE2T3VCH","created_at":"2026-07-05T11:06:57.771347+00:00"},{"alias_kind":"pith_short_16","alias_value":"SRBAZE2T3VCHK33F","created_at":"2026-07-05T11:06:57.771347+00:00"},{"alias_kind":"pith_short_8","alias_value":"SRBAZE2T","created_at":"2026-07-05T11:06:57.771347+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08035","citing_title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15970","citing_title":"Copositive Matrices with Ordered Off-Diagonal Entries","ref_index":197,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17883","citing_title":"On the convergence of doubly stochastic Primal-Dual Hybrid Gradient Method","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2601.07628","citing_title":"D-PDLP: Scaling PDLP to Distributed Multi-GPU Systems","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SRBAZE2T3VCHK33FT5VY2FE2JT","json":"https://pith.science/pith/SRBAZE2T3VCHK33FT5VY2FE2JT.json","graph_json":"https://pith.science/api/pith-number/SRBAZE2T3VCHK33FT5VY2FE2JT/graph.json","events_json":"https://pith.science/api/pith-number/SRBAZE2T3VCHK33FT5VY2FE2JT/events.json","paper":"https://pith.science/paper/SRBAZE2T"},"agent_actions":{"view_html":"https://pith.science/pith/SRBAZE2T3VCHK33FT5VY2FE2JT","download_json":"https://pith.science/pith/SRBAZE2T3VCHK33FT5VY2FE2JT.json","view_paper":"https://pith.science/paper/SRBAZE2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.15775&json=true","fetch_graph":"https://pith.science/api/pith-number/SRBAZE2T3VCHK33FT5VY2FE2JT/graph.json","fetch_events":"https://pith.science/api/pith-number/SRBAZE2T3VCHK33FT5VY2FE2JT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SRBAZE2T3VCHK33FT5VY2FE2JT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SRBAZE2T3VCHK33FT5VY2FE2JT/action/storage_attestation","attest_author":"https://pith.science/pith/SRBAZE2T3VCHK33FT5VY2FE2JT/action/author_attestation","sign_citation":"https://pith.science/pith/SRBAZE2T3VCHK33FT5VY2FE2JT/action/citation_signature","submit_replication":"https://pith.science/pith/SRBAZE2T3VCHK33FT5VY2FE2JT/action/replication_record"}},"created_at":"2026-07-05T11:06:57.771347+00:00","updated_at":"2026-07-05T11:06:57.771347+00:00"}