{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WUHISYFE7D33FSCXY5KXWF6COI","short_pith_number":"pith:WUHISYFE","schema_version":"1.0","canonical_sha256":"b50e8960a4f8f7b2c857c7557b17c27210dcd4c5c9b59654ce83cc5d8633e39a","source":{"kind":"arxiv","id":"1606.06794","version":2},"attestation_state":"computed","paper":{"title":"A Delay-Optimal Packet Scheduler for M2M Uplink","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Abdelhadi, Akshay Kumar, Charles Clancy","submitted_at":"2016-06-22T01:00:15Z","abstract_excerpt":"In this paper, we present a delay-optimal packet scheduler for processing the M2M uplink traffic at the M2M application server (AS). Due to the delay-heterogeneity in uplink traffic, we classify it broadly into delay-tolerant and delay-sensitive traffic. We then map the diverse delay requirements of each class to sigmoidal functions of packet delay and formulate a utility-maximization problem that results in a proportionally fair delay-optimal scheduler. We note that solving this optimization problem is equivalent to solving for the optimal fraction of time each class is served with (preemptiv"},"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":"1606.06794","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-22T01:00:15Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"ab158aafae4b97bd8b156a5f932057836768e0ae4ec7e334913c8791d9a94fcc","abstract_canon_sha256":"53f91728e84e948a0b6d3d9b57f438a1bcf6d96c0e8e19231264f17f3397f37f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:58.891549Z","signature_b64":"N/Amadi0vVUYjoVB8ToGV+aDEWF6XPEwGDJp5T4mJLfqBj14KdCghVKRA6FW75YaWCtjh5ld9xLUM3jaZjvjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b50e8960a4f8f7b2c857c7557b17c27210dcd4c5c9b59654ce83cc5d8633e39a","last_reissued_at":"2026-05-18T01:10:58.890828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:58.890828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Delay-Optimal Packet Scheduler for M2M Uplink","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Ahmed Abdelhadi, Akshay Kumar, Charles Clancy","submitted_at":"2016-06-22T01:00:15Z","abstract_excerpt":"In this paper, we present a delay-optimal packet scheduler for processing the M2M uplink traffic at the M2M application server (AS). Due to the delay-heterogeneity in uplink traffic, we classify it broadly into delay-tolerant and delay-sensitive traffic. We then map the diverse delay requirements of each class to sigmoidal functions of packet delay and formulate a utility-maximization problem that results in a proportionally fair delay-optimal scheduler. We note that solving this optimization problem is equivalent to solving for the optimal fraction of time each class is served with (preemptiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06794","kind":"arxiv","version":2},"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":"1606.06794","created_at":"2026-05-18T01:10:58.890958+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.06794v2","created_at":"2026-05-18T01:10:58.890958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06794","created_at":"2026-05-18T01:10:58.890958+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUHISYFE7D33","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUHISYFE7D33FSCX","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUHISYFE","created_at":"2026-05-18T12:30:51.357362+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/WUHISYFE7D33FSCXY5KXWF6COI","json":"https://pith.science/pith/WUHISYFE7D33FSCXY5KXWF6COI.json","graph_json":"https://pith.science/api/pith-number/WUHISYFE7D33FSCXY5KXWF6COI/graph.json","events_json":"https://pith.science/api/pith-number/WUHISYFE7D33FSCXY5KXWF6COI/events.json","paper":"https://pith.science/paper/WUHISYFE"},"agent_actions":{"view_html":"https://pith.science/pith/WUHISYFE7D33FSCXY5KXWF6COI","download_json":"https://pith.science/pith/WUHISYFE7D33FSCXY5KXWF6COI.json","view_paper":"https://pith.science/paper/WUHISYFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.06794&json=true","fetch_graph":"https://pith.science/api/pith-number/WUHISYFE7D33FSCXY5KXWF6COI/graph.json","fetch_events":"https://pith.science/api/pith-number/WUHISYFE7D33FSCXY5KXWF6COI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUHISYFE7D33FSCXY5KXWF6COI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUHISYFE7D33FSCXY5KXWF6COI/action/storage_attestation","attest_author":"https://pith.science/pith/WUHISYFE7D33FSCXY5KXWF6COI/action/author_attestation","sign_citation":"https://pith.science/pith/WUHISYFE7D33FSCXY5KXWF6COI/action/citation_signature","submit_replication":"https://pith.science/pith/WUHISYFE7D33FSCXY5KXWF6COI/action/replication_record"}},"created_at":"2026-05-18T01:10:58.890958+00:00","updated_at":"2026-05-18T01:10:58.890958+00:00"}