{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6647E2ILJ34FEARQH2ZWGJP4YI","short_pith_number":"pith:6647E2IL","canonical_record":{"source":{"id":"1504.01218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-06T07:14:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4562f23222a9f2ac499ad1888566aef8cf4cc5145af982e5bb89c2b14e2c973d","abstract_canon_sha256":"c5ece4b87ed6c6a16f67d024a6fdb988584fc1897b36f7915c355a413a2ab205"},"schema_version":"1.0"},"canonical_sha256":"f7b9f2690b4ef85202303eb36325fcc20806602d0c084cd25e7dfdc523ba7474","source":{"kind":"arxiv","id":"1504.01218","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01218","created_at":"2026-05-18T01:20:46Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01218v1","created_at":"2026-05-18T01:20:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01218","created_at":"2026-05-18T01:20:46Z"},{"alias_kind":"pith_short_12","alias_value":"6647E2ILJ34F","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6647E2ILJ34FEARQ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6647E2IL","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6647E2ILJ34FEARQH2ZWGJP4YI","target":"record","payload":{"canonical_record":{"source":{"id":"1504.01218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-06T07:14:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4562f23222a9f2ac499ad1888566aef8cf4cc5145af982e5bb89c2b14e2c973d","abstract_canon_sha256":"c5ece4b87ed6c6a16f67d024a6fdb988584fc1897b36f7915c355a413a2ab205"},"schema_version":"1.0"},"canonical_sha256":"f7b9f2690b4ef85202303eb36325fcc20806602d0c084cd25e7dfdc523ba7474","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:46.669183Z","signature_b64":"gQTvMNN96RP6FUbYINhRSejU1Yn7j75tYUO6A/L82518N2mfmgIo1U0g8oKrsjuVeT6v/JmFjoshZ95iTD+JCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7b9f2690b4ef85202303eb36325fcc20806602d0c084cd25e7dfdc523ba7474","last_reissued_at":"2026-05-18T01:20:46.668740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:46.668740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.01218","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-18T01:20:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"84J7paC018eJQFr6hGqOg6kXYdQVsld7MZ4bemzQdpm5MnNF4re3XwMDjNnQ/Bm2l3883s3E7nS3H+BkNpYcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:30:04.418101Z"},"content_sha256":"a3a7a7c156c71f5afc9516b60f2ddab19cf841a9e28d67279c4692612c84d6ed","schema_version":"1.0","event_id":"sha256:a3a7a7c156c71f5afc9516b60f2ddab19cf841a9e28d67279c4692612c84d6ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6647E2ILJ34FEARQH2ZWGJP4YI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Instantly Decodable Network Coding for Real-Time Scalable Video Broadcast over Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad S. Karim, Neda Aboutorab, Parastoo Sadeghi, Sameh Sorour","submitted_at":"2015-04-06T07:14:46Z","abstract_excerpt":"In this paper, we study a real-time scalable video broadcast over wireless networks in instantly decodable network coded (IDNC) systems. Such real-time scalable video has a hard deadline and imposes a decoding order on the video layers.We first derive the upper bound on the probability that the individual completion times of all receivers meet the deadline. Using this probability, we design two prioritized IDNC algorithms, namely the expanding window IDNC (EW-IDNC) algorithm and the non-overlapping window IDNC (NOW-IDNC) algorithm. These algorithms provide a high level of protection to the mos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01218","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-18T01:20:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oLfMKxra8GjEoi8KuWAlOSY26eG92to5fIRONz5pz9/hVmMh0RMIkoPFPbYckYE0F2F3PbptFpKane+sa450AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:30:04.418496Z"},"content_sha256":"20fadc57681cb1808450d0ff755522b4e0daa1b5383eaf02045cb452b4d3172c","schema_version":"1.0","event_id":"sha256:20fadc57681cb1808450d0ff755522b4e0daa1b5383eaf02045cb452b4d3172c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6647E2ILJ34FEARQH2ZWGJP4YI/bundle.json","state_url":"https://pith.science/pith/6647E2ILJ34FEARQH2ZWGJP4YI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6647E2ILJ34FEARQH2ZWGJP4YI/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-25T08:30:04Z","links":{"resolver":"https://pith.science/pith/6647E2ILJ34FEARQH2ZWGJP4YI","bundle":"https://pith.science/pith/6647E2ILJ34FEARQH2ZWGJP4YI/bundle.json","state":"https://pith.science/pith/6647E2ILJ34FEARQH2ZWGJP4YI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6647E2ILJ34FEARQH2ZWGJP4YI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6647E2ILJ34FEARQH2ZWGJP4YI","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":"c5ece4b87ed6c6a16f67d024a6fdb988584fc1897b36f7915c355a413a2ab205","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-06T07:14:46Z","title_canon_sha256":"4562f23222a9f2ac499ad1888566aef8cf4cc5145af982e5bb89c2b14e2c973d"},"schema_version":"1.0","source":{"id":"1504.01218","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01218","created_at":"2026-05-18T01:20:46Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01218v1","created_at":"2026-05-18T01:20:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01218","created_at":"2026-05-18T01:20:46Z"},{"alias_kind":"pith_short_12","alias_value":"6647E2ILJ34F","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6647E2ILJ34FEARQ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6647E2IL","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:20fadc57681cb1808450d0ff755522b4e0daa1b5383eaf02045cb452b4d3172c","target":"graph","created_at":"2026-05-18T01:20:46Z","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 a real-time scalable video broadcast over wireless networks in instantly decodable network coded (IDNC) systems. Such real-time scalable video has a hard deadline and imposes a decoding order on the video layers.We first derive the upper bound on the probability that the individual completion times of all receivers meet the deadline. Using this probability, we design two prioritized IDNC algorithms, namely the expanding window IDNC (EW-IDNC) algorithm and the non-overlapping window IDNC (NOW-IDNC) algorithm. These algorithms provide a high level of protection to the mos","authors_text":"Mohammad S. Karim, Neda Aboutorab, Parastoo Sadeghi, Sameh Sorour","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-06T07:14:46Z","title":"Instantly Decodable Network Coding for Real-Time Scalable Video Broadcast over Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01218","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:a3a7a7c156c71f5afc9516b60f2ddab19cf841a9e28d67279c4692612c84d6ed","target":"record","created_at":"2026-05-18T01:20:46Z","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":"c5ece4b87ed6c6a16f67d024a6fdb988584fc1897b36f7915c355a413a2ab205","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-06T07:14:46Z","title_canon_sha256":"4562f23222a9f2ac499ad1888566aef8cf4cc5145af982e5bb89c2b14e2c973d"},"schema_version":"1.0","source":{"id":"1504.01218","kind":"arxiv","version":1}},"canonical_sha256":"f7b9f2690b4ef85202303eb36325fcc20806602d0c084cd25e7dfdc523ba7474","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7b9f2690b4ef85202303eb36325fcc20806602d0c084cd25e7dfdc523ba7474","first_computed_at":"2026-05-18T01:20:46.668740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:46.668740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gQTvMNN96RP6FUbYINhRSejU1Yn7j75tYUO6A/L82518N2mfmgIo1U0g8oKrsjuVeT6v/JmFjoshZ95iTD+JCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:46.669183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01218","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3a7a7c156c71f5afc9516b60f2ddab19cf841a9e28d67279c4692612c84d6ed","sha256:20fadc57681cb1808450d0ff755522b4e0daa1b5383eaf02045cb452b4d3172c"],"state_sha256":"65787cca4bb3842f757ee24213b874f55c31f73069328baa63dd98888fcc3061"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HFT9E2/+DdLNp/+RWpCLwt+GuBedIY/EfdZOMjXYHJUsLG9skTv15i2E65dHy3IhYysDTu7c9YcP1Bp1UMvhBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:30:04.420455Z","bundle_sha256":"0b137888527b9c45b5a8adc45ff9a77ceaf26f2b0d875f9e952d897f18800995"}}