{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MGKB5UTGT3TO2SIULUEGGTAVRD","short_pith_number":"pith:MGKB5UTG","schema_version":"1.0","canonical_sha256":"61941ed2669ee6ed49145d08634c1588d4e6517f3e1cb0b1183691451825fadd","source":{"kind":"arxiv","id":"1304.2523","version":2},"attestation_state":"computed","paper":{"title":"Communication over Finite-Chain-Ring Matrix Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chen Feng, Danilo Silva, Frank R. Kschischang, Roberto W. N\\'obrega","submitted_at":"2013-04-09T10:46:45Z","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"},"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":"1304.2523","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-09T10:46:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"745768cef2948b1fea670581f36f4db86df699064ba79f0b6369a694cb2405a6","abstract_canon_sha256":"bb03202ac0573c940fbc7b491874fd22b7ac9e012b5027e8903c407cda04254c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:04.148146Z","signature_b64":"Q6Bs2TeSm1iWLowJgQqeKCAt/WUczSr8ExDS4glPeeJRCFNaBv34l3rmYCUAdWXGQA6KQphT6IMEAt2btJcVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61941ed2669ee6ed49145d08634c1588d4e6517f3e1cb0b1183691451825fadd","last_reissued_at":"2026-05-18T00:59:04.147656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:04.147656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication over Finite-Chain-Ring Matrix Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chen Feng, Danilo Silva, Frank R. Kschischang, Roberto W. N\\'obrega","submitted_at":"2013-04-09T10:46:45Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2523","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":""},"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":"1304.2523","created_at":"2026-05-18T00:59:04.147732+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2523v2","created_at":"2026-05-18T00:59:04.147732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2523","created_at":"2026-05-18T00:59:04.147732+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGKB5UTGT3TO","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGKB5UTGT3TO2SIU","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGKB5UTG","created_at":"2026-05-18T12:27:52.871228+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/MGKB5UTGT3TO2SIULUEGGTAVRD","json":"https://pith.science/pith/MGKB5UTGT3TO2SIULUEGGTAVRD.json","graph_json":"https://pith.science/api/pith-number/MGKB5UTGT3TO2SIULUEGGTAVRD/graph.json","events_json":"https://pith.science/api/pith-number/MGKB5UTGT3TO2SIULUEGGTAVRD/events.json","paper":"https://pith.science/paper/MGKB5UTG"},"agent_actions":{"view_html":"https://pith.science/pith/MGKB5UTGT3TO2SIULUEGGTAVRD","download_json":"https://pith.science/pith/MGKB5UTGT3TO2SIULUEGGTAVRD.json","view_paper":"https://pith.science/paper/MGKB5UTG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2523&json=true","fetch_graph":"https://pith.science/api/pith-number/MGKB5UTGT3TO2SIULUEGGTAVRD/graph.json","fetch_events":"https://pith.science/api/pith-number/MGKB5UTGT3TO2SIULUEGGTAVRD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGKB5UTGT3TO2SIULUEGGTAVRD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGKB5UTGT3TO2SIULUEGGTAVRD/action/storage_attestation","attest_author":"https://pith.science/pith/MGKB5UTGT3TO2SIULUEGGTAVRD/action/author_attestation","sign_citation":"https://pith.science/pith/MGKB5UTGT3TO2SIULUEGGTAVRD/action/citation_signature","submit_replication":"https://pith.science/pith/MGKB5UTGT3TO2SIULUEGGTAVRD/action/replication_record"}},"created_at":"2026-05-18T00:59:04.147732+00:00","updated_at":"2026-05-18T00:59:04.147732+00:00"}