{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:N34QB2VWQF63D5PFTYAYTXKEZU","short_pith_number":"pith:N34QB2VW","schema_version":"1.0","canonical_sha256":"6ef900eab6817db1f5e59e0189dd44cd159cccab2327bca474403a467359231a","source":{"kind":"arxiv","id":"2101.08208","version":2},"attestation_state":"computed","paper":{"title":"Solving SDP Faster: A Robust IPM Framework and Efficient Implementation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Baihe Huang, Ruizhe Zhang, Runzhou Tao, Shunhua Jiang, Zhao Song","submitted_at":"2021-01-20T16:41:47Z","abstract_excerpt":"This paper introduces a new robust interior point method analysis for semidefinite programming (SDP). This new robust analysis can be combined with either logarithmic barrier or hybrid barrier.\n  Under this new framework, we can improve the running time of semidefinite programming (SDP) with variable size $n \\times n$ and $m$ constraints up to $\\epsilon$ accuracy.\n  We show that for the case $m = \\Omega(n^2)$, we can solve SDPs in $m^{\\omega}$ time. This suggests solving SDP is nearly as fast as solving the linear system with equal number of variables and constraints. This is the first result "},"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":"2101.08208","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2021-01-20T16:41:47Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c2e30a7bebb0e3b8d753f2a78b4675cd2a950cb2bc4a998e5c97b1297a7243d1","abstract_canon_sha256":"d5c1ed9c34f9c3a5299d2c84f243e3997db68211d58bace3862eaf09730df1eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:33:20.224178Z","signature_b64":"s4KCV/YX62OitZ/2ZwAZOvU7NJb3P3xPl0L2Ggh5ArILRKDUmYci/w/5KACeqCMFHc1qH1kcX4zTiLaThzFJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ef900eab6817db1f5e59e0189dd44cd159cccab2327bca474403a467359231a","last_reissued_at":"2026-07-05T03:33:20.223645Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:33:20.223645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving SDP Faster: A Robust IPM Framework and Efficient Implementation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Baihe Huang, Ruizhe Zhang, Runzhou Tao, Shunhua Jiang, Zhao Song","submitted_at":"2021-01-20T16:41:47Z","abstract_excerpt":"This paper introduces a new robust interior point method analysis for semidefinite programming (SDP). This new robust analysis can be combined with either logarithmic barrier or hybrid barrier.\n  Under this new framework, we can improve the running time of semidefinite programming (SDP) with variable size $n \\times n$ and $m$ constraints up to $\\epsilon$ accuracy.\n  We show that for the case $m = \\Omega(n^2)$, we can solve SDPs in $m^{\\omega}$ time. This suggests solving SDP is nearly as fast as solving the linear system with equal number of variables and constraints. This is the first result "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.08208","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/2101.08208/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":"2101.08208","created_at":"2026-07-05T03:33:20.223709+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.08208v2","created_at":"2026-07-05T03:33:20.223709+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.08208","created_at":"2026-07-05T03:33:20.223709+00:00"},{"alias_kind":"pith_short_12","alias_value":"N34QB2VWQF63","created_at":"2026-07-05T03:33:20.223709+00:00"},{"alias_kind":"pith_short_16","alias_value":"N34QB2VWQF63D5PF","created_at":"2026-07-05T03:33:20.223709+00:00"},{"alias_kind":"pith_short_8","alias_value":"N34QB2VW","created_at":"2026-07-05T03:33:20.223709+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.24488","citing_title":"Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N34QB2VWQF63D5PFTYAYTXKEZU","json":"https://pith.science/pith/N34QB2VWQF63D5PFTYAYTXKEZU.json","graph_json":"https://pith.science/api/pith-number/N34QB2VWQF63D5PFTYAYTXKEZU/graph.json","events_json":"https://pith.science/api/pith-number/N34QB2VWQF63D5PFTYAYTXKEZU/events.json","paper":"https://pith.science/paper/N34QB2VW"},"agent_actions":{"view_html":"https://pith.science/pith/N34QB2VWQF63D5PFTYAYTXKEZU","download_json":"https://pith.science/pith/N34QB2VWQF63D5PFTYAYTXKEZU.json","view_paper":"https://pith.science/paper/N34QB2VW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.08208&json=true","fetch_graph":"https://pith.science/api/pith-number/N34QB2VWQF63D5PFTYAYTXKEZU/graph.json","fetch_events":"https://pith.science/api/pith-number/N34QB2VWQF63D5PFTYAYTXKEZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N34QB2VWQF63D5PFTYAYTXKEZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N34QB2VWQF63D5PFTYAYTXKEZU/action/storage_attestation","attest_author":"https://pith.science/pith/N34QB2VWQF63D5PFTYAYTXKEZU/action/author_attestation","sign_citation":"https://pith.science/pith/N34QB2VWQF63D5PFTYAYTXKEZU/action/citation_signature","submit_replication":"https://pith.science/pith/N34QB2VWQF63D5PFTYAYTXKEZU/action/replication_record"}},"created_at":"2026-07-05T03:33:20.223709+00:00","updated_at":"2026-07-05T03:33:20.223709+00:00"}