{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OYFHOLC7EK5IVIAYQRLRDNGDNR","short_pith_number":"pith:OYFHOLC7","canonical_record":{"source":{"id":"1801.04668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-15T05:41:21Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"ddce89c20d38f2d532c00f93617306a46ea5d863af341c41936fffde74aa8e4c","abstract_canon_sha256":"0f8e5767ade1f2a52e1e70fc64cbb755ebbea4c7a400b1d36fc91d0bbe481ae2"},"schema_version":"1.0"},"canonical_sha256":"760a772c5f22ba8aa018845711b4c36c46f169da0809987eb3da383e6020f01f","source":{"kind":"arxiv","id":"1801.04668","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04668","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04668v1","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04668","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"OYFHOLC7EK5I","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OYFHOLC7EK5IVIAY","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OYFHOLC7","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OYFHOLC7EK5IVIAYQRLRDNGDNR","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-15T05:41:21Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"ddce89c20d38f2d532c00f93617306a46ea5d863af341c41936fffde74aa8e4c","abstract_canon_sha256":"0f8e5767ade1f2a52e1e70fc64cbb755ebbea4c7a400b1d36fc91d0bbe481ae2"},"schema_version":"1.0"},"canonical_sha256":"760a772c5f22ba8aa018845711b4c36c46f169da0809987eb3da383e6020f01f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:03.677394Z","signature_b64":"P3LwNP17qE7Hm0oYQiTJfuRjZ6tyFleGNtV3/L6kpKDzhadoSQAgyn5/52jds3b7AUXkHRPB7FziP77lKxNECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"760a772c5f22ba8aa018845711b4c36c46f169da0809987eb3da383e6020f01f","last_reissued_at":"2026-05-18T00:26:03.676681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:03.676681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04668","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-18T00:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TwF6jZ1k7tj9wpdNSAPgDZwtGqpH9uVnPirE1F5CBejZhI4C111DyxMhydVdjjjqhunOUZ4KuTY67AgpWO3MAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:34:53.561630Z"},"content_sha256":"f6e4f066d59d1853ee7832710c74327a910d9876861676c2244b484788837261","schema_version":"1.0","event_id":"sha256:f6e4f066d59d1853ee7832710c74327a910d9876861676c2244b484788837261"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OYFHOLC7EK5IVIAYQRLRDNGDNR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The decoding failure probability of MDPC codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Jean-Pierre Tillich","submitted_at":"2018-01-15T05:41:21Z","abstract_excerpt":"Moderate Density Parity Check (MDPC) codes are defined here as codes which have a parity-check matrix whose row weight is $O(\\sqrt{n})$ where $n$ is the length $n$ of the code. They can be decoded like LDPC codes but they decode much less errors than LDPC codes: the number of errors they can decode in this case is of order $\\Theta(\\sqrt{n})$. Despite this fact they have been proved very useful in cryptography for devising key exchange mechanisms. They have also been proposed in McEliece type cryptosystems. However in this case, the parameters that have been proposed in \\cite{MTSB13} were broke"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04668","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-18T00:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E6TpjIM0vZSeHfA9r1SB86a2LYbGPpYrSDzHaWtwB6RBon5chUHFzS9vKUwwIKA4tvELnSUtejOl636tKUDaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T21:34:53.562188Z"},"content_sha256":"e1e22b149442625a819cfa46d5fa97f7e3b742b0c0aa60a36b188e5ab6601e95","schema_version":"1.0","event_id":"sha256:e1e22b149442625a819cfa46d5fa97f7e3b742b0c0aa60a36b188e5ab6601e95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYFHOLC7EK5IVIAYQRLRDNGDNR/bundle.json","state_url":"https://pith.science/pith/OYFHOLC7EK5IVIAYQRLRDNGDNR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYFHOLC7EK5IVIAYQRLRDNGDNR/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-07T21:34:53Z","links":{"resolver":"https://pith.science/pith/OYFHOLC7EK5IVIAYQRLRDNGDNR","bundle":"https://pith.science/pith/OYFHOLC7EK5IVIAYQRLRDNGDNR/bundle.json","state":"https://pith.science/pith/OYFHOLC7EK5IVIAYQRLRDNGDNR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYFHOLC7EK5IVIAYQRLRDNGDNR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OYFHOLC7EK5IVIAYQRLRDNGDNR","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":"0f8e5767ade1f2a52e1e70fc64cbb755ebbea4c7a400b1d36fc91d0bbe481ae2","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-15T05:41:21Z","title_canon_sha256":"ddce89c20d38f2d532c00f93617306a46ea5d863af341c41936fffde74aa8e4c"},"schema_version":"1.0","source":{"id":"1801.04668","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04668","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04668v1","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04668","created_at":"2026-05-18T00:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"OYFHOLC7EK5I","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OYFHOLC7EK5IVIAY","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OYFHOLC7","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:e1e22b149442625a819cfa46d5fa97f7e3b742b0c0aa60a36b188e5ab6601e95","target":"graph","created_at":"2026-05-18T00:26:03Z","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":"Moderate Density Parity Check (MDPC) codes are defined here as codes which have a parity-check matrix whose row weight is $O(\\sqrt{n})$ where $n$ is the length $n$ of the code. They can be decoded like LDPC codes but they decode much less errors than LDPC codes: the number of errors they can decode in this case is of order $\\Theta(\\sqrt{n})$. Despite this fact they have been proved very useful in cryptography for devising key exchange mechanisms. They have also been proposed in McEliece type cryptosystems. However in this case, the parameters that have been proposed in \\cite{MTSB13} were broke","authors_text":"Jean-Pierre Tillich","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-15T05:41:21Z","title":"The decoding failure probability of MDPC codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04668","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:f6e4f066d59d1853ee7832710c74327a910d9876861676c2244b484788837261","target":"record","created_at":"2026-05-18T00:26:03Z","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":"0f8e5767ade1f2a52e1e70fc64cbb755ebbea4c7a400b1d36fc91d0bbe481ae2","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-15T05:41:21Z","title_canon_sha256":"ddce89c20d38f2d532c00f93617306a46ea5d863af341c41936fffde74aa8e4c"},"schema_version":"1.0","source":{"id":"1801.04668","kind":"arxiv","version":1}},"canonical_sha256":"760a772c5f22ba8aa018845711b4c36c46f169da0809987eb3da383e6020f01f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"760a772c5f22ba8aa018845711b4c36c46f169da0809987eb3da383e6020f01f","first_computed_at":"2026-05-18T00:26:03.676681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:03.676681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P3LwNP17qE7Hm0oYQiTJfuRjZ6tyFleGNtV3/L6kpKDzhadoSQAgyn5/52jds3b7AUXkHRPB7FziP77lKxNECQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:03.677394Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04668","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6e4f066d59d1853ee7832710c74327a910d9876861676c2244b484788837261","sha256:e1e22b149442625a819cfa46d5fa97f7e3b742b0c0aa60a36b188e5ab6601e95"],"state_sha256":"58f3d090cfe6e00dc42d544026b8514ff5d73a37ae46889dec4c591ce717362f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W/7gFvOlXY+8SfPl35pIXbW/2ii8i4uTqffvR7Iuve+MBpmFam2+v2VOriT1lolM5F4DjlFeTnE6J0DmlE+TCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T21:34:53.565424Z","bundle_sha256":"c3231855c6bd0b08a32bbacb5fa891cdba73c162e823c8f6d45cc84779639c6f"}}