{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:V2ESVP5VBHE6MBVYKIUE4KQXYF","short_pith_number":"pith:V2ESVP5V","canonical_record":{"source":{"id":"1608.06080","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-08-22T08:27:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d13a67822bcf967bc81926ee54412352d835c88f7441a785193ff6b79638af1d","abstract_canon_sha256":"fe45b65f0ecaf9be3f57950372bdacb46c0df4f88b977f8246cc42213239f924"},"schema_version":"1.0"},"canonical_sha256":"ae892abfb509c9e606b852284e2a17c176804196d395b10521e2a6306df2c86b","source":{"kind":"arxiv","id":"1608.06080","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06080","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06080v1","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06080","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"V2ESVP5VBHE6","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"V2ESVP5VBHE6MBVY","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"V2ESVP5V","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:V2ESVP5VBHE6MBVYKIUE4KQXYF","target":"record","payload":{"canonical_record":{"source":{"id":"1608.06080","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-08-22T08:27:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d13a67822bcf967bc81926ee54412352d835c88f7441a785193ff6b79638af1d","abstract_canon_sha256":"fe45b65f0ecaf9be3f57950372bdacb46c0df4f88b977f8246cc42213239f924"},"schema_version":"1.0"},"canonical_sha256":"ae892abfb509c9e606b852284e2a17c176804196d395b10521e2a6306df2c86b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:22.356536Z","signature_b64":"/3tIi0opNhtW1iMw5pAa6ibxlnV0RKYHUPZt9Zy0TZqJTpZp0Td9q/2axnrV7uBNdzCLr3/ZC4OyO4WGXy3dDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae892abfb509c9e606b852284e2a17c176804196d395b10521e2a6306df2c86b","last_reissued_at":"2026-05-18T01:08:22.355993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:22.355993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.06080","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:08:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jRGHMuelJXvyLuMTXXon0uOCcTCf1dS78nHhSUjHpDd0jwfKbt49eWZU55jr986VDhx3dz2BkZgdrcZtaBSyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:57:07.285045Z"},"content_sha256":"63a97e2c08e7a6d1d8a37c1eda8f4021472fe3ac87ecc5adaee0e05bb0a8eb72","schema_version":"1.0","event_id":"sha256:63a97e2c08e7a6d1d8a37c1eda8f4021472fe3ac87ecc5adaee0e05bb0a8eb72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:V2ESVP5VBHE6MBVYKIUE4KQXYF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Worst case QC-MDPC decoder for McEliece cryptosystem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Julia Chaulet, Nicolas Sendrier","submitted_at":"2016-08-22T08:27:32Z","abstract_excerpt":"McEliece encryption scheme which enjoys relatively small key sizes as well as a security reduction to hard problems of coding theory. Furthermore, it remains secure against a quantum adversary and is very well suited to low cost implementations on embedded devices.\n  Decoding MDPC codes is achieved with the (iterative) bit flipping algorithm, as for LDPC codes. Variable time decoders might leak some information on the code structure (that is on the sparse parity check equations) and must be avoided. A constant time decoder is easy to emulate, but its running time depends on the worst case rath"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06080","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:08:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zSgCX2JuZ7fr3K8yXk5B0hyk4Yzj435mMsxYEbRPSZjHlrg6C6MO5DU00bSzhLJxP9+vzJO1nY8Wn/eZ4IX0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:57:07.285453Z"},"content_sha256":"bb0a2b048f8bb177bcb2efc032d36ef2e1252b6995f84917ac7f157033c22fe7","schema_version":"1.0","event_id":"sha256:bb0a2b048f8bb177bcb2efc032d36ef2e1252b6995f84917ac7f157033c22fe7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2ESVP5VBHE6MBVYKIUE4KQXYF/bundle.json","state_url":"https://pith.science/pith/V2ESVP5VBHE6MBVYKIUE4KQXYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2ESVP5VBHE6MBVYKIUE4KQXYF/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:57:07Z","links":{"resolver":"https://pith.science/pith/V2ESVP5VBHE6MBVYKIUE4KQXYF","bundle":"https://pith.science/pith/V2ESVP5VBHE6MBVYKIUE4KQXYF/bundle.json","state":"https://pith.science/pith/V2ESVP5VBHE6MBVYKIUE4KQXYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2ESVP5VBHE6MBVYKIUE4KQXYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:V2ESVP5VBHE6MBVYKIUE4KQXYF","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":"fe45b65f0ecaf9be3f57950372bdacb46c0df4f88b977f8246cc42213239f924","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-08-22T08:27:32Z","title_canon_sha256":"d13a67822bcf967bc81926ee54412352d835c88f7441a785193ff6b79638af1d"},"schema_version":"1.0","source":{"id":"1608.06080","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06080","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06080v1","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06080","created_at":"2026-05-18T01:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"V2ESVP5VBHE6","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"V2ESVP5VBHE6MBVY","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"V2ESVP5V","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:bb0a2b048f8bb177bcb2efc032d36ef2e1252b6995f84917ac7f157033c22fe7","target":"graph","created_at":"2026-05-18T01:08:22Z","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":"McEliece encryption scheme which enjoys relatively small key sizes as well as a security reduction to hard problems of coding theory. Furthermore, it remains secure against a quantum adversary and is very well suited to low cost implementations on embedded devices.\n  Decoding MDPC codes is achieved with the (iterative) bit flipping algorithm, as for LDPC codes. Variable time decoders might leak some information on the code structure (that is on the sparse parity check equations) and must be avoided. A constant time decoder is easy to emulate, but its running time depends on the worst case rath","authors_text":"Julia Chaulet, Nicolas Sendrier","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-08-22T08:27:32Z","title":"Worst case QC-MDPC decoder for McEliece cryptosystem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06080","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:63a97e2c08e7a6d1d8a37c1eda8f4021472fe3ac87ecc5adaee0e05bb0a8eb72","target":"record","created_at":"2026-05-18T01:08:22Z","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":"fe45b65f0ecaf9be3f57950372bdacb46c0df4f88b977f8246cc42213239f924","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-08-22T08:27:32Z","title_canon_sha256":"d13a67822bcf967bc81926ee54412352d835c88f7441a785193ff6b79638af1d"},"schema_version":"1.0","source":{"id":"1608.06080","kind":"arxiv","version":1}},"canonical_sha256":"ae892abfb509c9e606b852284e2a17c176804196d395b10521e2a6306df2c86b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae892abfb509c9e606b852284e2a17c176804196d395b10521e2a6306df2c86b","first_computed_at":"2026-05-18T01:08:22.355993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:22.355993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/3tIi0opNhtW1iMw5pAa6ibxlnV0RKYHUPZt9Zy0TZqJTpZp0Td9q/2axnrV7uBNdzCLr3/ZC4OyO4WGXy3dDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:22.356536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06080","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63a97e2c08e7a6d1d8a37c1eda8f4021472fe3ac87ecc5adaee0e05bb0a8eb72","sha256:bb0a2b048f8bb177bcb2efc032d36ef2e1252b6995f84917ac7f157033c22fe7"],"state_sha256":"8e8e5867babbdb77d9d99f0162d3be29aa278e35856cd4adf6059db1e6236cd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+jOUdj0GTgcqWStd6bg8gFPlejEssAakf6Vfar/l/P5yE5uG8mv2Y6qzbb97M32nXjDpa0ydj3F7LSuoGhIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T04:57:07.287906Z","bundle_sha256":"8d5a46359ead4118452e1b7a235ad4fa62d930677182fc1e026b4220d0fcc334"}}