{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RARWA2S7XMSGE3QQOPDNB7HFZX","short_pith_number":"pith:RARWA2S7","canonical_record":{"source":{"id":"1112.3333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-14T20:45:44Z","cross_cats_sorted":[],"title_canon_sha256":"1309c4d35fbd8272d5961cf206cb5b0c968b6f84ec728f9ac88189969238f8b8","abstract_canon_sha256":"84824cee0394150a665275ca848eca29cc5e1bce728e4b618428a4236a4e956a"},"schema_version":"1.0"},"canonical_sha256":"8823606a5fbb24626e1073c6d0fce5cdc5a4819394bbb4fa5f542219c28dc31a","source":{"kind":"arxiv","id":"1112.3333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3333","created_at":"2026-07-05T00:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3333v1","created_at":"2026-07-05T00:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3333","created_at":"2026-07-05T00:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"RARWA2S7XMSG","created_at":"2026-07-05T00:04:25Z"},{"alias_kind":"pith_short_16","alias_value":"RARWA2S7XMSGE3QQ","created_at":"2026-07-05T00:04:25Z"},{"alias_kind":"pith_short_8","alias_value":"RARWA2S7","created_at":"2026-07-05T00:04:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RARWA2S7XMSGE3QQOPDNB7HFZX","target":"record","payload":{"canonical_record":{"source":{"id":"1112.3333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-14T20:45:44Z","cross_cats_sorted":[],"title_canon_sha256":"1309c4d35fbd8272d5961cf206cb5b0c968b6f84ec728f9ac88189969238f8b8","abstract_canon_sha256":"84824cee0394150a665275ca848eca29cc5e1bce728e4b618428a4236a4e956a"},"schema_version":"1.0"},"canonical_sha256":"8823606a5fbb24626e1073c6d0fce5cdc5a4819394bbb4fa5f542219c28dc31a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:25.297528Z","signature_b64":"GF3Ux3jvQvdjBNihEvhW7XPizUw3aGeEFd6WJ5RAELYL8VOsu2yk0WAaElI5BihXRI1Kk0DV9U+O8ZTMfzVNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8823606a5fbb24626e1073c6d0fce5cdc5a4819394bbb4fa5f542219c28dc31a","last_reissued_at":"2026-07-05T00:04:25.296973Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:25.296973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.3333","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-05T00:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/rGGPNf+2krNoCVl8Pt00hR0gdX+a2R2SPI49O/YwhtzidunhTN2ef4l9H+6h/gRoTi12mjebhP22dAr1qh5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:05:35.966825Z"},"content_sha256":"b0e1dbe1fa52ae8fa018f4b50b2c1a64ac5ce043ac48a41a84117bf34fa6f05d","schema_version":"1.0","event_id":"sha256:b0e1dbe1fa52ae8fa018f4b50b2c1a64ac5ce043ac48a41a84117bf34fa6f05d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RARWA2S7XMSGE3QQOPDNB7HFZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Greg Kuperberg (UC Davis)","submitted_at":"2011-12-14T20:45:44Z","abstract_excerpt":"We give an algorithm for the hidden subgroup problem for the dihedral group $D_N$, or equivalently the cyclic hidden shift problem, that supersedes our first algorithm and is suggested by Regev's algorithm. It runs in $\\exp(O(\\sqrt{\\log N}))$ quantum time and uses $\\exp(O(\\sqrt{\\log N}))$ classical space, but only $O(\\log N)$ quantum space. The algorithm also runs faster with quantumly addressable classical space than with fully classical space. In the hidden shift form, which is more natural for this algorithm regardless, it can also make use of multiple hidden shifts. It can also be extended"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3333","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/1112.3333/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-05T00:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ZkiJfZF/i88uTUFwEyq0Xj0xKTaAE0Y/RcGOT1Pm8vY0ytMBKe4bELeUqHsHQbH8EW0rhflT+6IaJyUj+nBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:05:35.967347Z"},"content_sha256":"ae8016aa0ccd06bd81414bc071d0741e4a92c0337f86c305286d36737a18ff6d","schema_version":"1.0","event_id":"sha256:ae8016aa0ccd06bd81414bc071d0741e4a92c0337f86c305286d36737a18ff6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RARWA2S7XMSGE3QQOPDNB7HFZX/bundle.json","state_url":"https://pith.science/pith/RARWA2S7XMSGE3QQOPDNB7HFZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RARWA2S7XMSGE3QQOPDNB7HFZX/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-08T20:05:35Z","links":{"resolver":"https://pith.science/pith/RARWA2S7XMSGE3QQOPDNB7HFZX","bundle":"https://pith.science/pith/RARWA2S7XMSGE3QQOPDNB7HFZX/bundle.json","state":"https://pith.science/pith/RARWA2S7XMSGE3QQOPDNB7HFZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RARWA2S7XMSGE3QQOPDNB7HFZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RARWA2S7XMSGE3QQOPDNB7HFZX","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":"84824cee0394150a665275ca848eca29cc5e1bce728e4b618428a4236a4e956a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-14T20:45:44Z","title_canon_sha256":"1309c4d35fbd8272d5961cf206cb5b0c968b6f84ec728f9ac88189969238f8b8"},"schema_version":"1.0","source":{"id":"1112.3333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.3333","created_at":"2026-07-05T00:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"1112.3333v1","created_at":"2026-07-05T00:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3333","created_at":"2026-07-05T00:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"RARWA2S7XMSG","created_at":"2026-07-05T00:04:25Z"},{"alias_kind":"pith_short_16","alias_value":"RARWA2S7XMSGE3QQ","created_at":"2026-07-05T00:04:25Z"},{"alias_kind":"pith_short_8","alias_value":"RARWA2S7","created_at":"2026-07-05T00:04:25Z"}],"graph_snapshots":[{"event_id":"sha256:ae8016aa0ccd06bd81414bc071d0741e4a92c0337f86c305286d36737a18ff6d","target":"graph","created_at":"2026-07-05T00:04:25Z","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/1112.3333/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give an algorithm for the hidden subgroup problem for the dihedral group $D_N$, or equivalently the cyclic hidden shift problem, that supersedes our first algorithm and is suggested by Regev's algorithm. It runs in $\\exp(O(\\sqrt{\\log N}))$ quantum time and uses $\\exp(O(\\sqrt{\\log N}))$ classical space, but only $O(\\log N)$ quantum space. The algorithm also runs faster with quantumly addressable classical space than with fully classical space. In the hidden shift form, which is more natural for this algorithm regardless, it can also make use of multiple hidden shifts. It can also be extended","authors_text":"Greg Kuperberg (UC Davis)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-14T20:45:44Z","title":"Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3333","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:b0e1dbe1fa52ae8fa018f4b50b2c1a64ac5ce043ac48a41a84117bf34fa6f05d","target":"record","created_at":"2026-07-05T00:04:25Z","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":"84824cee0394150a665275ca848eca29cc5e1bce728e4b618428a4236a4e956a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-12-14T20:45:44Z","title_canon_sha256":"1309c4d35fbd8272d5961cf206cb5b0c968b6f84ec728f9ac88189969238f8b8"},"schema_version":"1.0","source":{"id":"1112.3333","kind":"arxiv","version":1}},"canonical_sha256":"8823606a5fbb24626e1073c6d0fce5cdc5a4819394bbb4fa5f542219c28dc31a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8823606a5fbb24626e1073c6d0fce5cdc5a4819394bbb4fa5f542219c28dc31a","first_computed_at":"2026-07-05T00:04:25.296973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:04:25.296973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GF3Ux3jvQvdjBNihEvhW7XPizUw3aGeEFd6WJ5RAELYL8VOsu2yk0WAaElI5BihXRI1Kk0DV9U+O8ZTMfzVNDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:04:25.297528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.3333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0e1dbe1fa52ae8fa018f4b50b2c1a64ac5ce043ac48a41a84117bf34fa6f05d","sha256:ae8016aa0ccd06bd81414bc071d0741e4a92c0337f86c305286d36737a18ff6d"],"state_sha256":"b55dae8732e2d1095a33e04aeab6aa4b769c989bd66661ed7d1c7a8853ecae91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZNNwOWKtX6yHyF4+99l5ZEQRo8joHXKffv9AH78xQmXRUdf5aQrtXQqeQo/mJmI3mUUQ4LwzFNi3HFFJCWP5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:05:35.971686Z","bundle_sha256":"525298a8580255d57afb641129430e72f13aa9f78619c8c9a97099a81e4b04f1"}}