{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:R7553YIFWDDHASZJW6YJFUPPO3","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":"4e8cb39a6807fea0ac184124a2b8dcf96dc9425e23b372a18a61dc9f30e6a13f","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-26T15:14:56Z","title_canon_sha256":"2fdfb96ed029d65a0a08e7b5539dcf9a833b41c87d32c661aa9b8b5abc21f8c6"},"schema_version":"1.0","source":{"id":"1511.08413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08413","created_at":"2026-05-18T01:25:54Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08413v1","created_at":"2026-05-18T01:25:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08413","created_at":"2026-05-18T01:25:54Z"},{"alias_kind":"pith_short_12","alias_value":"R7553YIFWDDH","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R7553YIFWDDHASZJ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R7553YIF","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:c5b7325d46fdea91aca4f0595bd067c346a1f58a8ac9dbe8ec751ec47406bb92","target":"graph","created_at":"2026-05-18T01:25:54Z","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 public-key cryptosystems is mostly based on number theoretic problems like factorization and the discrete logarithm. There exists an algorithm which solves these problems in polynomial time using a quantum computer. Hence, these cryptosystems will be broken as soon as quantum computers emerge. Code-based cryptography is an alternative which resists quantum computers since its security is based on an NP-complete problem, namely decoding of random linear codes. The McEliece cryptosystem is the most prominent scheme to realize code-based cryptography. Many codeclasses were propose","authors_text":"Karim Ishak, Martin Bossert, Sven M\\\"uelich, Sven Puchinger","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-26T15:14:56Z","title":"Code-Based Cryptosystems Using Generalized Concatenated Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08413","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:42ddbfed72ebb5ce56441a7edd668c9aa2cccfc2e28f3219d1d6f3bfe62c45ef","target":"record","created_at":"2026-05-18T01:25:54Z","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":"4e8cb39a6807fea0ac184124a2b8dcf96dc9425e23b372a18a61dc9f30e6a13f","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-26T15:14:56Z","title_canon_sha256":"2fdfb96ed029d65a0a08e7b5539dcf9a833b41c87d32c661aa9b8b5abc21f8c6"},"schema_version":"1.0","source":{"id":"1511.08413","kind":"arxiv","version":1}},"canonical_sha256":"8ffbdde105b0c6704b29b7b092d1ef76de2e2e6ca0aa67d4d3b4ab2f7ec58440","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ffbdde105b0c6704b29b7b092d1ef76de2e2e6ca0aa67d4d3b4ab2f7ec58440","first_computed_at":"2026-05-18T01:25:54.128737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:54.128737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q6U+++AT9Bh4z45+3UbtJvfgBvPCzl0XPl8afwuI5nrgDc3VSUtmeiJBKJpz00bEbR9YpNdO9iuNzoOpvoWuBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:54.129443Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42ddbfed72ebb5ce56441a7edd668c9aa2cccfc2e28f3219d1d6f3bfe62c45ef","sha256:c5b7325d46fdea91aca4f0595bd067c346a1f58a8ac9dbe8ec751ec47406bb92"],"state_sha256":"5d436e91e84dfba679164fcec92bad52f93330b6bbe9394e7f87e594c7fc294d"}