{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:NRDBRFDKMAKLIG6KEPV76HBONX","short_pith_number":"pith:NRDBRFDK","canonical_record":{"source":{"id":"2305.04198","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-07T05:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"f27cb5720dff3f4ea1e697a127b6187b8c1e91b58ad2b5f1907ccb0c6f848247","abstract_canon_sha256":"628fb8933b1ab7f4a29684422268d840553a5590a47e86d3e5aef44fe9ff3945"},"schema_version":"1.0"},"canonical_sha256":"6c4618946a6014b41bca23ebff1c2e6de10ddf20f0ea864792658247bd4dc128","source":{"kind":"arxiv","id":"2305.04198","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.04198","created_at":"2026-07-05T06:09:10Z"},{"alias_kind":"arxiv_version","alias_value":"2305.04198v2","created_at":"2026-07-05T06:09:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04198","created_at":"2026-07-05T06:09:10Z"},{"alias_kind":"pith_short_12","alias_value":"NRDBRFDKMAKL","created_at":"2026-07-05T06:09:10Z"},{"alias_kind":"pith_short_16","alias_value":"NRDBRFDKMAKLIG6K","created_at":"2026-07-05T06:09:10Z"},{"alias_kind":"pith_short_8","alias_value":"NRDBRFDK","created_at":"2026-07-05T06:09:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:NRDBRFDKMAKLIG6KEPV76HBONX","target":"record","payload":{"canonical_record":{"source":{"id":"2305.04198","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-07T05:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"f27cb5720dff3f4ea1e697a127b6187b8c1e91b58ad2b5f1907ccb0c6f848247","abstract_canon_sha256":"628fb8933b1ab7f4a29684422268d840553a5590a47e86d3e5aef44fe9ff3945"},"schema_version":"1.0"},"canonical_sha256":"6c4618946a6014b41bca23ebff1c2e6de10ddf20f0ea864792658247bd4dc128","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:09:10.703868Z","signature_b64":"RvYMg7yZbKlXS+CWmw/hL8X6JNED/LS9wSp32QVC99Z2ewTDmlu+XcmqhH7SmubY+kYuN1x4CVoOjmgzz92qBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c4618946a6014b41bca23ebff1c2e6de10ddf20f0ea864792658247bd4dc128","last_reissued_at":"2026-07-05T06:09:10.703399Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:09:10.703399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.04198","source_version":2,"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-05T06:09:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FD/xj7cS+99zVzralLP5bl4X284piDftztt1qwXyRIfC4gr5V+shq432aB5IlF8m0PAnX60hlledDwW0FzZ6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:47:57.772734Z"},"content_sha256":"5f8e0ed0419f1babef9faa869ab78f34a67d6c9c2c5d7b9c876cfae15bf3e7e8","schema_version":"1.0","event_id":"sha256:5f8e0ed0419f1babef9faa869ab78f34a67d6c9c2c5d7b9c876cfae15bf3e7e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:NRDBRFDKMAKLIG6KEPV76HBONX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pure Quantum Gradient Descent Algorithm and Full Quantum Variational Eigensolver","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Cong Guo, Guanru Feng, Ronghang Chen, Shi-yao Hou","submitted_at":"2023-05-07T05:52:41Z","abstract_excerpt":"Optimization problems are prevalent in various fields, and the gradient-based gradient descent algorithm is a widely adopted optimization method. However, in classical computing, computing the numerical gradient for a function with $d$ variables necessitates at least $d+1$ function evaluations, resulting in a computational complexity of $O(d)$. As the number of variables increases, the classical gradient estimation methods require substantial resources, ultimately surpassing the capabilities of classical computers. Fortunately, leveraging the principles of superposition and entanglement in qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.04198","kind":"arxiv","version":2},"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/2305.04198/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-05T06:09:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lpp8kd/icKaKqcqQ//xyU0Bo80CuW574d4mGcfaZYWdRXWdjPLZmUpsYLq5R0Yg5m9MdBDBYMyGLxw5AA/ZWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:47:57.773096Z"},"content_sha256":"2e8f8740b8b7a7fb202e95e7782f7e550f1919ee52a4d371327be7866a16900e","schema_version":"1.0","event_id":"sha256:2e8f8740b8b7a7fb202e95e7782f7e550f1919ee52a4d371327be7866a16900e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NRDBRFDKMAKLIG6KEPV76HBONX/bundle.json","state_url":"https://pith.science/pith/NRDBRFDKMAKLIG6KEPV76HBONX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NRDBRFDKMAKLIG6KEPV76HBONX/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-07-06T17:47:57Z","links":{"resolver":"https://pith.science/pith/NRDBRFDKMAKLIG6KEPV76HBONX","bundle":"https://pith.science/pith/NRDBRFDKMAKLIG6KEPV76HBONX/bundle.json","state":"https://pith.science/pith/NRDBRFDKMAKLIG6KEPV76HBONX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NRDBRFDKMAKLIG6KEPV76HBONX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:NRDBRFDKMAKLIG6KEPV76HBONX","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":"628fb8933b1ab7f4a29684422268d840553a5590a47e86d3e5aef44fe9ff3945","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-07T05:52:41Z","title_canon_sha256":"f27cb5720dff3f4ea1e697a127b6187b8c1e91b58ad2b5f1907ccb0c6f848247"},"schema_version":"1.0","source":{"id":"2305.04198","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.04198","created_at":"2026-07-05T06:09:10Z"},{"alias_kind":"arxiv_version","alias_value":"2305.04198v2","created_at":"2026-07-05T06:09:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04198","created_at":"2026-07-05T06:09:10Z"},{"alias_kind":"pith_short_12","alias_value":"NRDBRFDKMAKL","created_at":"2026-07-05T06:09:10Z"},{"alias_kind":"pith_short_16","alias_value":"NRDBRFDKMAKLIG6K","created_at":"2026-07-05T06:09:10Z"},{"alias_kind":"pith_short_8","alias_value":"NRDBRFDK","created_at":"2026-07-05T06:09:10Z"}],"graph_snapshots":[{"event_id":"sha256:2e8f8740b8b7a7fb202e95e7782f7e550f1919ee52a4d371327be7866a16900e","target":"graph","created_at":"2026-07-05T06:09:10Z","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/2305.04198/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimization problems are prevalent in various fields, and the gradient-based gradient descent algorithm is a widely adopted optimization method. However, in classical computing, computing the numerical gradient for a function with $d$ variables necessitates at least $d+1$ function evaluations, resulting in a computational complexity of $O(d)$. As the number of variables increases, the classical gradient estimation methods require substantial resources, ultimately surpassing the capabilities of classical computers. Fortunately, leveraging the principles of superposition and entanglement in qua","authors_text":"Cong Guo, Guanru Feng, Ronghang Chen, Shi-yao Hou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-07T05:52:41Z","title":"Pure Quantum Gradient Descent Algorithm and Full Quantum Variational Eigensolver"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.04198","kind":"arxiv","version":2},"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:5f8e0ed0419f1babef9faa869ab78f34a67d6c9c2c5d7b9c876cfae15bf3e7e8","target":"record","created_at":"2026-07-05T06:09:10Z","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":"628fb8933b1ab7f4a29684422268d840553a5590a47e86d3e5aef44fe9ff3945","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-07T05:52:41Z","title_canon_sha256":"f27cb5720dff3f4ea1e697a127b6187b8c1e91b58ad2b5f1907ccb0c6f848247"},"schema_version":"1.0","source":{"id":"2305.04198","kind":"arxiv","version":2}},"canonical_sha256":"6c4618946a6014b41bca23ebff1c2e6de10ddf20f0ea864792658247bd4dc128","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c4618946a6014b41bca23ebff1c2e6de10ddf20f0ea864792658247bd4dc128","first_computed_at":"2026-07-05T06:09:10.703399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:09:10.703399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RvYMg7yZbKlXS+CWmw/hL8X6JNED/LS9wSp32QVC99Z2ewTDmlu+XcmqhH7SmubY+kYuN1x4CVoOjmgzz92qBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:09:10.703868Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.04198","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f8e0ed0419f1babef9faa869ab78f34a67d6c9c2c5d7b9c876cfae15bf3e7e8","sha256:2e8f8740b8b7a7fb202e95e7782f7e550f1919ee52a4d371327be7866a16900e"],"state_sha256":"556ecbd1fd2232580e2a544a029720cafecf3adbd8030cf5b3b40b347f9c8fa9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bi+hV9FbZjLvM9Dfx6l/hZY6ZV/P/UTfcNHtJNfvx51D+E7ebgsZVRdzbEDdFEMugaw+Sx/TaWR1R3cgE7q1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T17:47:57.775446Z","bundle_sha256":"d1fda841749d9fa3516beca1a4db3b83af565df3ec142021dbb0e257633a362d"}}