{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FEG6DYK3JAL2DYETMUM5SJXQAI","short_pith_number":"pith:FEG6DYK3","canonical_record":{"source":{"id":"1104.1361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-04-07T15:41:42Z","cross_cats_sorted":["math.GR","math.RT"],"title_canon_sha256":"5af279904490d882b1c49ddd79a6c085b3493d8b693c5e8105227b1dbe2f0c7e","abstract_canon_sha256":"3f512fc06b5ef389e6acdc107a1687d2f8a3a9530ef421204b0b96acd4983073"},"schema_version":"1.0"},"canonical_sha256":"290de1e15b4817a1e0936519d926f0020bd8a2d1e0c91f9066f3c8da4bd7baba","source":{"kind":"arxiv","id":"1104.1361","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1361","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1361v1","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1361","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"pith_short_12","alias_value":"FEG6DYK3JAL2","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FEG6DYK3JAL2DYET","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FEG6DYK3","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FEG6DYK3JAL2DYETMUM5SJXQAI","target":"record","payload":{"canonical_record":{"source":{"id":"1104.1361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-04-07T15:41:42Z","cross_cats_sorted":["math.GR","math.RT"],"title_canon_sha256":"5af279904490d882b1c49ddd79a6c085b3493d8b693c5e8105227b1dbe2f0c7e","abstract_canon_sha256":"3f512fc06b5ef389e6acdc107a1687d2f8a3a9530ef421204b0b96acd4983073"},"schema_version":"1.0"},"canonical_sha256":"290de1e15b4817a1e0936519d926f0020bd8a2d1e0c91f9066f3c8da4bd7baba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:52.382866Z","signature_b64":"IU9Ux028TqXJEMcCeJ1ddH3z3iDBiUJ8sFN7iUbS6LtODVeDnUDXEV67MWrCmF0V2NdViN94m/kH/0dxMDBRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"290de1e15b4817a1e0936519d926f0020bd8a2d1e0c91f9066f3c8da4bd7baba","last_reissued_at":"2026-05-18T04:24:52.382310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:52.382310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.1361","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-05-18T04:24:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Puy+h+AUlTfJMOP285uriG9OCqEmXvnSzGYEPlFKA5Ke3Tjwf2erZElQjAqFvLNXLAfeRsuNd+/dK4v7zUMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:27:28.812100Z"},"content_sha256":"8a815c6c6b14ed09dbd2cbda0ecf82fe5b8deffa214c85f7637073a2ea7c321d","schema_version":"1.0","event_id":"sha256:8a815c6c6b14ed09dbd2cbda0ecf82fe5b8deffa214c85f7637073a2ea7c321d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FEG6DYK3JAL2DYETMUM5SJXQAI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solution to the Hidden Subgroup Problem for a Class of Noncommutative Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.RT"],"primary_cat":"quant-ph","authors_text":"D. N. Goncalves, R. Portugal","submitted_at":"2011-04-07T15:41:42Z","abstract_excerpt":"The hidden subgroup problem (HSP) plays an important role in quantum computation, because many quantum algorithms that are exponentially faster than classical algorithms can be casted in the HSP structure. In this paper, we present a new polynomial-time quantum algorithm that solves the HSP over the group $\\Z_{p^r} \\rtimes \\Z_{q^s}$, when $p^r/q= \\up{poly}(\\log p^r)$, where $p$, $q$ are any odd prime numbers and $r, s$ are any positive integers. To find the hidden subgroup, our algorithm uses the abelian quantum Fourier transform and a reduction procedure that simplifies the problem to find cy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1361","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":""},"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-18T04:24:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TH38zv5C/yRWp8PcrhZarllvS3oxgTcxUvYypZV0mUXRKYoBECTlvQwHPaTYQrVZB3QKKRrZOs/ceT97nF+zDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:27:28.812744Z"},"content_sha256":"62373d212a9c2112a07c7490f2a54c409ebc0215cdb3ac8de2d7482d29fc868b","schema_version":"1.0","event_id":"sha256:62373d212a9c2112a07c7490f2a54c409ebc0215cdb3ac8de2d7482d29fc868b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FEG6DYK3JAL2DYETMUM5SJXQAI/bundle.json","state_url":"https://pith.science/pith/FEG6DYK3JAL2DYETMUM5SJXQAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FEG6DYK3JAL2DYETMUM5SJXQAI/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-06T20:27:28Z","links":{"resolver":"https://pith.science/pith/FEG6DYK3JAL2DYETMUM5SJXQAI","bundle":"https://pith.science/pith/FEG6DYK3JAL2DYETMUM5SJXQAI/bundle.json","state":"https://pith.science/pith/FEG6DYK3JAL2DYETMUM5SJXQAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FEG6DYK3JAL2DYETMUM5SJXQAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FEG6DYK3JAL2DYETMUM5SJXQAI","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":"3f512fc06b5ef389e6acdc107a1687d2f8a3a9530ef421204b0b96acd4983073","cross_cats_sorted":["math.GR","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-04-07T15:41:42Z","title_canon_sha256":"5af279904490d882b1c49ddd79a6c085b3493d8b693c5e8105227b1dbe2f0c7e"},"schema_version":"1.0","source":{"id":"1104.1361","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1361","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1361v1","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1361","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"pith_short_12","alias_value":"FEG6DYK3JAL2","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FEG6DYK3JAL2DYET","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FEG6DYK3","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:62373d212a9c2112a07c7490f2a54c409ebc0215cdb3ac8de2d7482d29fc868b","target":"graph","created_at":"2026-05-18T04:24:52Z","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":"The hidden subgroup problem (HSP) plays an important role in quantum computation, because many quantum algorithms that are exponentially faster than classical algorithms can be casted in the HSP structure. In this paper, we present a new polynomial-time quantum algorithm that solves the HSP over the group $\\Z_{p^r} \\rtimes \\Z_{q^s}$, when $p^r/q= \\up{poly}(\\log p^r)$, where $p$, $q$ are any odd prime numbers and $r, s$ are any positive integers. To find the hidden subgroup, our algorithm uses the abelian quantum Fourier transform and a reduction procedure that simplifies the problem to find cy","authors_text":"D. N. Goncalves, R. Portugal","cross_cats":["math.GR","math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-04-07T15:41:42Z","title":"Solution to the Hidden Subgroup Problem for a Class of Noncommutative Groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1361","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:8a815c6c6b14ed09dbd2cbda0ecf82fe5b8deffa214c85f7637073a2ea7c321d","target":"record","created_at":"2026-05-18T04:24:52Z","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":"3f512fc06b5ef389e6acdc107a1687d2f8a3a9530ef421204b0b96acd4983073","cross_cats_sorted":["math.GR","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-04-07T15:41:42Z","title_canon_sha256":"5af279904490d882b1c49ddd79a6c085b3493d8b693c5e8105227b1dbe2f0c7e"},"schema_version":"1.0","source":{"id":"1104.1361","kind":"arxiv","version":1}},"canonical_sha256":"290de1e15b4817a1e0936519d926f0020bd8a2d1e0c91f9066f3c8da4bd7baba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"290de1e15b4817a1e0936519d926f0020bd8a2d1e0c91f9066f3c8da4bd7baba","first_computed_at":"2026-05-18T04:24:52.382310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:52.382310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IU9Ux028TqXJEMcCeJ1ddH3z3iDBiUJ8sFN7iUbS6LtODVeDnUDXEV67MWrCmF0V2NdViN94m/kH/0dxMDBRAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:52.382866Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.1361","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a815c6c6b14ed09dbd2cbda0ecf82fe5b8deffa214c85f7637073a2ea7c321d","sha256:62373d212a9c2112a07c7490f2a54c409ebc0215cdb3ac8de2d7482d29fc868b"],"state_sha256":"7b5c13e61273afa54d60a994fc6ca81ebd6e7a295f2803d055920a44b15d60c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9oHLssRXD3Ah1bRGXWNtesxRXmo8m0pHlM8fZ0cNuWOhn1OxqL1KJCYFMxgjJ85S3Uf2hlHhfHCLBV1Hb0BXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:27:28.815994Z","bundle_sha256":"8fa30f169f9b42836fdd962c31fa3c59f54f21fb32275a732aa6d7ca4b1716aa"}}