{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HHAV467QX2UXVLTLFR3BL2G5Z4","short_pith_number":"pith:HHAV467Q","schema_version":"1.0","canonical_sha256":"39c15e7bf0bea97aae6b2c7615e8ddcf36309235e755aefa412ef23c4e1c3ffd","source":{"kind":"arxiv","id":"1210.1037","version":1},"attestation_state":"computed","paper":{"title":"Laxity-Based Opportunistic Scheduling with Flow-Level Dynamics and Deadlines","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Huasen Wu, Xin Liu, Youguang Zhang","submitted_at":"2012-10-03T09:09:09Z","abstract_excerpt":"Many data applications in the next generation cellular networks, such as content precaching and video progressive downloading, require flow-level quality of service (QoS) guarantees. One such requirement is deadline, where the transmission task needs to be completed before the application-specific time. To minimize the number of uncompleted transmission tasks, we study laxity-based scheduling policies in this paper. We propose a Less-Laxity-Higher-Possible-Rate (L$^2$HPR) policy and prove its asymptotic optimality in underloaded identical-deadline systems. The asymptotic optimality of L$^2$HPR"},"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":"1210.1037","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-10-03T09:09:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e94d3ccc426878b68c978868b3c838bb705711637aac90f50e3ddc428c82fdcc","abstract_canon_sha256":"05cb3f8fed1733c0d9fd1342789d48eb463154ec1cba04faa9c94fcc4f93dc85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:05.728535Z","signature_b64":"WA7VGPzc7lTX95bjubQwX88zJ8FVp98b+C+fcMamvg7SYUpVe+r7UxisUZ0NZC69q/SpWzHoNSoAWydvbebzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39c15e7bf0bea97aae6b2c7615e8ddcf36309235e755aefa412ef23c4e1c3ffd","last_reissued_at":"2026-05-18T03:44:05.727761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:05.727761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Laxity-Based Opportunistic Scheduling with Flow-Level Dynamics and Deadlines","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Huasen Wu, Xin Liu, Youguang Zhang","submitted_at":"2012-10-03T09:09:09Z","abstract_excerpt":"Many data applications in the next generation cellular networks, such as content precaching and video progressive downloading, require flow-level quality of service (QoS) guarantees. One such requirement is deadline, where the transmission task needs to be completed before the application-specific time. To minimize the number of uncompleted transmission tasks, we study laxity-based scheduling policies in this paper. We propose a Less-Laxity-Higher-Possible-Rate (L$^2$HPR) policy and prove its asymptotic optimality in underloaded identical-deadline systems. The asymptotic optimality of L$^2$HPR"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1037","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":"1210.1037","created_at":"2026-05-18T03:44:05.727887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.1037v1","created_at":"2026-05-18T03:44:05.727887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1037","created_at":"2026-05-18T03:44:05.727887+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHAV467QX2UX","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHAV467QX2UXVLTL","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHAV467Q","created_at":"2026-05-18T12:27:09.501522+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/HHAV467QX2UXVLTLFR3BL2G5Z4","json":"https://pith.science/pith/HHAV467QX2UXVLTLFR3BL2G5Z4.json","graph_json":"https://pith.science/api/pith-number/HHAV467QX2UXVLTLFR3BL2G5Z4/graph.json","events_json":"https://pith.science/api/pith-number/HHAV467QX2UXVLTLFR3BL2G5Z4/events.json","paper":"https://pith.science/paper/HHAV467Q"},"agent_actions":{"view_html":"https://pith.science/pith/HHAV467QX2UXVLTLFR3BL2G5Z4","download_json":"https://pith.science/pith/HHAV467QX2UXVLTLFR3BL2G5Z4.json","view_paper":"https://pith.science/paper/HHAV467Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.1037&json=true","fetch_graph":"https://pith.science/api/pith-number/HHAV467QX2UXVLTLFR3BL2G5Z4/graph.json","fetch_events":"https://pith.science/api/pith-number/HHAV467QX2UXVLTLFR3BL2G5Z4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHAV467QX2UXVLTLFR3BL2G5Z4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHAV467QX2UXVLTLFR3BL2G5Z4/action/storage_attestation","attest_author":"https://pith.science/pith/HHAV467QX2UXVLTLFR3BL2G5Z4/action/author_attestation","sign_citation":"https://pith.science/pith/HHAV467QX2UXVLTLFR3BL2G5Z4/action/citation_signature","submit_replication":"https://pith.science/pith/HHAV467QX2UXVLTLFR3BL2G5Z4/action/replication_record"}},"created_at":"2026-05-18T03:44:05.727887+00:00","updated_at":"2026-05-18T03:44:05.727887+00:00"}