{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HHAV467QX2UXVLTLFR3BL2G5Z4","short_pith_number":"pith:HHAV467Q","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"},"canonical_sha256":"39c15e7bf0bea97aae6b2c7615e8ddcf36309235e755aefa412ef23c4e1c3ffd","source":{"kind":"arxiv","id":"1210.1037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1037","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1037v1","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1037","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"HHAV467QX2UX","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HHAV467QX2UXVLTL","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HHAV467Q","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HHAV467QX2UXVLTLFR3BL2G5Z4","target":"record","payload":{"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"},"canonical_sha256":"39c15e7bf0bea97aae6b2c7615e8ddcf36309235e755aefa412ef23c4e1c3ffd","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"},"source_kind":"arxiv","source_id":"1210.1037","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-18T03:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2he7UL/lys6kKLkbueYV4cj9SERx/+82sfzSm1xr8QTBJagcWvJXZhJrpi31CRZ53Nq5WrTTI2eScwx42aSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:21:40.255687Z"},"content_sha256":"dfed2495600b064c7e86d0b409859ebb45a58808b5637247850fe06146aa8d9c","schema_version":"1.0","event_id":"sha256:dfed2495600b064c7e86d0b409859ebb45a58808b5637247850fe06146aa8d9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HHAV467QX2UXVLTLFR3BL2G5Z4","target":"graph","payload":{"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"},"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-18T03:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DoMbjQcEZebChN19V4UpWwMAX1MU9YSxqj9z8m0n2F4fToilyqIJQY5osJFahhSxGU+0LpuazGsnHG3rqdVQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:21:40.256424Z"},"content_sha256":"2ac868c3f293c3e417ae7db4be22f1744b412456d3742e99450465ed38ccd5a7","schema_version":"1.0","event_id":"sha256:2ac868c3f293c3e417ae7db4be22f1744b412456d3742e99450465ed38ccd5a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHAV467QX2UXVLTLFR3BL2G5Z4/bundle.json","state_url":"https://pith.science/pith/HHAV467QX2UXVLTLFR3BL2G5Z4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHAV467QX2UXVLTLFR3BL2G5Z4/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-09T19:21:40Z","links":{"resolver":"https://pith.science/pith/HHAV467QX2UXVLTLFR3BL2G5Z4","bundle":"https://pith.science/pith/HHAV467QX2UXVLTLFR3BL2G5Z4/bundle.json","state":"https://pith.science/pith/HHAV467QX2UXVLTLFR3BL2G5Z4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHAV467QX2UXVLTLFR3BL2G5Z4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HHAV467QX2UXVLTLFR3BL2G5Z4","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":"05cb3f8fed1733c0d9fd1342789d48eb463154ec1cba04faa9c94fcc4f93dc85","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-10-03T09:09:09Z","title_canon_sha256":"e94d3ccc426878b68c978868b3c838bb705711637aac90f50e3ddc428c82fdcc"},"schema_version":"1.0","source":{"id":"1210.1037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1037","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1037v1","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1037","created_at":"2026-05-18T03:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"HHAV467QX2UX","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HHAV467QX2UXVLTL","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HHAV467Q","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:2ac868c3f293c3e417ae7db4be22f1744b412456d3742e99450465ed38ccd5a7","target":"graph","created_at":"2026-05-18T03:44:05Z","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":"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","authors_text":"Huasen Wu, Xin Liu, Youguang Zhang","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-10-03T09:09:09Z","title":"Laxity-Based Opportunistic Scheduling with Flow-Level Dynamics and Deadlines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1037","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:dfed2495600b064c7e86d0b409859ebb45a58808b5637247850fe06146aa8d9c","target":"record","created_at":"2026-05-18T03:44:05Z","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":"05cb3f8fed1733c0d9fd1342789d48eb463154ec1cba04faa9c94fcc4f93dc85","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2012-10-03T09:09:09Z","title_canon_sha256":"e94d3ccc426878b68c978868b3c838bb705711637aac90f50e3ddc428c82fdcc"},"schema_version":"1.0","source":{"id":"1210.1037","kind":"arxiv","version":1}},"canonical_sha256":"39c15e7bf0bea97aae6b2c7615e8ddcf36309235e755aefa412ef23c4e1c3ffd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39c15e7bf0bea97aae6b2c7615e8ddcf36309235e755aefa412ef23c4e1c3ffd","first_computed_at":"2026-05-18T03:44:05.727761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:05.727761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WA7VGPzc7lTX95bjubQwX88zJ8FVp98b+C+fcMamvg7SYUpVe+r7UxisUZ0NZC69q/SpWzHoNSoAWydvbebzCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:05.728535Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.1037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfed2495600b064c7e86d0b409859ebb45a58808b5637247850fe06146aa8d9c","sha256:2ac868c3f293c3e417ae7db4be22f1744b412456d3742e99450465ed38ccd5a7"],"state_sha256":"bc1e56fcb34565731528f5d29457acd485ab88748ec1037ccc69014f191f0e60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+yBGG/JevtsCZE55NuSaXT9gIhrpR87rRYdYLjMuYO0WmGx7cgsJ2ZeHIlmogyFlYBihc4WNgahzoUcorxOeAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:21:40.260325Z","bundle_sha256":"106569c803aecfecc6bccef04e580e9e634d79401dadf9afe450cf8abcadb053"}}