{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:U3VF2ISM65MI6Z5RZRY5GPAKQC","short_pith_number":"pith:U3VF2ISM","canonical_record":{"source":{"id":"1111.4382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-18T14:56:53Z","cross_cats_sorted":["cs.CR","quant-ph"],"title_canon_sha256":"6474a12ceb298d3b719b82911b97c147354a938ae1b35104a95d523793fa03d8","abstract_canon_sha256":"cb67920f725a0a9a6be4a33f40323633b164f3b67157cd62598809476621b8cf"},"schema_version":"1.0"},"canonical_sha256":"a6ea5d224cf7588f67b1cc71d33c0a80a03696f5d60cd3d57229fc254f42f178","source":{"kind":"arxiv","id":"1111.4382","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4382","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4382v1","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4382","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"pith_short_12","alias_value":"U3VF2ISM65MI","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"U3VF2ISM65MI6Z5R","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"U3VF2ISM","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:U3VF2ISM65MI6Z5RZRY5GPAKQC","target":"record","payload":{"canonical_record":{"source":{"id":"1111.4382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-18T14:56:53Z","cross_cats_sorted":["cs.CR","quant-ph"],"title_canon_sha256":"6474a12ceb298d3b719b82911b97c147354a938ae1b35104a95d523793fa03d8","abstract_canon_sha256":"cb67920f725a0a9a6be4a33f40323633b164f3b67157cd62598809476621b8cf"},"schema_version":"1.0"},"canonical_sha256":"a6ea5d224cf7588f67b1cc71d33c0a80a03696f5d60cd3d57229fc254f42f178","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:04.481855Z","signature_b64":"e93TQ0mxOT8mb5BLcx2idWjwu+L/QC1pNm2Yyu58eOWnCwExxRjadpL59Wu4dz8Cq95m7PcunU9nUK1LDFS9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6ea5d224cf7588f67b1cc71d33c0a80a03696f5d60cd3d57229fc254f42f178","last_reissued_at":"2026-05-18T04:08:04.481403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:04.481403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.4382","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:08:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B+WH8AQDBh53YaAEeIaRWO4OhiQq2XmcDjdJj9u4c4QxnvIyrihuZUA+FRHDGbdrFMeUrLkCE50epZvUZy5MDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:58:22.411626Z"},"content_sha256":"eef9c722032d58f7bd049c5a10d7f34808b989384bf68b8bf538ec8782ef74e2","schema_version":"1.0","event_id":"sha256:eef9c722032d58f7bd049c5a10d7f34808b989384bf68b8bf538ec8782ef74e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:U3VF2ISM65MI6Z5RZRY5GPAKQC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","quant-ph"],"primary_cat":"cs.CC","authors_text":"Alexander Russell, Cristopher Moore, Hang Dinh","submitted_at":"2011-11-18T14:56:53Z","abstract_excerpt":"The Code Equivalence problem is that of determining whether two given linear codes are equivalent to each other up to a permutation of the coordinates. This problem has a direct reduction to a nonabelian hidden subgroup problem (HSP), suggesting a possible quantum algorithm analogous to Shor's algorithms for factoring or discrete log. However, we recently showed that in many cases of interest---including Goppa codes---solving this case of the HSP requires rich, entangled measurements. Thus, solving these cases of Code Equivalence via Fourier sampling appears to be out of reach of current famil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4382","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:08:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UDQCu0hd4od62x36umSumDyJ2LgTGa3b969NJhCo9CpGKy3fKnkpmxQ/zGCch6FqXp2x5WPTc+xIzbRHYHR6Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:58:22.412008Z"},"content_sha256":"34f9737ff916d76463fd609083957d87755ecc2d1f0730d81512615b9a6c1f5d","schema_version":"1.0","event_id":"sha256:34f9737ff916d76463fd609083957d87755ecc2d1f0730d81512615b9a6c1f5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U3VF2ISM65MI6Z5RZRY5GPAKQC/bundle.json","state_url":"https://pith.science/pith/U3VF2ISM65MI6Z5RZRY5GPAKQC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U3VF2ISM65MI6Z5RZRY5GPAKQC/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-05-20T09:58:22Z","links":{"resolver":"https://pith.science/pith/U3VF2ISM65MI6Z5RZRY5GPAKQC","bundle":"https://pith.science/pith/U3VF2ISM65MI6Z5RZRY5GPAKQC/bundle.json","state":"https://pith.science/pith/U3VF2ISM65MI6Z5RZRY5GPAKQC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U3VF2ISM65MI6Z5RZRY5GPAKQC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:U3VF2ISM65MI6Z5RZRY5GPAKQC","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":"cb67920f725a0a9a6be4a33f40323633b164f3b67157cd62598809476621b8cf","cross_cats_sorted":["cs.CR","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-18T14:56:53Z","title_canon_sha256":"6474a12ceb298d3b719b82911b97c147354a938ae1b35104a95d523793fa03d8"},"schema_version":"1.0","source":{"id":"1111.4382","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4382","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4382v1","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4382","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"pith_short_12","alias_value":"U3VF2ISM65MI","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"U3VF2ISM65MI6Z5R","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"U3VF2ISM","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:34f9737ff916d76463fd609083957d87755ecc2d1f0730d81512615b9a6c1f5d","target":"graph","created_at":"2026-05-18T04:08:04Z","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 Code Equivalence problem is that of determining whether two given linear codes are equivalent to each other up to a permutation of the coordinates. This problem has a direct reduction to a nonabelian hidden subgroup problem (HSP), suggesting a possible quantum algorithm analogous to Shor's algorithms for factoring or discrete log. However, we recently showed that in many cases of interest---including Goppa codes---solving this case of the HSP requires rich, entangled measurements. Thus, solving these cases of Code Equivalence via Fourier sampling appears to be out of reach of current famil","authors_text":"Alexander Russell, Cristopher Moore, Hang Dinh","cross_cats":["cs.CR","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-18T14:56:53Z","title":"Quantum Fourier sampling, Code Equivalence, and the quantum security of the McEliece and Sidelnikov cryptosystems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4382","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:eef9c722032d58f7bd049c5a10d7f34808b989384bf68b8bf538ec8782ef74e2","target":"record","created_at":"2026-05-18T04:08:04Z","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":"cb67920f725a0a9a6be4a33f40323633b164f3b67157cd62598809476621b8cf","cross_cats_sorted":["cs.CR","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-18T14:56:53Z","title_canon_sha256":"6474a12ceb298d3b719b82911b97c147354a938ae1b35104a95d523793fa03d8"},"schema_version":"1.0","source":{"id":"1111.4382","kind":"arxiv","version":1}},"canonical_sha256":"a6ea5d224cf7588f67b1cc71d33c0a80a03696f5d60cd3d57229fc254f42f178","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6ea5d224cf7588f67b1cc71d33c0a80a03696f5d60cd3d57229fc254f42f178","first_computed_at":"2026-05-18T04:08:04.481403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:04.481403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e93TQ0mxOT8mb5BLcx2idWjwu+L/QC1pNm2Yyu58eOWnCwExxRjadpL59Wu4dz8Cq95m7PcunU9nUK1LDFS9CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:04.481855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.4382","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eef9c722032d58f7bd049c5a10d7f34808b989384bf68b8bf538ec8782ef74e2","sha256:34f9737ff916d76463fd609083957d87755ecc2d1f0730d81512615b9a6c1f5d"],"state_sha256":"a0eb7e5247ea4ff5b0a34f98f69b3e5695304ac903a8c70c1adc463594034474"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l15uqegXnIamfYxfxVbvmgntUlO497y6Cpg6FVGCKvTqe8CyDweCO4NZomY6MlerZ2zOCFgEs6qKvFkiXzpmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T09:58:22.414105Z","bundle_sha256":"87c679987720044e5e8fd05fcf30daf8b6d6c8327d464f8817d41c1ff99bce02"}}