{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YA2RGAPYUVLEWYEGANGKRMRD7V","short_pith_number":"pith:YA2RGAPY","schema_version":"1.0","canonical_sha256":"c0351301f8a5564b6086034ca8b223fd40030f427e760cbd55d4d5ad3dd71f41","source":{"kind":"arxiv","id":"2506.09711","version":2},"attestation_state":"computed","paper":{"title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Michael Lindsey, Yuhang Cai","submitted_at":"2025-06-11T13:24:18Z","abstract_excerpt":"We present an optimization framework that exhibits dimension-independent convergence on a broad class of semidefinite programs (SDPs). Our approach first regularizes the primal problem with the von Neumann entropy, then solve the regularized problem using dual gradient ascent with respect to a problem-adapted norm. In particular, we show that the dual gradient norm converges to zero at a rate independent of the ambient dimension and, via rounding arguments, construct primal-feasible solutions in certain special cases. We also derive explicit convergence rates for the objective. In order to ach"},"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":"2506.09711","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-11T13:24:18Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"8d04419da9df81a6c01d7992eed573ffd1214fdfcdfc5fee2f68a1386decd67a","abstract_canon_sha256":"80dbff7ff7d05026ca499b2fff9d6c363c22497533d56282f3abeaf15ce974fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:30:01.554060Z","signature_b64":"uDjQyn4ea5/IXGSrXNtQgTf+TxJBV+4gxM4irrLVIpARamWmN/4vJ5o+CgDcDvldbg90eA/5fSKwV6SgGb6MBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0351301f8a5564b6086034ca8b223fd40030f427e760cbd55d4d5ad3dd71f41","last_reissued_at":"2026-07-05T11:30:01.553657Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:30:01.553657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Michael Lindsey, Yuhang Cai","submitted_at":"2025-06-11T13:24:18Z","abstract_excerpt":"We present an optimization framework that exhibits dimension-independent convergence on a broad class of semidefinite programs (SDPs). Our approach first regularizes the primal problem with the von Neumann entropy, then solve the regularized problem using dual gradient ascent with respect to a problem-adapted norm. In particular, we show that the dual gradient norm converges to zero at a rate independent of the ambient dimension and, via rounding arguments, construct primal-feasible solutions in certain special cases. We also derive explicit convergence rates for the objective. In order to ach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.09711","kind":"arxiv","version":2},"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/2506.09711/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":"2506.09711","created_at":"2026-07-05T11:30:01.553712+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.09711v2","created_at":"2026-07-05T11:30:01.553712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.09711","created_at":"2026-07-05T11:30:01.553712+00:00"},{"alias_kind":"pith_short_12","alias_value":"YA2RGAPYUVLE","created_at":"2026-07-05T11:30:01.553712+00:00"},{"alias_kind":"pith_short_16","alias_value":"YA2RGAPYUVLEWYEG","created_at":"2026-07-05T11:30:01.553712+00:00"},{"alias_kind":"pith_short_8","alias_value":"YA2RGAPY","created_at":"2026-07-05T11:30:01.553712+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/YA2RGAPYUVLEWYEGANGKRMRD7V","json":"https://pith.science/pith/YA2RGAPYUVLEWYEGANGKRMRD7V.json","graph_json":"https://pith.science/api/pith-number/YA2RGAPYUVLEWYEGANGKRMRD7V/graph.json","events_json":"https://pith.science/api/pith-number/YA2RGAPYUVLEWYEGANGKRMRD7V/events.json","paper":"https://pith.science/paper/YA2RGAPY"},"agent_actions":{"view_html":"https://pith.science/pith/YA2RGAPYUVLEWYEGANGKRMRD7V","download_json":"https://pith.science/pith/YA2RGAPYUVLEWYEGANGKRMRD7V.json","view_paper":"https://pith.science/paper/YA2RGAPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.09711&json=true","fetch_graph":"https://pith.science/api/pith-number/YA2RGAPYUVLEWYEGANGKRMRD7V/graph.json","fetch_events":"https://pith.science/api/pith-number/YA2RGAPYUVLEWYEGANGKRMRD7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YA2RGAPYUVLEWYEGANGKRMRD7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YA2RGAPYUVLEWYEGANGKRMRD7V/action/storage_attestation","attest_author":"https://pith.science/pith/YA2RGAPYUVLEWYEGANGKRMRD7V/action/author_attestation","sign_citation":"https://pith.science/pith/YA2RGAPYUVLEWYEGANGKRMRD7V/action/citation_signature","submit_replication":"https://pith.science/pith/YA2RGAPYUVLEWYEGANGKRMRD7V/action/replication_record"}},"created_at":"2026-07-05T11:30:01.553712+00:00","updated_at":"2026-07-05T11:30:01.553712+00:00"}