{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FP4YOB35TDXNFW2BLA67UCQ42Z","short_pith_number":"pith:FP4YOB35","schema_version":"1.0","canonical_sha256":"2bf987077d98eed2db41583dfa0a1cd64ad60e6c39f8cfab448abcfd8fa010c1","source":{"kind":"arxiv","id":"2412.02949","version":1},"attestation_state":"computed","paper":{"title":"Extracting Dual Solutions via Primal Optimizers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Aaron Sidford, Arun Jambulapati, Liam O'Carroll, Yair Carmon","submitted_at":"2024-12-04T01:33:01Z","abstract_excerpt":"We provide a general method to convert a \"primal\" black-box algorithm for solving regularized convex-concave minimax optimization problems into an algorithm for solving the associated dual maximin optimization problem. Our method adds recursive regularization over a logarithmic number of rounds where each round consists of an approximate regularized primal optimization followed by the computation of a dual best response. We apply this result to obtain new state-of-the-art runtimes for solving matrix games in specific parameter regimes, obtain improved query complexity for solving the dual of t"},"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":"2412.02949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-04T01:33:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c1ebf0ae852776ee7531f6592c336219e80bdb0949a133bcd4dcb01876727c6f","abstract_canon_sha256":"b4042eb897980be8950a90a101deb4d0978bb1a0b4fd317f949bd669b5b8aac3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:22.462862Z","signature_b64":"EB0N4zsPMRYRhvlFjNxKPR7njhKqY5j9pc5v1goloOpr+x3wAdNwfKNQrqZwKVUqS8d45vGGCugn4tr+u+BfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bf987077d98eed2db41583dfa0a1cd64ad60e6c39f8cfab448abcfd8fa010c1","last_reissued_at":"2026-07-05T09:44:22.462380Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:22.462380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extracting Dual Solutions via Primal Optimizers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Aaron Sidford, Arun Jambulapati, Liam O'Carroll, Yair Carmon","submitted_at":"2024-12-04T01:33:01Z","abstract_excerpt":"We provide a general method to convert a \"primal\" black-box algorithm for solving regularized convex-concave minimax optimization problems into an algorithm for solving the associated dual maximin optimization problem. Our method adds recursive regularization over a logarithmic number of rounds where each round consists of an approximate regularized primal optimization followed by the computation of a dual best response. We apply this result to obtain new state-of-the-art runtimes for solving matrix games in specific parameter regimes, obtain improved query complexity for solving the dual of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02949","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/2412.02949/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":"2412.02949","created_at":"2026-07-05T09:44:22.462439+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.02949v1","created_at":"2026-07-05T09:44:22.462439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02949","created_at":"2026-07-05T09:44:22.462439+00:00"},{"alias_kind":"pith_short_12","alias_value":"FP4YOB35TDXN","created_at":"2026-07-05T09:44:22.462439+00:00"},{"alias_kind":"pith_short_16","alias_value":"FP4YOB35TDXNFW2B","created_at":"2026-07-05T09:44:22.462439+00:00"},{"alias_kind":"pith_short_8","alias_value":"FP4YOB35","created_at":"2026-07-05T09:44:22.462439+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/FP4YOB35TDXNFW2BLA67UCQ42Z","json":"https://pith.science/pith/FP4YOB35TDXNFW2BLA67UCQ42Z.json","graph_json":"https://pith.science/api/pith-number/FP4YOB35TDXNFW2BLA67UCQ42Z/graph.json","events_json":"https://pith.science/api/pith-number/FP4YOB35TDXNFW2BLA67UCQ42Z/events.json","paper":"https://pith.science/paper/FP4YOB35"},"agent_actions":{"view_html":"https://pith.science/pith/FP4YOB35TDXNFW2BLA67UCQ42Z","download_json":"https://pith.science/pith/FP4YOB35TDXNFW2BLA67UCQ42Z.json","view_paper":"https://pith.science/paper/FP4YOB35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.02949&json=true","fetch_graph":"https://pith.science/api/pith-number/FP4YOB35TDXNFW2BLA67UCQ42Z/graph.json","fetch_events":"https://pith.science/api/pith-number/FP4YOB35TDXNFW2BLA67UCQ42Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FP4YOB35TDXNFW2BLA67UCQ42Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FP4YOB35TDXNFW2BLA67UCQ42Z/action/storage_attestation","attest_author":"https://pith.science/pith/FP4YOB35TDXNFW2BLA67UCQ42Z/action/author_attestation","sign_citation":"https://pith.science/pith/FP4YOB35TDXNFW2BLA67UCQ42Z/action/citation_signature","submit_replication":"https://pith.science/pith/FP4YOB35TDXNFW2BLA67UCQ42Z/action/replication_record"}},"created_at":"2026-07-05T09:44:22.462439+00:00","updated_at":"2026-07-05T09:44:22.462439+00:00"}