{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2NZD2GZZK7D74E274KJBM2PAYI","short_pith_number":"pith:2NZD2GZZ","canonical_record":{"source":{"id":"1807.10128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-26T13:41:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8c0e4dd592d5415e5fc9861183adba546d7d73d801f11010cf2aad7f6daf677b","abstract_canon_sha256":"75ffc87489c823d89885876a2c2a11cd28e35d260ba52ad4779efee0b38d2462"},"schema_version":"1.0"},"canonical_sha256":"d3723d1b3957c7fe135fe2921669e0c21cea85ce9a24013f266e23b17d0a73bd","source":{"kind":"arxiv","id":"1807.10128","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10128","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10128v1","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10128","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"2NZD2GZZK7D7","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2NZD2GZZK7D74E27","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2NZD2GZZ","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2NZD2GZZK7D74E274KJBM2PAYI","target":"record","payload":{"canonical_record":{"source":{"id":"1807.10128","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-26T13:41:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8c0e4dd592d5415e5fc9861183adba546d7d73d801f11010cf2aad7f6daf677b","abstract_canon_sha256":"75ffc87489c823d89885876a2c2a11cd28e35d260ba52ad4779efee0b38d2462"},"schema_version":"1.0"},"canonical_sha256":"d3723d1b3957c7fe135fe2921669e0c21cea85ce9a24013f266e23b17d0a73bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:45.324699Z","signature_b64":"SGJeBo97Xe/4GvD9QnR/HlkEAdZCwU6ESbtwVstxhL17xkDSACGBJ2twNtNrYPrvTRPty7xwK4DBy1G2gX/ACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3723d1b3957c7fe135fe2921669e0c21cea85ce9a24013f266e23b17d0a73bd","last_reissued_at":"2026-05-18T00:09:45.323982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:45.323982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.10128","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-18T00:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SLssI5ENKUGtyjML59ZysYztFTra5SPjf2qoUZ5PSF1NWi1c0P/bciWzceh4C5kMeuFZszOXX5l1oNoHHbTXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:25:57.351820Z"},"content_sha256":"6c2b2026c41a46fd69f88266d3934906c84c1972c3258c707670ebb45ac148c4","schema_version":"1.0","event_id":"sha256:6c2b2026c41a46fd69f88266d3934906c84c1972c3258c707670ebb45ac148c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2NZD2GZZK7D74E274KJBM2PAYI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Queue-Aware and Channel-Aware Delay Optimal Scheduling of Arbitrarily Bursty Traffic over Multi-State Time-Varying Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anthony Ephremides, Juan Liu, Meng Wang, Wei Chen","submitted_at":"2018-07-26T13:41:30Z","abstract_excerpt":"This paper is motivated by the observation that the average queueing delay can be decreased by sacrificing power efficiency in wireless communications. In this sense, we naturally wonder what is the minimum queueing delay when the available power is limited and how to achieve the minimum queueing delay. To answer these two questions in the scenario where randomly arriving packets are transmitted over multi-state wireless fading channel, a probabilistic cross-layer scheduling policy is proposed in this paper, and characterized by a constrained Markov Decision Process (MDP). Using the steady-sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10128","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-18T00:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BNmQCCUreZRIxjRCRfNi6rVYSpn/mge22Hx6/qjEbyN4MZIGhmVDvlLHgJsSD8eQUUZxnKEFWxpBiicvup2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:25:57.352240Z"},"content_sha256":"282d118791d98c545b48307d17ef44983e8c9e1f994b52151ee100f30c5c7c16","schema_version":"1.0","event_id":"sha256:282d118791d98c545b48307d17ef44983e8c9e1f994b52151ee100f30c5c7c16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2NZD2GZZK7D74E274KJBM2PAYI/bundle.json","state_url":"https://pith.science/pith/2NZD2GZZK7D74E274KJBM2PAYI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2NZD2GZZK7D74E274KJBM2PAYI/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-27T19:25:57Z","links":{"resolver":"https://pith.science/pith/2NZD2GZZK7D74E274KJBM2PAYI","bundle":"https://pith.science/pith/2NZD2GZZK7D74E274KJBM2PAYI/bundle.json","state":"https://pith.science/pith/2NZD2GZZK7D74E274KJBM2PAYI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2NZD2GZZK7D74E274KJBM2PAYI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2NZD2GZZK7D74E274KJBM2PAYI","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":"75ffc87489c823d89885876a2c2a11cd28e35d260ba52ad4779efee0b38d2462","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-26T13:41:30Z","title_canon_sha256":"8c0e4dd592d5415e5fc9861183adba546d7d73d801f11010cf2aad7f6daf677b"},"schema_version":"1.0","source":{"id":"1807.10128","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10128","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10128v1","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10128","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"2NZD2GZZK7D7","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2NZD2GZZK7D74E27","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2NZD2GZZ","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:282d118791d98c545b48307d17ef44983e8c9e1f994b52151ee100f30c5c7c16","target":"graph","created_at":"2026-05-18T00:09:45Z","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 is motivated by the observation that the average queueing delay can be decreased by sacrificing power efficiency in wireless communications. In this sense, we naturally wonder what is the minimum queueing delay when the available power is limited and how to achieve the minimum queueing delay. To answer these two questions in the scenario where randomly arriving packets are transmitted over multi-state wireless fading channel, a probabilistic cross-layer scheduling policy is proposed in this paper, and characterized by a constrained Markov Decision Process (MDP). Using the steady-sta","authors_text":"Anthony Ephremides, Juan Liu, Meng Wang, Wei Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-26T13:41:30Z","title":"Joint Queue-Aware and Channel-Aware Delay Optimal Scheduling of Arbitrarily Bursty Traffic over Multi-State Time-Varying Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10128","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:6c2b2026c41a46fd69f88266d3934906c84c1972c3258c707670ebb45ac148c4","target":"record","created_at":"2026-05-18T00:09:45Z","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":"75ffc87489c823d89885876a2c2a11cd28e35d260ba52ad4779efee0b38d2462","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-07-26T13:41:30Z","title_canon_sha256":"8c0e4dd592d5415e5fc9861183adba546d7d73d801f11010cf2aad7f6daf677b"},"schema_version":"1.0","source":{"id":"1807.10128","kind":"arxiv","version":1}},"canonical_sha256":"d3723d1b3957c7fe135fe2921669e0c21cea85ce9a24013f266e23b17d0a73bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3723d1b3957c7fe135fe2921669e0c21cea85ce9a24013f266e23b17d0a73bd","first_computed_at":"2026-05-18T00:09:45.323982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:45.323982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SGJeBo97Xe/4GvD9QnR/HlkEAdZCwU6ESbtwVstxhL17xkDSACGBJ2twNtNrYPrvTRPty7xwK4DBy1G2gX/ACg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:45.324699Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.10128","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c2b2026c41a46fd69f88266d3934906c84c1972c3258c707670ebb45ac148c4","sha256:282d118791d98c545b48307d17ef44983e8c9e1f994b52151ee100f30c5c7c16"],"state_sha256":"7f83a2ac128d3e5c48feb7378a909a6c967d7aec55da239a2e871d61a29d3db2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tcZA9axSSu8qnHBk0fuYBF5ncMg9XOwGBgZVA/ThINxDRyutLrp4tW/CSFXLhlyRpTuHXuQdrAS1BMQrNnc+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:25:57.354600Z","bundle_sha256":"ef5d85f6ba2bda488d888cbb02e1cbcad93cb7573d3a73193c5cd54a4e9203d6"}}