{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WUHISYFE7D33FSCXY5KXWF6COI","short_pith_number":"pith:WUHISYFE","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"},"canonical_sha256":"b50e8960a4f8f7b2c857c7557b17c27210dcd4c5c9b59654ce83cc5d8633e39a","source":{"kind":"arxiv","id":"1606.06794","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06794","created_at":"2026-05-18T01:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06794v2","created_at":"2026-05-18T01:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06794","created_at":"2026-05-18T01:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"WUHISYFE7D33","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WUHISYFE7D33FSCX","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WUHISYFE","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WUHISYFE7D33FSCXY5KXWF6COI","target":"record","payload":{"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"},"canonical_sha256":"b50e8960a4f8f7b2c857c7557b17c27210dcd4c5c9b59654ce83cc5d8633e39a","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"},"source_kind":"arxiv","source_id":"1606.06794","source_version":2,"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-18T01:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R9hnhjIKccpHR+e0cxeLpPEO1MvgB+2qPe6W2fMuss95HJiUTLscfOFReOxZJlXulWeI9gEaERpqRnfcoqpyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:18:06.075503Z"},"content_sha256":"cd9ad533722e3620ebf7885af5cc39291592c0724080b494569dba1052ec488d","schema_version":"1.0","event_id":"sha256:cd9ad533722e3620ebf7885af5cc39291592c0724080b494569dba1052ec488d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WUHISYFE7D33FSCXY5KXWF6COI","target":"graph","payload":{"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"},"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-18T01:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JpQnLLbqafDaMG8BMjAaY5amGcIld3Tw1jMEWX/hPZSXAlZLfwcVg51dK7F6FIiVGn2fbD9yQBPugYSrYVOpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:18:06.075849Z"},"content_sha256":"a812e602ceeb97d40fe37d93a2f6c953b7af3bbeb69999d27277bc2006ab18da","schema_version":"1.0","event_id":"sha256:a812e602ceeb97d40fe37d93a2f6c953b7af3bbeb69999d27277bc2006ab18da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUHISYFE7D33FSCXY5KXWF6COI/bundle.json","state_url":"https://pith.science/pith/WUHISYFE7D33FSCXY5KXWF6COI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUHISYFE7D33FSCXY5KXWF6COI/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-01T16:18:06Z","links":{"resolver":"https://pith.science/pith/WUHISYFE7D33FSCXY5KXWF6COI","bundle":"https://pith.science/pith/WUHISYFE7D33FSCXY5KXWF6COI/bundle.json","state":"https://pith.science/pith/WUHISYFE7D33FSCXY5KXWF6COI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUHISYFE7D33FSCXY5KXWF6COI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WUHISYFE7D33FSCXY5KXWF6COI","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":"53f91728e84e948a0b6d3d9b57f438a1bcf6d96c0e8e19231264f17f3397f37f","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-22T01:00:15Z","title_canon_sha256":"ab158aafae4b97bd8b156a5f932057836768e0ae4ec7e334913c8791d9a94fcc"},"schema_version":"1.0","source":{"id":"1606.06794","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06794","created_at":"2026-05-18T01:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06794v2","created_at":"2026-05-18T01:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06794","created_at":"2026-05-18T01:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"WUHISYFE7D33","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WUHISYFE7D33FSCX","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WUHISYFE","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:a812e602ceeb97d40fe37d93a2f6c953b7af3bbeb69999d27277bc2006ab18da","target":"graph","created_at":"2026-05-18T01:10:58Z","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":"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","authors_text":"Ahmed Abdelhadi, Akshay Kumar, Charles Clancy","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-22T01:00:15Z","title":"A Delay-Optimal Packet Scheduler for M2M Uplink"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06794","kind":"arxiv","version":2},"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:cd9ad533722e3620ebf7885af5cc39291592c0724080b494569dba1052ec488d","target":"record","created_at":"2026-05-18T01:10:58Z","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":"53f91728e84e948a0b6d3d9b57f438a1bcf6d96c0e8e19231264f17f3397f37f","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-22T01:00:15Z","title_canon_sha256":"ab158aafae4b97bd8b156a5f932057836768e0ae4ec7e334913c8791d9a94fcc"},"schema_version":"1.0","source":{"id":"1606.06794","kind":"arxiv","version":2}},"canonical_sha256":"b50e8960a4f8f7b2c857c7557b17c27210dcd4c5c9b59654ce83cc5d8633e39a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b50e8960a4f8f7b2c857c7557b17c27210dcd4c5c9b59654ce83cc5d8633e39a","first_computed_at":"2026-05-18T01:10:58.890828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:58.890828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N/Amadi0vVUYjoVB8ToGV+aDEWF6XPEwGDJp5T4mJLfqBj14KdCghVKRA6FW75YaWCtjh5ld9xLUM3jaZjvjBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:58.891549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06794","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd9ad533722e3620ebf7885af5cc39291592c0724080b494569dba1052ec488d","sha256:a812e602ceeb97d40fe37d93a2f6c953b7af3bbeb69999d27277bc2006ab18da"],"state_sha256":"9ef1414d86ec2053a76c083b1f80dc12dbbbbb9e9bcb6395d52273ac1936c52e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KR1vEYT70GqZK8tsdRHO3fcc+JmGkMDLZF74LnCLuQawJmMi9LfEodalbnXYMxXp+d5o1FnTqFfgVTGai+tHAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:18:06.077835Z","bundle_sha256":"d19073c65ce1677d1a5de90ed017c2d2c48b7a27679275fe5d412b4fbea2860a"}}