{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:X5KFAGW2RFNQY32OQ5KTMGL7YG","short_pith_number":"pith:X5KFAGW2","schema_version":"1.0","canonical_sha256":"bf54501ada895b0c6f4e875536197fc1bde10bdf8be02adefb20daab4446e4b1","source":{"kind":"arxiv","id":"1206.1634","version":3},"attestation_state":"computed","paper":{"title":"Low-complexity Optimal Scheduling over Correlated Fading Channels with ARQ Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Atilla Eryilmaz, Ness B. Shroff, Wenzhuo Ouyang","submitted_at":"2012-06-07T22:18:17Z","abstract_excerpt":"We investigate the downlink scheduling problem under Markovian ON/OFF fading channels, where the instantaneous channel state information is not directly accessible, but is revealed via ARQ-type feedback. The scheduler can exploit the temporal correlation/channel memory inherent in the Markovian channels to improve network performance. However, designing low-complexity and throughput-optimal algorithms under temporal correlation is a challenging problem. In this paper, we find that under an average number of transmissions constraint, a low-complexity index policy is throughput-optimal. The poli"},"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":"1206.1634","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-06-07T22:18:17Z","cross_cats_sorted":[],"title_canon_sha256":"7bb5c68165af5a9c826475c0843481cf449d6fe1912ebd869e18cce3e68eefdd","abstract_canon_sha256":"e200ca23fdbb1b27ac6505825f4195181406ba66e6c472968262cda84a4f7dc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:56.916828Z","signature_b64":"z4EZDeJpDrrSnaaNy3oDWenjUBcamo44ACYnjMMEnICE6Hy0UueDbLMwSorB9m9OOdK98aCt8Bu7As+dwUjgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf54501ada895b0c6f4e875536197fc1bde10bdf8be02adefb20daab4446e4b1","last_reissued_at":"2026-05-18T00:57:56.916428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:56.916428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-complexity Optimal Scheduling over Correlated Fading Channels with ARQ Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Atilla Eryilmaz, Ness B. Shroff, Wenzhuo Ouyang","submitted_at":"2012-06-07T22:18:17Z","abstract_excerpt":"We investigate the downlink scheduling problem under Markovian ON/OFF fading channels, where the instantaneous channel state information is not directly accessible, but is revealed via ARQ-type feedback. The scheduler can exploit the temporal correlation/channel memory inherent in the Markovian channels to improve network performance. However, designing low-complexity and throughput-optimal algorithms under temporal correlation is a challenging problem. In this paper, we find that under an average number of transmissions constraint, a low-complexity index policy is throughput-optimal. The poli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1634","kind":"arxiv","version":3},"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":"1206.1634","created_at":"2026-05-18T00:57:56.916490+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1634v3","created_at":"2026-05-18T00:57:56.916490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1634","created_at":"2026-05-18T00:57:56.916490+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5KFAGW2RFNQ","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5KFAGW2RFNQY32O","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5KFAGW2","created_at":"2026-05-18T12:27:27.928770+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/X5KFAGW2RFNQY32OQ5KTMGL7YG","json":"https://pith.science/pith/X5KFAGW2RFNQY32OQ5KTMGL7YG.json","graph_json":"https://pith.science/api/pith-number/X5KFAGW2RFNQY32OQ5KTMGL7YG/graph.json","events_json":"https://pith.science/api/pith-number/X5KFAGW2RFNQY32OQ5KTMGL7YG/events.json","paper":"https://pith.science/paper/X5KFAGW2"},"agent_actions":{"view_html":"https://pith.science/pith/X5KFAGW2RFNQY32OQ5KTMGL7YG","download_json":"https://pith.science/pith/X5KFAGW2RFNQY32OQ5KTMGL7YG.json","view_paper":"https://pith.science/paper/X5KFAGW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1634&json=true","fetch_graph":"https://pith.science/api/pith-number/X5KFAGW2RFNQY32OQ5KTMGL7YG/graph.json","fetch_events":"https://pith.science/api/pith-number/X5KFAGW2RFNQY32OQ5KTMGL7YG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5KFAGW2RFNQY32OQ5KTMGL7YG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5KFAGW2RFNQY32OQ5KTMGL7YG/action/storage_attestation","attest_author":"https://pith.science/pith/X5KFAGW2RFNQY32OQ5KTMGL7YG/action/author_attestation","sign_citation":"https://pith.science/pith/X5KFAGW2RFNQY32OQ5KTMGL7YG/action/citation_signature","submit_replication":"https://pith.science/pith/X5KFAGW2RFNQY32OQ5KTMGL7YG/action/replication_record"}},"created_at":"2026-05-18T00:57:56.916490+00:00","updated_at":"2026-05-18T00:57:56.916490+00:00"}