{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Q4VUISGN2RCOX4OQE3AYJJOM44","short_pith_number":"pith:Q4VUISGN","canonical_record":{"source":{"id":"1509.09271","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-09-30T17:47:39Z","cross_cats_sorted":["cs.CC","cs.CR","cs.DS"],"title_canon_sha256":"710f285aa376e52bbbb49edc784a3084279521715572645bd2d0a2a774af86f8","abstract_canon_sha256":"9fb1bd80dc6cdbdf11d3df3c59a9ca2e91691ec60311e75a6f6d73b55225ebe3"},"schema_version":"1.0"},"canonical_sha256":"872b4448cdd444ebf1d026c184a5cce723342e97c2d65132c955894e09ce95de","source":{"kind":"arxiv","id":"1509.09271","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09271","created_at":"2026-05-18T01:05:12Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09271v2","created_at":"2026-05-18T01:05:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09271","created_at":"2026-05-18T01:05:12Z"},{"alias_kind":"pith_short_12","alias_value":"Q4VUISGN2RCO","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q4VUISGN2RCOX4OQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q4VUISGN","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Q4VUISGN2RCOX4OQE3AYJJOM44","target":"record","payload":{"canonical_record":{"source":{"id":"1509.09271","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-09-30T17:47:39Z","cross_cats_sorted":["cs.CC","cs.CR","cs.DS"],"title_canon_sha256":"710f285aa376e52bbbb49edc784a3084279521715572645bd2d0a2a774af86f8","abstract_canon_sha256":"9fb1bd80dc6cdbdf11d3df3c59a9ca2e91691ec60311e75a6f6d73b55225ebe3"},"schema_version":"1.0"},"canonical_sha256":"872b4448cdd444ebf1d026c184a5cce723342e97c2d65132c955894e09ce95de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:12.717601Z","signature_b64":"8Cv4lkSuulHMMJxoxMU4qfd4VbH2b9q3sVIdvbiy4Og2PrB4Ru/29NKU0inmoOiVIkvKjt5M17xppd2YGMumAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"872b4448cdd444ebf1d026c184a5cce723342e97c2d65132c955894e09ce95de","last_reissued_at":"2026-05-18T01:05:12.716799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:12.716799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.09271","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-05-18T01:05:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E9HwqhddKHi5p51mdPlLMXq++/u3uyvyGG6S6lTrbEN4ZXHtelqOxML+EKc8Ab2hQjKHtPBi2EDRBeBrGJovCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:11:32.639274Z"},"content_sha256":"f5b39167595d82797a7c454428169f879977af8d8f661b5e8346f4ca5078ee6a","schema_version":"1.0","event_id":"sha256:f5b39167595d82797a7c454428169f879977af8d8f661b5e8346f4ca5078ee6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Q4VUISGN2RCOX4OQE3AYJJOM44","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal quantum algorithm for polynomial interpolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR","cs.DS"],"primary_cat":"quant-ph","authors_text":"Andrew M. Childs, Igor E. Shparlinski, Shih-Han Hung, Wim van Dam","submitted_at":"2015-09-30T17:47:39Z","abstract_excerpt":"We consider the number of quantum queries required to determine the coefficients of a degree-d polynomial over GF(q). A lower bound shown independently by Kane and Kutin and by Meyer and Pommersheim shows that d/2+1/2 quantum queries are needed to solve this problem with bounded error, whereas an algorithm of Boneh and Zhandry shows that d quantum queries are sufficient. We show that the lower bound is achievable: d/2+1/2 quantum queries suffice to determine the polynomial with bounded error. Furthermore, we show that d/2+1 queries suffice to achieve probability approaching 1 for large q. Thes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09271","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"},"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-18T01:05:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JgeGuvBy5ic8WE9wDPPfsl3vkdXHPQABNyhzeFvKw8+7/FI2ax3dM1GyZzCf1vfkpH7kHImxWVpVDYBsLgTAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:11:32.639649Z"},"content_sha256":"1264959242e641d5f91c5d41d87af54eed4af77ebdb9df594b33360d888ccab8","schema_version":"1.0","event_id":"sha256:1264959242e641d5f91c5d41d87af54eed4af77ebdb9df594b33360d888ccab8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q4VUISGN2RCOX4OQE3AYJJOM44/bundle.json","state_url":"https://pith.science/pith/Q4VUISGN2RCOX4OQE3AYJJOM44/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q4VUISGN2RCOX4OQE3AYJJOM44/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-28T04:11:32Z","links":{"resolver":"https://pith.science/pith/Q4VUISGN2RCOX4OQE3AYJJOM44","bundle":"https://pith.science/pith/Q4VUISGN2RCOX4OQE3AYJJOM44/bundle.json","state":"https://pith.science/pith/Q4VUISGN2RCOX4OQE3AYJJOM44/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q4VUISGN2RCOX4OQE3AYJJOM44/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Q4VUISGN2RCOX4OQE3AYJJOM44","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":"9fb1bd80dc6cdbdf11d3df3c59a9ca2e91691ec60311e75a6f6d73b55225ebe3","cross_cats_sorted":["cs.CC","cs.CR","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-09-30T17:47:39Z","title_canon_sha256":"710f285aa376e52bbbb49edc784a3084279521715572645bd2d0a2a774af86f8"},"schema_version":"1.0","source":{"id":"1509.09271","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09271","created_at":"2026-05-18T01:05:12Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09271v2","created_at":"2026-05-18T01:05:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09271","created_at":"2026-05-18T01:05:12Z"},{"alias_kind":"pith_short_12","alias_value":"Q4VUISGN2RCO","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q4VUISGN2RCOX4OQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q4VUISGN","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:1264959242e641d5f91c5d41d87af54eed4af77ebdb9df594b33360d888ccab8","target":"graph","created_at":"2026-05-18T01:05:12Z","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 the number of quantum queries required to determine the coefficients of a degree-d polynomial over GF(q). A lower bound shown independently by Kane and Kutin and by Meyer and Pommersheim shows that d/2+1/2 quantum queries are needed to solve this problem with bounded error, whereas an algorithm of Boneh and Zhandry shows that d quantum queries are sufficient. We show that the lower bound is achievable: d/2+1/2 quantum queries suffice to determine the polynomial with bounded error. Furthermore, we show that d/2+1 queries suffice to achieve probability approaching 1 for large q. Thes","authors_text":"Andrew M. Childs, Igor E. Shparlinski, Shih-Han Hung, Wim van Dam","cross_cats":["cs.CC","cs.CR","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-09-30T17:47:39Z","title":"Optimal quantum algorithm for polynomial interpolation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09271","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:f5b39167595d82797a7c454428169f879977af8d8f661b5e8346f4ca5078ee6a","target":"record","created_at":"2026-05-18T01:05:12Z","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":"9fb1bd80dc6cdbdf11d3df3c59a9ca2e91691ec60311e75a6f6d73b55225ebe3","cross_cats_sorted":["cs.CC","cs.CR","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-09-30T17:47:39Z","title_canon_sha256":"710f285aa376e52bbbb49edc784a3084279521715572645bd2d0a2a774af86f8"},"schema_version":"1.0","source":{"id":"1509.09271","kind":"arxiv","version":2}},"canonical_sha256":"872b4448cdd444ebf1d026c184a5cce723342e97c2d65132c955894e09ce95de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"872b4448cdd444ebf1d026c184a5cce723342e97c2d65132c955894e09ce95de","first_computed_at":"2026-05-18T01:05:12.716799Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:12.716799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Cv4lkSuulHMMJxoxMU4qfd4VbH2b9q3sVIdvbiy4Og2PrB4Ru/29NKU0inmoOiVIkvKjt5M17xppd2YGMumAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:12.717601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.09271","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5b39167595d82797a7c454428169f879977af8d8f661b5e8346f4ca5078ee6a","sha256:1264959242e641d5f91c5d41d87af54eed4af77ebdb9df594b33360d888ccab8"],"state_sha256":"6262ca672dd49e35db3824a0cc95de5e17c610d50b34994f72ea97c9addb3c29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P05DVSw6MBuGwPJQZXsV98kWNDuv3ARKBpmjcmZ8NQIKz0Pf0O4+iFz9zPuZmxzQZgGdoTPnrTuIt2Z95rsgCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:11:32.641881Z","bundle_sha256":"2cd7ba5353a597dcb6e9c26be93ed1680c98f24ad5afe2f5a00458335fd17e98"}}