{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YPEYK5QZ4W3DXPHQOSU5MDHDKC","short_pith_number":"pith:YPEYK5QZ","schema_version":"1.0","canonical_sha256":"c3c9857619e5b63bbcf074a9d60ce350b4e3c373feb2c0a9fb9380c8757f9505","source":{"kind":"arxiv","id":"1304.4464","version":1},"attestation_state":"computed","paper":{"title":"The Deterministic Multicast Capacity of 4-Node Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed A. Zewail, H. El Gamal, M. Nafie, Y. Mohasseb","submitted_at":"2013-04-16T14:31:38Z","abstract_excerpt":"In this paper, we completely characterize the deterministic capacity region of a four-node relay network with no direct links between the nodes, where each node communicates with the three other nodes via a relay. Towards this end, we develop an upper bound on the deterministic capacity region, based on the notion of a one-sided genie. To establish achievability, we use the detour schemes that achieve the upper bound by routing specific bits via indirect paths instead of sending them directly."},"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.4464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-16T14:31:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a954786140897ce54d5b03120c2a38f2d432d13bf1adb014dc395574f79e63d7","abstract_canon_sha256":"cfa92f32de4e3b1bdade965c39500bd4ca0439c23cded3de0ce1a6d50889cdc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:52.977740Z","signature_b64":"5iYAw/dwSrVKqkHFKU4V0+93FQ0Y8f0WSdFlv9vtAAriBGfXEwYmiChAzAAy0tQbkAkiwE5lqjTCvvsx0t4EDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3c9857619e5b63bbcf074a9d60ce350b4e3c373feb2c0a9fb9380c8757f9505","last_reissued_at":"2026-05-18T03:27:52.977117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:52.977117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Deterministic Multicast Capacity of 4-Node Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed A. Zewail, H. El Gamal, M. Nafie, Y. Mohasseb","submitted_at":"2013-04-16T14:31:38Z","abstract_excerpt":"In this paper, we completely characterize the deterministic capacity region of a four-node relay network with no direct links between the nodes, where each node communicates with the three other nodes via a relay. Towards this end, we develop an upper bound on the deterministic capacity region, based on the notion of a one-sided genie. To establish achievability, we use the detour schemes that achieve the upper bound by routing specific bits via indirect paths instead of sending them directly."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4464","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":"1304.4464","created_at":"2026-05-18T03:27:52.977222+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4464v1","created_at":"2026-05-18T03:27:52.977222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4464","created_at":"2026-05-18T03:27:52.977222+00:00"},{"alias_kind":"pith_short_12","alias_value":"YPEYK5QZ4W3D","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YPEYK5QZ4W3DXPHQ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YPEYK5QZ","created_at":"2026-05-18T12:28:09.283467+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/YPEYK5QZ4W3DXPHQOSU5MDHDKC","json":"https://pith.science/pith/YPEYK5QZ4W3DXPHQOSU5MDHDKC.json","graph_json":"https://pith.science/api/pith-number/YPEYK5QZ4W3DXPHQOSU5MDHDKC/graph.json","events_json":"https://pith.science/api/pith-number/YPEYK5QZ4W3DXPHQOSU5MDHDKC/events.json","paper":"https://pith.science/paper/YPEYK5QZ"},"agent_actions":{"view_html":"https://pith.science/pith/YPEYK5QZ4W3DXPHQOSU5MDHDKC","download_json":"https://pith.science/pith/YPEYK5QZ4W3DXPHQOSU5MDHDKC.json","view_paper":"https://pith.science/paper/YPEYK5QZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4464&json=true","fetch_graph":"https://pith.science/api/pith-number/YPEYK5QZ4W3DXPHQOSU5MDHDKC/graph.json","fetch_events":"https://pith.science/api/pith-number/YPEYK5QZ4W3DXPHQOSU5MDHDKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YPEYK5QZ4W3DXPHQOSU5MDHDKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YPEYK5QZ4W3DXPHQOSU5MDHDKC/action/storage_attestation","attest_author":"https://pith.science/pith/YPEYK5QZ4W3DXPHQOSU5MDHDKC/action/author_attestation","sign_citation":"https://pith.science/pith/YPEYK5QZ4W3DXPHQOSU5MDHDKC/action/citation_signature","submit_replication":"https://pith.science/pith/YPEYK5QZ4W3DXPHQOSU5MDHDKC/action/replication_record"}},"created_at":"2026-05-18T03:27:52.977222+00:00","updated_at":"2026-05-18T03:27:52.977222+00:00"}