{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:V6B3B4AUN5VI7RERRAYXIWARU7","short_pith_number":"pith:V6B3B4AU","canonical_record":{"source":{"id":"2412.18309","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-24T09:48:38Z","cross_cats_sorted":[],"title_canon_sha256":"2de8501ffba6d167a2ece70e73e74c0dcaf287166148eafe6a28c15510870932","abstract_canon_sha256":"b4433e83864b26806d869c7d7a2c04a46a493e38aa6305a75c974d47494eea70"},"schema_version":"1.0"},"canonical_sha256":"af83b0f0146f6a8fc4918831745811a7eebcb0893129459763a66fd968ab96cf","source":{"kind":"arxiv","id":"2412.18309","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.18309","created_at":"2026-07-05T10:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"2412.18309v2","created_at":"2026-07-05T10:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.18309","created_at":"2026-07-05T10:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"V6B3B4AUN5VI","created_at":"2026-07-05T10:18:47Z"},{"alias_kind":"pith_short_16","alias_value":"V6B3B4AUN5VI7RER","created_at":"2026-07-05T10:18:47Z"},{"alias_kind":"pith_short_8","alias_value":"V6B3B4AU","created_at":"2026-07-05T10:18:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:V6B3B4AUN5VI7RERRAYXIWARU7","target":"record","payload":{"canonical_record":{"source":{"id":"2412.18309","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-24T09:48:38Z","cross_cats_sorted":[],"title_canon_sha256":"2de8501ffba6d167a2ece70e73e74c0dcaf287166148eafe6a28c15510870932","abstract_canon_sha256":"b4433e83864b26806d869c7d7a2c04a46a493e38aa6305a75c974d47494eea70"},"schema_version":"1.0"},"canonical_sha256":"af83b0f0146f6a8fc4918831745811a7eebcb0893129459763a66fd968ab96cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:47.489689Z","signature_b64":"r+nA+zgkkPs0HZWzbhe8SmoIqEL2oP61EEpXOO0flJjXvlt5KDptaR/ypROERd7Zw/6tCfHXESCMy+U6MpsDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af83b0f0146f6a8fc4918831745811a7eebcb0893129459763a66fd968ab96cf","last_reissued_at":"2026-07-05T10:18:47.488680Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:47.488680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.18309","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-05T10:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RblgJRnCXEKjGuF6bw0Lpc/e4ePiadMudYrGcAxehWxH2T9tx9TcuZfRZK+JA9ET5btyt+lGk5Yx7hCDfnqMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T05:12:02.580222Z"},"content_sha256":"97c2a36a3a550b8da6cf256413d31605fba2ea8f0fb92e8d54d15d82948a8d74","schema_version":"1.0","event_id":"sha256:97c2a36a3a550b8da6cf256413d31605fba2ea8f0fb92e8d54d15d82948a8d74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:V6B3B4AUN5VI7RERRAYXIWARU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple Quantum Gradient Descent Without Coherent Oracle Access","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Nhat A. Nghiem","submitted_at":"2024-12-24T09:48:38Z","abstract_excerpt":"The gradient descent method aims at finding local minima of a given multivariate function by moving along the direction of its gradient, and hence, the algorithm typically involves computing all partial derivatives of a given function, before updating the solution iteratively. In the work of Rebentrost et al. [New Journal of Physics, 21(7):073023, 2019], the authors translated the iterative optimization algorithm into a quantum setting, with some assumptions regarding certain structure of the given function, with oracle or black-box access to some matrix that specifies the structure. Here, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.18309","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/2412.18309/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-05T10:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lCKS5idvkwvPLmTwNZXGVOYlBMMtytAqu0lRWiuOsLmnV+E/bhpoVcy3wVN5yiQNTD+V2pWrGu1krZCHGjUDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T05:12:02.580801Z"},"content_sha256":"6aba7f48cb47e9b812b738137663f296022b492e4a849145a63fc88b21bfa948","schema_version":"1.0","event_id":"sha256:6aba7f48cb47e9b812b738137663f296022b492e4a849145a63fc88b21bfa948"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V6B3B4AUN5VI7RERRAYXIWARU7/bundle.json","state_url":"https://pith.science/pith/V6B3B4AUN5VI7RERRAYXIWARU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V6B3B4AUN5VI7RERRAYXIWARU7/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-12T05:12:02Z","links":{"resolver":"https://pith.science/pith/V6B3B4AUN5VI7RERRAYXIWARU7","bundle":"https://pith.science/pith/V6B3B4AUN5VI7RERRAYXIWARU7/bundle.json","state":"https://pith.science/pith/V6B3B4AUN5VI7RERRAYXIWARU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V6B3B4AUN5VI7RERRAYXIWARU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:V6B3B4AUN5VI7RERRAYXIWARU7","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":"b4433e83864b26806d869c7d7a2c04a46a493e38aa6305a75c974d47494eea70","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-24T09:48:38Z","title_canon_sha256":"2de8501ffba6d167a2ece70e73e74c0dcaf287166148eafe6a28c15510870932"},"schema_version":"1.0","source":{"id":"2412.18309","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.18309","created_at":"2026-07-05T10:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"2412.18309v2","created_at":"2026-07-05T10:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.18309","created_at":"2026-07-05T10:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"V6B3B4AUN5VI","created_at":"2026-07-05T10:18:47Z"},{"alias_kind":"pith_short_16","alias_value":"V6B3B4AUN5VI7RER","created_at":"2026-07-05T10:18:47Z"},{"alias_kind":"pith_short_8","alias_value":"V6B3B4AU","created_at":"2026-07-05T10:18:47Z"}],"graph_snapshots":[{"event_id":"sha256:6aba7f48cb47e9b812b738137663f296022b492e4a849145a63fc88b21bfa948","target":"graph","created_at":"2026-07-05T10:18:47Z","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/2412.18309/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The gradient descent method aims at finding local minima of a given multivariate function by moving along the direction of its gradient, and hence, the algorithm typically involves computing all partial derivatives of a given function, before updating the solution iteratively. In the work of Rebentrost et al. [New Journal of Physics, 21(7):073023, 2019], the authors translated the iterative optimization algorithm into a quantum setting, with some assumptions regarding certain structure of the given function, with oracle or black-box access to some matrix that specifies the structure. Here, we ","authors_text":"Nhat A. Nghiem","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-24T09:48:38Z","title":"Simple Quantum Gradient Descent Without Coherent Oracle Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.18309","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:97c2a36a3a550b8da6cf256413d31605fba2ea8f0fb92e8d54d15d82948a8d74","target":"record","created_at":"2026-07-05T10:18:47Z","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":"b4433e83864b26806d869c7d7a2c04a46a493e38aa6305a75c974d47494eea70","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-24T09:48:38Z","title_canon_sha256":"2de8501ffba6d167a2ece70e73e74c0dcaf287166148eafe6a28c15510870932"},"schema_version":"1.0","source":{"id":"2412.18309","kind":"arxiv","version":2}},"canonical_sha256":"af83b0f0146f6a8fc4918831745811a7eebcb0893129459763a66fd968ab96cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af83b0f0146f6a8fc4918831745811a7eebcb0893129459763a66fd968ab96cf","first_computed_at":"2026-07-05T10:18:47.488680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:18:47.488680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r+nA+zgkkPs0HZWzbhe8SmoIqEL2oP61EEpXOO0flJjXvlt5KDptaR/ypROERd7Zw/6tCfHXESCMy+U6MpsDCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:18:47.489689Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.18309","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97c2a36a3a550b8da6cf256413d31605fba2ea8f0fb92e8d54d15d82948a8d74","sha256:6aba7f48cb47e9b812b738137663f296022b492e4a849145a63fc88b21bfa948"],"state_sha256":"0c6878b5880757fc836710b9d2337855fe3ae295c1a4cdfa3f70ee7e3c7f3f76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pM6O3Kw2k/yDdczQTa45PelVmv2AnUnEfFlttRboibamTiCxDuBsaOfcopNHvT9CmR+vkdNgqM41ship3B6KAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T05:12:02.587948Z","bundle_sha256":"79a9ec7ef7df091ed09e16a5683adccd49d835ef7ac8a81e0b99437c10d4f577"}}