{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KND2K6VAMQORJUE3ZPJN56IVA3","short_pith_number":"pith:KND2K6VA","schema_version":"1.0","canonical_sha256":"5347a57aa0641d14d09bcbd2def91506c8bea046047c7ccc1cba3d84448092f2","source":{"kind":"arxiv","id":"1311.0459","version":1},"attestation_state":"computed","paper":{"title":"A Lossy Graph Model for Decoding Delay Reduction in Instantly Decodable Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Douik, Mohamed-Slim Alouini, Sameh Sorour, Tareq Y. Al-Naffouri","submitted_at":"2013-11-03T12:15:54Z","abstract_excerpt":"In this paper, we study the broadcast decoding delay performance of generalized instantly decodable network coding (G-IDNC) in the lossy feedback scenario. The problem is formulated as a maximum weight clique problem over the G-IDNC graph in [1]. In order to further minimize the decoding delay, we introduce in this paper the lossy G-IDNC graph (LG-IDNC). Whereas the G-IDNC graph represents only doubtless combinable packets, the LG-IDNC graph represents also uncertain packet combinations when the expected decoding delay of the encoded packet is lower than the individual expected decoding delay "},"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.0459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-03T12:15:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f4992d97d0b3b5380d72cb5bd0012cb0ea795050c9ecd2d61ba143f588d8881a","abstract_canon_sha256":"e0a2a30fab45d644288e4d8ad7299290c786d1e0015e66aa6dbc1f78f56b9d8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:52.295534Z","signature_b64":"8SepCqXtIEGwjzd2vdNSI9ODcdkquj/nfZz5vQjJKopLGgq/yF2jRvKR64w1IakIiNQVLEl+IJGfAWHjH/rxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5347a57aa0641d14d09bcbd2def91506c8bea046047c7ccc1cba3d84448092f2","last_reissued_at":"2026-05-18T02:35:52.295073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:52.295073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lossy Graph Model for Decoding Delay Reduction in Instantly Decodable Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Douik, Mohamed-Slim Alouini, Sameh Sorour, Tareq Y. Al-Naffouri","submitted_at":"2013-11-03T12:15:54Z","abstract_excerpt":"In this paper, we study the broadcast decoding delay performance of generalized instantly decodable network coding (G-IDNC) in the lossy feedback scenario. The problem is formulated as a maximum weight clique problem over the G-IDNC graph in [1]. In order to further minimize the decoding delay, we introduce in this paper the lossy G-IDNC graph (LG-IDNC). Whereas the G-IDNC graph represents only doubtless combinable packets, the LG-IDNC graph represents also uncertain packet combinations when the expected decoding delay of the encoded packet is lower than the individual expected decoding delay "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0459","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.0459","created_at":"2026-05-18T02:35:52.295140+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.0459v1","created_at":"2026-05-18T02:35:52.295140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0459","created_at":"2026-05-18T02:35:52.295140+00:00"},{"alias_kind":"pith_short_12","alias_value":"KND2K6VAMQOR","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"KND2K6VAMQORJUE3","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"KND2K6VA","created_at":"2026-05-18T12:27:51.066281+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/KND2K6VAMQORJUE3ZPJN56IVA3","json":"https://pith.science/pith/KND2K6VAMQORJUE3ZPJN56IVA3.json","graph_json":"https://pith.science/api/pith-number/KND2K6VAMQORJUE3ZPJN56IVA3/graph.json","events_json":"https://pith.science/api/pith-number/KND2K6VAMQORJUE3ZPJN56IVA3/events.json","paper":"https://pith.science/paper/KND2K6VA"},"agent_actions":{"view_html":"https://pith.science/pith/KND2K6VAMQORJUE3ZPJN56IVA3","download_json":"https://pith.science/pith/KND2K6VAMQORJUE3ZPJN56IVA3.json","view_paper":"https://pith.science/paper/KND2K6VA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.0459&json=true","fetch_graph":"https://pith.science/api/pith-number/KND2K6VAMQORJUE3ZPJN56IVA3/graph.json","fetch_events":"https://pith.science/api/pith-number/KND2K6VAMQORJUE3ZPJN56IVA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KND2K6VAMQORJUE3ZPJN56IVA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KND2K6VAMQORJUE3ZPJN56IVA3/action/storage_attestation","attest_author":"https://pith.science/pith/KND2K6VAMQORJUE3ZPJN56IVA3/action/author_attestation","sign_citation":"https://pith.science/pith/KND2K6VAMQORJUE3ZPJN56IVA3/action/citation_signature","submit_replication":"https://pith.science/pith/KND2K6VAMQORJUE3ZPJN56IVA3/action/replication_record"}},"created_at":"2026-05-18T02:35:52.295140+00:00","updated_at":"2026-05-18T02:35:52.295140+00:00"}