{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:QELJD2YVT7GBDWCPTOYVFXXZJB","short_pith_number":"pith:QELJD2YV","canonical_record":{"source":{"id":"quant-ph/0211091","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2002-11-15T11:54:15Z","cross_cats_sorted":[],"title_canon_sha256":"1284dda5c310a95cf0672429ec43809a605f1455dc838cf2f94ef122ec5a3cf1","abstract_canon_sha256":"04b7544306f5ff79d62b70c6996f2832578d03bdc61f76d6673d7eae2dfd6ae5"},"schema_version":"1.0"},"canonical_sha256":"811691eb159fcc11d84f9bb152def94852b9d12dda0e4d19a3f932e9c45f58a7","source":{"kind":"arxiv","id":"quant-ph/0211091","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0211091","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0211091v4","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0211091","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"QELJD2YVT7GB","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"QELJD2YVT7GBDWCP","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"QELJD2YV","created_at":"2026-05-18T12:25:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:QELJD2YVT7GBDWCPTOYVFXXZJB","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0211091","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2002-11-15T11:54:15Z","cross_cats_sorted":[],"title_canon_sha256":"1284dda5c310a95cf0672429ec43809a605f1455dc838cf2f94ef122ec5a3cf1","abstract_canon_sha256":"04b7544306f5ff79d62b70c6996f2832578d03bdc61f76d6673d7eae2dfd6ae5"},"schema_version":"1.0"},"canonical_sha256":"811691eb159fcc11d84f9bb152def94852b9d12dda0e4d19a3f932e9c45f58a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:53.362133Z","signature_b64":"9cP+xtgH1b0gsGUPlVpfdZETm/mdX7Doworz19Z4akj+dGnOK0lhiTNyULx5PE5H6Amrh3TU+gxT86zI6GB4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"811691eb159fcc11d84f9bb152def94852b9d12dda0e4d19a3f932e9c45f58a7","last_reissued_at":"2026-05-18T02:47:53.361724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:53.361724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0211091","source_version":4,"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-18T02:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/17e/DwFIC//JRa23o+XpHTOvB7Yx41djwIhfzJ2JezToDSXAEDwdyBC6rhFbohsiwy0VILSirirCodLiRWyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:35:02.512423Z"},"content_sha256":"c37bd058c1174c80195dba10a2d96112d6efa15633ee489822132b26528acb1e","schema_version":"1.0","event_id":"sha256:c37bd058c1174c80195dba10a2d96112d6efa15633ee489822132b26528acb1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:QELJD2YVT7GBDWCPTOYVFXXZJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hidden Translation and Translating Coset in Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"F. Magniez, G. Ivanyos, K. Friedl, M. Santha, P. Sen","submitted_at":"2002-11-15T11:54:15Z","abstract_excerpt":"We give efficient quantum algorithms for the problems of Hidden Translation and Hidden Subgroup in a large class of non-abelian solvable groups including solvable groups of constant exponent and of constant length derived series. Our algorithms are recursive. For the base case, we solve efficiently Hidden Translation in $\\Z_{p}^{n}$, whenever $p$ is a fixed prime. For the induction step, we introduce the problem Translating Coset generalizing both Hidden Translation and Hidden Subgroup, and prove a powerful self-reducibility result: Translating Coset in a finite solvable group $G$ is reducible"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0211091","kind":"arxiv","version":4},"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-18T02:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3KuOXEtd8LzcNxhZKz3/HZSy+F0KPN1PeI7Qq8NQxI9EwAEmkj0YjlanfoDqPXILIefegSCS4ogEZHT4gS3eCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:35:02.512791Z"},"content_sha256":"fc68d6d1c9451089372f093da8adb1b64901ca0575611d4fcbe7944ca2ecb8ae","schema_version":"1.0","event_id":"sha256:fc68d6d1c9451089372f093da8adb1b64901ca0575611d4fcbe7944ca2ecb8ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QELJD2YVT7GBDWCPTOYVFXXZJB/bundle.json","state_url":"https://pith.science/pith/QELJD2YVT7GBDWCPTOYVFXXZJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QELJD2YVT7GBDWCPTOYVFXXZJB/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-06-02T20:35:02Z","links":{"resolver":"https://pith.science/pith/QELJD2YVT7GBDWCPTOYVFXXZJB","bundle":"https://pith.science/pith/QELJD2YVT7GBDWCPTOYVFXXZJB/bundle.json","state":"https://pith.science/pith/QELJD2YVT7GBDWCPTOYVFXXZJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QELJD2YVT7GBDWCPTOYVFXXZJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:QELJD2YVT7GBDWCPTOYVFXXZJB","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":"04b7544306f5ff79d62b70c6996f2832578d03bdc61f76d6673d7eae2dfd6ae5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2002-11-15T11:54:15Z","title_canon_sha256":"1284dda5c310a95cf0672429ec43809a605f1455dc838cf2f94ef122ec5a3cf1"},"schema_version":"1.0","source":{"id":"quant-ph/0211091","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0211091","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0211091v4","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0211091","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"QELJD2YVT7GB","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_16","alias_value":"QELJD2YVT7GBDWCP","created_at":"2026-05-18T12:25:51Z"},{"alias_kind":"pith_short_8","alias_value":"QELJD2YV","created_at":"2026-05-18T12:25:51Z"}],"graph_snapshots":[{"event_id":"sha256:fc68d6d1c9451089372f093da8adb1b64901ca0575611d4fcbe7944ca2ecb8ae","target":"graph","created_at":"2026-05-18T02:47:53Z","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 give efficient quantum algorithms for the problems of Hidden Translation and Hidden Subgroup in a large class of non-abelian solvable groups including solvable groups of constant exponent and of constant length derived series. Our algorithms are recursive. For the base case, we solve efficiently Hidden Translation in $\\Z_{p}^{n}$, whenever $p$ is a fixed prime. For the induction step, we introduce the problem Translating Coset generalizing both Hidden Translation and Hidden Subgroup, and prove a powerful self-reducibility result: Translating Coset in a finite solvable group $G$ is reducible","authors_text":"F. Magniez, G. Ivanyos, K. Friedl, M. Santha, P. Sen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2002-11-15T11:54:15Z","title":"Hidden Translation and Translating Coset in Quantum Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0211091","kind":"arxiv","version":4},"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:c37bd058c1174c80195dba10a2d96112d6efa15633ee489822132b26528acb1e","target":"record","created_at":"2026-05-18T02:47:53Z","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":"04b7544306f5ff79d62b70c6996f2832578d03bdc61f76d6673d7eae2dfd6ae5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2002-11-15T11:54:15Z","title_canon_sha256":"1284dda5c310a95cf0672429ec43809a605f1455dc838cf2f94ef122ec5a3cf1"},"schema_version":"1.0","source":{"id":"quant-ph/0211091","kind":"arxiv","version":4}},"canonical_sha256":"811691eb159fcc11d84f9bb152def94852b9d12dda0e4d19a3f932e9c45f58a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"811691eb159fcc11d84f9bb152def94852b9d12dda0e4d19a3f932e9c45f58a7","first_computed_at":"2026-05-18T02:47:53.361724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:53.361724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9cP+xtgH1b0gsGUPlVpfdZETm/mdX7Doworz19Z4akj+dGnOK0lhiTNyULx5PE5H6Amrh3TU+gxT86zI6GB4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:53.362133Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0211091","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c37bd058c1174c80195dba10a2d96112d6efa15633ee489822132b26528acb1e","sha256:fc68d6d1c9451089372f093da8adb1b64901ca0575611d4fcbe7944ca2ecb8ae"],"state_sha256":"182a1b70ed038d78188fe468f1b1e6d026d8a9cae049a66a47c685b6fc5fabcc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U6owb4e3BhqZ+YoGxO9blA79JQ34PLv+XysABKg3J1+PGQovXoIrktAkW1sNNSd8k5tBBNVkm5sgdEEx/tSpAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:35:02.514873Z","bundle_sha256":"f9ef812f596143c6dccb1cc5fae5bbfc63e8ba5f64e224e6f941619b91ebe9d1"}}