{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VA7AZLQ2263QWB55KLP4MDNNWX","short_pith_number":"pith:VA7AZLQ2","schema_version":"1.0","canonical_sha256":"a83e0cae1ad7b70b07bd52dfc60dadb5ed27549716290758241c6fc5ce452925","source":{"kind":"arxiv","id":"1701.07416","version":2},"attestation_state":"computed","paper":{"title":"Statistical Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Jean-Pierre Tillich, Thomas Debris-Alazard","submitted_at":"2017-01-25T18:22:47Z","abstract_excerpt":"The security of code-based cryptography relies primarily on the hardness of generic decoding with linear codes. The best generic decoding algorithms are all improvements of an old algorithm due to Prange: they are known under the name of information set decoding techniques (ISD). A while ago a generic decoding algorithm which does not belong to this family was proposed: statistical decoding. It is a randomized algorithm that requires the computation of a large set of parity-check equations of moderate weight. We solve here several open problems related to this decoding algorithm.\n  We give in "},"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":"1701.07416","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-01-25T18:22:47Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"b8e125fadcf83abcbf8c3a7731c6db7efd38a39e6a2cc3a6f88dceb21066badd","abstract_canon_sha256":"b418eae213d21451f5dea398226e19347280ca7eab84f62bb4fcd0a926eeb8c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:06.807896Z","signature_b64":"UbMQ1BpV0AWy3yCozNZLlyokC8TlBQw9LddhH0Ah5GlYuCHweAP10LBdPD7UKWIkqojMBRMxQXRer6Pa4DS1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a83e0cae1ad7b70b07bd52dfc60dadb5ed27549716290758241c6fc5ce452925","last_reissued_at":"2026-05-18T00:51:06.807499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:06.807499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistical Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Jean-Pierre Tillich, Thomas Debris-Alazard","submitted_at":"2017-01-25T18:22:47Z","abstract_excerpt":"The security of code-based cryptography relies primarily on the hardness of generic decoding with linear codes. The best generic decoding algorithms are all improvements of an old algorithm due to Prange: they are known under the name of information set decoding techniques (ISD). A while ago a generic decoding algorithm which does not belong to this family was proposed: statistical decoding. It is a randomized algorithm that requires the computation of a large set of parity-check equations of moderate weight. We solve here several open problems related to this decoding algorithm.\n  We give in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07416","kind":"arxiv","version":2},"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":"1701.07416","created_at":"2026-05-18T00:51:06.807567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07416v2","created_at":"2026-05-18T00:51:06.807567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07416","created_at":"2026-05-18T00:51:06.807567+00:00"},{"alias_kind":"pith_short_12","alias_value":"VA7AZLQ2263Q","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VA7AZLQ2263QWB55","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VA7AZLQ2","created_at":"2026-05-18T12:31:49.984773+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/VA7AZLQ2263QWB55KLP4MDNNWX","json":"https://pith.science/pith/VA7AZLQ2263QWB55KLP4MDNNWX.json","graph_json":"https://pith.science/api/pith-number/VA7AZLQ2263QWB55KLP4MDNNWX/graph.json","events_json":"https://pith.science/api/pith-number/VA7AZLQ2263QWB55KLP4MDNNWX/events.json","paper":"https://pith.science/paper/VA7AZLQ2"},"agent_actions":{"view_html":"https://pith.science/pith/VA7AZLQ2263QWB55KLP4MDNNWX","download_json":"https://pith.science/pith/VA7AZLQ2263QWB55KLP4MDNNWX.json","view_paper":"https://pith.science/paper/VA7AZLQ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07416&json=true","fetch_graph":"https://pith.science/api/pith-number/VA7AZLQ2263QWB55KLP4MDNNWX/graph.json","fetch_events":"https://pith.science/api/pith-number/VA7AZLQ2263QWB55KLP4MDNNWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VA7AZLQ2263QWB55KLP4MDNNWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VA7AZLQ2263QWB55KLP4MDNNWX/action/storage_attestation","attest_author":"https://pith.science/pith/VA7AZLQ2263QWB55KLP4MDNNWX/action/author_attestation","sign_citation":"https://pith.science/pith/VA7AZLQ2263QWB55KLP4MDNNWX/action/citation_signature","submit_replication":"https://pith.science/pith/VA7AZLQ2263QWB55KLP4MDNNWX/action/replication_record"}},"created_at":"2026-05-18T00:51:06.807567+00:00","updated_at":"2026-05-18T00:51:06.807567+00:00"}