{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XYDAIBHIJNWVQQ5RGLS6OR5FD4","short_pith_number":"pith:XYDAIBHI","schema_version":"1.0","canonical_sha256":"be060404e84b6d5843b132e5e747a51f0f8f07a744e3aa2c3da07d6b709cad9a","source":{"kind":"arxiv","id":"1901.03254","version":2},"attestation_state":"computed","paper":{"title":"Quantum-inspired sublinear algorithm for solving low-rank semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","quant-ph"],"primary_cat":"cs.DS","authors_text":"Chunhao Wang, Han-Hsuan Lin, Nai-Hui Chia, Tongyang Li","submitted_at":"2019-01-10T16:26:15Z","abstract_excerpt":"Semidefinite programming (SDP) is a central topic in mathematical optimization with extensive studies on its efficient solvers. In this paper, we present a proof-of-principle sublinear-time algorithm for solving SDPs with low-rank constraints; specifically, given an SDP with $m$ constraint matrices, each of dimension $n$ and rank $r$, our algorithm can compute any entry and efficient descriptions of the spectral decomposition of the solution matrix. The algorithm runs in time $O(m\\cdot\\mathrm{poly}(\\log n,r,1/\\varepsilon))$ given access to a sampling-based low-overhead data structure for the c"},"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":"1901.03254","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-10T16:26:15Z","cross_cats_sorted":["cs.LG","math.OC","quant-ph"],"title_canon_sha256":"8a98a875e274ae367a26abb023bf8b6817a94277822abbeb6b7b56757cf49a2c","abstract_canon_sha256":"4fe59f67649ff0a0e5a999a12b826458dcb7bf92c6fc9850fbf477e45a3262f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:01.240913Z","signature_b64":"b10TO196pe3ldDg8Sp4wkgH66yM5I1Rjt6bal4PEls7G4vh01rpViGgJdRP+HdzZ2H8wYVYY13BK0Prs4wMPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be060404e84b6d5843b132e5e747a51f0f8f07a744e3aa2c3da07d6b709cad9a","last_reissued_at":"2026-07-05T01:25:01.240390Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:01.240390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum-inspired sublinear algorithm for solving low-rank semidefinite programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","quant-ph"],"primary_cat":"cs.DS","authors_text":"Chunhao Wang, Han-Hsuan Lin, Nai-Hui Chia, Tongyang Li","submitted_at":"2019-01-10T16:26:15Z","abstract_excerpt":"Semidefinite programming (SDP) is a central topic in mathematical optimization with extensive studies on its efficient solvers. In this paper, we present a proof-of-principle sublinear-time algorithm for solving SDPs with low-rank constraints; specifically, given an SDP with $m$ constraint matrices, each of dimension $n$ and rank $r$, our algorithm can compute any entry and efficient descriptions of the spectral decomposition of the solution matrix. The algorithm runs in time $O(m\\cdot\\mathrm{poly}(\\log n,r,1/\\varepsilon))$ given access to a sampling-based low-overhead data structure for the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03254","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/1901.03254/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":"1901.03254","created_at":"2026-07-05T01:25:01.240453+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03254v2","created_at":"2026-07-05T01:25:01.240453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03254","created_at":"2026-07-05T01:25:01.240453+00:00"},{"alias_kind":"pith_short_12","alias_value":"XYDAIBHIJNWV","created_at":"2026-07-05T01:25:01.240453+00:00"},{"alias_kind":"pith_short_16","alias_value":"XYDAIBHIJNWVQQ5R","created_at":"2026-07-05T01:25:01.240453+00:00"},{"alias_kind":"pith_short_8","alias_value":"XYDAIBHI","created_at":"2026-07-05T01:25:01.240453+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/XYDAIBHIJNWVQQ5RGLS6OR5FD4","json":"https://pith.science/pith/XYDAIBHIJNWVQQ5RGLS6OR5FD4.json","graph_json":"https://pith.science/api/pith-number/XYDAIBHIJNWVQQ5RGLS6OR5FD4/graph.json","events_json":"https://pith.science/api/pith-number/XYDAIBHIJNWVQQ5RGLS6OR5FD4/events.json","paper":"https://pith.science/paper/XYDAIBHI"},"agent_actions":{"view_html":"https://pith.science/pith/XYDAIBHIJNWVQQ5RGLS6OR5FD4","download_json":"https://pith.science/pith/XYDAIBHIJNWVQQ5RGLS6OR5FD4.json","view_paper":"https://pith.science/paper/XYDAIBHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03254&json=true","fetch_graph":"https://pith.science/api/pith-number/XYDAIBHIJNWVQQ5RGLS6OR5FD4/graph.json","fetch_events":"https://pith.science/api/pith-number/XYDAIBHIJNWVQQ5RGLS6OR5FD4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XYDAIBHIJNWVQQ5RGLS6OR5FD4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XYDAIBHIJNWVQQ5RGLS6OR5FD4/action/storage_attestation","attest_author":"https://pith.science/pith/XYDAIBHIJNWVQQ5RGLS6OR5FD4/action/author_attestation","sign_citation":"https://pith.science/pith/XYDAIBHIJNWVQQ5RGLS6OR5FD4/action/citation_signature","submit_replication":"https://pith.science/pith/XYDAIBHIJNWVQQ5RGLS6OR5FD4/action/replication_record"}},"created_at":"2026-07-05T01:25:01.240453+00:00","updated_at":"2026-07-05T01:25:01.240453+00:00"}