{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:USLEXYE43RV4QOQNCQJTWXWT4E","short_pith_number":"pith:USLEXYE4","canonical_record":{"source":{"id":"1807.11623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-31T01:26:05Z","cross_cats_sorted":[],"title_canon_sha256":"2a7cd89db21f1696f231dd69bb377d5f09c5be4a33c31040a100234d4ecf2110","abstract_canon_sha256":"f53d6946c272d445a706a37d9c8621542e8174d56d8eceacc1726787b62145cf"},"schema_version":"1.0"},"canonical_sha256":"a4964be09cdc6bc83a0d14133b5ed3e110497a02e3b1a849d0511c5cce5f56b6","source":{"kind":"arxiv","id":"1807.11623","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11623","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11623v1","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11623","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"pith_short_12","alias_value":"USLEXYE43RV4","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"USLEXYE43RV4QOQN","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"USLEXYE4","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:USLEXYE43RV4QOQNCQJTWXWT4E","target":"record","payload":{"canonical_record":{"source":{"id":"1807.11623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-31T01:26:05Z","cross_cats_sorted":[],"title_canon_sha256":"2a7cd89db21f1696f231dd69bb377d5f09c5be4a33c31040a100234d4ecf2110","abstract_canon_sha256":"f53d6946c272d445a706a37d9c8621542e8174d56d8eceacc1726787b62145cf"},"schema_version":"1.0"},"canonical_sha256":"a4964be09cdc6bc83a0d14133b5ed3e110497a02e3b1a849d0511c5cce5f56b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:21.575771Z","signature_b64":"X20nlOVQX+u7RDYRgygiiLVFjCsGbc+NpjC8GI4LZi8M7zv904Ysi1HLmCxnwop1diR+9n74IfDBzLTMr3PRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4964be09cdc6bc83a0d14133b5ed3e110497a02e3b1a849d0511c5cce5f56b6","last_reissued_at":"2026-05-18T00:09:21.575164Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:21.575164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.11623","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-18T00:09:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3LaiFaT1uN5+DG24sv8xZzSvaTlsEQFmNZ8eo7FBCm1SWdpNAyoSUwYoht9jf0FjRIZcNWcz6Dx+kU8xa+sjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:19:17.149691Z"},"content_sha256":"101abceeab3b40db0df5cab18f42ba604c6667b29c5f7f31e20a9a52ea33b2c0","schema_version":"1.0","event_id":"sha256:101abceeab3b40db0df5cab18f42ba604c6667b29c5f7f31e20a9a52ea33b2c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:USLEXYE43RV4QOQNCQJTWXWT4E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Erasure Broadcast Channels with Hard Deadlines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Besma Smida, Daniela Tuninetti, Hulya Seferoglu, Natasha Devroye, Zohreh Ovaisi","submitted_at":"2018-07-31T01:26:05Z","abstract_excerpt":"This paper considers packet scheduling over a broadcast channel with packet erasures to multiple receivers with different messages (multiple uni-cast) each with possibly different hard deadline constraints. A novel metric is proposed and evaluated: the global deadline outage probability, which gives the probability that the hard communication deadline is not met for at least one of the receivers. The cut-set upper bound is derived and a scheduling policy is proposed to determine which receiver's packets should be sent in each time slot. This policy is shown to be optimal among all scheduling p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11623","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-18T00:09:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UbKd1Fxgc0BHduCfzWvwY4G/apw4858yztRTufDUNHHonzrwJIxAKq6Ti9zSdKhybwjcrQNCm78HIiWmOm9kCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:19:17.150059Z"},"content_sha256":"80ca6d1c857ff53391e433ecd518842ae8fbfb27c86f55361bce5c5982fecf27","schema_version":"1.0","event_id":"sha256:80ca6d1c857ff53391e433ecd518842ae8fbfb27c86f55361bce5c5982fecf27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USLEXYE43RV4QOQNCQJTWXWT4E/bundle.json","state_url":"https://pith.science/pith/USLEXYE43RV4QOQNCQJTWXWT4E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USLEXYE43RV4QOQNCQJTWXWT4E/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-05-28T19:19:17Z","links":{"resolver":"https://pith.science/pith/USLEXYE43RV4QOQNCQJTWXWT4E","bundle":"https://pith.science/pith/USLEXYE43RV4QOQNCQJTWXWT4E/bundle.json","state":"https://pith.science/pith/USLEXYE43RV4QOQNCQJTWXWT4E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USLEXYE43RV4QOQNCQJTWXWT4E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:USLEXYE43RV4QOQNCQJTWXWT4E","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":"f53d6946c272d445a706a37d9c8621542e8174d56d8eceacc1726787b62145cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-31T01:26:05Z","title_canon_sha256":"2a7cd89db21f1696f231dd69bb377d5f09c5be4a33c31040a100234d4ecf2110"},"schema_version":"1.0","source":{"id":"1807.11623","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11623","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11623v1","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11623","created_at":"2026-05-18T00:09:21Z"},{"alias_kind":"pith_short_12","alias_value":"USLEXYE43RV4","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"USLEXYE43RV4QOQN","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"USLEXYE4","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:80ca6d1c857ff53391e433ecd518842ae8fbfb27c86f55361bce5c5982fecf27","target":"graph","created_at":"2026-05-18T00:09:21Z","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":"This paper considers packet scheduling over a broadcast channel with packet erasures to multiple receivers with different messages (multiple uni-cast) each with possibly different hard deadline constraints. A novel metric is proposed and evaluated: the global deadline outage probability, which gives the probability that the hard communication deadline is not met for at least one of the receivers. The cut-set upper bound is derived and a scheduling policy is proposed to determine which receiver's packets should be sent in each time slot. This policy is shown to be optimal among all scheduling p","authors_text":"Besma Smida, Daniela Tuninetti, Hulya Seferoglu, Natasha Devroye, Zohreh Ovaisi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-31T01:26:05Z","title":"On Erasure Broadcast Channels with Hard Deadlines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11623","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:101abceeab3b40db0df5cab18f42ba604c6667b29c5f7f31e20a9a52ea33b2c0","target":"record","created_at":"2026-05-18T00:09:21Z","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":"f53d6946c272d445a706a37d9c8621542e8174d56d8eceacc1726787b62145cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-31T01:26:05Z","title_canon_sha256":"2a7cd89db21f1696f231dd69bb377d5f09c5be4a33c31040a100234d4ecf2110"},"schema_version":"1.0","source":{"id":"1807.11623","kind":"arxiv","version":1}},"canonical_sha256":"a4964be09cdc6bc83a0d14133b5ed3e110497a02e3b1a849d0511c5cce5f56b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4964be09cdc6bc83a0d14133b5ed3e110497a02e3b1a849d0511c5cce5f56b6","first_computed_at":"2026-05-18T00:09:21.575164Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:21.575164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X20nlOVQX+u7RDYRgygiiLVFjCsGbc+NpjC8GI4LZi8M7zv904Ysi1HLmCxnwop1diR+9n74IfDBzLTMr3PRAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:21.575771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.11623","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:101abceeab3b40db0df5cab18f42ba604c6667b29c5f7f31e20a9a52ea33b2c0","sha256:80ca6d1c857ff53391e433ecd518842ae8fbfb27c86f55361bce5c5982fecf27"],"state_sha256":"056b2e57d724296ca0d20609537ce2a601fc6402453b814654440f9ad25a3358"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z9UN3pNBE9JWrxORENiRRptYcIhxzmz/F2JZnopAJtHSbCsCeRItP8pxsklKsxGyXC7ZVpOSbp6DBhTgcaFhBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:19:17.153640Z","bundle_sha256":"21666ee7e622f0c2d585b3eafed2998d5deaea233fc6b0309d9ae691e1a41501"}}