{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QZPKNARSBB4TWSVFGJ4CIZZ6NF","short_pith_number":"pith:QZPKNARS","canonical_record":{"source":{"id":"1203.5362","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-23T21:48:10Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3905cfa0b0348d9c128dc218b03ded6e9053d7ddf710a85a85b5bad6b0e30571","abstract_canon_sha256":"fc114846286ca9ae39dff01e6ef697444cded3d8d424757d9ce49d7b6bcd89ba"},"schema_version":"1.0"},"canonical_sha256":"865ea6823208793b4aa5327824673e6978b1e1ca9e6c359b01ae6fa352f69cf9","source":{"kind":"arxiv","id":"1203.5362","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5362","created_at":"2026-05-18T03:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5362v2","created_at":"2026-05-18T03:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5362","created_at":"2026-05-18T03:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"QZPKNARSBB4T","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QZPKNARSBB4TWSVF","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QZPKNARS","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QZPKNARSBB4TWSVFGJ4CIZZ6NF","target":"record","payload":{"canonical_record":{"source":{"id":"1203.5362","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-23T21:48:10Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"3905cfa0b0348d9c128dc218b03ded6e9053d7ddf710a85a85b5bad6b0e30571","abstract_canon_sha256":"fc114846286ca9ae39dff01e6ef697444cded3d8d424757d9ce49d7b6bcd89ba"},"schema_version":"1.0"},"canonical_sha256":"865ea6823208793b4aa5327824673e6978b1e1ca9e6c359b01ae6fa352f69cf9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:22.627207Z","signature_b64":"zW65Mb+7jv41zsoN8nend7bS59l9RFPlEzMFSemE0Xe2J5PTgBhrPi9oL/2wWUl/U3Qa8SZCcnuE1atYHs9SCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"865ea6823208793b4aa5327824673e6978b1e1ca9e6c359b01ae6fa352f69cf9","last_reissued_at":"2026-05-18T03:19:22.626376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:22.626376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.5362","source_version":2,"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-18T03:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2B8qp0nYp9I+E7GThvdxrQQ+DN+UlviccvZi7zs7W16ccdKUc5oQF5a3KJsid0zdsPyCcR8KcurlnZ/IrGInCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:21:25.168129Z"},"content_sha256":"7134bd82d3ea38af6c588105be9cd4bb483a7c60a5bb043beb6f0478023b4100","schema_version":"1.0","event_id":"sha256:7134bd82d3ea38af6c588105be9cd4bb483a7c60a5bb043beb6f0478023b4100"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QZPKNARSBB4TWSVFGJ4CIZZ6NF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput Optimal Scheduling with Dynamic Channel Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Holger Boche, Mehmet Karaca, Ozgur Ercetin, Tansu Alpcan, Yunus Sarikaya","submitted_at":"2012-03-23T21:48:10Z","abstract_excerpt":"It is well known that opportunistic scheduling algorithms are throughput optimal under full knowledge of channel and network conditions. However, these algorithms achieve a hypothetical achievable rate region which does not take into account the overhead associated with channel probing and feedback required to obtain the full channel state information at every slot. We adopt a channel probing model where $\\beta$ fraction of time slot is consumed for acquiring the channel state information (CSI) of a single channel. In this work, we design a joint scheduling and channel probing algorithm named "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5362","kind":"arxiv","version":2},"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-18T03:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q4DEFYPSTQ9AB/DqfBcb748cpLr7qtN21jaPJTNJh9UgGy4FzWyAQah7W2JCCfWotkn6eXHzb0wtIEQ3iBujBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:21:25.168479Z"},"content_sha256":"dd8603e63a060c260108dc27f84c26be50fb9242b233e6638e296af9c6e9f2c7","schema_version":"1.0","event_id":"sha256:dd8603e63a060c260108dc27f84c26be50fb9242b233e6638e296af9c6e9f2c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZPKNARSBB4TWSVFGJ4CIZZ6NF/bundle.json","state_url":"https://pith.science/pith/QZPKNARSBB4TWSVFGJ4CIZZ6NF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZPKNARSBB4TWSVFGJ4CIZZ6NF/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-20T04:21:25Z","links":{"resolver":"https://pith.science/pith/QZPKNARSBB4TWSVFGJ4CIZZ6NF","bundle":"https://pith.science/pith/QZPKNARSBB4TWSVFGJ4CIZZ6NF/bundle.json","state":"https://pith.science/pith/QZPKNARSBB4TWSVFGJ4CIZZ6NF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZPKNARSBB4TWSVFGJ4CIZZ6NF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QZPKNARSBB4TWSVFGJ4CIZZ6NF","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":"fc114846286ca9ae39dff01e6ef697444cded3d8d424757d9ce49d7b6bcd89ba","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-23T21:48:10Z","title_canon_sha256":"3905cfa0b0348d9c128dc218b03ded6e9053d7ddf710a85a85b5bad6b0e30571"},"schema_version":"1.0","source":{"id":"1203.5362","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5362","created_at":"2026-05-18T03:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5362v2","created_at":"2026-05-18T03:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5362","created_at":"2026-05-18T03:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"QZPKNARSBB4T","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QZPKNARSBB4TWSVF","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QZPKNARS","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:dd8603e63a060c260108dc27f84c26be50fb9242b233e6638e296af9c6e9f2c7","target":"graph","created_at":"2026-05-18T03:19:22Z","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":"It is well known that opportunistic scheduling algorithms are throughput optimal under full knowledge of channel and network conditions. However, these algorithms achieve a hypothetical achievable rate region which does not take into account the overhead associated with channel probing and feedback required to obtain the full channel state information at every slot. We adopt a channel probing model where $\\beta$ fraction of time slot is consumed for acquiring the channel state information (CSI) of a single channel. In this work, we design a joint scheduling and channel probing algorithm named ","authors_text":"Holger Boche, Mehmet Karaca, Ozgur Ercetin, Tansu Alpcan, Yunus Sarikaya","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-23T21:48:10Z","title":"Throughput Optimal Scheduling with Dynamic Channel Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5362","kind":"arxiv","version":2},"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:7134bd82d3ea38af6c588105be9cd4bb483a7c60a5bb043beb6f0478023b4100","target":"record","created_at":"2026-05-18T03:19:22Z","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":"fc114846286ca9ae39dff01e6ef697444cded3d8d424757d9ce49d7b6bcd89ba","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-23T21:48:10Z","title_canon_sha256":"3905cfa0b0348d9c128dc218b03ded6e9053d7ddf710a85a85b5bad6b0e30571"},"schema_version":"1.0","source":{"id":"1203.5362","kind":"arxiv","version":2}},"canonical_sha256":"865ea6823208793b4aa5327824673e6978b1e1ca9e6c359b01ae6fa352f69cf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"865ea6823208793b4aa5327824673e6978b1e1ca9e6c359b01ae6fa352f69cf9","first_computed_at":"2026-05-18T03:19:22.626376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:22.626376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zW65Mb+7jv41zsoN8nend7bS59l9RFPlEzMFSemE0Xe2J5PTgBhrPi9oL/2wWUl/U3Qa8SZCcnuE1atYHs9SCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:22.627207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.5362","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7134bd82d3ea38af6c588105be9cd4bb483a7c60a5bb043beb6f0478023b4100","sha256:dd8603e63a060c260108dc27f84c26be50fb9242b233e6638e296af9c6e9f2c7"],"state_sha256":"37d62c4895e1f6a214c04dfa05d7ca8113af19efbbb8c6c9bdfa821ebc3c0fcb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uvrfpGkMiagbtfQLeR6lIcVQtPl7BO0Uf9bU5NXrMklhF36c+OTnCa7SxU6jSlODISNba7JjHlW/KsH65FqUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T04:21:25.170417Z","bundle_sha256":"37331781925e72e58cc0320bf0a879e0301930c4fd5be603b17fcd420e538876"}}