{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FVHQWHJMUQ6LFZTKLN4PQIPLVV","short_pith_number":"pith:FVHQWHJM","schema_version":"1.0","canonical_sha256":"2d4f0b1d2ca43cb2e66a5b78f821ebad512ce40911d4620cfb33589778a467f8","source":{"kind":"arxiv","id":"1606.00952","version":1},"attestation_state":"computed","paper":{"title":"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":"Juan Liu, Meng Wang, Wei Chen","submitted_at":"2016-06-03T02:34:02Z","abstract_excerpt":"In this paper, we study joint queue-aware and channel-aware scheduling of arbitrarily bursty traffic over multi-state time-varying channels, where the bursty packet arrival in the network layer, the backlogged queue in the data link layer, and the power adaptive transmission with fixed modulation in the physical layer are jointly considered from a cross-layer perspective. To achieve minimum queueing delay given a power constraint, a probabilistic cross-layer scheduling policy is proposed, and characterized by a Markov chain model. To describe the delay-power tradeoff, we formulate a non-linear"},"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.00952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-03T02:34:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f57fd2db5b8a0325e1ef82067b0ae4e7eade8afc9ff3f00b999e715463eea398","abstract_canon_sha256":"fb9abc7dd5fe76ea7b443e815f29e621fdd67959e611a2213fcdd0c8ca20e069"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:00.021610Z","signature_b64":"CuCxnKGuRArmrS5liaAIVJafd5JKq8eivgQbuOC4JKIqYjv7Ep6sF85rgIZ9w6qE05UTHhHkapAq02+Pn12HDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d4f0b1d2ca43cb2e66a5b78f821ebad512ce40911d4620cfb33589778a467f8","last_reissued_at":"2026-05-18T01:13:00.021207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:00.021207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"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":"Juan Liu, Meng Wang, Wei Chen","submitted_at":"2016-06-03T02:34:02Z","abstract_excerpt":"In this paper, we study joint queue-aware and channel-aware scheduling of arbitrarily bursty traffic over multi-state time-varying channels, where the bursty packet arrival in the network layer, the backlogged queue in the data link layer, and the power adaptive transmission with fixed modulation in the physical layer are jointly considered from a cross-layer perspective. To achieve minimum queueing delay given a power constraint, a probabilistic cross-layer scheduling policy is proposed, and characterized by a Markov chain model. To describe the delay-power tradeoff, we formulate a non-linear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00952","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.00952","created_at":"2026-05-18T01:13:00.021274+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00952v1","created_at":"2026-05-18T01:13:00.021274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00952","created_at":"2026-05-18T01:13:00.021274+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVHQWHJMUQ6L","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVHQWHJMUQ6LFZTK","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVHQWHJM","created_at":"2026-05-18T12:30:15.759754+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/FVHQWHJMUQ6LFZTKLN4PQIPLVV","json":"https://pith.science/pith/FVHQWHJMUQ6LFZTKLN4PQIPLVV.json","graph_json":"https://pith.science/api/pith-number/FVHQWHJMUQ6LFZTKLN4PQIPLVV/graph.json","events_json":"https://pith.science/api/pith-number/FVHQWHJMUQ6LFZTKLN4PQIPLVV/events.json","paper":"https://pith.science/paper/FVHQWHJM"},"agent_actions":{"view_html":"https://pith.science/pith/FVHQWHJMUQ6LFZTKLN4PQIPLVV","download_json":"https://pith.science/pith/FVHQWHJMUQ6LFZTKLN4PQIPLVV.json","view_paper":"https://pith.science/paper/FVHQWHJM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00952&json=true","fetch_graph":"https://pith.science/api/pith-number/FVHQWHJMUQ6LFZTKLN4PQIPLVV/graph.json","fetch_events":"https://pith.science/api/pith-number/FVHQWHJMUQ6LFZTKLN4PQIPLVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVHQWHJMUQ6LFZTKLN4PQIPLVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVHQWHJMUQ6LFZTKLN4PQIPLVV/action/storage_attestation","attest_author":"https://pith.science/pith/FVHQWHJMUQ6LFZTKLN4PQIPLVV/action/author_attestation","sign_citation":"https://pith.science/pith/FVHQWHJMUQ6LFZTKLN4PQIPLVV/action/citation_signature","submit_replication":"https://pith.science/pith/FVHQWHJMUQ6LFZTKLN4PQIPLVV/action/replication_record"}},"created_at":"2026-05-18T01:13:00.021274+00:00","updated_at":"2026-05-18T01:13:00.021274+00:00"}