{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LSWSHSLWDCZOJIUEMLLWFTJMUV","short_pith_number":"pith:LSWSHSLW","schema_version":"1.0","canonical_sha256":"5cad23c97618b2e4a28462d762cd2ca55c14fe1f07ee1dfc7484884f7cbbdd29","source":{"kind":"arxiv","id":"2309.05135","version":1},"attestation_state":"computed","paper":{"title":"Streaming Semidefinite Programs: $O(\\sqrt{n})$ Passes, Small Space and Fast Runtime","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lichen Zhang, Mingquan Ye, Zhao Song","submitted_at":"2023-09-10T21:07:19Z","abstract_excerpt":"We study the problem of solving semidefinite programs (SDP) in the streaming model. Specifically, $m$ constraint matrices and a target matrix $C$, all of size $n\\times n$ together with a vector $b\\in \\mathbb{R}^m$ are streamed to us one-by-one. The goal is to find a matrix $X\\in \\mathbb{R}^{n\\times n}$ such that $\\langle C, X\\rangle$ is maximized, subject to $\\langle A_i, X\\rangle=b_i$ for all $i\\in [m]$ and $X\\succeq 0$. Previous algorithmic studies of SDP primarily focus on \\emph{time-efficiency}, and all of them require a prohibitively large $\\Omega(mn^2)$ space in order to store \\emph{all "},"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":"2309.05135","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-09-10T21:07:19Z","cross_cats_sorted":[],"title_canon_sha256":"9e5e580a7aaa336187ca226a108a57df67a50a0d17037a8512cd2bf0b51652fc","abstract_canon_sha256":"1e22f80ac1b29264a5a02171cf577759db07372d5b343395fac2fbedcc44c008"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:49:31.442820Z","signature_b64":"KsaMMJLk75Ic+LPPHgCplglcUL3VlIQwjYIekZVYTisNTBLaVl5jj3NZxvRV4kRkOKrM6WLjpe77GIVop2EBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cad23c97618b2e4a28462d762cd2ca55c14fe1f07ee1dfc7484884f7cbbdd29","last_reissued_at":"2026-07-05T06:49:31.442347Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:49:31.442347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Streaming Semidefinite Programs: $O(\\sqrt{n})$ Passes, Small Space and Fast Runtime","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lichen Zhang, Mingquan Ye, Zhao Song","submitted_at":"2023-09-10T21:07:19Z","abstract_excerpt":"We study the problem of solving semidefinite programs (SDP) in the streaming model. Specifically, $m$ constraint matrices and a target matrix $C$, all of size $n\\times n$ together with a vector $b\\in \\mathbb{R}^m$ are streamed to us one-by-one. The goal is to find a matrix $X\\in \\mathbb{R}^{n\\times n}$ such that $\\langle C, X\\rangle$ is maximized, subject to $\\langle A_i, X\\rangle=b_i$ for all $i\\in [m]$ and $X\\succeq 0$. Previous algorithmic studies of SDP primarily focus on \\emph{time-efficiency}, and all of them require a prohibitively large $\\Omega(mn^2)$ space in order to store \\emph{all "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.05135","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/2309.05135/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":"2309.05135","created_at":"2026-07-05T06:49:31.442411+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.05135v1","created_at":"2026-07-05T06:49:31.442411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.05135","created_at":"2026-07-05T06:49:31.442411+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSWSHSLWDCZO","created_at":"2026-07-05T06:49:31.442411+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSWSHSLWDCZOJIUE","created_at":"2026-07-05T06:49:31.442411+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSWSHSLW","created_at":"2026-07-05T06:49:31.442411+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2306.14048","citing_title":"H$_2$O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models","ref_index":143,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LSWSHSLWDCZOJIUEMLLWFTJMUV","json":"https://pith.science/pith/LSWSHSLWDCZOJIUEMLLWFTJMUV.json","graph_json":"https://pith.science/api/pith-number/LSWSHSLWDCZOJIUEMLLWFTJMUV/graph.json","events_json":"https://pith.science/api/pith-number/LSWSHSLWDCZOJIUEMLLWFTJMUV/events.json","paper":"https://pith.science/paper/LSWSHSLW"},"agent_actions":{"view_html":"https://pith.science/pith/LSWSHSLWDCZOJIUEMLLWFTJMUV","download_json":"https://pith.science/pith/LSWSHSLWDCZOJIUEMLLWFTJMUV.json","view_paper":"https://pith.science/paper/LSWSHSLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.05135&json=true","fetch_graph":"https://pith.science/api/pith-number/LSWSHSLWDCZOJIUEMLLWFTJMUV/graph.json","fetch_events":"https://pith.science/api/pith-number/LSWSHSLWDCZOJIUEMLLWFTJMUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSWSHSLWDCZOJIUEMLLWFTJMUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSWSHSLWDCZOJIUEMLLWFTJMUV/action/storage_attestation","attest_author":"https://pith.science/pith/LSWSHSLWDCZOJIUEMLLWFTJMUV/action/author_attestation","sign_citation":"https://pith.science/pith/LSWSHSLWDCZOJIUEMLLWFTJMUV/action/citation_signature","submit_replication":"https://pith.science/pith/LSWSHSLWDCZOJIUEMLLWFTJMUV/action/replication_record"}},"created_at":"2026-07-05T06:49:31.442411+00:00","updated_at":"2026-07-05T06:49:31.442411+00:00"}