{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:RSGSZX2KDDUE7VCNUQRU447HIB","short_pith_number":"pith:RSGSZX2K","canonical_record":{"source":{"id":"2307.03065","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-07-06T15:32:50Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"64784a2098dcba0eb0912ff855327b3a97cb13ff427576f3e417ed6a90367172","abstract_canon_sha256":"12b2d30f0f512aafc71406d3ddc1d7a585474a511e24389d1cdd2440ad46ade1"},"schema_version":"1.0"},"canonical_sha256":"8c8d2cdf4a18e84fd44da4234e73e7405e52503f408e16ab83da82970a886f02","source":{"kind":"arxiv","id":"2307.03065","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.03065","created_at":"2026-07-05T09:23:44Z"},{"alias_kind":"arxiv_version","alias_value":"2307.03065v2","created_at":"2026-07-05T09:23:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.03065","created_at":"2026-07-05T09:23:44Z"},{"alias_kind":"pith_short_12","alias_value":"RSGSZX2KDDUE","created_at":"2026-07-05T09:23:44Z"},{"alias_kind":"pith_short_16","alias_value":"RSGSZX2KDDUE7VCN","created_at":"2026-07-05T09:23:44Z"},{"alias_kind":"pith_short_8","alias_value":"RSGSZX2K","created_at":"2026-07-05T09:23:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:RSGSZX2KDDUE7VCNUQRU447HIB","target":"record","payload":{"canonical_record":{"source":{"id":"2307.03065","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-07-06T15:32:50Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"64784a2098dcba0eb0912ff855327b3a97cb13ff427576f3e417ed6a90367172","abstract_canon_sha256":"12b2d30f0f512aafc71406d3ddc1d7a585474a511e24389d1cdd2440ad46ade1"},"schema_version":"1.0"},"canonical_sha256":"8c8d2cdf4a18e84fd44da4234e73e7405e52503f408e16ab83da82970a886f02","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:44.152422Z","signature_b64":"bBHwkBR/fbdmWSi3Ndqg2iYYq6U8Dn8fyj+28EbQO/KuQhZl+kutM2oUreECg70vpSw6XANxeph8BkHKaElkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c8d2cdf4a18e84fd44da4234e73e7405e52503f408e16ab83da82970a886f02","last_reissued_at":"2026-07-05T09:23:44.151860Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:44.151860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.03065","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-05T09:23:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ITGfO4EvXrY66j/FKcDbQUoott0kW2f+k463eizVA8gwgs5DkKoYUbc3bUqikXWMKpK8+38zlDdY0Ycjp65xAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:00:24.344353Z"},"content_sha256":"e16ade55ef30d5b958f14cb244730d57d7b735bae738d6efb5325c8174032b4f","schema_version":"1.0","event_id":"sha256:e16ade55ef30d5b958f14cb244730d57d7b735bae738d6efb5325c8174032b4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:RSGSZX2KDDUE7VCNUQRU447HIB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Complexity for Discrete Logarithms and Related Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Aaram Yun, Minki Hhan, Takashi Yamakawa","submitted_at":"2023-07-06T15:32:50Z","abstract_excerpt":"This paper studies the quantum computational complexity of the discrete logarithm (DL) and related group-theoretic problems in the context of generic algorithms -- that is, algorithms that do not exploit any properties of the group encoding.\n  We establish a generic model of quantum computation for group-theoretic problems, which we call the quantum generic group model. Shor's algorithm for the DL problem and related algorithms can be described in this model. We show the quantum complexity lower bounds and almost matching algorithms of the DL and related problems in this model. More precisely,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.03065","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/2307.03065/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-05T09:23:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQ6UepChHpCl2lu0Iq1Wmt7Y/LHABwq52GMUi6T6vkQbNLpDcYyrhm0KjIqv2FOF77XCS+E0o5tpGEC8s6mjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:00:24.344742Z"},"content_sha256":"05490018c910af53ea189e09f14864a88737c74c88e8fc67951102306cb49e3b","schema_version":"1.0","event_id":"sha256:05490018c910af53ea189e09f14864a88737c74c88e8fc67951102306cb49e3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RSGSZX2KDDUE7VCNUQRU447HIB/bundle.json","state_url":"https://pith.science/pith/RSGSZX2KDDUE7VCNUQRU447HIB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RSGSZX2KDDUE7VCNUQRU447HIB/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-09T06:00:24Z","links":{"resolver":"https://pith.science/pith/RSGSZX2KDDUE7VCNUQRU447HIB","bundle":"https://pith.science/pith/RSGSZX2KDDUE7VCNUQRU447HIB/bundle.json","state":"https://pith.science/pith/RSGSZX2KDDUE7VCNUQRU447HIB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RSGSZX2KDDUE7VCNUQRU447HIB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:RSGSZX2KDDUE7VCNUQRU447HIB","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":"12b2d30f0f512aafc71406d3ddc1d7a585474a511e24389d1cdd2440ad46ade1","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-07-06T15:32:50Z","title_canon_sha256":"64784a2098dcba0eb0912ff855327b3a97cb13ff427576f3e417ed6a90367172"},"schema_version":"1.0","source":{"id":"2307.03065","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.03065","created_at":"2026-07-05T09:23:44Z"},{"alias_kind":"arxiv_version","alias_value":"2307.03065v2","created_at":"2026-07-05T09:23:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.03065","created_at":"2026-07-05T09:23:44Z"},{"alias_kind":"pith_short_12","alias_value":"RSGSZX2KDDUE","created_at":"2026-07-05T09:23:44Z"},{"alias_kind":"pith_short_16","alias_value":"RSGSZX2KDDUE7VCN","created_at":"2026-07-05T09:23:44Z"},{"alias_kind":"pith_short_8","alias_value":"RSGSZX2K","created_at":"2026-07-05T09:23:44Z"}],"graph_snapshots":[{"event_id":"sha256:05490018c910af53ea189e09f14864a88737c74c88e8fc67951102306cb49e3b","target":"graph","created_at":"2026-07-05T09:23:44Z","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/2307.03065/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies the quantum computational complexity of the discrete logarithm (DL) and related group-theoretic problems in the context of generic algorithms -- that is, algorithms that do not exploit any properties of the group encoding.\n  We establish a generic model of quantum computation for group-theoretic problems, which we call the quantum generic group model. Shor's algorithm for the DL problem and related algorithms can be described in this model. We show the quantum complexity lower bounds and almost matching algorithms of the DL and related problems in this model. More precisely,","authors_text":"Aaram Yun, Minki Hhan, Takashi Yamakawa","cross_cats":["cs.CR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-07-06T15:32:50Z","title":"Quantum Complexity for Discrete Logarithms and Related Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.03065","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:e16ade55ef30d5b958f14cb244730d57d7b735bae738d6efb5325c8174032b4f","target":"record","created_at":"2026-07-05T09:23:44Z","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":"12b2d30f0f512aafc71406d3ddc1d7a585474a511e24389d1cdd2440ad46ade1","cross_cats_sorted":["cs.CR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-07-06T15:32:50Z","title_canon_sha256":"64784a2098dcba0eb0912ff855327b3a97cb13ff427576f3e417ed6a90367172"},"schema_version":"1.0","source":{"id":"2307.03065","kind":"arxiv","version":2}},"canonical_sha256":"8c8d2cdf4a18e84fd44da4234e73e7405e52503f408e16ab83da82970a886f02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c8d2cdf4a18e84fd44da4234e73e7405e52503f408e16ab83da82970a886f02","first_computed_at":"2026-07-05T09:23:44.151860Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:23:44.151860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bBHwkBR/fbdmWSi3Ndqg2iYYq6U8Dn8fyj+28EbQO/KuQhZl+kutM2oUreECg70vpSw6XANxeph8BkHKaElkBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:23:44.152422Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.03065","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e16ade55ef30d5b958f14cb244730d57d7b735bae738d6efb5325c8174032b4f","sha256:05490018c910af53ea189e09f14864a88737c74c88e8fc67951102306cb49e3b"],"state_sha256":"505ff0401232ce327ee792cddd194eddd55a7e4838e3060fdd6b8f4e5ded4c6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nqUDzX2UApRILrRRDSyzxlxdFGox3ARFpn1hz4DyRCL3lFnU60rVk/Ai4LjUID96X85k03fULPRK7X72F5ngCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T06:00:24.347069Z","bundle_sha256":"a34a646b177a79821f245cf2937a65da3819b550c46b09f2d94a730269c077cc"}}