{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OLB5PCQN72EWBH3H2GCQMGF6ND","short_pith_number":"pith:OLB5PCQN","schema_version":"1.0","canonical_sha256":"72c3d78a0dfe89609f67d1850618be68f2e6aa09831aaf35111f85d183e7d002","source":{"kind":"arxiv","id":"1404.4761","version":2},"attestation_state":"computed","paper":{"title":"Using Network Coding to Achieve the Capacity of Deterministic Relay Networks with Relay Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed A. Zewail, Hesham El Gamal, Mohammed Nafie, Yahya Mohasseb","submitted_at":"2014-04-18T12:31:25Z","abstract_excerpt":"In this paper, we derive the capacity of the deterministic relay networks with relay messages. We consider a network which consists of five nodes, four of which can only communicate via the fifth one. However, the fifth node is not merely a relay as it may exchange private messages with the other network nodes. First, we develop an upper bound on the capacity region based on the notion of a single sided genie. In the course of the achievability proof, we also derive the deterministic capacity of a 4-user relay network (without private messages at the relay). The capacity achieving schemes use "},"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":"1404.4761","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-18T12:31:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4b83e697376bc996291c1187d414e96e900b1f787706a2cc1b22eccc63bb88c0","abstract_canon_sha256":"0ed0357a9f9345fa02c22338b3cf3fbbeba40a977522c5b858105b256884ad04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:03.111306Z","signature_b64":"PwMeLoi4wGFvsMgDIwS6y0U2C7p0yuBlHKANmcxu/fn3goAbdAhMgWs4xveMK39ZytAghTOx7K3IqInqcIqLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72c3d78a0dfe89609f67d1850618be68f2e6aa09831aaf35111f85d183e7d002","last_reissued_at":"2026-05-18T00:59:03.110711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:03.110711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Network Coding to Achieve the Capacity of Deterministic Relay Networks with Relay Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed A. Zewail, Hesham El Gamal, Mohammed Nafie, Yahya Mohasseb","submitted_at":"2014-04-18T12:31:25Z","abstract_excerpt":"In this paper, we derive the capacity of the deterministic relay networks with relay messages. We consider a network which consists of five nodes, four of which can only communicate via the fifth one. However, the fifth node is not merely a relay as it may exchange private messages with the other network nodes. First, we develop an upper bound on the capacity region based on the notion of a single sided genie. In the course of the achievability proof, we also derive the deterministic capacity of a 4-user relay network (without private messages at the relay). The capacity achieving schemes use "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4761","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":"1404.4761","created_at":"2026-05-18T00:59:03.110799+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4761v2","created_at":"2026-05-18T00:59:03.110799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4761","created_at":"2026-05-18T00:59:03.110799+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLB5PCQN72EW","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLB5PCQN72EWBH3H","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLB5PCQN","created_at":"2026-05-18T12:28:41.024544+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/OLB5PCQN72EWBH3H2GCQMGF6ND","json":"https://pith.science/pith/OLB5PCQN72EWBH3H2GCQMGF6ND.json","graph_json":"https://pith.science/api/pith-number/OLB5PCQN72EWBH3H2GCQMGF6ND/graph.json","events_json":"https://pith.science/api/pith-number/OLB5PCQN72EWBH3H2GCQMGF6ND/events.json","paper":"https://pith.science/paper/OLB5PCQN"},"agent_actions":{"view_html":"https://pith.science/pith/OLB5PCQN72EWBH3H2GCQMGF6ND","download_json":"https://pith.science/pith/OLB5PCQN72EWBH3H2GCQMGF6ND.json","view_paper":"https://pith.science/paper/OLB5PCQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4761&json=true","fetch_graph":"https://pith.science/api/pith-number/OLB5PCQN72EWBH3H2GCQMGF6ND/graph.json","fetch_events":"https://pith.science/api/pith-number/OLB5PCQN72EWBH3H2GCQMGF6ND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLB5PCQN72EWBH3H2GCQMGF6ND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLB5PCQN72EWBH3H2GCQMGF6ND/action/storage_attestation","attest_author":"https://pith.science/pith/OLB5PCQN72EWBH3H2GCQMGF6ND/action/author_attestation","sign_citation":"https://pith.science/pith/OLB5PCQN72EWBH3H2GCQMGF6ND/action/citation_signature","submit_replication":"https://pith.science/pith/OLB5PCQN72EWBH3H2GCQMGF6ND/action/replication_record"}},"created_at":"2026-05-18T00:59:03.110799+00:00","updated_at":"2026-05-18T00:59:03.110799+00:00"}