{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HT7M7FX6KJFEEVMSC7Q5M7W6I2","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":"591d6b4c816528c6d138be9bfc052b8f463ca04f837926ed42e28e7764771a9a","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T11:11:32Z","title_canon_sha256":"69ba4735ac46a1bbeb97a9d69fcd63ad0b7f694d1cec45bb3da0b60110675b38"},"schema_version":"1.0","source":{"id":"1801.07484","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07484","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07484v1","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07484","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"pith_short_12","alias_value":"HT7M7FX6KJFE","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HT7M7FX6KJFEEVMS","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HT7M7FX6","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:d476743e197ea13478dd02f35858292c675f4a8ce402e6e6fb007031e3413b54","target":"graph","created_at":"2026-05-18T00:25:12Z","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":"In this paper, ensembles of quasi-cyclic moderate-density parity-check (MDPC) codes based on protographs are introduced and analyzed in the context of a McEliece-like cryptosystem. The proposed ensembles significantly improve the error correction capability of the regular MDPC code ensembles that are currently considered for post-quantum cryptosystems without increasing the public key size. The proposed ensembles are analyzed in the asymptotic setting via density evolution, both under the sum-product algorithm and a low-complexity (error-and-erasure) message passing algorithm. The asymptotic a","authors_text":"Gianluigi Liva, Hannes Bartz","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T11:11:32Z","title":"Protograph-based Quasi-Cyclic MDPC Codes for McEliece Cryptosystems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07484","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:fbb3289fd1aa48686562f9533cd5ebbcb8e0d9a318a7d282914ecd61264f4415","target":"record","created_at":"2026-05-18T00:25:12Z","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":"591d6b4c816528c6d138be9bfc052b8f463ca04f837926ed42e28e7764771a9a","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T11:11:32Z","title_canon_sha256":"69ba4735ac46a1bbeb97a9d69fcd63ad0b7f694d1cec45bb3da0b60110675b38"},"schema_version":"1.0","source":{"id":"1801.07484","kind":"arxiv","version":1}},"canonical_sha256":"3cfecf96fe524a42559217e1d67ede46b124d21312c60f7ce6b0b77e79d48dba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cfecf96fe524a42559217e1d67ede46b124d21312c60f7ce6b0b77e79d48dba","first_computed_at":"2026-05-18T00:25:12.730651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:12.730651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t/s5BsUIpW+rLBvvzmu3MOfb65xKcat9VQSIYVIMlYJar4j9s4q5fH9ixFX7ik9kYayPZyxDG3gaGgj9QzSQDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:12.731212Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07484","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbb3289fd1aa48686562f9533cd5ebbcb8e0d9a318a7d282914ecd61264f4415","sha256:d476743e197ea13478dd02f35858292c675f4a8ce402e6e6fb007031e3413b54"],"state_sha256":"f2192a2ea81f85073a81986b85c0c1ed33e1c9440dd90b6e31be8c627c2fc3df"}