{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:BWCR32ZT3OMFDD2KX35XIMC3AO","short_pith_number":"pith:BWCR32ZT","canonical_record":{"source":{"id":"2210.06484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-10-12T18:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"f5b5fb23a9d55e20cfa53713c9a923ce5d9cdd5afc5b7d70a724edcb8cc99808","abstract_canon_sha256":"cc0dd708a97ebf4118ce239b75d8c6ce604dff396502d3f9674315e9c97e4315"},"schema_version":"1.0"},"canonical_sha256":"0d851deb33db98518f4abefb74305b03bd420eafbc18233b11099921af4bfbc0","source":{"kind":"arxiv","id":"2210.06484","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.06484","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"arxiv_version","alias_value":"2210.06484v1","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.06484","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"pith_short_12","alias_value":"BWCR32ZT3OMF","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"pith_short_16","alias_value":"BWCR32ZT3OMFDD2K","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"pith_short_8","alias_value":"BWCR32ZT","created_at":"2026-07-05T05:06:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:BWCR32ZT3OMFDD2KX35XIMC3AO","target":"record","payload":{"canonical_record":{"source":{"id":"2210.06484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-10-12T18:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"f5b5fb23a9d55e20cfa53713c9a923ce5d9cdd5afc5b7d70a724edcb8cc99808","abstract_canon_sha256":"cc0dd708a97ebf4118ce239b75d8c6ce604dff396502d3f9674315e9c97e4315"},"schema_version":"1.0"},"canonical_sha256":"0d851deb33db98518f4abefb74305b03bd420eafbc18233b11099921af4bfbc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:01.652305Z","signature_b64":"t5Hj9L6X62QZ60HcTnqlNta7hwmplEV45cPP0bnnTtLNVLi/JqSh1BN3Wx71QRPXIGmJ+hgbM+y7pCQyojJ+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d851deb33db98518f4abefb74305b03bd420eafbc18233b11099921af4bfbc0","last_reissued_at":"2026-07-05T05:06:01.651762Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:01.651762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.06484","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-05T05:06:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"anhGaX01tMByD0XOWbFyhUqQfJvhSmTG1K4F2+wdkDX0FLUGfgzaVd3L8dtriiCdY5eXkNz2saak798dL3mBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:43:43.802714Z"},"content_sha256":"d1cc64e8a29f51aa03df850d0ab168e5d8bbcfe6779fb6a2a1502b5b8491e163","schema_version":"1.0","event_id":"sha256:d1cc64e8a29f51aa03df850d0ab168e5d8bbcfe6779fb6a2a1502b5b8491e163"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:BWCR32ZT3OMFDD2KX35XIMC3AO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast gradient estimation for variational quantum algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jens Watty, Lennart Bittel, Martin Kliesch","submitted_at":"2022-10-12T18:00:00Z","abstract_excerpt":"Many optimization methods for training variational quantum algorithms are based on estimating gradients of the cost function. Due to the statistical nature of quantum measurements, this estimation requires many circuit evaluations, which is a crucial bottleneck of the whole approach. We propose a new gradient estimation method to mitigate this measurement challenge and reduce the required measurement rounds. Within a Bayesian framework and based on the generalized parameter shift rule, we use prior information about the circuit to find an estimation strategy that minimizes expected statistical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.06484","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/2210.06484/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-05T05:06:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"52s+2bD6G//yzBkbZG7XoRxHCSTvRYj0rlKJfX62NTl9zK8HdFyE99bizIwpuc5nsdjmeRJXg7UUFZ3fdcvrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:43:43.803331Z"},"content_sha256":"e224302c228692d8063fd9d3371937b2cc1d053506b5a332102eaf20f1cbe41d","schema_version":"1.0","event_id":"sha256:e224302c228692d8063fd9d3371937b2cc1d053506b5a332102eaf20f1cbe41d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWCR32ZT3OMFDD2KX35XIMC3AO/bundle.json","state_url":"https://pith.science/pith/BWCR32ZT3OMFDD2KX35XIMC3AO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWCR32ZT3OMFDD2KX35XIMC3AO/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-03T16:43:43Z","links":{"resolver":"https://pith.science/pith/BWCR32ZT3OMFDD2KX35XIMC3AO","bundle":"https://pith.science/pith/BWCR32ZT3OMFDD2KX35XIMC3AO/bundle.json","state":"https://pith.science/pith/BWCR32ZT3OMFDD2KX35XIMC3AO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWCR32ZT3OMFDD2KX35XIMC3AO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:BWCR32ZT3OMFDD2KX35XIMC3AO","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":"cc0dd708a97ebf4118ce239b75d8c6ce604dff396502d3f9674315e9c97e4315","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-10-12T18:00:00Z","title_canon_sha256":"f5b5fb23a9d55e20cfa53713c9a923ce5d9cdd5afc5b7d70a724edcb8cc99808"},"schema_version":"1.0","source":{"id":"2210.06484","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.06484","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"arxiv_version","alias_value":"2210.06484v1","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.06484","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"pith_short_12","alias_value":"BWCR32ZT3OMF","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"pith_short_16","alias_value":"BWCR32ZT3OMFDD2K","created_at":"2026-07-05T05:06:01Z"},{"alias_kind":"pith_short_8","alias_value":"BWCR32ZT","created_at":"2026-07-05T05:06:01Z"}],"graph_snapshots":[{"event_id":"sha256:e224302c228692d8063fd9d3371937b2cc1d053506b5a332102eaf20f1cbe41d","target":"graph","created_at":"2026-07-05T05:06:01Z","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/2210.06484/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many optimization methods for training variational quantum algorithms are based on estimating gradients of the cost function. Due to the statistical nature of quantum measurements, this estimation requires many circuit evaluations, which is a crucial bottleneck of the whole approach. We propose a new gradient estimation method to mitigate this measurement challenge and reduce the required measurement rounds. Within a Bayesian framework and based on the generalized parameter shift rule, we use prior information about the circuit to find an estimation strategy that minimizes expected statistical","authors_text":"Jens Watty, Lennart Bittel, Martin Kliesch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-10-12T18:00:00Z","title":"Fast gradient estimation for variational quantum algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.06484","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:d1cc64e8a29f51aa03df850d0ab168e5d8bbcfe6779fb6a2a1502b5b8491e163","target":"record","created_at":"2026-07-05T05:06:01Z","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":"cc0dd708a97ebf4118ce239b75d8c6ce604dff396502d3f9674315e9c97e4315","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-10-12T18:00:00Z","title_canon_sha256":"f5b5fb23a9d55e20cfa53713c9a923ce5d9cdd5afc5b7d70a724edcb8cc99808"},"schema_version":"1.0","source":{"id":"2210.06484","kind":"arxiv","version":1}},"canonical_sha256":"0d851deb33db98518f4abefb74305b03bd420eafbc18233b11099921af4bfbc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d851deb33db98518f4abefb74305b03bd420eafbc18233b11099921af4bfbc0","first_computed_at":"2026-07-05T05:06:01.651762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:06:01.651762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t5Hj9L6X62QZ60HcTnqlNta7hwmplEV45cPP0bnnTtLNVLi/JqSh1BN3Wx71QRPXIGmJ+hgbM+y7pCQyojJ+CA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:06:01.652305Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.06484","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1cc64e8a29f51aa03df850d0ab168e5d8bbcfe6779fb6a2a1502b5b8491e163","sha256:e224302c228692d8063fd9d3371937b2cc1d053506b5a332102eaf20f1cbe41d"],"state_sha256":"cf97fadcc6f402478a4958ed4a66f78132c3c9d8abf87ef65810487d143acf43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQTglZPChVoJ6R//4L1O8UbhtxlEEOCBbD+XsC6EoAYH/JByOvKCmB23F/Ahv2h8TgKd9ZIipkXf9wRS1KGXDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:43:43.807869Z","bundle_sha256":"cc417f6afd1b3b8b394b37039d8278bd371f0a254cf45e77419bd50f284e2964"}}