{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:U3VF2ISM65MI6Z5RZRY5GPAKQC","short_pith_number":"pith:U3VF2ISM","schema_version":"1.0","canonical_sha256":"a6ea5d224cf7588f67b1cc71d33c0a80a03696f5d60cd3d57229fc254f42f178","source":{"kind":"arxiv","id":"1111.4382","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.4382","created_at":"2026-05-18T04:08:04.481465+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.4382v1","created_at":"2026-05-18T04:08:04.481465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4382","created_at":"2026-05-18T04:08:04.481465+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3VF2ISM65MI","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3VF2ISM65MI6Z5R","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3VF2ISM","created_at":"2026-05-18T12:26:42.757692+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U3VF2ISM65MI6Z5RZRY5GPAKQC","json":"https://pith.science/pith/U3VF2ISM65MI6Z5RZRY5GPAKQC.json","graph_json":"https://pith.science/api/pith-number/U3VF2ISM65MI6Z5RZRY5GPAKQC/graph.json","events_json":"https://pith.science/api/pith-number/U3VF2ISM65MI6Z5RZRY5GPAKQC/events.json","paper":"https://pith.science/paper/U3VF2ISM"},"agent_actions":{"view_html":"https://pith.science/pith/U3VF2ISM65MI6Z5RZRY5GPAKQC","download_json":"https://pith.science/pith/U3VF2ISM65MI6Z5RZRY5GPAKQC.json","view_paper":"https://pith.science/paper/U3VF2ISM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.4382&json=true","fetch_graph":"https://pith.science/api/pith-number/U3VF2ISM65MI6Z5RZRY5GPAKQC/graph.json","fetch_events":"https://pith.science/api/pith-number/U3VF2ISM65MI6Z5RZRY5GPAKQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3VF2ISM65MI6Z5RZRY5GPAKQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3VF2ISM65MI6Z5RZRY5GPAKQC/action/storage_attestation","attest_author":"https://pith.science/pith/U3VF2ISM65MI6Z5RZRY5GPAKQC/action/author_attestation","sign_citation":"https://pith.science/pith/U3VF2ISM65MI6Z5RZRY5GPAKQC/action/citation_signature","submit_replication":"https://pith.science/pith/U3VF2ISM65MI6Z5RZRY5GPAKQC/action/replication_record"}},"created_at":"2026-05-18T04:08:04.481465+00:00","updated_at":"2026-05-18T04:08:04.481465+00:00"}