{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EDBQUH2IESACR5XHT4GC4PGF7H","short_pith_number":"pith:EDBQUH2I","canonical_record":{"source":{"id":"1311.4861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-19T20:17:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b2a7c98509e7320094bf95bb3857273403dd2e2b43bf8d4c84ed836239fefe0b","abstract_canon_sha256":"400c42bd5b794b1012369e03c83847f308edf75cd9486b545ef2db3e518d3701"},"schema_version":"1.0"},"canonical_sha256":"20c30a1f48248028f6e79f0c2e3cc5f9e03f40b6ad422a4618b50fe1dac06651","source":{"kind":"arxiv","id":"1311.4861","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4861","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4861v1","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4861","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"pith_short_12","alias_value":"EDBQUH2IESAC","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EDBQUH2IESACR5XH","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EDBQUH2I","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EDBQUH2IESACR5XHT4GC4PGF7H","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-19T20:17:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b2a7c98509e7320094bf95bb3857273403dd2e2b43bf8d4c84ed836239fefe0b","abstract_canon_sha256":"400c42bd5b794b1012369e03c83847f308edf75cd9486b545ef2db3e518d3701"},"schema_version":"1.0"},"canonical_sha256":"20c30a1f48248028f6e79f0c2e3cc5f9e03f40b6ad422a4618b50fe1dac06651","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:43.333495Z","signature_b64":"KXEukgIpUO6CrqG0ULC4k2vwkGXiC07gU4hcl3ALgjJ5nBJZV6nKB7POUfDjnB763nPrcALBwHNxSOrUi8ONBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20c30a1f48248028f6e79f0c2e3cc5f9e03f40b6ad422a4618b50fe1dac06651","last_reissued_at":"2026-05-18T03:06:43.332878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:43.332878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4861","source_version":1,"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-18T03:06:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xQV5YbrWlw/6WFrLZzLNu+5/fKSmYEXNbZNLlURSZZV/F8eZB2TZghqa+zYM5xepL3uWLx74sas+jvCstvoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:49:09.232460Z"},"content_sha256":"6693ad049707080844e48cc4a673f0943d27e512ce7b5517e8a54730dee9509f","schema_version":"1.0","event_id":"sha256:6693ad049707080844e48cc4a673f0943d27e512ce7b5517e8a54730dee9509f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EDBQUH2IESACR5XHT4GC4PGF7H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Multiplicative Matrix Channels over Finite Chain Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bartolomeu F. Uch\\^oa-Filho, Chen Feng, Danilo Silva, Roberto W. N\\'obrega","submitted_at":"2013-11-19T20:17:19Z","abstract_excerpt":"Motivated by physical-layer network coding, this paper considers communication in multiplicative matrix channels over finite chain rings. Such channels are defined by the law $Y =A X$, where $X$ and $Y$ are the input and output matrices, respectively, and $A$ is called the transfer matrix. It is assumed a coherent scenario in which the instances of the transfer matrix are unknown to the transmitter, but available to the receiver. It is also assumed that $A$ and $X$ are independent. Besides that, no restrictions on the statistics of $A$ are imposed. As contributions, a closed-form expression fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4861","kind":"arxiv","version":1},"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-18T03:06:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"psBHAmNwCTtv/+6TZV2mtkeED9TRthoRCswYgodF2jEtNklFp2AKcuMa2jFq9vvuzLgOWZffPo/vcuBvbfOoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:49:09.233017Z"},"content_sha256":"63e68ad7657908081944b13640a871e5c551665716f26d2eba2e4b50821b4cb4","schema_version":"1.0","event_id":"sha256:63e68ad7657908081944b13640a871e5c551665716f26d2eba2e4b50821b4cb4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EDBQUH2IESACR5XHT4GC4PGF7H/bundle.json","state_url":"https://pith.science/pith/EDBQUH2IESACR5XHT4GC4PGF7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EDBQUH2IESACR5XHT4GC4PGF7H/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-23T04:49:09Z","links":{"resolver":"https://pith.science/pith/EDBQUH2IESACR5XHT4GC4PGF7H","bundle":"https://pith.science/pith/EDBQUH2IESACR5XHT4GC4PGF7H/bundle.json","state":"https://pith.science/pith/EDBQUH2IESACR5XHT4GC4PGF7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EDBQUH2IESACR5XHT4GC4PGF7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EDBQUH2IESACR5XHT4GC4PGF7H","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":"400c42bd5b794b1012369e03c83847f308edf75cd9486b545ef2db3e518d3701","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-19T20:17:19Z","title_canon_sha256":"b2a7c98509e7320094bf95bb3857273403dd2e2b43bf8d4c84ed836239fefe0b"},"schema_version":"1.0","source":{"id":"1311.4861","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4861","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4861v1","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4861","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"pith_short_12","alias_value":"EDBQUH2IESAC","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EDBQUH2IESACR5XH","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EDBQUH2I","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:63e68ad7657908081944b13640a871e5c551665716f26d2eba2e4b50821b4cb4","target":"graph","created_at":"2026-05-18T03:06:43Z","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":"Motivated by physical-layer network coding, this paper considers communication in multiplicative matrix channels over finite chain rings. Such channels are defined by the law $Y =A X$, where $X$ and $Y$ are the input and output matrices, respectively, and $A$ is called the transfer matrix. It is assumed a coherent scenario in which the instances of the transfer matrix are unknown to the transmitter, but available to the receiver. It is also assumed that $A$ and $X$ are independent. Besides that, no restrictions on the statistics of $A$ are imposed. As contributions, a closed-form expression fo","authors_text":"Bartolomeu F. Uch\\^oa-Filho, Chen Feng, Danilo Silva, 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-11-19T20:17:19Z","title":"On Multiplicative Matrix Channels over Finite Chain Rings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4861","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:6693ad049707080844e48cc4a673f0943d27e512ce7b5517e8a54730dee9509f","target":"record","created_at":"2026-05-18T03:06:43Z","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":"400c42bd5b794b1012369e03c83847f308edf75cd9486b545ef2db3e518d3701","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-19T20:17:19Z","title_canon_sha256":"b2a7c98509e7320094bf95bb3857273403dd2e2b43bf8d4c84ed836239fefe0b"},"schema_version":"1.0","source":{"id":"1311.4861","kind":"arxiv","version":1}},"canonical_sha256":"20c30a1f48248028f6e79f0c2e3cc5f9e03f40b6ad422a4618b50fe1dac06651","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20c30a1f48248028f6e79f0c2e3cc5f9e03f40b6ad422a4618b50fe1dac06651","first_computed_at":"2026-05-18T03:06:43.332878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:43.332878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KXEukgIpUO6CrqG0ULC4k2vwkGXiC07gU4hcl3ALgjJ5nBJZV6nKB7POUfDjnB763nPrcALBwHNxSOrUi8ONBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:43.333495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4861","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6693ad049707080844e48cc4a673f0943d27e512ce7b5517e8a54730dee9509f","sha256:63e68ad7657908081944b13640a871e5c551665716f26d2eba2e4b50821b4cb4"],"state_sha256":"30d891507feeef4f412448a27af1079e09787689b2efe25c584090c8e4d005c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ib6gxj5jdSjjyqeootR6F5nis8np7qYcycRNdGUMo5xC0VM77mP6CW9YXwbYNTec+HZ28P948Lu/vk2LxC6aCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:49:09.235721Z","bundle_sha256":"28c5b828c233083295304d55b6266d530909122623cd98a9a4da4611e0245ea8"}}