{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KEKVRLN2O3B5O6U2R4JIUNKG3M","short_pith_number":"pith:KEKVRLN2","schema_version":"1.0","canonical_sha256":"511558adba76c3d77a9a8f128a3546db118f3bbf6b3675ddf1362ae4cd74b122","source":{"kind":"arxiv","id":"2607.08035","version":1},"attestation_state":"computed","paper":{"title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Xin Jiang","submitted_at":"2026-07-09T01:25:30Z","abstract_excerpt":"Primal-dual first-order methods are widely used for large-scale semidefinite programming (SDP), but their ability to compute highly accurate solutions is not well explained by global convergence theory alone. We study the local convergence of the primal-dual hybrid gradient (PDHG) method applied to a standard primal--dual SDP pair. We show that PDHG converges eventually (R-)linearly whenever the limiting KKT point satisfies either strict complementarity or primal--dual nondegeneracy. The proof views PDHG as a preconditioned proximal point method for the KKT inclusion and combines its descent i"},"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":"2607.08035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-07-09T01:25:30Z","cross_cats_sorted":[],"title_canon_sha256":"ec38eeaf67ffb465a881e531bb3753170e2cb92a2a394aa47cc0a00ebcff6e15","abstract_canon_sha256":"c1e035d501fd824bd99ae1c5bf5284049b9017031d119eea79a23cfb8e82586b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T00:19:08.186954Z","signature_b64":"XtRtiQEJo/6lyPAtLXL4uz59H3+lAaLVvykeYU4l4gZAXk7qMxd6P+/TLrlufDa3G/ITw78aK0hy7NSxwcs7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"511558adba76c3d77a9a8f128a3546db118f3bbf6b3675ddf1362ae4cd74b122","last_reissued_at":"2026-07-10T00:19:08.186564Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T00:19:08.186564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Linear Convergence of the Primal-Dual Hybrid Gradient Method for Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Xin Jiang","submitted_at":"2026-07-09T01:25:30Z","abstract_excerpt":"Primal-dual first-order methods are widely used for large-scale semidefinite programming (SDP), but their ability to compute highly accurate solutions is not well explained by global convergence theory alone. We study the local convergence of the primal-dual hybrid gradient (PDHG) method applied to a standard primal--dual SDP pair. We show that PDHG converges eventually (R-)linearly whenever the limiting KKT point satisfies either strict complementarity or primal--dual nondegeneracy. The proof views PDHG as a preconditioned proximal point method for the KKT inclusion and combines its descent i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08035","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/2607.08035/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":"2607.08035","created_at":"2026-07-10T00:19:08.186625+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.08035v1","created_at":"2026-07-10T00:19:08.186625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08035","created_at":"2026-07-10T00:19:08.186625+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEKVRLN2O3B5","created_at":"2026-07-10T00:19:08.186625+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEKVRLN2O3B5O6U2","created_at":"2026-07-10T00:19:08.186625+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEKVRLN2","created_at":"2026-07-10T00:19:08.186625+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.09159","citing_title":"GPU-Accelerated Conic Quadratic Programming with Local Linear Convergence under Strict Complementarity","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KEKVRLN2O3B5O6U2R4JIUNKG3M","json":"https://pith.science/pith/KEKVRLN2O3B5O6U2R4JIUNKG3M.json","graph_json":"https://pith.science/api/pith-number/KEKVRLN2O3B5O6U2R4JIUNKG3M/graph.json","events_json":"https://pith.science/api/pith-number/KEKVRLN2O3B5O6U2R4JIUNKG3M/events.json","paper":"https://pith.science/paper/KEKVRLN2"},"agent_actions":{"view_html":"https://pith.science/pith/KEKVRLN2O3B5O6U2R4JIUNKG3M","download_json":"https://pith.science/pith/KEKVRLN2O3B5O6U2R4JIUNKG3M.json","view_paper":"https://pith.science/paper/KEKVRLN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.08035&json=true","fetch_graph":"https://pith.science/api/pith-number/KEKVRLN2O3B5O6U2R4JIUNKG3M/graph.json","fetch_events":"https://pith.science/api/pith-number/KEKVRLN2O3B5O6U2R4JIUNKG3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEKVRLN2O3B5O6U2R4JIUNKG3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEKVRLN2O3B5O6U2R4JIUNKG3M/action/storage_attestation","attest_author":"https://pith.science/pith/KEKVRLN2O3B5O6U2R4JIUNKG3M/action/author_attestation","sign_citation":"https://pith.science/pith/KEKVRLN2O3B5O6U2R4JIUNKG3M/action/citation_signature","submit_replication":"https://pith.science/pith/KEKVRLN2O3B5O6U2R4JIUNKG3M/action/replication_record"}},"created_at":"2026-07-10T00:19:08.186625+00:00","updated_at":"2026-07-10T00:19:08.186625+00:00"}