{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6D6QVOX2NXZQG2LSFGVHFAJFMR","short_pith_number":"pith:6D6QVOX2","schema_version":"1.0","canonical_sha256":"f0fd0abafa6df303697229aa728125644f379d0eadf6bb037962d0424c9af8cb","source":{"kind":"arxiv","id":"1902.03373","version":2},"attestation_state":"computed","paper":{"title":"An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Alp Yurtsever, Joel A. Tropp, Lijun Ding, Madeleine Udell, Volkan Cevher","submitted_at":"2019-02-09T05:03:00Z","abstract_excerpt":"This paper develops a new storage-optimal algorithm that provably solves generic semidefinite programs (SDPs) in standard form. This method is particularly effective for weakly constrained SDPs. The key idea is to formulate an approximate complementarity principle: Given an approximate solution to the dual SDP, the primal SDP has an approximate solution whose range is contained in the eigenspace with small eigenvalues of the dual slack matrix. For weakly constrained SDPs, this eigenspace has very low dimension, so this observation significantly reduces the search space for the primal solution."},"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":"1902.03373","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-09T05:03:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"52e9440bf7b323eeff90c0123f78831f1dc6e093f4d1a7a641fbed3719d956db","abstract_canon_sha256":"0bcfc8aafdb42bafee4a75805d0d9bfe22f23a93ea3fe132bc8bf34357c0f61e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:11:08.752816Z","signature_b64":"Z67JP0g3N1AD1lir5A3KvMYjIqlAX4Zjay/xpgx64gT3meV8gHyMS8HHCbQBQSWJwdhyl9kGkUK5uR4y8fmaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0fd0abafa6df303697229aa728125644f379d0eadf6bb037962d0424c9af8cb","last_reissued_at":"2026-07-05T01:11:08.752430Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:11:08.752430Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Alp Yurtsever, Joel A. Tropp, Lijun Ding, Madeleine Udell, Volkan Cevher","submitted_at":"2019-02-09T05:03:00Z","abstract_excerpt":"This paper develops a new storage-optimal algorithm that provably solves generic semidefinite programs (SDPs) in standard form. This method is particularly effective for weakly constrained SDPs. The key idea is to formulate an approximate complementarity principle: Given an approximate solution to the dual SDP, the primal SDP has an approximate solution whose range is contained in the eigenspace with small eigenvalues of the dual slack matrix. For weakly constrained SDPs, this eigenspace has very low dimension, so this observation significantly reduces the search space for the primal solution."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03373","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/1902.03373/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":"1902.03373","created_at":"2026-07-05T01:11:08.752488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03373v2","created_at":"2026-07-05T01:11:08.752488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03373","created_at":"2026-07-05T01:11:08.752488+00:00"},{"alias_kind":"pith_short_12","alias_value":"6D6QVOX2NXZQ","created_at":"2026-07-05T01:11:08.752488+00:00"},{"alias_kind":"pith_short_16","alias_value":"6D6QVOX2NXZQG2LS","created_at":"2026-07-05T01:11:08.752488+00:00"},{"alias_kind":"pith_short_8","alias_value":"6D6QVOX2","created_at":"2026-07-05T01:11:08.752488+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.05209","citing_title":"A Survey of Recent Scalability Improvements for Semidefinite Programming with Applications in Machine Learning, Control, and Robotics","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6D6QVOX2NXZQG2LSFGVHFAJFMR","json":"https://pith.science/pith/6D6QVOX2NXZQG2LSFGVHFAJFMR.json","graph_json":"https://pith.science/api/pith-number/6D6QVOX2NXZQG2LSFGVHFAJFMR/graph.json","events_json":"https://pith.science/api/pith-number/6D6QVOX2NXZQG2LSFGVHFAJFMR/events.json","paper":"https://pith.science/paper/6D6QVOX2"},"agent_actions":{"view_html":"https://pith.science/pith/6D6QVOX2NXZQG2LSFGVHFAJFMR","download_json":"https://pith.science/pith/6D6QVOX2NXZQG2LSFGVHFAJFMR.json","view_paper":"https://pith.science/paper/6D6QVOX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03373&json=true","fetch_graph":"https://pith.science/api/pith-number/6D6QVOX2NXZQG2LSFGVHFAJFMR/graph.json","fetch_events":"https://pith.science/api/pith-number/6D6QVOX2NXZQG2LSFGVHFAJFMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6D6QVOX2NXZQG2LSFGVHFAJFMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6D6QVOX2NXZQG2LSFGVHFAJFMR/action/storage_attestation","attest_author":"https://pith.science/pith/6D6QVOX2NXZQG2LSFGVHFAJFMR/action/author_attestation","sign_citation":"https://pith.science/pith/6D6QVOX2NXZQG2LSFGVHFAJFMR/action/citation_signature","submit_replication":"https://pith.science/pith/6D6QVOX2NXZQG2LSFGVHFAJFMR/action/replication_record"}},"created_at":"2026-07-05T01:11:08.752488+00:00","updated_at":"2026-07-05T01:11:08.752488+00:00"}