{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:S2QKBHDG7YZIML4JKAL6J4FPWP","short_pith_number":"pith:S2QKBHDG","schema_version":"1.0","canonical_sha256":"96a0a09c66fe32862f895017e4f0afb3c10cc33cfec769ee0d9e8edefc119395","source":{"kind":"arxiv","id":"2001.04800","version":2},"attestation_state":"computed","paper":{"title":"Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia Wachter-Zeh, Camilla Hollanti, Julian Renner, Ragnar Freij-Hollanti, Sven Puchinger","submitted_at":"2020-01-14T14:24:23Z","abstract_excerpt":"We define and analyze low-rank parity-check (LRPC) codes over extension rings of the finite chain ring $\\mathbb{Z}_{p^r}$, where $p$ is a prime and $r$ is a positive integer. LRPC codes have originally been proposed by Gaborit et al.(2013) over finite fields for cryptographic applications. The adaption to finite rings is inspired by a recent paper by Kamche et al. (2019), which constructed Gabidulin codes over finite principle ideal rings with applications to space-time codes and network coding. We give a decoding algorithm based on simple linear-algebraic operations. Further, we derive an upp"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2001.04800","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-01-14T14:24:23Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"e8b28339ddd06a61b4c8e4c8bcd1d13e5bd367bafc2e083210caf321a6f33c9e","abstract_canon_sha256":"72100943ce3fe3951afab46e21fbc3f8dbcfd7a8a63e004116770e3a75605b0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:02:58.093808Z","signature_b64":"0crR0jDdUDArwqr4xMQMPVxdGCzZR2O5KSxpLvSvoa2t7MsonfHxVGspV6ma229D56P4otDqaVJQOnN8oATgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96a0a09c66fe32862f895017e4f0afb3c10cc33cfec769ee0d9e8edefc119395","last_reissued_at":"2026-07-05T01:02:58.093441Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:02:58.093441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia Wachter-Zeh, Camilla Hollanti, Julian Renner, Ragnar Freij-Hollanti, Sven Puchinger","submitted_at":"2020-01-14T14:24:23Z","abstract_excerpt":"We define and analyze low-rank parity-check (LRPC) codes over extension rings of the finite chain ring $\\mathbb{Z}_{p^r}$, where $p$ is a prime and $r$ is a positive integer. LRPC codes have originally been proposed by Gaborit et al.(2013) over finite fields for cryptographic applications. The adaption to finite rings is inspired by a recent paper by Kamche et al. (2019), which constructed Gabidulin codes over finite principle ideal rings with applications to space-time codes and network coding. We give a decoding algorithm based on simple linear-algebraic operations. Further, we derive an upp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.04800","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.04800/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2001.04800","created_at":"2026-07-05T01:02:58.093496+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.04800v2","created_at":"2026-07-05T01:02:58.093496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.04800","created_at":"2026-07-05T01:02:58.093496+00:00"},{"alias_kind":"pith_short_12","alias_value":"S2QKBHDG7YZI","created_at":"2026-07-05T01:02:58.093496+00:00"},{"alias_kind":"pith_short_16","alias_value":"S2QKBHDG7YZIML4J","created_at":"2026-07-05T01:02:58.093496+00:00"},{"alias_kind":"pith_short_8","alias_value":"S2QKBHDG","created_at":"2026-07-05T01:02:58.093496+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S2QKBHDG7YZIML4JKAL6J4FPWP","json":"https://pith.science/pith/S2QKBHDG7YZIML4JKAL6J4FPWP.json","graph_json":"https://pith.science/api/pith-number/S2QKBHDG7YZIML4JKAL6J4FPWP/graph.json","events_json":"https://pith.science/api/pith-number/S2QKBHDG7YZIML4JKAL6J4FPWP/events.json","paper":"https://pith.science/paper/S2QKBHDG"},"agent_actions":{"view_html":"https://pith.science/pith/S2QKBHDG7YZIML4JKAL6J4FPWP","download_json":"https://pith.science/pith/S2QKBHDG7YZIML4JKAL6J4FPWP.json","view_paper":"https://pith.science/paper/S2QKBHDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.04800&json=true","fetch_graph":"https://pith.science/api/pith-number/S2QKBHDG7YZIML4JKAL6J4FPWP/graph.json","fetch_events":"https://pith.science/api/pith-number/S2QKBHDG7YZIML4JKAL6J4FPWP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S2QKBHDG7YZIML4JKAL6J4FPWP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S2QKBHDG7YZIML4JKAL6J4FPWP/action/storage_attestation","attest_author":"https://pith.science/pith/S2QKBHDG7YZIML4JKAL6J4FPWP/action/author_attestation","sign_citation":"https://pith.science/pith/S2QKBHDG7YZIML4JKAL6J4FPWP/action/citation_signature","submit_replication":"https://pith.science/pith/S2QKBHDG7YZIML4JKAL6J4FPWP/action/replication_record"}},"created_at":"2026-07-05T01:02:58.093496+00:00","updated_at":"2026-07-05T01:02:58.093496+00:00"}