{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2NNGF3SHNNPCFBLGTCLXL2KLQA","short_pith_number":"pith:2NNGF3SH","canonical_record":{"source":{"id":"1606.06692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-21T18:15:38Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"e9cdc23f3aa063c8000722ff8c3747f9483b523aedca7e71ae93573ea39dc37e","abstract_canon_sha256":"420a07bfb9c504365356332471c911ff25263ca963b5e31a854fabcf4e581abf"},"schema_version":"1.0"},"canonical_sha256":"d35a62ee476b5e228566989775e94b802abca204279d4b21b599406537a3a46c","source":{"kind":"arxiv","id":"1606.06692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06692","created_at":"2026-05-18T01:12:08Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06692v1","created_at":"2026-05-18T01:12:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06692","created_at":"2026-05-18T01:12:08Z"},{"alias_kind":"pith_short_12","alias_value":"2NNGF3SHNNPC","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2NNGF3SHNNPCFBLG","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2NNGF3SH","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2NNGF3SHNNPCFBLGTCLXL2KLQA","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-21T18:15:38Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"e9cdc23f3aa063c8000722ff8c3747f9483b523aedca7e71ae93573ea39dc37e","abstract_canon_sha256":"420a07bfb9c504365356332471c911ff25263ca963b5e31a854fabcf4e581abf"},"schema_version":"1.0"},"canonical_sha256":"d35a62ee476b5e228566989775e94b802abca204279d4b21b599406537a3a46c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:08.990773Z","signature_b64":"wYdp7egYhODXDaWs1J33tTyLAqwQGXwy+BAqox6Bnm1DBxaflZyYuavPH/SykbKqiHS1oM2t5wx77vNpojYrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d35a62ee476b5e228566989775e94b802abca204279d4b21b599406537a3a46c","last_reissued_at":"2026-05-18T01:12:08.990376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:08.990376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06692","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-18T01:12:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ki04sCC0hQMsmyrRQ27/18xcpe80nUsmTglnaSFcIZWiIwMe3E4bslAtQlZqXdHtAwqqtEUFD/wQ3qSHmLWaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:59:58.099848Z"},"content_sha256":"1da8097ae644b1539a855e971dd84d8a28fb3d5ca965c963c1cebefe54eb680d","schema_version":"1.0","event_id":"sha256:1da8097ae644b1539a855e971dd84d8a28fb3d5ca965c963c1cebefe54eb680d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2NNGF3SHNNPCFBLGTCLXL2KLQA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Delay Optimal MAC and Packet Scheduler for Heterogeneous 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-21T18:15:38Z","abstract_excerpt":"The uplink data arriving at the Machine-to-Machine (M2M) Application Server (AS) via M2M Aggregators (MAs) is fairly heterogeneous along several dimensions such as maximum tolerable packet delay, payload size and arrival rate, thus necessitating the design of Quality-of-Service (QoS) aware packet scheduler. In this paper, we classify the M2M uplink data into multiple QoS classes and use sigmoidal function to map the delay requirements of each class onto utility functions. We propose a proportionally fair delay-optimal multiclass packet scheduler at AS that maximizes a system utility metric. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06692","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-18T01:12:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qFt+/rzdCgtnmfBvnc5pPCm8vd3r7D5FhgsEcYmPCjCciYCIgI5qDhmIDZ17SD18hJT0iVr6x9NNnA5plZrPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:59:58.100196Z"},"content_sha256":"83e5df0d41006124c973f2242c764496facfd0f444fb656282b983ad2f0c6d0a","schema_version":"1.0","event_id":"sha256:83e5df0d41006124c973f2242c764496facfd0f444fb656282b983ad2f0c6d0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2NNGF3SHNNPCFBLGTCLXL2KLQA/bundle.json","state_url":"https://pith.science/pith/2NNGF3SHNNPCFBLGTCLXL2KLQA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2NNGF3SHNNPCFBLGTCLXL2KLQA/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-01T18:59:58Z","links":{"resolver":"https://pith.science/pith/2NNGF3SHNNPCFBLGTCLXL2KLQA","bundle":"https://pith.science/pith/2NNGF3SHNNPCFBLGTCLXL2KLQA/bundle.json","state":"https://pith.science/pith/2NNGF3SHNNPCFBLGTCLXL2KLQA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2NNGF3SHNNPCFBLGTCLXL2KLQA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2NNGF3SHNNPCFBLGTCLXL2KLQA","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":"420a07bfb9c504365356332471c911ff25263ca963b5e31a854fabcf4e581abf","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-21T18:15:38Z","title_canon_sha256":"e9cdc23f3aa063c8000722ff8c3747f9483b523aedca7e71ae93573ea39dc37e"},"schema_version":"1.0","source":{"id":"1606.06692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06692","created_at":"2026-05-18T01:12:08Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06692v1","created_at":"2026-05-18T01:12:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06692","created_at":"2026-05-18T01:12:08Z"},{"alias_kind":"pith_short_12","alias_value":"2NNGF3SHNNPC","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2NNGF3SHNNPCFBLG","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2NNGF3SH","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:83e5df0d41006124c973f2242c764496facfd0f444fb656282b983ad2f0c6d0a","target":"graph","created_at":"2026-05-18T01:12:08Z","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":"The uplink data arriving at the Machine-to-Machine (M2M) Application Server (AS) via M2M Aggregators (MAs) is fairly heterogeneous along several dimensions such as maximum tolerable packet delay, payload size and arrival rate, thus necessitating the design of Quality-of-Service (QoS) aware packet scheduler. In this paper, we classify the M2M uplink data into multiple QoS classes and use sigmoidal function to map the delay requirements of each class onto utility functions. We propose a proportionally fair delay-optimal multiclass packet scheduler at AS that maximizes a system utility metric. We","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-21T18:15:38Z","title":"A Delay Optimal MAC and Packet Scheduler for Heterogeneous M2M Uplink"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06692","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:1da8097ae644b1539a855e971dd84d8a28fb3d5ca965c963c1cebefe54eb680d","target":"record","created_at":"2026-05-18T01:12:08Z","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":"420a07bfb9c504365356332471c911ff25263ca963b5e31a854fabcf4e581abf","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-21T18:15:38Z","title_canon_sha256":"e9cdc23f3aa063c8000722ff8c3747f9483b523aedca7e71ae93573ea39dc37e"},"schema_version":"1.0","source":{"id":"1606.06692","kind":"arxiv","version":1}},"canonical_sha256":"d35a62ee476b5e228566989775e94b802abca204279d4b21b599406537a3a46c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d35a62ee476b5e228566989775e94b802abca204279d4b21b599406537a3a46c","first_computed_at":"2026-05-18T01:12:08.990376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:08.990376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wYdp7egYhODXDaWs1J33tTyLAqwQGXwy+BAqox6Bnm1DBxaflZyYuavPH/SykbKqiHS1oM2t5wx77vNpojYrAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:08.990773Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1da8097ae644b1539a855e971dd84d8a28fb3d5ca965c963c1cebefe54eb680d","sha256:83e5df0d41006124c973f2242c764496facfd0f444fb656282b983ad2f0c6d0a"],"state_sha256":"6a48216f8194c7372967269358c08474d7fa235b45046d46b0a5ca70b755f8d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z606LKreHtgGnmp/TEIAXvN6bsoibEznklOf5pgp0F7luenYHAxiyk5OC1d7mSAIEmM46srrj1ecVkvvYeE/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:59:58.102821Z","bundle_sha256":"767079ca11b08aca96ab8f3ac3f34a1bedc0dc8358b852f718e4f78167a0f7de"}}