{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7PTEU25WFKCPCKUM3QNSPH4TDS","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":"43a67beb752388f621ab24f43f570d8101b8563b178c70b92a4cc970eb35d766","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-31T08:10:49Z","title_canon_sha256":"0b167e5de591e99a78f690dd5a404c67b15cd531b02068591ea9119a65446046"},"schema_version":"1.0","source":{"id":"1904.00357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.00357","created_at":"2026-05-17T23:49:48Z"},{"alias_kind":"arxiv_version","alias_value":"1904.00357v1","created_at":"2026-05-17T23:49:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.00357","created_at":"2026-05-17T23:49:48Z"},{"alias_kind":"pith_short_12","alias_value":"7PTEU25WFKCP","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7PTEU25WFKCPCKUM","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7PTEU25W","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:2e874215125d813bccba7cec67c5ef590cb4e348d9979c973edc6b58d346d3e1","target":"graph","created_at":"2026-05-17T23:49:48Z","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":"We introduce a new family of rank metric codes: Low Rank Parity Check codes (LRPC), for which we propose an efficient probabilistic decoding algorithm. This family of codes can be seen as the equivalent of classical LDPC codes for the rank metric. We then use these codes to design cryptosystems \\`a la McEliece: more precisely we propose two schemes for key encapsulation mechanism (KEM) and public key encryption (PKE). Unlike rank metric codes used in\n  previous encryption algorithms -notably Gabidulin codes - LRPC codes have a very weak algebraic structure. Our cryptosystems can be seen as an ","authors_text":"Adrien Hauteville, Gilles Z\\'emor, Nicolas Aragon, Olivier Ruatta, Philippe Gaborit","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-31T08:10:49Z","title":"Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.00357","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:a6f340accf56f80defd3eb9db68f9c4ea525acfd9c47b66651a13b13fd1839aa","target":"record","created_at":"2026-05-17T23:49:48Z","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":"43a67beb752388f621ab24f43f570d8101b8563b178c70b92a4cc970eb35d766","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-31T08:10:49Z","title_canon_sha256":"0b167e5de591e99a78f690dd5a404c67b15cd531b02068591ea9119a65446046"},"schema_version":"1.0","source":{"id":"1904.00357","kind":"arxiv","version":1}},"canonical_sha256":"fbe64a6bb62a84f12a8cdc1b279f931c9206d2e63b14caafc57719ab39d4bf52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbe64a6bb62a84f12a8cdc1b279f931c9206d2e63b14caafc57719ab39d4bf52","first_computed_at":"2026-05-17T23:49:48.617788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:48.617788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bixFcii7TtKHaY1dahGLEOedyaK7UymvvUsD/J77yDe7rdUQCeyfyu8oxN7MHWFsBjkgAscNyd9htpGSMwRABw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:48.618233Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.00357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6f340accf56f80defd3eb9db68f9c4ea525acfd9c47b66651a13b13fd1839aa","sha256:2e874215125d813bccba7cec67c5ef590cb4e348d9979c973edc6b58d346d3e1"],"state_sha256":"079d9747c8f2c8ee83e471159229e8d9e3d11693c2d351ac1702e10ec5cde64e"}