{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:USLEXYE43RV4QOQNCQJTWXWT4E","short_pith_number":"pith:USLEXYE4","schema_version":"1.0","canonical_sha256":"a4964be09cdc6bc83a0d14133b5ed3e110497a02e3b1a849d0511c5cce5f56b6","source":{"kind":"arxiv","id":"1807.11623","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.11623","created_at":"2026-05-18T00:09:21.575264+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.11623v1","created_at":"2026-05-18T00:09:21.575264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11623","created_at":"2026-05-18T00:09:21.575264+00:00"},{"alias_kind":"pith_short_12","alias_value":"USLEXYE43RV4","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"USLEXYE43RV4QOQN","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"USLEXYE4","created_at":"2026-05-18T12:32:56.356000+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/USLEXYE43RV4QOQNCQJTWXWT4E","json":"https://pith.science/pith/USLEXYE43RV4QOQNCQJTWXWT4E.json","graph_json":"https://pith.science/api/pith-number/USLEXYE43RV4QOQNCQJTWXWT4E/graph.json","events_json":"https://pith.science/api/pith-number/USLEXYE43RV4QOQNCQJTWXWT4E/events.json","paper":"https://pith.science/paper/USLEXYE4"},"agent_actions":{"view_html":"https://pith.science/pith/USLEXYE43RV4QOQNCQJTWXWT4E","download_json":"https://pith.science/pith/USLEXYE43RV4QOQNCQJTWXWT4E.json","view_paper":"https://pith.science/paper/USLEXYE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.11623&json=true","fetch_graph":"https://pith.science/api/pith-number/USLEXYE43RV4QOQNCQJTWXWT4E/graph.json","fetch_events":"https://pith.science/api/pith-number/USLEXYE43RV4QOQNCQJTWXWT4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USLEXYE43RV4QOQNCQJTWXWT4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USLEXYE43RV4QOQNCQJTWXWT4E/action/storage_attestation","attest_author":"https://pith.science/pith/USLEXYE43RV4QOQNCQJTWXWT4E/action/author_attestation","sign_citation":"https://pith.science/pith/USLEXYE43RV4QOQNCQJTWXWT4E/action/citation_signature","submit_replication":"https://pith.science/pith/USLEXYE43RV4QOQNCQJTWXWT4E/action/replication_record"}},"created_at":"2026-05-18T00:09:21.575264+00:00","updated_at":"2026-05-18T00:09:21.575264+00:00"}