{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:N2ETSPFDCD2ZPLN7ZFV56IDEWZ","short_pith_number":"pith:N2ETSPFD","canonical_record":{"source":{"id":"1809.01731","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-09-04T14:05:38Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"f88094014f35557e00a573293b9dc7bfbf875d00cf060b259e7b77aaef7ddcfa","abstract_canon_sha256":"6e8dd92cd21be70ed0e9c15a1c66590a86a4d95db1777433b34c98cc6e2b9740"},"schema_version":"1.0"},"canonical_sha256":"6e89393ca310f597adbfc96bdf2064b66c170e13a2925f2b3d612276951718b0","source":{"kind":"arxiv","id":"1809.01731","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01731","created_at":"2026-07-05T00:33:09Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01731v3","created_at":"2026-07-05T00:33:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01731","created_at":"2026-07-05T00:33:09Z"},{"alias_kind":"pith_short_12","alias_value":"N2ETSPFDCD2Z","created_at":"2026-07-05T00:33:09Z"},{"alias_kind":"pith_short_16","alias_value":"N2ETSPFDCD2ZPLN7","created_at":"2026-07-05T00:33:09Z"},{"alias_kind":"pith_short_8","alias_value":"N2ETSPFD","created_at":"2026-07-05T00:33:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:N2ETSPFDCD2ZPLN7ZFV56IDEWZ","target":"record","payload":{"canonical_record":{"source":{"id":"1809.01731","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-09-04T14:05:38Z","cross_cats_sorted":["cs.DS","math.OC"],"title_canon_sha256":"f88094014f35557e00a573293b9dc7bfbf875d00cf060b259e7b77aaef7ddcfa","abstract_canon_sha256":"6e8dd92cd21be70ed0e9c15a1c66590a86a4d95db1777433b34c98cc6e2b9740"},"schema_version":"1.0"},"canonical_sha256":"6e89393ca310f597adbfc96bdf2064b66c170e13a2925f2b3d612276951718b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:33:09.303993Z","signature_b64":"6FKHU59tci3n7/zSwgBhqzdWs7Rn9PXz7hexXqvPEmu+8hmmb325jHYDdO1eWJkLZen4WYumLOraa0Z+zlrRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e89393ca310f597adbfc96bdf2064b66c170e13a2925f2b3d612276951718b0","last_reissued_at":"2026-07-05T00:33:09.303414Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:33:09.303414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.01731","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-07-05T00:33:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xv5OHLYKGS7S3P1csTlZYvqHiO3/aOtgBTjRoYPfDqI9LXZLgv/zPZwuZBaQcjT/M335qf+W3eRgqDpDwYOtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:03:34.877370Z"},"content_sha256":"fec2194bbde401bab8b98038a401a8fde83423037e13de24e4b92676b9d8f41f","schema_version":"1.0","event_id":"sha256:fec2194bbde401bab8b98038a401a8fde83423037e13de24e4b92676b9d8f41f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:N2ETSPFDCD2ZPLN7ZFV56IDEWZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum algorithms and lower bounds for convex optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.OC"],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Shouvanik Chakrabarti, Tongyang Li, Xiaodi Wu","submitted_at":"2018-09-04T14:05:38Z","abstract_excerpt":"While recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization. We present a quantum algorithm that can optimize a convex function over an $n$-dimensional convex body using $\\tilde{O}(n)$ queries to oracles that evaluate the objective function and determine membership in the convex body. This represents a quadratic improvement over the best-known classical algorithm. We also study limitations on the power of quantum computers for general convex optimization, showing that it r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01731","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1809.01731/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-05T00:33:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ik5VrIez90Mwa82AS8/HslWZCo50Qu6hsHpXTRs+2L8FJq0w7dKY7oxKl7xP70JDBxXgpHNeDQ7FzRM6miKoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:03:34.879334Z"},"content_sha256":"a700442a3e8ba87b10e91b78a8583ebded1a6964abd8131c3fca455d4892a4c4","schema_version":"1.0","event_id":"sha256:a700442a3e8ba87b10e91b78a8583ebded1a6964abd8131c3fca455d4892a4c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N2ETSPFDCD2ZPLN7ZFV56IDEWZ/bundle.json","state_url":"https://pith.science/pith/N2ETSPFDCD2ZPLN7ZFV56IDEWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N2ETSPFDCD2ZPLN7ZFV56IDEWZ/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-08-04T11:03:34Z","links":{"resolver":"https://pith.science/pith/N2ETSPFDCD2ZPLN7ZFV56IDEWZ","bundle":"https://pith.science/pith/N2ETSPFDCD2ZPLN7ZFV56IDEWZ/bundle.json","state":"https://pith.science/pith/N2ETSPFDCD2ZPLN7ZFV56IDEWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N2ETSPFDCD2ZPLN7ZFV56IDEWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N2ETSPFDCD2ZPLN7ZFV56IDEWZ","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":"6e8dd92cd21be70ed0e9c15a1c66590a86a4d95db1777433b34c98cc6e2b9740","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-09-04T14:05:38Z","title_canon_sha256":"f88094014f35557e00a573293b9dc7bfbf875d00cf060b259e7b77aaef7ddcfa"},"schema_version":"1.0","source":{"id":"1809.01731","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01731","created_at":"2026-07-05T00:33:09Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01731v3","created_at":"2026-07-05T00:33:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01731","created_at":"2026-07-05T00:33:09Z"},{"alias_kind":"pith_short_12","alias_value":"N2ETSPFDCD2Z","created_at":"2026-07-05T00:33:09Z"},{"alias_kind":"pith_short_16","alias_value":"N2ETSPFDCD2ZPLN7","created_at":"2026-07-05T00:33:09Z"},{"alias_kind":"pith_short_8","alias_value":"N2ETSPFD","created_at":"2026-07-05T00:33:09Z"}],"graph_snapshots":[{"event_id":"sha256:a700442a3e8ba87b10e91b78a8583ebded1a6964abd8131c3fca455d4892a4c4","target":"graph","created_at":"2026-07-05T00:33:09Z","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/1809.01731/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"While recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization. We present a quantum algorithm that can optimize a convex function over an $n$-dimensional convex body using $\\tilde{O}(n)$ queries to oracles that evaluate the objective function and determine membership in the convex body. This represents a quadratic improvement over the best-known classical algorithm. We also study limitations on the power of quantum computers for general convex optimization, showing that it r","authors_text":"Andrew M. Childs, Shouvanik Chakrabarti, Tongyang Li, Xiaodi Wu","cross_cats":["cs.DS","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-09-04T14:05:38Z","title":"Quantum algorithms and lower bounds for convex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01731","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:fec2194bbde401bab8b98038a401a8fde83423037e13de24e4b92676b9d8f41f","target":"record","created_at":"2026-07-05T00:33:09Z","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":"6e8dd92cd21be70ed0e9c15a1c66590a86a4d95db1777433b34c98cc6e2b9740","cross_cats_sorted":["cs.DS","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2018-09-04T14:05:38Z","title_canon_sha256":"f88094014f35557e00a573293b9dc7bfbf875d00cf060b259e7b77aaef7ddcfa"},"schema_version":"1.0","source":{"id":"1809.01731","kind":"arxiv","version":3}},"canonical_sha256":"6e89393ca310f597adbfc96bdf2064b66c170e13a2925f2b3d612276951718b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e89393ca310f597adbfc96bdf2064b66c170e13a2925f2b3d612276951718b0","first_computed_at":"2026-07-05T00:33:09.303414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:33:09.303414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6FKHU59tci3n7/zSwgBhqzdWs7Rn9PXz7hexXqvPEmu+8hmmb325jHYDdO1eWJkLZen4WYumLOraa0Z+zlrRAg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:33:09.303993Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01731","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fec2194bbde401bab8b98038a401a8fde83423037e13de24e4b92676b9d8f41f","sha256:a700442a3e8ba87b10e91b78a8583ebded1a6964abd8131c3fca455d4892a4c4"],"state_sha256":"615972b8381092394f14c32825ef787e76a9dcca1c02c6c5b3ff1685ae020277"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IiwnGi+F5TlomEaRtr1l9hv9iUONjmjHJR9aPU9EKrRAhT5R7ZJNPSCU+v5FXJOL+gzAzgwvbkTQNn3/Tl/HCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T11:03:34.888589Z","bundle_sha256":"5dbd11036c77044fea526083821428330dcf6ed28eb5fba3efb90ac6a32dd37e"}}