{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:LSWSHSLWDCZOJIUEMLLWFTJMUV","short_pith_number":"pith:LSWSHSLW","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"},"canonical_sha256":"5cad23c97618b2e4a28462d762cd2ca55c14fe1f07ee1dfc7484884f7cbbdd29","source":{"kind":"arxiv","id":"2309.05135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.05135","created_at":"2026-07-05T06:49:31Z"},{"alias_kind":"arxiv_version","alias_value":"2309.05135v1","created_at":"2026-07-05T06:49:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.05135","created_at":"2026-07-05T06:49:31Z"},{"alias_kind":"pith_short_12","alias_value":"LSWSHSLWDCZO","created_at":"2026-07-05T06:49:31Z"},{"alias_kind":"pith_short_16","alias_value":"LSWSHSLWDCZOJIUE","created_at":"2026-07-05T06:49:31Z"},{"alias_kind":"pith_short_8","alias_value":"LSWSHSLW","created_at":"2026-07-05T06:49:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:LSWSHSLWDCZOJIUEMLLWFTJMUV","target":"record","payload":{"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"},"canonical_sha256":"5cad23c97618b2e4a28462d762cd2ca55c14fe1f07ee1dfc7484884f7cbbdd29","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"},"source_kind":"arxiv","source_id":"2309.05135","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:49:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a8zaPs/KRQZmUgiAfhh907YVwe0s1IBd4tdIcEoTskMwT7yU7fyddVCAGpSZsh+3WTfQX3tX+6vOhnX8jIqSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T01:43:24.250710Z"},"content_sha256":"bfb2ae4adaf083a00ff5ecd421a628f17472c04d1231ded86ca19592242761e2","schema_version":"1.0","event_id":"sha256:bfb2ae4adaf083a00ff5ecd421a628f17472c04d1231ded86ca19592242761e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:LSWSHSLWDCZOJIUEMLLWFTJMUV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:49:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q7H2t+tSpLse7RV3jLsYD4qocA4eRrMcjPxIW101JerNCobYsf2ETrQ6oP/QDQEMVtKrVXak/+KUZGqYRhfYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T01:43:24.251086Z"},"content_sha256":"f86e430676a03cb17e247871a0e438a396f0b8020f5c145861bc403b507c23c7","schema_version":"1.0","event_id":"sha256:f86e430676a03cb17e247871a0e438a396f0b8020f5c145861bc403b507c23c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSWSHSLWDCZOJIUEMLLWFTJMUV/bundle.json","state_url":"https://pith.science/pith/LSWSHSLWDCZOJIUEMLLWFTJMUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSWSHSLWDCZOJIUEMLLWFTJMUV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-09T01:43:24Z","links":{"resolver":"https://pith.science/pith/LSWSHSLWDCZOJIUEMLLWFTJMUV","bundle":"https://pith.science/pith/LSWSHSLWDCZOJIUEMLLWFTJMUV/bundle.json","state":"https://pith.science/pith/LSWSHSLWDCZOJIUEMLLWFTJMUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSWSHSLWDCZOJIUEMLLWFTJMUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:LSWSHSLWDCZOJIUEMLLWFTJMUV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1e22f80ac1b29264a5a02171cf577759db07372d5b343395fac2fbedcc44c008","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-09-10T21:07:19Z","title_canon_sha256":"9e5e580a7aaa336187ca226a108a57df67a50a0d17037a8512cd2bf0b51652fc"},"schema_version":"1.0","source":{"id":"2309.05135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.05135","created_at":"2026-07-05T06:49:31Z"},{"alias_kind":"arxiv_version","alias_value":"2309.05135v1","created_at":"2026-07-05T06:49:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.05135","created_at":"2026-07-05T06:49:31Z"},{"alias_kind":"pith_short_12","alias_value":"LSWSHSLWDCZO","created_at":"2026-07-05T06:49:31Z"},{"alias_kind":"pith_short_16","alias_value":"LSWSHSLWDCZOJIUE","created_at":"2026-07-05T06:49:31Z"},{"alias_kind":"pith_short_8","alias_value":"LSWSHSLW","created_at":"2026-07-05T06:49:31Z"}],"graph_snapshots":[{"event_id":"sha256:f86e430676a03cb17e247871a0e438a396f0b8020f5c145861bc403b507c23c7","target":"graph","created_at":"2026-07-05T06:49:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2309.05135/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Lichen Zhang, Mingquan Ye, Zhao Song","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-09-10T21:07:19Z","title":"Streaming Semidefinite Programs: $O(\\sqrt{n})$ Passes, Small Space and Fast Runtime"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.05135","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bfb2ae4adaf083a00ff5ecd421a628f17472c04d1231ded86ca19592242761e2","target":"record","created_at":"2026-07-05T06:49:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1e22f80ac1b29264a5a02171cf577759db07372d5b343395fac2fbedcc44c008","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2023-09-10T21:07:19Z","title_canon_sha256":"9e5e580a7aaa336187ca226a108a57df67a50a0d17037a8512cd2bf0b51652fc"},"schema_version":"1.0","source":{"id":"2309.05135","kind":"arxiv","version":1}},"canonical_sha256":"5cad23c97618b2e4a28462d762cd2ca55c14fe1f07ee1dfc7484884f7cbbdd29","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cad23c97618b2e4a28462d762cd2ca55c14fe1f07ee1dfc7484884f7cbbdd29","first_computed_at":"2026-07-05T06:49:31.442347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:49:31.442347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KsaMMJLk75Ic+LPPHgCplglcUL3VlIQwjYIekZVYTisNTBLaVl5jj3NZxvRV4kRkOKrM6WLjpe77GIVop2EBAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:49:31.442820Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.05135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfb2ae4adaf083a00ff5ecd421a628f17472c04d1231ded86ca19592242761e2","sha256:f86e430676a03cb17e247871a0e438a396f0b8020f5c145861bc403b507c23c7"],"state_sha256":"9aa6f641275b9ed2bb682f1dba70e381008f296aedfcbea1b03aaa181843d948"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZR0mpBAiwncRpP+VjtgAdYfrVdGtU25WJoEJkhyimyU0YXb6CLriwpdMEOKugt0UQqptETNLgTQ1OzQNoa+mBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T01:43:24.253259Z","bundle_sha256":"038649c39f4ca27dacb6a3a5f3b2ea2ffe0a4f16563ba0027d834843787de7f5"}}