{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MGKB5UTGT3TO2SIULUEGGTAVRD","short_pith_number":"pith:MGKB5UTG","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"},"canonical_sha256":"61941ed2669ee6ed49145d08634c1588d4e6517f3e1cb0b1183691451825fadd","source":{"kind":"arxiv","id":"1304.2523","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MGKB5UTGT3TO2SIULUEGGTAVRD","target":"record","payload":{"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"},"canonical_sha256":"61941ed2669ee6ed49145d08634c1588d4e6517f3e1cb0b1183691451825fadd","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"},"source_kind":"arxiv","source_id":"1304.2523","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhBI9FI+vXfvXSLMlgFsWzJ2s2PpaJVOz7+Y+nPhB8W+I2oiNBfvFiiqv+2prsCvjkP85xID2Xii7UIiezzBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:24:54.993861Z"},"content_sha256":"5685a5ec8209dcbe6bb49b0ff686b3e473ea329dedbbb3c66dd2ad697162ca60","schema_version":"1.0","event_id":"sha256:5685a5ec8209dcbe6bb49b0ff686b3e473ea329dedbbb3c66dd2ad697162ca60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MGKB5UTGT3TO2SIULUEGGTAVRD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CopwzbwtNLClq4a24jsqnKIzWB1umJE2ejWsboGyaw8wcVuejCld9cmzw/QSzHhaWMAGjbkGIxrMLbk8+crFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:24:54.994201Z"},"content_sha256":"e13d2f6ca85f87c0c11dcdee459da16a67dbca39295e100de8b71a42266b080d","schema_version":"1.0","event_id":"sha256:e13d2f6ca85f87c0c11dcdee459da16a67dbca39295e100de8b71a42266b080d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGKB5UTGT3TO2SIULUEGGTAVRD/bundle.json","state_url":"https://pith.science/pith/MGKB5UTGT3TO2SIULUEGGTAVRD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGKB5UTGT3TO2SIULUEGGTAVRD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T05:24:54Z","links":{"resolver":"https://pith.science/pith/MGKB5UTGT3TO2SIULUEGGTAVRD","bundle":"https://pith.science/pith/MGKB5UTGT3TO2SIULUEGGTAVRD/bundle.json","state":"https://pith.science/pith/MGKB5UTGT3TO2SIULUEGGTAVRD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGKB5UTGT3TO2SIULUEGGTAVRD/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hk4dR3OGGanT1GCVY+/LH8u+FXHMN90ekMCl8L8wxpD9bDdbVIzahQFoZsILj06l9A+T/xXdsHjiUy2xAbJvCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T05:24:54.996134Z","bundle_sha256":"6c7d620229450014b20dc0ac85ebbe0e64320e1b4f656a1f8c23c250f44c416f"}}