{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VQUE7UP7OQBKW2EG5MV6F3ALN6","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":"5e7f187a167d308a3fe82e01c6841b3e9f03e31f64d07eba52b9535df4ebe6f8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-22T03:08:12Z","title_canon_sha256":"1c5e0b8dda273675b97be25fc4f85679a4ec9a89981b5ac5f702af97f837c569"},"schema_version":"1.0","source":{"id":"1901.07159","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07159","created_at":"2026-05-17T23:55:47Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07159v1","created_at":"2026-05-17T23:55:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07159","created_at":"2026-05-17T23:55:47Z"},{"alias_kind":"pith_short_12","alias_value":"VQUE7UP7OQBK","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VQUE7UP7OQBKW2EG","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VQUE7UP7","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:1b5aac3342ae929eda8b68fc50313bd79a713d336b7d7e1d1b1d5e5da9b9d150","target":"graph","created_at":"2026-05-17T23:55:47Z","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":"The model-based power allocation algorithm has been investigated for decades, but it requires the mathematical models to be analytically tractable and it usually has high computational complexity. Recently, the data-driven model-free machine learning enabled approaches are being rapidly developed to obtain near-optimal performance with affordable computational complexity, and deep reinforcement learning (DRL) is regarded as of great potential for future intelligent networks. In this paper, the DRL approaches are considered for power control in multi-user wireless communication cellular network","authors_text":"Fan Meng, Julian Cheng, Lenan Wu, Peng Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-22T03:08:12Z","title":"Power Allocation in Multi-User Cellular Networks: Deep Reinforcement Learning Approaches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07159","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:5118bad2b56114631a5b00e70340be802b57e4a5eaa776ae848a47130f792e45","target":"record","created_at":"2026-05-17T23:55:47Z","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":"5e7f187a167d308a3fe82e01c6841b3e9f03e31f64d07eba52b9535df4ebe6f8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-22T03:08:12Z","title_canon_sha256":"1c5e0b8dda273675b97be25fc4f85679a4ec9a89981b5ac5f702af97f837c569"},"schema_version":"1.0","source":{"id":"1901.07159","kind":"arxiv","version":1}},"canonical_sha256":"ac284fd1ff7402ab6886eb2be2ec0b6fa0166bea270988a855871474fb6c1e7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac284fd1ff7402ab6886eb2be2ec0b6fa0166bea270988a855871474fb6c1e7f","first_computed_at":"2026-05-17T23:55:47.950725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:47.950725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"35y1ME0ozpwx8GjVjVpHnSn6oaekCaMyABuWz7m4s+s4Yokh9fvtjND4P6444xJxrP0XiBvxz/euUWQGJBv/Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:47.951382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07159","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5118bad2b56114631a5b00e70340be802b57e4a5eaa776ae848a47130f792e45","sha256:1b5aac3342ae929eda8b68fc50313bd79a713d336b7d7e1d1b1d5e5da9b9d150"],"state_sha256":"8d54cf5e1131f8a20abc034235e591f5d97e499a725ae1344136d3b04ea7a979"}