{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4VA6JKVK7CSG4JSJUNIESZICQQ","short_pith_number":"pith:4VA6JKVK","canonical_record":{"source":{"id":"1711.00465","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-11-01T17:59:47Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"66bd04865635ac6eb0a910a7d31c5a1f507630d05207afec9fcecbe0b18f5a7b","abstract_canon_sha256":"9145a7f6f19a71f24a13d7ebd14ada6edddcecf9045bf6cf9908e67749410886"},"schema_version":"1.0"},"canonical_sha256":"e541e4aaaaf8a46e2649a350496502842b3e9a5562dafff8f7c1ec851b043259","source":{"kind":"arxiv","id":"1711.00465","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00465","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00465v3","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00465","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"4VA6JKVK7CSG","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4VA6JKVK7CSG4JSJ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4VA6JKVK","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4VA6JKVK7CSG4JSJUNIESZICQQ","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00465","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-11-01T17:59:47Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"66bd04865635ac6eb0a910a7d31c5a1f507630d05207afec9fcecbe0b18f5a7b","abstract_canon_sha256":"9145a7f6f19a71f24a13d7ebd14ada6edddcecf9045bf6cf9908e67749410886"},"schema_version":"1.0"},"canonical_sha256":"e541e4aaaaf8a46e2649a350496502842b3e9a5562dafff8f7c1ec851b043259","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:51.970370Z","signature_b64":"Chf61Li1q9DjkpTlxkRC1YigMUURjHhxncwWLld/tdzdb7xhE9o5VvA4AoYWlV0dhi4+lINVIViSa2qb8yzXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e541e4aaaaf8a46e2649a350496502842b3e9a5562dafff8f7c1ec851b043259","last_reissued_at":"2026-05-17T23:53:51.969526Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:51.969526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00465","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:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tqwxygYjLvuiFZ8lXktqcui1JSJqxbUzjOCln13gkTUm1xO4+GcY5KbdR3KITvJ1SmReyZTLHBsMrpB4oDAECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:36:57.693637Z"},"content_sha256":"f98d964853279c34cf74c4799495c8f6b889f1e9ddaa89195cf5d321e8213ef4","schema_version":"1.0","event_id":"sha256:f98d964853279c34cf74c4799495c8f6b889f1e9ddaa89195cf5d321e8213ef4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4VA6JKVK7CSG4JSJUNIESZICQQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing quantum optimization algorithms via faster quantum gradient computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Andr\\'as Gily\\'en, Nathan Wiebe, Srinivasan Arunachalam","submitted_at":"2017-11-01T17:59:47Z","abstract_excerpt":"We consider a generic framework of optimization algorithms based on gradient descent. We develop a quantum algorithm that computes the gradient of a multi-variate real-valued function $f:\\mathbb{R}^d\\rightarrow \\mathbb{R}$ by evaluating it at only a logarithmic number of points in superposition. Our algorithm is an improved version of Stephen Jordan's gradient computation algorithm, providing an approximation of the gradient $\\nabla f$ with quadratically better dependence on the evaluation accuracy of $f$, for an important class of smooth functions. Furthermore, we show that most objective fun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00465","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:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5pamPy94ZuLq/CwH329aofqSuTlfWOjwEPxVGx4z6pv/at1yXBHH4Fzfevrib7hUk8Qhycn7osVQVNuZNCNMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:36:57.694385Z"},"content_sha256":"eaf4c1043726b82a86c39acb4b28e08c3fd3d74e90f4d3ae89c4ef08b8c92dea","schema_version":"1.0","event_id":"sha256:eaf4c1043726b82a86c39acb4b28e08c3fd3d74e90f4d3ae89c4ef08b8c92dea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VA6JKVK7CSG4JSJUNIESZICQQ/bundle.json","state_url":"https://pith.science/pith/4VA6JKVK7CSG4JSJUNIESZICQQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VA6JKVK7CSG4JSJUNIESZICQQ/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-26T12:36:57Z","links":{"resolver":"https://pith.science/pith/4VA6JKVK7CSG4JSJUNIESZICQQ","bundle":"https://pith.science/pith/4VA6JKVK7CSG4JSJUNIESZICQQ/bundle.json","state":"https://pith.science/pith/4VA6JKVK7CSG4JSJUNIESZICQQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VA6JKVK7CSG4JSJUNIESZICQQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4VA6JKVK7CSG4JSJUNIESZICQQ","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":"9145a7f6f19a71f24a13d7ebd14ada6edddcecf9045bf6cf9908e67749410886","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-11-01T17:59:47Z","title_canon_sha256":"66bd04865635ac6eb0a910a7d31c5a1f507630d05207afec9fcecbe0b18f5a7b"},"schema_version":"1.0","source":{"id":"1711.00465","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00465","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00465v3","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00465","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"4VA6JKVK7CSG","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4VA6JKVK7CSG4JSJ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4VA6JKVK","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:eaf4c1043726b82a86c39acb4b28e08c3fd3d74e90f4d3ae89c4ef08b8c92dea","target":"graph","created_at":"2026-05-17T23:53:51Z","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 consider a generic framework of optimization algorithms based on gradient descent. We develop a quantum algorithm that computes the gradient of a multi-variate real-valued function $f:\\mathbb{R}^d\\rightarrow \\mathbb{R}$ by evaluating it at only a logarithmic number of points in superposition. Our algorithm is an improved version of Stephen Jordan's gradient computation algorithm, providing an approximation of the gradient $\\nabla f$ with quadratically better dependence on the evaluation accuracy of $f$, for an important class of smooth functions. Furthermore, we show that most objective fun","authors_text":"Andr\\'as Gily\\'en, Nathan Wiebe, Srinivasan Arunachalam","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-11-01T17:59:47Z","title":"Optimizing quantum optimization algorithms via faster quantum gradient computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00465","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:f98d964853279c34cf74c4799495c8f6b889f1e9ddaa89195cf5d321e8213ef4","target":"record","created_at":"2026-05-17T23:53:51Z","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":"9145a7f6f19a71f24a13d7ebd14ada6edddcecf9045bf6cf9908e67749410886","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-11-01T17:59:47Z","title_canon_sha256":"66bd04865635ac6eb0a910a7d31c5a1f507630d05207afec9fcecbe0b18f5a7b"},"schema_version":"1.0","source":{"id":"1711.00465","kind":"arxiv","version":3}},"canonical_sha256":"e541e4aaaaf8a46e2649a350496502842b3e9a5562dafff8f7c1ec851b043259","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e541e4aaaaf8a46e2649a350496502842b3e9a5562dafff8f7c1ec851b043259","first_computed_at":"2026-05-17T23:53:51.969526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:51.969526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Chf61Li1q9DjkpTlxkRC1YigMUURjHhxncwWLld/tdzdb7xhE9o5VvA4AoYWlV0dhi4+lINVIViSa2qb8yzXBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:51.970370Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00465","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f98d964853279c34cf74c4799495c8f6b889f1e9ddaa89195cf5d321e8213ef4","sha256:eaf4c1043726b82a86c39acb4b28e08c3fd3d74e90f4d3ae89c4ef08b8c92dea"],"state_sha256":"56d2dfeb3fbed8a16d233cfc3e8df5b4fb4168c1830bfbb3d8b2c0571aa10db4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wTD+GaZA3ZUAT3D943O3JPkc9i4kEyoJfly9b62oMZNgRGMQWdfleXocmF1Ii5cc3SYqFVJBml1lZO8fshBmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:36:57.696994Z","bundle_sha256":"5da9e9b74c39714b15458b5b76c235d36dd4355e18e546853c6a8fbb24b92fd8"}}