{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VHZKW3RJNFM4WXJSAV7HBLYZXH","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":"38ba045d3ccb05412267065c16e77eb302dc10c2ce6be6e2418679bdcf025c61","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-29T21:52:44Z","title_canon_sha256":"9dcf022ef14b13dde1f2c063e3168ea7b802b95aa0d8c347b8a0cce885fd021b"},"schema_version":"1.0","source":{"id":"1011.0027","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0027","created_at":"2026-05-18T02:04:54Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0027v3","created_at":"2026-05-18T02:04:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0027","created_at":"2026-05-18T02:04:54Z"},{"alias_kind":"pith_short_12","alias_value":"VHZKW3RJNFM4","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VHZKW3RJNFM4WXJS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VHZKW3RJ","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:f87a0dee8d80adc88a535f075cbf797c9831067467267717e1abc4f0271b54a3","target":"graph","created_at":"2026-05-18T02:04:54Z","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 consider the problem of simultaneous user-scheduling, power-allocation, and rate-selection in an OFDMA downlink, with the goal of maximizing expected sum-utility under a sum-power constraint. In doing so, we consider a family of generic goodput-based utilities that facilitate, e.g., throughput-based pricing, quality-of-service enforcement, and/or the treatment of practical modulation-and-coding schemes (MCS). Since perfect knowledge of channel state information (CSI) may be difficult to maintain at the base-station, especially when the number of users and/or subchannels is large, we conside","authors_text":"C. Emre Koksal, Mohamad Assaad, Philip Schniter, Rohit Aggarwal","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-29T21:52:44Z","title":"Joint Scheduling and Resource Allocation in the OFDMA Downlink: Utility Maximization under Imperfect Channel-State Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0027","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:ecdef08db3c4b9fbc7fe935b9f2ec9276e4ae4ebc994298a9c61b639c871b7f5","target":"record","created_at":"2026-05-18T02:04:54Z","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":"38ba045d3ccb05412267065c16e77eb302dc10c2ce6be6e2418679bdcf025c61","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-29T21:52:44Z","title_canon_sha256":"9dcf022ef14b13dde1f2c063e3168ea7b802b95aa0d8c347b8a0cce885fd021b"},"schema_version":"1.0","source":{"id":"1011.0027","kind":"arxiv","version":3}},"canonical_sha256":"a9f2ab6e296959cb5d32057e70af19b9cd160a473e62802dc162b8e68ca4c228","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9f2ab6e296959cb5d32057e70af19b9cd160a473e62802dc162b8e68ca4c228","first_computed_at":"2026-05-18T02:04:54.752236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:04:54.752236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"arO6kjKm+1Cf27Ysqj2H0ropW1gs/LNrM6XYhdnTZeh6Mc1fvuu8mUbuONomP+4k9vt5YFKIQWupNwlwT/guDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:04:54.752829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.0027","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecdef08db3c4b9fbc7fe935b9f2ec9276e4ae4ebc994298a9c61b639c871b7f5","sha256:f87a0dee8d80adc88a535f075cbf797c9831067467267717e1abc4f0271b54a3"],"state_sha256":"40d44fbfcfb37f59b61808834526263bd4b01670a797b58d5d0ee18cd2d058e0"}