{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PPPHY5VK5Z6HUYWOEQDG3UOZ3J","short_pith_number":"pith:PPPHY5VK","schema_version":"1.0","canonical_sha256":"7bde7c76aaee7c7a62ce24066dd1d9da61db572db7129b45ad1f0acf999cc19d","source":{"kind":"arxiv","id":"1906.08792","version":1},"attestation_state":"computed","paper":{"title":"When Multiple Agents Learn to Schedule: A Distributed Radio Resource Management Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hosein Nikopour, Jaroslaw Sydir, Meryem Simsek, Navid Naderializadeh, Shilpa Talwar","submitted_at":"2019-06-20T18:06:58Z","abstract_excerpt":"Interference among concurrent transmissions in a wireless network is a key factor limiting the system performance. One way to alleviate this problem is to manage the radio resources in order to maximize either the average or the worst-case performance. However, joint consideration of both metrics is often neglected as they are competing in nature. In this article, a mechanism for radio resource management using multi-agent deep reinforcement learning (RL) is proposed, which strikes the right trade-off between maximizing the average and the $5^{th}$ percentile user throughput. Each transmitter "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1906.08792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-20T18:06:58Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"d2a612d651132952ee78ef225462ec48286df69b1258bcd1042fb3976894efed","abstract_canon_sha256":"dc46713e6fa85896363c94b2708a427252d9db81a7df97195d20f5d077d10cd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:47.883400Z","signature_b64":"PKC/7MnzvuNdUJF+gjYKmUPcZsjgrgct05OO61YEXSO8cGKUWSXxU0IdvFhXGLvf5t5pBNxIFJpDg9NgEfj2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bde7c76aaee7c7a62ce24066dd1d9da61db572db7129b45ad1f0acf999cc19d","last_reissued_at":"2026-05-17T23:42:47.882572Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:47.882572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When Multiple Agents Learn to Schedule: A Distributed Radio Resource Management Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hosein Nikopour, Jaroslaw Sydir, Meryem Simsek, Navid Naderializadeh, Shilpa Talwar","submitted_at":"2019-06-20T18:06:58Z","abstract_excerpt":"Interference among concurrent transmissions in a wireless network is a key factor limiting the system performance. One way to alleviate this problem is to manage the radio resources in order to maximize either the average or the worst-case performance. However, joint consideration of both metrics is often neglected as they are competing in nature. In this article, a mechanism for radio resource management using multi-agent deep reinforcement learning (RL) is proposed, which strikes the right trade-off between maximizing the average and the $5^{th}$ percentile user throughput. Each transmitter "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08792","kind":"arxiv","version":1},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.08792","created_at":"2026-05-17T23:42:47.882702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.08792v1","created_at":"2026-05-17T23:42:47.882702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08792","created_at":"2026-05-17T23:42:47.882702+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPPHY5VK5Z6H","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPPHY5VK5Z6HUYWO","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPPHY5VK","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PPPHY5VK5Z6HUYWOEQDG3UOZ3J","json":"https://pith.science/pith/PPPHY5VK5Z6HUYWOEQDG3UOZ3J.json","graph_json":"https://pith.science/api/pith-number/PPPHY5VK5Z6HUYWOEQDG3UOZ3J/graph.json","events_json":"https://pith.science/api/pith-number/PPPHY5VK5Z6HUYWOEQDG3UOZ3J/events.json","paper":"https://pith.science/paper/PPPHY5VK"},"agent_actions":{"view_html":"https://pith.science/pith/PPPHY5VK5Z6HUYWOEQDG3UOZ3J","download_json":"https://pith.science/pith/PPPHY5VK5Z6HUYWOEQDG3UOZ3J.json","view_paper":"https://pith.science/paper/PPPHY5VK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.08792&json=true","fetch_graph":"https://pith.science/api/pith-number/PPPHY5VK5Z6HUYWOEQDG3UOZ3J/graph.json","fetch_events":"https://pith.science/api/pith-number/PPPHY5VK5Z6HUYWOEQDG3UOZ3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPPHY5VK5Z6HUYWOEQDG3UOZ3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPPHY5VK5Z6HUYWOEQDG3UOZ3J/action/storage_attestation","attest_author":"https://pith.science/pith/PPPHY5VK5Z6HUYWOEQDG3UOZ3J/action/author_attestation","sign_citation":"https://pith.science/pith/PPPHY5VK5Z6HUYWOEQDG3UOZ3J/action/citation_signature","submit_replication":"https://pith.science/pith/PPPHY5VK5Z6HUYWOEQDG3UOZ3J/action/replication_record"}},"created_at":"2026-05-17T23:42:47.882702+00:00","updated_at":"2026-05-17T23:42:47.882702+00:00"}