{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IZNJJW5T7I5YVWA5ELI5IYCLR2","short_pith_number":"pith:IZNJJW5T","canonical_record":{"source":{"id":"1608.02003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-05T20:01:14Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e45043e2795d33e599f2e155baa448e9bd1ba7698535fff5e92dc3ba3b49ddf6","abstract_canon_sha256":"94b6937ea0f1962e0df6fbeb5dafa0d4c2440a51a3bde3023ec88e51ee348697"},"schema_version":"1.0"},"canonical_sha256":"465a94dbb3fa3b8ad81d22d1d4604b8e93a3a77b8f314becd20f0b1a0a820e39","source":{"kind":"arxiv","id":"1608.02003","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02003","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02003v1","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02003","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"IZNJJW5T7I5Y","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IZNJJW5T7I5YVWA5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IZNJJW5T","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IZNJJW5T7I5YVWA5ELI5IYCLR2","target":"record","payload":{"canonical_record":{"source":{"id":"1608.02003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-05T20:01:14Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e45043e2795d33e599f2e155baa448e9bd1ba7698535fff5e92dc3ba3b49ddf6","abstract_canon_sha256":"94b6937ea0f1962e0df6fbeb5dafa0d4c2440a51a3bde3023ec88e51ee348697"},"schema_version":"1.0"},"canonical_sha256":"465a94dbb3fa3b8ad81d22d1d4604b8e93a3a77b8f314becd20f0b1a0a820e39","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:41.180949Z","signature_b64":"wITeWB3V81YuVEIjVwLsxcLpQG8rATUe2FWLUKnAqgxq52/MU4D/6JvNyr5NJ64kqDzYx1dkMnH8nTxeL20xBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"465a94dbb3fa3b8ad81d22d1d4604b8e93a3a77b8f314becd20f0b1a0a820e39","last_reissued_at":"2026-05-18T01:09:41.180512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:41.180512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.02003","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-18T01:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qjz91XtejyZCAm0mI2xMGrtlD30zHZLfF7peHo/5o6ziCsIP/Uoj/2SjvpD9v/RQuien1SYRKRWI7LWc9NCfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:58:58.953200Z"},"content_sha256":"251e3e3a69c3a09ee036ffacc7b2c85589f73424e7dac1a395062e2888376d07","schema_version":"1.0","event_id":"sha256:251e3e3a69c3a09ee036ffacc7b2c85589f73424e7dac1a395062e2888376d07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IZNJJW5T7I5YVWA5ELI5IYCLR2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How hard is deciding trivial versus nontrivial in the dihedral coset problem?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Nai-Hui Chia, Sean Hallgren","submitted_at":"2016-08-05T20:01:14Z","abstract_excerpt":"We study the hardness of the dihedral hidden subgroup problem. It is known that lattice problems reduce to it, and that it reduces to random subset sum with density $> 1$ and also to quantum sampling subset sum solutions. We examine a decision version of the problem where the question asks whether the hidden subgroup is trivial or order two. The decision problem essentially asks if a given vector is in the span of all coset states. We approach this by first computing an explicit basis for the coset space and the perpendicular space. We then look at the consequences of having efficient unitarie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02003","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-18T01:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ux74G4P5JVQ2yVIGiQTgqBE09OEFyGzXeSDxZsdOKkh6EFXrstzFoplSSS9u9BFHPs9ODDFKVh7URk7ec/fOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:58:58.953580Z"},"content_sha256":"a827d43d70b0683088951ca08bc5da613e0f06f64afecfcbd46f8e53a21161a0","schema_version":"1.0","event_id":"sha256:a827d43d70b0683088951ca08bc5da613e0f06f64afecfcbd46f8e53a21161a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZNJJW5T7I5YVWA5ELI5IYCLR2/bundle.json","state_url":"https://pith.science/pith/IZNJJW5T7I5YVWA5ELI5IYCLR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZNJJW5T7I5YVWA5ELI5IYCLR2/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-01T21:58:58Z","links":{"resolver":"https://pith.science/pith/IZNJJW5T7I5YVWA5ELI5IYCLR2","bundle":"https://pith.science/pith/IZNJJW5T7I5YVWA5ELI5IYCLR2/bundle.json","state":"https://pith.science/pith/IZNJJW5T7I5YVWA5ELI5IYCLR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZNJJW5T7I5YVWA5ELI5IYCLR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IZNJJW5T7I5YVWA5ELI5IYCLR2","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":"94b6937ea0f1962e0df6fbeb5dafa0d4c2440a51a3bde3023ec88e51ee348697","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-05T20:01:14Z","title_canon_sha256":"e45043e2795d33e599f2e155baa448e9bd1ba7698535fff5e92dc3ba3b49ddf6"},"schema_version":"1.0","source":{"id":"1608.02003","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02003","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02003v1","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02003","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"IZNJJW5T7I5Y","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IZNJJW5T7I5YVWA5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IZNJJW5T","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:a827d43d70b0683088951ca08bc5da613e0f06f64afecfcbd46f8e53a21161a0","target":"graph","created_at":"2026-05-18T01:09:41Z","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 study the hardness of the dihedral hidden subgroup problem. It is known that lattice problems reduce to it, and that it reduces to random subset sum with density $> 1$ and also to quantum sampling subset sum solutions. We examine a decision version of the problem where the question asks whether the hidden subgroup is trivial or order two. The decision problem essentially asks if a given vector is in the span of all coset states. We approach this by first computing an explicit basis for the coset space and the perpendicular space. We then look at the consequences of having efficient unitarie","authors_text":"Nai-Hui Chia, Sean Hallgren","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-05T20:01:14Z","title":"How hard is deciding trivial versus nontrivial in the dihedral coset problem?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02003","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:251e3e3a69c3a09ee036ffacc7b2c85589f73424e7dac1a395062e2888376d07","target":"record","created_at":"2026-05-18T01:09:41Z","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":"94b6937ea0f1962e0df6fbeb5dafa0d4c2440a51a3bde3023ec88e51ee348697","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-08-05T20:01:14Z","title_canon_sha256":"e45043e2795d33e599f2e155baa448e9bd1ba7698535fff5e92dc3ba3b49ddf6"},"schema_version":"1.0","source":{"id":"1608.02003","kind":"arxiv","version":1}},"canonical_sha256":"465a94dbb3fa3b8ad81d22d1d4604b8e93a3a77b8f314becd20f0b1a0a820e39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"465a94dbb3fa3b8ad81d22d1d4604b8e93a3a77b8f314becd20f0b1a0a820e39","first_computed_at":"2026-05-18T01:09:41.180512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:41.180512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wITeWB3V81YuVEIjVwLsxcLpQG8rATUe2FWLUKnAqgxq52/MU4D/6JvNyr5NJ64kqDzYx1dkMnH8nTxeL20xBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:41.180949Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.02003","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:251e3e3a69c3a09ee036ffacc7b2c85589f73424e7dac1a395062e2888376d07","sha256:a827d43d70b0683088951ca08bc5da613e0f06f64afecfcbd46f8e53a21161a0"],"state_sha256":"f96f8042e06c0e356bdf9d592973f969dd7aac9bc3eee3369e8ba9fca6e2864f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jKdZaOieX1XUdaYOZXWz91n0p8KzOLLlJ0ffs0pc08spH8l27ViTEpjkqtU9A9nu2CyhcD38M6C6xlWBI9EcAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:58:58.955424Z","bundle_sha256":"58554dd4bc7ab910f76779cda1a4f196af58feb9891b761cf27a4b7758e9ebfc"}}