{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:X5KFAGW2RFNQY32OQ5KTMGL7YG","short_pith_number":"pith:X5KFAGW2","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"},"canonical_sha256":"bf54501ada895b0c6f4e875536197fc1bde10bdf8be02adefb20daab4446e4b1","source":{"kind":"arxiv","id":"1206.1634","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1634","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1634v3","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1634","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"X5KFAGW2RFNQ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"X5KFAGW2RFNQY32O","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"X5KFAGW2","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:X5KFAGW2RFNQY32OQ5KTMGL7YG","target":"record","payload":{"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"},"canonical_sha256":"bf54501ada895b0c6f4e875536197fc1bde10bdf8be02adefb20daab4446e4b1","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"},"source_kind":"arxiv","source_id":"1206.1634","source_version":3,"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:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p5EKfd5D8mBh007sGl0G6h7FYueB1GkCJJYr+vaXBeb6X92WxzmsWmXb/TVqlv69tusFs0rCtYkUbWM/aotPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:21:12.391347Z"},"content_sha256":"f964c61666a953fdbcd713019f6a4a75396528eafc6587fa8bb7c60ee9c792b1","schema_version":"1.0","event_id":"sha256:f964c61666a953fdbcd713019f6a4a75396528eafc6587fa8bb7c60ee9c792b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:X5KFAGW2RFNQY32OQ5KTMGL7YG","target":"graph","payload":{"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"},"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:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YvFVVU3u0seDNKm1AD67EC87Rou7ly0m0YnFa15EWSgC7Ei95F2cOs+8NeNHHoqk5H/dhQQEQt6rgm1IoV9ZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T02:21:12.391906Z"},"content_sha256":"fbe1b3b7c01aedc3f626073a66cca026e819cf35cb2d9542eabf24e828ea9fb3","schema_version":"1.0","event_id":"sha256:fbe1b3b7c01aedc3f626073a66cca026e819cf35cb2d9542eabf24e828ea9fb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5KFAGW2RFNQY32OQ5KTMGL7YG/bundle.json","state_url":"https://pith.science/pith/X5KFAGW2RFNQY32OQ5KTMGL7YG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5KFAGW2RFNQY32OQ5KTMGL7YG/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-23T02:21:12Z","links":{"resolver":"https://pith.science/pith/X5KFAGW2RFNQY32OQ5KTMGL7YG","bundle":"https://pith.science/pith/X5KFAGW2RFNQY32OQ5KTMGL7YG/bundle.json","state":"https://pith.science/pith/X5KFAGW2RFNQY32OQ5KTMGL7YG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5KFAGW2RFNQY32OQ5KTMGL7YG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:X5KFAGW2RFNQY32OQ5KTMGL7YG","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":"e200ca23fdbb1b27ac6505825f4195181406ba66e6c472968262cda84a4f7dc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-06-07T22:18:17Z","title_canon_sha256":"7bb5c68165af5a9c826475c0843481cf449d6fe1912ebd869e18cce3e68eefdd"},"schema_version":"1.0","source":{"id":"1206.1634","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1634","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1634v3","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1634","created_at":"2026-05-18T00:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"X5KFAGW2RFNQ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"X5KFAGW2RFNQY32O","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"X5KFAGW2","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:fbe1b3b7c01aedc3f626073a66cca026e819cf35cb2d9542eabf24e828ea9fb3","target":"graph","created_at":"2026-05-18T00:57:56Z","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":"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","authors_text":"Atilla Eryilmaz, Ness B. Shroff, Wenzhuo Ouyang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-06-07T22:18:17Z","title":"Low-complexity Optimal Scheduling over Correlated Fading Channels with ARQ Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1634","kind":"arxiv","version":3},"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:f964c61666a953fdbcd713019f6a4a75396528eafc6587fa8bb7c60ee9c792b1","target":"record","created_at":"2026-05-18T00:57:56Z","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":"e200ca23fdbb1b27ac6505825f4195181406ba66e6c472968262cda84a4f7dc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-06-07T22:18:17Z","title_canon_sha256":"7bb5c68165af5a9c826475c0843481cf449d6fe1912ebd869e18cce3e68eefdd"},"schema_version":"1.0","source":{"id":"1206.1634","kind":"arxiv","version":3}},"canonical_sha256":"bf54501ada895b0c6f4e875536197fc1bde10bdf8be02adefb20daab4446e4b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf54501ada895b0c6f4e875536197fc1bde10bdf8be02adefb20daab4446e4b1","first_computed_at":"2026-05-18T00:57:56.916428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:56.916428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z4EZDeJpDrrSnaaNy3oDWenjUBcamo44ACYnjMMEnICE6Hy0UueDbLMwSorB9m9OOdK98aCt8Bu7As+dwUjgAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:56.916828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.1634","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f964c61666a953fdbcd713019f6a4a75396528eafc6587fa8bb7c60ee9c792b1","sha256:fbe1b3b7c01aedc3f626073a66cca026e819cf35cb2d9542eabf24e828ea9fb3"],"state_sha256":"8bb695dd38516bd956f249b802c3b20fceb435b5a34bcd472c1a7936b50cc162"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bqC3niLraxJURW2Oed7SpGI+zLJzUYaJf3naXD0lN95zyH9ANFyDQ6Up2OJZofCTEZCBcArATVYYpaM3N6H6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T02:21:12.394870Z","bundle_sha256":"83cfafe482417d674ae59306d18f77b4a9bca8606f21bb5baab1bc179ab1cb70"}}