{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:RRGM4HP7CECUQOAVWE26KU2VVQ","short_pith_number":"pith:RRGM4HP7","schema_version":"1.0","canonical_sha256":"8c4cce1dff1105483815b135e55355ac070e90550af2ecec165cb4151f0dbc5b","source":{"kind":"arxiv","id":"quant-ph/0405146","version":2},"attestation_state":"computed","paper":{"title":"Fast quantum algorithm for numerical gradient estimation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Stephen P. Jordan","submitted_at":"2004-05-25T19:23:40Z","abstract_excerpt":"Given a blackbox for f, a smooth real scalar function of d real variables, one wants to estimate the gradient of f at a given point with n bits of precision. On a classical computer this requires a minimum of d+1 blackbox queries, whereas on a quantum computer it requires only one query regardless of d. The number of bits of precision to which f must be evaluated matches the classical requirement in the limit of large n."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"quant-ph/0405146","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-05-25T19:23:40Z","cross_cats_sorted":[],"title_canon_sha256":"e83dde0235d023e2c9a46edc7d1f609867e0ab5f8ec45871d7f6d24463422dd9","abstract_canon_sha256":"9a880c6b6f9440a1a911a81b212ff44cdd293c3665bddb6aa95239b96b01dfa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:20.074071Z","signature_b64":"WDUO2XchNH6YTnyQtQEF76+X143ih9OFKCqrHFJdovm2ZQGpck3Iume5y8N1N/ttFBqyR3dRMkXTFotaMfY1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c4cce1dff1105483815b135e55355ac070e90550af2ecec165cb4151f0dbc5b","last_reissued_at":"2026-05-18T03:24:20.073367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:20.073367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast quantum algorithm for numerical gradient estimation","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Stephen P. Jordan","submitted_at":"2004-05-25T19:23:40Z","abstract_excerpt":"Given a blackbox for f, a smooth real scalar function of d real variables, one wants to estimate the gradient of f at a given point with n bits of precision. On a classical computer this requires a minimum of d+1 blackbox queries, whereas on a quantum computer it requires only one query regardless of d. The number of bits of precision to which f must be evaluated matches the classical requirement in the limit of large n."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0405146","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0405146","created_at":"2026-05-18T03:24:20.073480+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0405146v2","created_at":"2026-05-18T03:24:20.073480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0405146","created_at":"2026-05-18T03:24:20.073480+00:00"},{"alias_kind":"pith_short_12","alias_value":"RRGM4HP7CECU","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"RRGM4HP7CECUQOAV","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"RRGM4HP7","created_at":"2026-05-18T12:25:52.687210+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.30396","citing_title":"Provable Quantum Advantage for Dynamical Phase Transition","ref_index":62,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RRGM4HP7CECUQOAVWE26KU2VVQ","json":"https://pith.science/pith/RRGM4HP7CECUQOAVWE26KU2VVQ.json","graph_json":"https://pith.science/api/pith-number/RRGM4HP7CECUQOAVWE26KU2VVQ/graph.json","events_json":"https://pith.science/api/pith-number/RRGM4HP7CECUQOAVWE26KU2VVQ/events.json","paper":"https://pith.science/paper/RRGM4HP7"},"agent_actions":{"view_html":"https://pith.science/pith/RRGM4HP7CECUQOAVWE26KU2VVQ","download_json":"https://pith.science/pith/RRGM4HP7CECUQOAVWE26KU2VVQ.json","view_paper":"https://pith.science/paper/RRGM4HP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0405146&json=true","fetch_graph":"https://pith.science/api/pith-number/RRGM4HP7CECUQOAVWE26KU2VVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/RRGM4HP7CECUQOAVWE26KU2VVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RRGM4HP7CECUQOAVWE26KU2VVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RRGM4HP7CECUQOAVWE26KU2VVQ/action/storage_attestation","attest_author":"https://pith.science/pith/RRGM4HP7CECUQOAVWE26KU2VVQ/action/author_attestation","sign_citation":"https://pith.science/pith/RRGM4HP7CECUQOAVWE26KU2VVQ/action/citation_signature","submit_replication":"https://pith.science/pith/RRGM4HP7CECUQOAVWE26KU2VVQ/action/replication_record"}},"created_at":"2026-05-18T03:24:20.073480+00:00","updated_at":"2026-05-18T03:24:20.073480+00:00"}