{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KV7VNLQXC6ZRFAB5NLSGJ2IWXC","short_pith_number":"pith:KV7VNLQX","canonical_record":{"source":{"id":"1609.05537","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-18T20:13:50Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"14e06bb49ef83d6ae743d08d0c6a7fac6d7f1e612c02be1723428b4309df65c1","abstract_canon_sha256":"90b7139d4db3d205f7b28d512f2eb1537badd430ec31c551db24b40de7c15f41"},"schema_version":"1.0"},"canonical_sha256":"557f56ae1717b312803d6ae464e916b89db0a9c072b56360ba290157f541636b","source":{"kind":"arxiv","id":"1609.05537","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05537","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05537v5","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05537","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"KV7VNLQXC6ZR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KV7VNLQXC6ZRFAB5","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KV7VNLQX","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KV7VNLQXC6ZRFAB5NLSGJ2IWXC","target":"record","payload":{"canonical_record":{"source":{"id":"1609.05537","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-18T20:13:50Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"14e06bb49ef83d6ae743d08d0c6a7fac6d7f1e612c02be1723428b4309df65c1","abstract_canon_sha256":"90b7139d4db3d205f7b28d512f2eb1537badd430ec31c551db24b40de7c15f41"},"schema_version":"1.0"},"canonical_sha256":"557f56ae1717b312803d6ae464e916b89db0a9c072b56360ba290157f541636b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:31.578370Z","signature_b64":"GDHJMN+/7zyJIN+dW9mlXo/Gt7BKDYMLCPiXgZd+pdffdUMFhq54IE7z5OounoiI5CDz21WpMCj1EvXodPROAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"557f56ae1717b312803d6ae464e916b89db0a9c072b56360ba290157f541636b","last_reissued_at":"2026-05-18T00:34:31.577958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:31.577958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.05537","source_version":5,"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-18T00:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XKSkWdW1x+lJeUglTSv/8k1aSOHAUHAgepOnqGZ9PzZGWzZzy4FGCy5ljbiz4mWgRAjjMoHO0oDYuUpqQemvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:12:56.633697Z"},"content_sha256":"6c1335f0b5d5d24d92c16bdb9544c50e94d0314de14c3a778e8268601d5a7b68","schema_version":"1.0","event_id":"sha256:6c1335f0b5d5d24d92c16bdb9544c50e94d0314de14c3a778e8268601d5a7b68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KV7VNLQXC6ZRFAB5NLSGJ2IWXC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Speed-ups for Semidefinite Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Fernando G.S.L. Brandao, Krysta Svore","submitted_at":"2016-09-18T20:13:50Z","abstract_excerpt":"We give a quantum algorithm for solving semidefinite programs (SDPs). It has worst-case running time $n^{\\frac{1}{2}} m^{\\frac{1}{2}} s^2 \\text{poly}(\\log(n), \\log(m), R, r, 1/\\delta)$, with $n$ and $s$ the dimension and row-sparsity of the input matrices, respectively, $m$ the number of constraints, $\\delta$ the accuracy of the solution, and $R, r$ a upper bounds on the size of the optimal primal and dual solutions. This gives a square-root unconditional speed-up over any classical method for solving SDPs both in $n$ and $m$. We prove the algorithm cannot be substantially improved (in terms o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05537","kind":"arxiv","version":5},"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-18T00:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvpMb1dVV91a7HsisFYJWtuW260oSx1Cyk1xWijD8iS4kKXFTAgPRVc0eheTPbTfQR2AbYfj7aB2rzhwTe5IDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:12:56.634260Z"},"content_sha256":"d96000299b27e7db4d51e4bf803783b150bc0207a80d7afbae440f2517e639f6","schema_version":"1.0","event_id":"sha256:d96000299b27e7db4d51e4bf803783b150bc0207a80d7afbae440f2517e639f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KV7VNLQXC6ZRFAB5NLSGJ2IWXC/bundle.json","state_url":"https://pith.science/pith/KV7VNLQXC6ZRFAB5NLSGJ2IWXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KV7VNLQXC6ZRFAB5NLSGJ2IWXC/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-25T16:12:56Z","links":{"resolver":"https://pith.science/pith/KV7VNLQXC6ZRFAB5NLSGJ2IWXC","bundle":"https://pith.science/pith/KV7VNLQXC6ZRFAB5NLSGJ2IWXC/bundle.json","state":"https://pith.science/pith/KV7VNLQXC6ZRFAB5NLSGJ2IWXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KV7VNLQXC6ZRFAB5NLSGJ2IWXC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KV7VNLQXC6ZRFAB5NLSGJ2IWXC","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":"90b7139d4db3d205f7b28d512f2eb1537badd430ec31c551db24b40de7c15f41","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-18T20:13:50Z","title_canon_sha256":"14e06bb49ef83d6ae743d08d0c6a7fac6d7f1e612c02be1723428b4309df65c1"},"schema_version":"1.0","source":{"id":"1609.05537","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05537","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05537v5","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05537","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"KV7VNLQXC6ZR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"KV7VNLQXC6ZRFAB5","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"KV7VNLQX","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:d96000299b27e7db4d51e4bf803783b150bc0207a80d7afbae440f2517e639f6","target":"graph","created_at":"2026-05-18T00:34: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"},"paper":{"abstract_excerpt":"We give a quantum algorithm for solving semidefinite programs (SDPs). It has worst-case running time $n^{\\frac{1}{2}} m^{\\frac{1}{2}} s^2 \\text{poly}(\\log(n), \\log(m), R, r, 1/\\delta)$, with $n$ and $s$ the dimension and row-sparsity of the input matrices, respectively, $m$ the number of constraints, $\\delta$ the accuracy of the solution, and $R, r$ a upper bounds on the size of the optimal primal and dual solutions. This gives a square-root unconditional speed-up over any classical method for solving SDPs both in $n$ and $m$. We prove the algorithm cannot be substantially improved (in terms o","authors_text":"Fernando G.S.L. Brandao, Krysta Svore","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-18T20:13:50Z","title":"Quantum Speed-ups for Semidefinite Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05537","kind":"arxiv","version":5},"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:6c1335f0b5d5d24d92c16bdb9544c50e94d0314de14c3a778e8268601d5a7b68","target":"record","created_at":"2026-05-18T00:34: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":"90b7139d4db3d205f7b28d512f2eb1537badd430ec31c551db24b40de7c15f41","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-18T20:13:50Z","title_canon_sha256":"14e06bb49ef83d6ae743d08d0c6a7fac6d7f1e612c02be1723428b4309df65c1"},"schema_version":"1.0","source":{"id":"1609.05537","kind":"arxiv","version":5}},"canonical_sha256":"557f56ae1717b312803d6ae464e916b89db0a9c072b56360ba290157f541636b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"557f56ae1717b312803d6ae464e916b89db0a9c072b56360ba290157f541636b","first_computed_at":"2026-05-18T00:34:31.577958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:31.577958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GDHJMN+/7zyJIN+dW9mlXo/Gt7BKDYMLCPiXgZd+pdffdUMFhq54IE7z5OounoiI5CDz21WpMCj1EvXodPROAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:31.578370Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05537","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c1335f0b5d5d24d92c16bdb9544c50e94d0314de14c3a778e8268601d5a7b68","sha256:d96000299b27e7db4d51e4bf803783b150bc0207a80d7afbae440f2517e639f6"],"state_sha256":"1d8dcfc3740fb1ec7c4702b9edc33c50e747670e990e3cb8a0b08adee7c6a7e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+ozqd4duhx+DJiRoQHYWwjaU8E4m1Z6FkdqBEbOb/meD86fWDaH+Z97LBnn5M9UC3pqbyE3b7VtcEcNM6BVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:12:56.636816Z","bundle_sha256":"d6e50d650fa0a43678e65983d8b88b03985c63642b87e8d1392f27fac14e2692"}}