{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4TMMTMZDPHOXA5ERY6YDYZEIQM","short_pith_number":"pith:4TMMTMZD","schema_version":"1.0","canonical_sha256":"e4d8c9b32379dd707491c7b03c6488833718428d72e69342dc56a2aff66cc18c","source":{"kind":"arxiv","id":"1502.02868","version":1},"attestation_state":"computed","paper":{"title":"Maximum Throughput Opportunistic Network Coding in Two-Way Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Maha Zohdy, Mohamed Nafie, Tamer ElBatt","submitted_at":"2015-02-10T11:49:11Z","abstract_excerpt":"In this paper, we study Two-way relaying networks well-known for its throughput merits. In particular, we study the fundamental throughput delay trade-off in two-way relaying networks using opportunistic network coding. We characterize the optimal opportunistic network coding policy that maximizes the aggregate network throughput subject to an average packet delay constraint. Towards this objective, first, we consider a pair of nodes communicating through a common relay and develop a two dimensional Markov chain model capturing the buffers' length states at the two nodes. Second, we formulate "},"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":"1502.02868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-02-10T11:49:11Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"f284a10b08b04c29f5e2ce0f0d8e3ca20d5106dde3c3d4c57cd3e33bcac90f61","abstract_canon_sha256":"b4f1be4633ed2411af959e4663901a19c4a3b10b7dd73f4a11210aa1c0dfb415"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:30.622352Z","signature_b64":"Xz3JPCpKM65gzjRCirW3Qwu22tNG7UdBKemMrgP254m1Hvfcp5/Fwxbw0dMfFIOQRcIeS79/uiJEq+U3ANsIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4d8c9b32379dd707491c7b03c6488833718428d72e69342dc56a2aff66cc18c","last_reissued_at":"2026-05-18T02:27:30.621598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:30.621598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Throughput Opportunistic Network Coding in Two-Way Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Maha Zohdy, Mohamed Nafie, Tamer ElBatt","submitted_at":"2015-02-10T11:49:11Z","abstract_excerpt":"In this paper, we study Two-way relaying networks well-known for its throughput merits. In particular, we study the fundamental throughput delay trade-off in two-way relaying networks using opportunistic network coding. We characterize the optimal opportunistic network coding policy that maximizes the aggregate network throughput subject to an average packet delay constraint. Towards this objective, first, we consider a pair of nodes communicating through a common relay and develop a two dimensional Markov chain model capturing the buffers' length states at the two nodes. Second, we formulate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02868","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":"1502.02868","created_at":"2026-05-18T02:27:30.621704+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02868v1","created_at":"2026-05-18T02:27:30.621704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02868","created_at":"2026-05-18T02:27:30.621704+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TMMTMZDPHOX","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TMMTMZDPHOXA5ER","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TMMTMZD","created_at":"2026-05-18T12:29:05.191682+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/4TMMTMZDPHOXA5ERY6YDYZEIQM","json":"https://pith.science/pith/4TMMTMZDPHOXA5ERY6YDYZEIQM.json","graph_json":"https://pith.science/api/pith-number/4TMMTMZDPHOXA5ERY6YDYZEIQM/graph.json","events_json":"https://pith.science/api/pith-number/4TMMTMZDPHOXA5ERY6YDYZEIQM/events.json","paper":"https://pith.science/paper/4TMMTMZD"},"agent_actions":{"view_html":"https://pith.science/pith/4TMMTMZDPHOXA5ERY6YDYZEIQM","download_json":"https://pith.science/pith/4TMMTMZDPHOXA5ERY6YDYZEIQM.json","view_paper":"https://pith.science/paper/4TMMTMZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02868&json=true","fetch_graph":"https://pith.science/api/pith-number/4TMMTMZDPHOXA5ERY6YDYZEIQM/graph.json","fetch_events":"https://pith.science/api/pith-number/4TMMTMZDPHOXA5ERY6YDYZEIQM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TMMTMZDPHOXA5ERY6YDYZEIQM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TMMTMZDPHOXA5ERY6YDYZEIQM/action/storage_attestation","attest_author":"https://pith.science/pith/4TMMTMZDPHOXA5ERY6YDYZEIQM/action/author_attestation","sign_citation":"https://pith.science/pith/4TMMTMZDPHOXA5ERY6YDYZEIQM/action/citation_signature","submit_replication":"https://pith.science/pith/4TMMTMZDPHOXA5ERY6YDYZEIQM/action/replication_record"}},"created_at":"2026-05-18T02:27:30.621704+00:00","updated_at":"2026-05-18T02:27:30.621704+00:00"}