{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DHWNJZDL2UIYO4PGJLY3PQAUWZ","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":"19e72f1c8eb5c182dba708e83e93e5b68e73ff2624acb10eb3cfad315dc650a2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-26T21:33:12Z","title_canon_sha256":"a75e4931fec6772327ffbca7afb7a2965bc00ad0b18ca9f80d080e642f321618"},"schema_version":"1.0","source":{"id":"1404.6688","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6688","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6688v1","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6688","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"DHWNJZDL2UIY","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DHWNJZDL2UIYO4PG","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DHWNJZDL","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:2c8b00bfcb95a9b7bb269ee8342f79d7cc82086662de39a5ca8b0fae4fb87f43","target":"graph","created_at":"2026-05-18T02:53:06Z","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":"Wireless network scheduling and control techniques (e.g., opportunistic scheduling) rely heavily on access to Channel State Information (CSI). However, obtaining this information is costly in terms of bandwidth, time, and power, and could result in large overhead. Therefore, a critical question is how to optimally manage network resources in the absence of such information. To that end, we develop a cross-layer solution for downlink cellular systems with imperfect (and possibly no) CSI at the transmitter. We use rateless codes to resolve channel uncertainty. To keep the decoding complexity low","authors_text":"C. Emre Koksal, Ness B. Shroff, Sung-Ju Lee, Yin Sun","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-26T21:33:12Z","title":"Network Control without CSI using Rateless Codes for Downlink Cellular Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6688","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:a2226fe37415febae0aadc920e891a25775d7c87307e9b389a5012fc052d07bb","target":"record","created_at":"2026-05-18T02:53:06Z","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":"19e72f1c8eb5c182dba708e83e93e5b68e73ff2624acb10eb3cfad315dc650a2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-26T21:33:12Z","title_canon_sha256":"a75e4931fec6772327ffbca7afb7a2965bc00ad0b18ca9f80d080e642f321618"},"schema_version":"1.0","source":{"id":"1404.6688","kind":"arxiv","version":1}},"canonical_sha256":"19ecd4e46bd5118771e64af1b7c014b65f8d8a57ebb9580146b2f999e022348d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19ecd4e46bd5118771e64af1b7c014b65f8d8a57ebb9580146b2f999e022348d","first_computed_at":"2026-05-18T02:53:06.311215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:06.311215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/KBy3f+pKMR0BRpIrIjQ5Qj2kHOmSTnTfmo4xthLnbyvamqixT+Fbx2yIoHA0qPrOAD76YVKcFK97eDTbRV+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:06.311680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6688","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2226fe37415febae0aadc920e891a25775d7c87307e9b389a5012fc052d07bb","sha256:2c8b00bfcb95a9b7bb269ee8342f79d7cc82086662de39a5ca8b0fae4fb87f43"],"state_sha256":"764ca5a4dab590759ed875473a30a9a6b3077cd38faf7718f66fc34908b0c30e"}