{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DMTW2U3RZPDOWY5OIBNI6F26NZ","short_pith_number":"pith:DMTW2U3R","canonical_record":{"source":{"id":"1710.02581","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-06T20:43:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"34bc13f2a840337e165e8ea310ed8044d71a0e864368ede6ab55aaf22cb066d2","abstract_canon_sha256":"83f76b53df65afa42ae3cb7a7b6f84c4ef24907c1bc2207077a7967c00af38ba"},"schema_version":"1.0"},"canonical_sha256":"1b276d5371cbc6eb63ae405a8f175e6e6ff996902e89859a7ad93428de14dfed","source":{"kind":"arxiv","id":"1710.02581","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02581","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02581v3","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02581","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"DMTW2U3RZPDO","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DMTW2U3RZPDOWY5O","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DMTW2U3R","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DMTW2U3RZPDOWY5OIBNI6F26NZ","target":"record","payload":{"canonical_record":{"source":{"id":"1710.02581","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-06T20:43:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"34bc13f2a840337e165e8ea310ed8044d71a0e864368ede6ab55aaf22cb066d2","abstract_canon_sha256":"83f76b53df65afa42ae3cb7a7b6f84c4ef24907c1bc2207077a7967c00af38ba"},"schema_version":"1.0"},"canonical_sha256":"1b276d5371cbc6eb63ae405a8f175e6e6ff996902e89859a7ad93428de14dfed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:02.267463Z","signature_b64":"3lCqUpQ6Uh+fDDUk7Ksd3pmYuwz3nwBI0LlNfOCWIAv1haAgi1KK+y1RjNq1KbouuWw9Y4BJmDVG/FalptN+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b276d5371cbc6eb63ae405a8f175e6e6ff996902e89859a7ad93428de14dfed","last_reissued_at":"2026-05-17T23:48:02.266921Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:02.266921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.02581","source_version":3,"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-05-17T23:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NQhkWyMRhN/Pty7xvT0e9QVMy+Ej5Oqaeul0eQYL4xg5UX7nXnNVQIIXpJfprZDIXeJaLPPfOmxsozMjebjxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:19:30.941395Z"},"content_sha256":"aa6dc3fdd400abdf9df5e9fcd74cfdea1204337c4dc7b7da1ac86fe0e5a8dbf1","schema_version":"1.0","event_id":"sha256:aa6dc3fdd400abdf9df5e9fcd74cfdea1204337c4dc7b7da1ac86fe0e5a8dbf1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DMTW2U3RZPDOWY5OIBNI6F26NZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Amir Kalev, Cedric Yen-Yu Lin, Fernando G. S. L. Brand\\~ao, Krysta M. Svore, Tongyang Li, Xiaodi Wu","submitted_at":"2017-10-06T20:43:14Z","abstract_excerpt":"We give two quantum algorithms for solving semidefinite programs (SDPs) providing quantum speed-ups. We consider SDP instances with $m$ constraint matrices, each of dimension $n$, rank at most $r$, and sparsity $s$. The first algorithm assumes access to an oracle to the matrices at unit cost. We show that it has run time $\\tilde{O}(s^2(\\sqrt{m}\\epsilon^{-10}+\\sqrt{n}\\epsilon^{-12}))$, with $\\epsilon$ the error of the solution. This gives an optimal dependence in terms of $m, n$ and quadratic improvement over previous quantum algorithms when $m\\approx n$. The second algorithm assumes a fully qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02581","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-17T23:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M+JjUghfwxVe1mxtNropiNVtH2SSUMm5K4k/DrlgHL0y3V1mtRphiagxj/9EMzFflgWDPLXaNnva2cqvoZVMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:19:30.941752Z"},"content_sha256":"9e159b808de5f3ac4a600554e4198e860094d878a1907f23d9b1431babe35b0a","schema_version":"1.0","event_id":"sha256:9e159b808de5f3ac4a600554e4198e860094d878a1907f23d9b1431babe35b0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMTW2U3RZPDOWY5OIBNI6F26NZ/bundle.json","state_url":"https://pith.science/pith/DMTW2U3RZPDOWY5OIBNI6F26NZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMTW2U3RZPDOWY5OIBNI6F26NZ/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-05-28T01:19:30Z","links":{"resolver":"https://pith.science/pith/DMTW2U3RZPDOWY5OIBNI6F26NZ","bundle":"https://pith.science/pith/DMTW2U3RZPDOWY5OIBNI6F26NZ/bundle.json","state":"https://pith.science/pith/DMTW2U3RZPDOWY5OIBNI6F26NZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMTW2U3RZPDOWY5OIBNI6F26NZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DMTW2U3RZPDOWY5OIBNI6F26NZ","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":"83f76b53df65afa42ae3cb7a7b6f84c4ef24907c1bc2207077a7967c00af38ba","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-06T20:43:14Z","title_canon_sha256":"34bc13f2a840337e165e8ea310ed8044d71a0e864368ede6ab55aaf22cb066d2"},"schema_version":"1.0","source":{"id":"1710.02581","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02581","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02581v3","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02581","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"DMTW2U3RZPDO","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DMTW2U3RZPDOWY5O","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DMTW2U3R","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:9e159b808de5f3ac4a600554e4198e860094d878a1907f23d9b1431babe35b0a","target":"graph","created_at":"2026-05-17T23:48:02Z","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"},"paper":{"abstract_excerpt":"We give two quantum algorithms for solving semidefinite programs (SDPs) providing quantum speed-ups. We consider SDP instances with $m$ constraint matrices, each of dimension $n$, rank at most $r$, and sparsity $s$. The first algorithm assumes access to an oracle to the matrices at unit cost. We show that it has run time $\\tilde{O}(s^2(\\sqrt{m}\\epsilon^{-10}+\\sqrt{n}\\epsilon^{-12}))$, with $\\epsilon$ the error of the solution. This gives an optimal dependence in terms of $m, n$ and quadratic improvement over previous quantum algorithms when $m\\approx n$. The second algorithm assumes a fully qu","authors_text":"Amir Kalev, Cedric Yen-Yu Lin, Fernando G. S. L. Brand\\~ao, Krysta M. Svore, Tongyang Li, Xiaodi Wu","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-06T20:43:14Z","title":"Quantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02581","kind":"arxiv","version":3},"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:aa6dc3fdd400abdf9df5e9fcd74cfdea1204337c4dc7b7da1ac86fe0e5a8dbf1","target":"record","created_at":"2026-05-17T23:48:02Z","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":"83f76b53df65afa42ae3cb7a7b6f84c4ef24907c1bc2207077a7967c00af38ba","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-10-06T20:43:14Z","title_canon_sha256":"34bc13f2a840337e165e8ea310ed8044d71a0e864368ede6ab55aaf22cb066d2"},"schema_version":"1.0","source":{"id":"1710.02581","kind":"arxiv","version":3}},"canonical_sha256":"1b276d5371cbc6eb63ae405a8f175e6e6ff996902e89859a7ad93428de14dfed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b276d5371cbc6eb63ae405a8f175e6e6ff996902e89859a7ad93428de14dfed","first_computed_at":"2026-05-17T23:48:02.266921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:02.266921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3lCqUpQ6Uh+fDDUk7Ksd3pmYuwz3nwBI0LlNfOCWIAv1haAgi1KK+y1RjNq1KbouuWw9Y4BJmDVG/FalptN+Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:02.267463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.02581","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa6dc3fdd400abdf9df5e9fcd74cfdea1204337c4dc7b7da1ac86fe0e5a8dbf1","sha256:9e159b808de5f3ac4a600554e4198e860094d878a1907f23d9b1431babe35b0a"],"state_sha256":"9a8506e4631c38aa727450dc8ba5ef4ddcabaa2e4e804f741c591447c1454fa8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C2fVsAApUr840fju5meJ2ufCj2B2rrNGPPk7j3eLPR5ZhdCfkSvG9yTYghy0Maqj/JFCBiTfdo7hKQHY80r0BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:19:30.943778Z","bundle_sha256":"5e88dc2cf6ff64ce65394df643cecfe962412685d4a8f3870be783aa45a49499"}}