{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WV5YGMGT4XMCT53YBPH72QX3SO","short_pith_number":"pith:WV5YGMGT","schema_version":"1.0","canonical_sha256":"b57b8330d3e5d829f7780bcffd42fb93971fc23ac78eb7938febe28f859fa370","source":{"kind":"arxiv","id":"1811.02341","version":2},"attestation_state":"computed","paper":{"title":"Risk-Sensitive Reinforcement Learning for URLLC Traffic in Wireless Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"M\\'erouane Debbah, Mohamad Assaad, Nesrine Ben-Khalifa","submitted_at":"2018-11-06T13:20:37Z","abstract_excerpt":"In this paper, we study the problem of dynamic channel allocation for URLLC traffic in a multi-user multi-channel wireless network where urgent packets have to be successfully transmitted in a timely manner. We formulate the problem as a finite-horizon Markov Decision Process with a stochastic constraint related to the QoS requirement, defined as the packet loss rate for each user. We propose a novel weighted formulation that takes into account both the total expected reward (number of successfully transmitted packets) and the risk which we define as the QoS requirement violation. First, we us"},"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":"1811.02341","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2018-11-06T13:20:37Z","cross_cats_sorted":[],"title_canon_sha256":"472b8d59cd73ff2d58419af1c425f023450390d1b00519b73e23d904b3babe5c","abstract_canon_sha256":"94dfff58c854c84af97740137fd0dab0b4ba23bfead37db90d7b486d560ae2ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:21.372528Z","signature_b64":"iFTY9Ziz+N7Mpb75t9i5FO3Fo3ti2w0IQ7mo4vk145V+oBso03fCjpunCYlIA5hNOuoDPALZAz5aSJtac9jeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b57b8330d3e5d829f7780bcffd42fb93971fc23ac78eb7938febe28f859fa370","last_reissued_at":"2026-05-18T00:01:21.371904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:21.371904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Risk-Sensitive Reinforcement Learning for URLLC Traffic in Wireless Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"M\\'erouane Debbah, Mohamad Assaad, Nesrine Ben-Khalifa","submitted_at":"2018-11-06T13:20:37Z","abstract_excerpt":"In this paper, we study the problem of dynamic channel allocation for URLLC traffic in a multi-user multi-channel wireless network where urgent packets have to be successfully transmitted in a timely manner. We formulate the problem as a finite-horizon Markov Decision Process with a stochastic constraint related to the QoS requirement, defined as the packet loss rate for each user. We propose a novel weighted formulation that takes into account both the total expected reward (number of successfully transmitted packets) and the risk which we define as the QoS requirement violation. First, we us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02341","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.02341","created_at":"2026-05-18T00:01:21.372014+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02341v2","created_at":"2026-05-18T00:01:21.372014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02341","created_at":"2026-05-18T00:01:21.372014+00:00"},{"alias_kind":"pith_short_12","alias_value":"WV5YGMGT4XMC","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WV5YGMGT4XMCT53Y","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WV5YGMGT","created_at":"2026-05-18T12:33:01.666342+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/WV5YGMGT4XMCT53YBPH72QX3SO","json":"https://pith.science/pith/WV5YGMGT4XMCT53YBPH72QX3SO.json","graph_json":"https://pith.science/api/pith-number/WV5YGMGT4XMCT53YBPH72QX3SO/graph.json","events_json":"https://pith.science/api/pith-number/WV5YGMGT4XMCT53YBPH72QX3SO/events.json","paper":"https://pith.science/paper/WV5YGMGT"},"agent_actions":{"view_html":"https://pith.science/pith/WV5YGMGT4XMCT53YBPH72QX3SO","download_json":"https://pith.science/pith/WV5YGMGT4XMCT53YBPH72QX3SO.json","view_paper":"https://pith.science/paper/WV5YGMGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02341&json=true","fetch_graph":"https://pith.science/api/pith-number/WV5YGMGT4XMCT53YBPH72QX3SO/graph.json","fetch_events":"https://pith.science/api/pith-number/WV5YGMGT4XMCT53YBPH72QX3SO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WV5YGMGT4XMCT53YBPH72QX3SO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WV5YGMGT4XMCT53YBPH72QX3SO/action/storage_attestation","attest_author":"https://pith.science/pith/WV5YGMGT4XMCT53YBPH72QX3SO/action/author_attestation","sign_citation":"https://pith.science/pith/WV5YGMGT4XMCT53YBPH72QX3SO/action/citation_signature","submit_replication":"https://pith.science/pith/WV5YGMGT4XMCT53YBPH72QX3SO/action/replication_record"}},"created_at":"2026-05-18T00:01:21.372014+00:00","updated_at":"2026-05-18T00:01:21.372014+00:00"}