{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EDBQUH2IESACR5XHT4GC4PGF7H","short_pith_number":"pith:EDBQUH2I","schema_version":"1.0","canonical_sha256":"20c30a1f48248028f6e79f0c2e3cc5f9e03f40b6ad422a4618b50fe1dac06651","source":{"kind":"arxiv","id":"1311.4861","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.4861","created_at":"2026-05-18T03:06:43.332955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4861v1","created_at":"2026-05-18T03:06:43.332955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4861","created_at":"2026-05-18T03:06:43.332955+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDBQUH2IESAC","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDBQUH2IESACR5XH","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDBQUH2I","created_at":"2026-05-18T12:27:43.054852+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/EDBQUH2IESACR5XHT4GC4PGF7H","json":"https://pith.science/pith/EDBQUH2IESACR5XHT4GC4PGF7H.json","graph_json":"https://pith.science/api/pith-number/EDBQUH2IESACR5XHT4GC4PGF7H/graph.json","events_json":"https://pith.science/api/pith-number/EDBQUH2IESACR5XHT4GC4PGF7H/events.json","paper":"https://pith.science/paper/EDBQUH2I"},"agent_actions":{"view_html":"https://pith.science/pith/EDBQUH2IESACR5XHT4GC4PGF7H","download_json":"https://pith.science/pith/EDBQUH2IESACR5XHT4GC4PGF7H.json","view_paper":"https://pith.science/paper/EDBQUH2I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4861&json=true","fetch_graph":"https://pith.science/api/pith-number/EDBQUH2IESACR5XHT4GC4PGF7H/graph.json","fetch_events":"https://pith.science/api/pith-number/EDBQUH2IESACR5XHT4GC4PGF7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDBQUH2IESACR5XHT4GC4PGF7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDBQUH2IESACR5XHT4GC4PGF7H/action/storage_attestation","attest_author":"https://pith.science/pith/EDBQUH2IESACR5XHT4GC4PGF7H/action/author_attestation","sign_citation":"https://pith.science/pith/EDBQUH2IESACR5XHT4GC4PGF7H/action/citation_signature","submit_replication":"https://pith.science/pith/EDBQUH2IESACR5XHT4GC4PGF7H/action/replication_record"}},"created_at":"2026-05-18T03:06:43.332955+00:00","updated_at":"2026-05-18T03:06:43.332955+00:00"}