{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VA7AZLQ2263QWB55KLP4MDNNWX","short_pith_number":"pith:VA7AZLQ2","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"},"canonical_sha256":"a83e0cae1ad7b70b07bd52dfc60dadb5ed27549716290758241c6fc5ce452925","source":{"kind":"arxiv","id":"1701.07416","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07416","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07416v2","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07416","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"VA7AZLQ2263Q","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VA7AZLQ2263QWB55","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VA7AZLQ2","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VA7AZLQ2263QWB55KLP4MDNNWX","target":"record","payload":{"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"},"canonical_sha256":"a83e0cae1ad7b70b07bd52dfc60dadb5ed27549716290758241c6fc5ce452925","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"},"source_kind":"arxiv","source_id":"1701.07416","source_version":2,"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-18T00:51:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mkziT4sh4re2dWj6FF7OtAVI0JHPaWZk+jX+fSMNlFbhGy2QS2ZeScPT4DEfWcQNsu+yNp6Is0DTDaurO2UBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:58:10.222997Z"},"content_sha256":"70b2537a5076fb55722530fffc82f37599cc342af75404bd23cc8db79f49ebe1","schema_version":"1.0","event_id":"sha256:70b2537a5076fb55722530fffc82f37599cc342af75404bd23cc8db79f49ebe1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VA7AZLQ2263QWB55KLP4MDNNWX","target":"graph","payload":{"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"},"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-18T00:51:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oqZc1MCE8MLHnsLVk48wztIG/fNyhrNWW1foOF6LbWU/gIZV2lorxU+IjlhbVCDmWQWhmWjvcZ4He4WiFg6kDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:58:10.223682Z"},"content_sha256":"3425dc143fe7fd3f322431b51fec704cb6b6e4a735cddd44273d1e14f6845276","schema_version":"1.0","event_id":"sha256:3425dc143fe7fd3f322431b51fec704cb6b6e4a735cddd44273d1e14f6845276"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VA7AZLQ2263QWB55KLP4MDNNWX/bundle.json","state_url":"https://pith.science/pith/VA7AZLQ2263QWB55KLP4MDNNWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VA7AZLQ2263QWB55KLP4MDNNWX/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-07T04:58:10Z","links":{"resolver":"https://pith.science/pith/VA7AZLQ2263QWB55KLP4MDNNWX","bundle":"https://pith.science/pith/VA7AZLQ2263QWB55KLP4MDNNWX/bundle.json","state":"https://pith.science/pith/VA7AZLQ2263QWB55KLP4MDNNWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VA7AZLQ2263QWB55KLP4MDNNWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VA7AZLQ2263QWB55KLP4MDNNWX","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":"b418eae213d21451f5dea398226e19347280ca7eab84f62bb4fcd0a926eeb8c8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-01-25T18:22:47Z","title_canon_sha256":"b8e125fadcf83abcbf8c3a7731c6db7efd38a39e6a2cc3a6f88dceb21066badd"},"schema_version":"1.0","source":{"id":"1701.07416","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07416","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07416v2","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07416","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"VA7AZLQ2263Q","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VA7AZLQ2263QWB55","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VA7AZLQ2","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:3425dc143fe7fd3f322431b51fec704cb6b6e4a735cddd44273d1e14f6845276","target":"graph","created_at":"2026-05-18T00:51:06Z","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 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 ","authors_text":"Jean-Pierre Tillich, Thomas Debris-Alazard","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-01-25T18:22:47Z","title":"Statistical Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07416","kind":"arxiv","version":2},"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:70b2537a5076fb55722530fffc82f37599cc342af75404bd23cc8db79f49ebe1","target":"record","created_at":"2026-05-18T00:51:06Z","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":"b418eae213d21451f5dea398226e19347280ca7eab84f62bb4fcd0a926eeb8c8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-01-25T18:22:47Z","title_canon_sha256":"b8e125fadcf83abcbf8c3a7731c6db7efd38a39e6a2cc3a6f88dceb21066badd"},"schema_version":"1.0","source":{"id":"1701.07416","kind":"arxiv","version":2}},"canonical_sha256":"a83e0cae1ad7b70b07bd52dfc60dadb5ed27549716290758241c6fc5ce452925","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a83e0cae1ad7b70b07bd52dfc60dadb5ed27549716290758241c6fc5ce452925","first_computed_at":"2026-05-18T00:51:06.807499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:06.807499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UbMQ1BpV0AWy3yCozNZLlyokC8TlBQw9LddhH0Ah5GlYuCHweAP10LBdPD7UKWIkqojMBRMxQXRer6Pa4DS1DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:06.807896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07416","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70b2537a5076fb55722530fffc82f37599cc342af75404bd23cc8db79f49ebe1","sha256:3425dc143fe7fd3f322431b51fec704cb6b6e4a735cddd44273d1e14f6845276"],"state_sha256":"f4d8e2095f04996dbc839b0dddcb66fa1cf6a9e01208b5937ebc21d140cb5c77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIJI2mBdKHy0O5tE1f/DzDpMqSBHhziSQuN683unua1KFh0FqXCMvBEYDbG74UMcZ71NhYpSOMjwfFtYuce3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T04:58:10.226965Z","bundle_sha256":"0c77119158a19afc049d95f81adbc59bd792c6ecc3fe000efa3a75b1eb980ab7"}}