{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:XDWBQHT3BU2VCDU4ACE2BLXQL2","short_pith_number":"pith:XDWBQHT3","canonical_record":{"source":{"id":"quant-ph/0207131","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-07-23T00:53:31Z","cross_cats_sorted":["cs.DM","math.NT"],"title_canon_sha256":"5ccdac806424579ca2044f1b97ab20521f770ef85e28d48a8421aaaf406995f4","abstract_canon_sha256":"96c7aca61c9bc4a721b600303c165bbfab174eeba57528a00b8a98bc9bc7594a"},"schema_version":"1.0"},"canonical_sha256":"b8ec181e7b0d35510e9c0089a0aef05eab82f5f05db9b56972481e42120130d2","source":{"kind":"arxiv","id":"quant-ph/0207131","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0207131","created_at":"2026-07-04T14:45:59Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0207131v1","created_at":"2026-07-04T14:45:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0207131","created_at":"2026-07-04T14:45:59Z"},{"alias_kind":"pith_short_12","alias_value":"XDWBQHT3BU2V","created_at":"2026-07-04T14:45:59Z"},{"alias_kind":"pith_short_16","alias_value":"XDWBQHT3BU2VCDU4","created_at":"2026-07-04T14:45:59Z"},{"alias_kind":"pith_short_8","alias_value":"XDWBQHT3","created_at":"2026-07-04T14:45:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:XDWBQHT3BU2VCDU4ACE2BLXQL2","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0207131","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-07-23T00:53:31Z","cross_cats_sorted":["cs.DM","math.NT"],"title_canon_sha256":"5ccdac806424579ca2044f1b97ab20521f770ef85e28d48a8421aaaf406995f4","abstract_canon_sha256":"96c7aca61c9bc4a721b600303c165bbfab174eeba57528a00b8a98bc9bc7594a"},"schema_version":"1.0"},"canonical_sha256":"b8ec181e7b0d35510e9c0089a0aef05eab82f5f05db9b56972481e42120130d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:45:59.132862Z","signature_b64":"Qk5uut88xJcX29ESjB5owNdE1GdL4+VBNt0a1mdENdqMnFSWjS/xQDCTbqWT6DHCSOaWUX6koKejiEGcWCDpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8ec181e7b0d35510e9c0089a0aef05eab82f5f05db9b56972481e42120130d2","last_reissued_at":"2026-07-04T14:45:59.132510Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:45:59.132510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0207131","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-04T14:45:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TwG0xQ0vvW7CDbUZwN0ieARHXWOIlTQu9C6IGp7fiiWTsv4mMhZeqhJ5mUIjgrGnze6Y3GW/CKTk4qSEac8CBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T00:23:09.708494Z"},"content_sha256":"33a98ad31040f89d0fb6db895ac4016f1d0b69c45a7c191ef5a6a46fbd4597bb","schema_version":"1.0","event_id":"sha256:33a98ad31040f89d0fb6db895ac4016f1d0b69c45a7c191ef5a6a46fbd4597bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:XDWBQHT3BU2VCDU4ACE2BLXQL2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Quantum Algorithms for Estimating Gauss Sums","license":"","headline":"","cross_cats":["cs.DM","math.NT"],"primary_cat":"quant-ph","authors_text":"Gadiel Seroussi (HP), MSRI, UC Berkeley), Wim van Dam (HP","submitted_at":"2002-07-23T00:53:31Z","abstract_excerpt":"We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction from the discrete logarithm problem to Gauss sum estimation we also give evidence that this problem is hard for classical algorithms. The workings of the quantum algorithm rely on the interaction between the additive characters of the Fourier transform and the multiplicative characters of the Gauss sum."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0207131","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/quant-ph/0207131/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-04T14:45:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xn+PWIlegTBJNDF/+9CXjpG9poapDQ4IbgGJAAR5PU+qLwvF7IBT4YchyytgqxXTwdT2baKFfVjlR5ZSknrWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T00:23:09.709636Z"},"content_sha256":"d0e0dd20b3167f5a2691a72e00453c0dd7e6160b027a6d0e6c588126f1251d01","schema_version":"1.0","event_id":"sha256:d0e0dd20b3167f5a2691a72e00453c0dd7e6160b027a6d0e6c588126f1251d01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDWBQHT3BU2VCDU4ACE2BLXQL2/bundle.json","state_url":"https://pith.science/pith/XDWBQHT3BU2VCDU4ACE2BLXQL2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDWBQHT3BU2VCDU4ACE2BLXQL2/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-14T00:23:09Z","links":{"resolver":"https://pith.science/pith/XDWBQHT3BU2VCDU4ACE2BLXQL2","bundle":"https://pith.science/pith/XDWBQHT3BU2VCDU4ACE2BLXQL2/bundle.json","state":"https://pith.science/pith/XDWBQHT3BU2VCDU4ACE2BLXQL2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDWBQHT3BU2VCDU4ACE2BLXQL2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:XDWBQHT3BU2VCDU4ACE2BLXQL2","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":"96c7aca61c9bc4a721b600303c165bbfab174eeba57528a00b8a98bc9bc7594a","cross_cats_sorted":["cs.DM","math.NT"],"license":"","primary_cat":"quant-ph","submitted_at":"2002-07-23T00:53:31Z","title_canon_sha256":"5ccdac806424579ca2044f1b97ab20521f770ef85e28d48a8421aaaf406995f4"},"schema_version":"1.0","source":{"id":"quant-ph/0207131","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0207131","created_at":"2026-07-04T14:45:59Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0207131v1","created_at":"2026-07-04T14:45:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0207131","created_at":"2026-07-04T14:45:59Z"},{"alias_kind":"pith_short_12","alias_value":"XDWBQHT3BU2V","created_at":"2026-07-04T14:45:59Z"},{"alias_kind":"pith_short_16","alias_value":"XDWBQHT3BU2VCDU4","created_at":"2026-07-04T14:45:59Z"},{"alias_kind":"pith_short_8","alias_value":"XDWBQHT3","created_at":"2026-07-04T14:45:59Z"}],"graph_snapshots":[{"event_id":"sha256:d0e0dd20b3167f5a2691a72e00453c0dd7e6160b027a6d0e6c588126f1251d01","target":"graph","created_at":"2026-07-04T14:45:59Z","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/quant-ph/0207131/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction from the discrete logarithm problem to Gauss sum estimation we also give evidence that this problem is hard for classical algorithms. The workings of the quantum algorithm rely on the interaction between the additive characters of the Fourier transform and the multiplicative characters of the Gauss sum.","authors_text":"Gadiel Seroussi (HP), MSRI, UC Berkeley), Wim van Dam (HP","cross_cats":["cs.DM","math.NT"],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2002-07-23T00:53:31Z","title":"Efficient Quantum Algorithms for Estimating Gauss Sums"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0207131","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:33a98ad31040f89d0fb6db895ac4016f1d0b69c45a7c191ef5a6a46fbd4597bb","target":"record","created_at":"2026-07-04T14:45:59Z","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":"96c7aca61c9bc4a721b600303c165bbfab174eeba57528a00b8a98bc9bc7594a","cross_cats_sorted":["cs.DM","math.NT"],"license":"","primary_cat":"quant-ph","submitted_at":"2002-07-23T00:53:31Z","title_canon_sha256":"5ccdac806424579ca2044f1b97ab20521f770ef85e28d48a8421aaaf406995f4"},"schema_version":"1.0","source":{"id":"quant-ph/0207131","kind":"arxiv","version":1}},"canonical_sha256":"b8ec181e7b0d35510e9c0089a0aef05eab82f5f05db9b56972481e42120130d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8ec181e7b0d35510e9c0089a0aef05eab82f5f05db9b56972481e42120130d2","first_computed_at":"2026-07-04T14:45:59.132510Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:45:59.132510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qk5uut88xJcX29ESjB5owNdE1GdL4+VBNt0a1mdENdqMnFSWjS/xQDCTbqWT6DHCSOaWUX6koKejiEGcWCDpAg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:45:59.132862Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0207131","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33a98ad31040f89d0fb6db895ac4016f1d0b69c45a7c191ef5a6a46fbd4597bb","sha256:d0e0dd20b3167f5a2691a72e00453c0dd7e6160b027a6d0e6c588126f1251d01"],"state_sha256":"ed0a062dafd57f9f6c8f572e5955071dafcda4cfeae0775a89cb4174559bc315"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HxhA+g5YZMwYtLPvCoxaAEQko6tlFyOi9/tgCIpNYy4kJI/A1XvfJ8bNWGN5uQZP2BBsRRMEAkeKpbHK5txrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T00:23:09.810885Z","bundle_sha256":"8428c2b3e13f17be7081b13bdd78a13871bb85bc689a625e734e1bc6c4a34e73"}}