{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Y5D3DKL5POW5VANTLCUPCE3ZPM","short_pith_number":"pith:Y5D3DKL5","schema_version":"1.0","canonical_sha256":"c747b1a97d7badda81b358a8f113797b039d03edc2972bca01606f63e83fa771","source":{"kind":"arxiv","id":"1311.1240","version":2},"attestation_state":"computed","paper":{"title":"Generalized Instantly Decodable Network Coding for Relay-Assisted Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Adel M. Elmahdy, Karim G. Seddik, Sameh Sorour","submitted_at":"2013-11-05T22:21:06Z","abstract_excerpt":"In this paper, we investigate the problem of minimizing the frame completion delay for Instantly Decodable Network Coding (IDNC) in relay-assisted wireless multicast networks. We first propose a packet recovery algorithm in the single relay topology which employs generalized IDNC instead of strict IDNC previously proposed in the literature for the same relay-assisted topology. This use of generalized IDNC is supported by showing that it is a super-set of the strict IDNC scheme, and thus can generate coding combinations that are at least as efficient as strict IDNC in reducing the average compl"},"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.1240","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-11-05T22:21:06Z","cross_cats_sorted":[],"title_canon_sha256":"edaeb595b2b95c3858090a1c9950189d306c378ce9c15e37e6194b54f4c04707","abstract_canon_sha256":"60bde8205f8d9d174cecf5e5d2b560395f58f62efddc2dcb6ce7eb9d26db68ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:41.894543Z","signature_b64":"KeqUybnpgEurrAOGP1SWNh+MKMkTLdLhnqcSQYiK65ijahtUyN4qlGrfPvzMkkwJNJEmrI5bfr2wA1bIPWkODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c747b1a97d7badda81b358a8f113797b039d03edc2972bca01606f63e83fa771","last_reissued_at":"2026-05-18T00:58:41.893917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:41.893917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Instantly Decodable Network Coding for Relay-Assisted Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Adel M. Elmahdy, Karim G. Seddik, Sameh Sorour","submitted_at":"2013-11-05T22:21:06Z","abstract_excerpt":"In this paper, we investigate the problem of minimizing the frame completion delay for Instantly Decodable Network Coding (IDNC) in relay-assisted wireless multicast networks. We first propose a packet recovery algorithm in the single relay topology which employs generalized IDNC instead of strict IDNC previously proposed in the literature for the same relay-assisted topology. This use of generalized IDNC is supported by showing that it is a super-set of the strict IDNC scheme, and thus can generate coding combinations that are at least as efficient as strict IDNC in reducing the average compl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1240","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":"1311.1240","created_at":"2026-05-18T00:58:41.894028+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.1240v2","created_at":"2026-05-18T00:58:41.894028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1240","created_at":"2026-05-18T00:58:41.894028+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y5D3DKL5POW5","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y5D3DKL5POW5VANT","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y5D3DKL5","created_at":"2026-05-18T12:28:06.772260+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/Y5D3DKL5POW5VANTLCUPCE3ZPM","json":"https://pith.science/pith/Y5D3DKL5POW5VANTLCUPCE3ZPM.json","graph_json":"https://pith.science/api/pith-number/Y5D3DKL5POW5VANTLCUPCE3ZPM/graph.json","events_json":"https://pith.science/api/pith-number/Y5D3DKL5POW5VANTLCUPCE3ZPM/events.json","paper":"https://pith.science/paper/Y5D3DKL5"},"agent_actions":{"view_html":"https://pith.science/pith/Y5D3DKL5POW5VANTLCUPCE3ZPM","download_json":"https://pith.science/pith/Y5D3DKL5POW5VANTLCUPCE3ZPM.json","view_paper":"https://pith.science/paper/Y5D3DKL5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.1240&json=true","fetch_graph":"https://pith.science/api/pith-number/Y5D3DKL5POW5VANTLCUPCE3ZPM/graph.json","fetch_events":"https://pith.science/api/pith-number/Y5D3DKL5POW5VANTLCUPCE3ZPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y5D3DKL5POW5VANTLCUPCE3ZPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y5D3DKL5POW5VANTLCUPCE3ZPM/action/storage_attestation","attest_author":"https://pith.science/pith/Y5D3DKL5POW5VANTLCUPCE3ZPM/action/author_attestation","sign_citation":"https://pith.science/pith/Y5D3DKL5POW5VANTLCUPCE3ZPM/action/citation_signature","submit_replication":"https://pith.science/pith/Y5D3DKL5POW5VANTLCUPCE3ZPM/action/replication_record"}},"created_at":"2026-05-18T00:58:41.894028+00:00","updated_at":"2026-05-18T00:58:41.894028+00:00"}