{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GIQLRZNAD3ENVZ55K44RCA6QTN","short_pith_number":"pith:GIQLRZNA","canonical_record":{"source":{"id":"1411.4740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-18T06:12:50Z","cross_cats_sorted":[],"title_canon_sha256":"59d608b4fd415b7d47cf5630e075a4280fd0aa1cc74d477566b245357721f85e","abstract_canon_sha256":"ec3d83a19fce4a651389118bfdb40baad99fd5f668cee6f7c2d94ca28a9913c6"},"schema_version":"1.0"},"canonical_sha256":"3220b8e5a01ec8dae7bd57391103d09b7ae5955731ca0eb3a11950db78df6692","source":{"kind":"arxiv","id":"1411.4740","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4740","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4740v1","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4740","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"pith_short_12","alias_value":"GIQLRZNAD3EN","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GIQLRZNAD3ENVZ55","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GIQLRZNA","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GIQLRZNAD3ENVZ55K44RCA6QTN","target":"record","payload":{"canonical_record":{"source":{"id":"1411.4740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-18T06:12:50Z","cross_cats_sorted":[],"title_canon_sha256":"59d608b4fd415b7d47cf5630e075a4280fd0aa1cc74d477566b245357721f85e","abstract_canon_sha256":"ec3d83a19fce4a651389118bfdb40baad99fd5f668cee6f7c2d94ca28a9913c6"},"schema_version":"1.0"},"canonical_sha256":"3220b8e5a01ec8dae7bd57391103d09b7ae5955731ca0eb3a11950db78df6692","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:51.291296Z","signature_b64":"KqhY1V3P1eZkvOetuI6EFXBMFGMvLa7cEHB+tYvS+FxaagKa4/jl0goCG6Z2P87JjKFVrmnLizdSBdJsvrAEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3220b8e5a01ec8dae7bd57391103d09b7ae5955731ca0eb3a11950db78df6692","last_reissued_at":"2026-05-18T02:34:51.290939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:51.290939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.4740","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-18T02:34:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x6U9wSWOTEo9PbbmdVtP3JULdagplMJSbka5KL10FCruovBpc/uktAHT5u0aau2nlbZLCHyfQZGL+DM0tYgjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:40:20.986213Z"},"content_sha256":"67e4abd9e59a09fa5c98f4fbd54f922de4702c0ed23b6dd603ee70ca4618433a","schema_version":"1.0","event_id":"sha256:67e4abd9e59a09fa5c98f4fbd54f922de4702c0ed23b6dd603ee70ca4618433a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GIQLRZNAD3ENVZ55K44RCA6QTN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy-Aware Wireless Scheduling with Near Optimal Backlog and Convergence Time Tradeoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Michael J. Neely","submitted_at":"2014-11-18T06:12:50Z","abstract_excerpt":"This paper considers a wireless link with randomly arriving data that is queued and served over a time-varying channel. It is known that any algorithm that comes within $\\epsilon$ of the minimum average power required for queue stability must incur average queue size at least $\\Omega(\\log(1/\\epsilon))$. However, the optimal convergence time is unknown, and prior algorithms give convergence time bounds of $O(1/\\epsilon^2)$. This paper develops a scheduling algorithm that, for any $\\epsilon>0$, achieves the optimal $O(\\log(1/\\epsilon))$ average queue size tradeoff with an improved convergence ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4740","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-18T02:34:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"60MHr6XVWeq93RVjsIAG0qFFfbm56KVTqb6y7dz7llB4E1Iw9k+tc+6PSSCovIHdXZuLNDiDVRyJJ4fnt4D6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:40:20.986584Z"},"content_sha256":"a39bba8d0f1d3b411923c5934a8cbd7f7bebd23b4137e9db6d98274faf2a9d00","schema_version":"1.0","event_id":"sha256:a39bba8d0f1d3b411923c5934a8cbd7f7bebd23b4137e9db6d98274faf2a9d00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIQLRZNAD3ENVZ55K44RCA6QTN/bundle.json","state_url":"https://pith.science/pith/GIQLRZNAD3ENVZ55K44RCA6QTN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIQLRZNAD3ENVZ55K44RCA6QTN/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-05-30T07:40:20Z","links":{"resolver":"https://pith.science/pith/GIQLRZNAD3ENVZ55K44RCA6QTN","bundle":"https://pith.science/pith/GIQLRZNAD3ENVZ55K44RCA6QTN/bundle.json","state":"https://pith.science/pith/GIQLRZNAD3ENVZ55K44RCA6QTN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIQLRZNAD3ENVZ55K44RCA6QTN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GIQLRZNAD3ENVZ55K44RCA6QTN","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":"ec3d83a19fce4a651389118bfdb40baad99fd5f668cee6f7c2d94ca28a9913c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-18T06:12:50Z","title_canon_sha256":"59d608b4fd415b7d47cf5630e075a4280fd0aa1cc74d477566b245357721f85e"},"schema_version":"1.0","source":{"id":"1411.4740","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4740","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4740v1","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4740","created_at":"2026-05-18T02:34:51Z"},{"alias_kind":"pith_short_12","alias_value":"GIQLRZNAD3EN","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GIQLRZNAD3ENVZ55","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GIQLRZNA","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:a39bba8d0f1d3b411923c5934a8cbd7f7bebd23b4137e9db6d98274faf2a9d00","target":"graph","created_at":"2026-05-18T02:34:51Z","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":"This paper considers a wireless link with randomly arriving data that is queued and served over a time-varying channel. It is known that any algorithm that comes within $\\epsilon$ of the minimum average power required for queue stability must incur average queue size at least $\\Omega(\\log(1/\\epsilon))$. However, the optimal convergence time is unknown, and prior algorithms give convergence time bounds of $O(1/\\epsilon^2)$. This paper develops a scheduling algorithm that, for any $\\epsilon>0$, achieves the optimal $O(\\log(1/\\epsilon))$ average queue size tradeoff with an improved convergence ti","authors_text":"Michael J. Neely","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-18T06:12:50Z","title":"Energy-Aware Wireless Scheduling with Near Optimal Backlog and Convergence Time Tradeoffs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4740","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:67e4abd9e59a09fa5c98f4fbd54f922de4702c0ed23b6dd603ee70ca4618433a","target":"record","created_at":"2026-05-18T02:34:51Z","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":"ec3d83a19fce4a651389118bfdb40baad99fd5f668cee6f7c2d94ca28a9913c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-18T06:12:50Z","title_canon_sha256":"59d608b4fd415b7d47cf5630e075a4280fd0aa1cc74d477566b245357721f85e"},"schema_version":"1.0","source":{"id":"1411.4740","kind":"arxiv","version":1}},"canonical_sha256":"3220b8e5a01ec8dae7bd57391103d09b7ae5955731ca0eb3a11950db78df6692","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3220b8e5a01ec8dae7bd57391103d09b7ae5955731ca0eb3a11950db78df6692","first_computed_at":"2026-05-18T02:34:51.290939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:34:51.290939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KqhY1V3P1eZkvOetuI6EFXBMFGMvLa7cEHB+tYvS+FxaagKa4/jl0goCG6Z2P87JjKFVrmnLizdSBdJsvrAEBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:34:51.291296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4740","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67e4abd9e59a09fa5c98f4fbd54f922de4702c0ed23b6dd603ee70ca4618433a","sha256:a39bba8d0f1d3b411923c5934a8cbd7f7bebd23b4137e9db6d98274faf2a9d00"],"state_sha256":"351a71f6104dad036de10d525c4aa2dd99b2931ec0a8e2d5794b63926552abb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rU0MLNhkzhe4LREy/MY3hqfQTy0hfAV4jdCeOuytObI3Hpg2PDUS+NZbupx6DTXLzX5C25HJ5B1lFn2j8DqeCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:40:20.989130Z","bundle_sha256":"86e5960f2ab5d56f3d65f148298386c68e7687ae4ff3ea3dce2eb30dbd537ae0"}}