{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KND2K6VAMQORJUE3ZPJN56IVA3","short_pith_number":"pith:KND2K6VA","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"},"canonical_sha256":"5347a57aa0641d14d09bcbd2def91506c8bea046047c7ccc1cba3d84448092f2","source":{"kind":"arxiv","id":"1311.0459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0459","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0459v1","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0459","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"pith_short_12","alias_value":"KND2K6VAMQOR","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KND2K6VAMQORJUE3","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KND2K6VA","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KND2K6VAMQORJUE3ZPJN56IVA3","target":"record","payload":{"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"},"canonical_sha256":"5347a57aa0641d14d09bcbd2def91506c8bea046047c7ccc1cba3d84448092f2","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"},"source_kind":"arxiv","source_id":"1311.0459","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:35:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23EKSd5Kworhhwk2cPWcpTRudI9O4iPUW4qniW7CRamaFathVpmJGG0ltfk8I9l5SGdO8OcP/yNnV556UR3mCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:00:05.481377Z"},"content_sha256":"b7c579f324feb653df93d86114afb681032768ac9e996b91f7d05a9b191b384e","schema_version":"1.0","event_id":"sha256:b7c579f324feb653df93d86114afb681032768ac9e996b91f7d05a9b191b384e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KND2K6VAMQORJUE3ZPJN56IVA3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:35:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4E8aNS+1wYzcC16Iqg/VAzaOcDb6tvl+goKnx2jx97CnKz3D2Bltpn0UOASbOb6q3HASBm4DK8wN7m7MGeI4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:00:05.481732Z"},"content_sha256":"3a279bbd1faa475d5c01b177f21eeaf3fd612bf013c07a00debc92533ab1e8d0","schema_version":"1.0","event_id":"sha256:3a279bbd1faa475d5c01b177f21eeaf3fd612bf013c07a00debc92533ab1e8d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KND2K6VAMQORJUE3ZPJN56IVA3/bundle.json","state_url":"https://pith.science/pith/KND2K6VAMQORJUE3ZPJN56IVA3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KND2K6VAMQORJUE3ZPJN56IVA3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T15:00:05Z","links":{"resolver":"https://pith.science/pith/KND2K6VAMQORJUE3ZPJN56IVA3","bundle":"https://pith.science/pith/KND2K6VAMQORJUE3ZPJN56IVA3/bundle.json","state":"https://pith.science/pith/KND2K6VAMQORJUE3ZPJN56IVA3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KND2K6VAMQORJUE3ZPJN56IVA3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KND2K6VAMQORJUE3ZPJN56IVA3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e0a2a30fab45d644288e4d8ad7299290c786d1e0015e66aa6dbc1f78f56b9d8f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-03T12:15:54Z","title_canon_sha256":"f4992d97d0b3b5380d72cb5bd0012cb0ea795050c9ecd2d61ba143f588d8881a"},"schema_version":"1.0","source":{"id":"1311.0459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0459","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0459v1","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0459","created_at":"2026-05-18T02:35:52Z"},{"alias_kind":"pith_short_12","alias_value":"KND2K6VAMQOR","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KND2K6VAMQORJUE3","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KND2K6VA","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:3a279bbd1faa475d5c01b177f21eeaf3fd612bf013c07a00debc92533ab1e8d0","target":"graph","created_at":"2026-05-18T02:35:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Ahmed Douik, Mohamed-Slim Alouini, Sameh Sorour, Tareq Y. Al-Naffouri","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-03T12:15:54Z","title":"A Lossy Graph Model for Decoding Delay Reduction in Instantly Decodable Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0459","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b7c579f324feb653df93d86114afb681032768ac9e996b91f7d05a9b191b384e","target":"record","created_at":"2026-05-18T02:35:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e0a2a30fab45d644288e4d8ad7299290c786d1e0015e66aa6dbc1f78f56b9d8f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-03T12:15:54Z","title_canon_sha256":"f4992d97d0b3b5380d72cb5bd0012cb0ea795050c9ecd2d61ba143f588d8881a"},"schema_version":"1.0","source":{"id":"1311.0459","kind":"arxiv","version":1}},"canonical_sha256":"5347a57aa0641d14d09bcbd2def91506c8bea046047c7ccc1cba3d84448092f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5347a57aa0641d14d09bcbd2def91506c8bea046047c7ccc1cba3d84448092f2","first_computed_at":"2026-05-18T02:35:52.295073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:35:52.295073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8SepCqXtIEGwjzd2vdNSI9ODcdkquj/nfZz5vQjJKopLGgq/yF2jRvKR64w1IakIiNQVLEl+IJGfAWHjH/rxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:35:52.295534Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.0459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7c579f324feb653df93d86114afb681032768ac9e996b91f7d05a9b191b384e","sha256:3a279bbd1faa475d5c01b177f21eeaf3fd612bf013c07a00debc92533ab1e8d0"],"state_sha256":"6b45e7b8cb4fa691c60194f3d50e8b1c3ad5f787558c885063f9a971baeb0c1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2GXqfq86nX+0xzOWJrN1xRJFlCQVADVkr0+rirU+NVJRK227zy3SH4ztBgn45OWQzxqj+z/uW+ibQxfFqFE+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:00:05.483705Z","bundle_sha256":"aa1d34e07162bbda3cdb3ab48045c6850954de245c4c540e21a80e5381280243"}}