{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MGKB5UTGT3TO2SIULUEGGTAVRD","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":"bb03202ac0573c940fbc7b491874fd22b7ac9e012b5027e8903c407cda04254c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-09T10:46:45Z","title_canon_sha256":"745768cef2948b1fea670581f36f4db86df699064ba79f0b6369a694cb2405a6"},"schema_version":"1.0","source":{"id":"1304.2523","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2523","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2523v2","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2523","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"MGKB5UTGT3TO","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MGKB5UTGT3TO2SIU","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MGKB5UTG","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:e13d2f6ca85f87c0c11dcdee459da16a67dbca39295e100de8b71a42266b080d","target":"graph","created_at":"2026-05-18T00:59:04Z","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":"Though network coding is traditionally performed over finite fields, recent work on nested-lattice-based network coding suggests that, by allowing network coding over certain finite rings, more efficient physical-layer network coding schemes can be constructed. This paper considers the problem of communication over a finite-ring matrix channel $Y = AX + BE$, where $X$ is the channel input, $Y$ is the channel output, $E$ is random error, and $A$ and $B$ are random transfer matrices. Tight capacity results are obtained and simple polynomial-complexity capacity-achieving coding schemes are provid","authors_text":"Chen Feng, Danilo Silva, Frank R. Kschischang, Roberto W. N\\'obrega","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-09T10:46:45Z","title":"Communication over Finite-Chain-Ring Matrix Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2523","kind":"arxiv","version":2},"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:5685a5ec8209dcbe6bb49b0ff686b3e473ea329dedbbb3c66dd2ad697162ca60","target":"record","created_at":"2026-05-18T00:59:04Z","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":"bb03202ac0573c940fbc7b491874fd22b7ac9e012b5027e8903c407cda04254c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-09T10:46:45Z","title_canon_sha256":"745768cef2948b1fea670581f36f4db86df699064ba79f0b6369a694cb2405a6"},"schema_version":"1.0","source":{"id":"1304.2523","kind":"arxiv","version":2}},"canonical_sha256":"61941ed2669ee6ed49145d08634c1588d4e6517f3e1cb0b1183691451825fadd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61941ed2669ee6ed49145d08634c1588d4e6517f3e1cb0b1183691451825fadd","first_computed_at":"2026-05-18T00:59:04.147656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:04.147656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q6Bs2TeSm1iWLowJgQqeKCAt/WUczSr8ExDS4glPeeJRCFNaBv34l3rmYCUAdWXGQA6KQphT6IMEAt2btJcVAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:04.148146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.2523","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5685a5ec8209dcbe6bb49b0ff686b3e473ea329dedbbb3c66dd2ad697162ca60","sha256:e13d2f6ca85f87c0c11dcdee459da16a67dbca39295e100de8b71a42266b080d"],"state_sha256":"2f922c1cf7f23a5005fe28e06f8b950577215972d4f6488a93de47bcf31971e8"}