{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WDWOOBJ24THCH42CKRZHLOWPQB","short_pith_number":"pith:WDWOOBJ2","schema_version":"1.0","canonical_sha256":"b0ece7053ae4ce23f342547275bacf80577875d20ecbb37550813c02e9029a48","source":{"kind":"arxiv","id":"2201.10281","version":1},"attestation_state":"computed","paper":{"title":"Latency Fairness Optimization on Wireless Networks through Deep Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Villena-Rodr\\'iguez, F. J. Mart\\'in-Vega, G. G\\'omez, M. C. Aguayo-Torres, M. L\\'opez-S\\'anchez","submitted_at":"2022-01-25T12:49:25Z","abstract_excerpt":"In this paper, we propose a novel deep reinforcement learning framework to maximize user fairness in terms of delay. To this end, we devise a new version of the modified largest weighted delay first (M-LWDF) algorithm, which is called $\\beta$-M-LWDF, aiming to fulfill an appropriate balance between user fairness and average delay. This balance is defined as a feasible region on the cumulative distribution function (CDF) of the user delay that allows identifying unfair states, feasible-fair states, and over-fair states. Simulation results reveal that our proposed framework outperforms tradition"},"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":"2201.10281","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2022-01-25T12:49:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6e0a2df612967134e28c0593dd234f8987a02e543f73355ec6ddda5fa41d961f","abstract_canon_sha256":"3e0e56d2b6e5e41e3cada2d840b40b4ee487a4a7f891ac0b75ac45268a35dc36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:51:17.558467Z","signature_b64":"owCAn3KQXBVr9t3CldzwY9FOq+duqMoo+PtDGWRLL6g5xtFSlfiPMlFB8QG42lCb6OHekQKodaH0ECOOynd+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0ece7053ae4ce23f342547275bacf80577875d20ecbb37550813c02e9029a48","last_reissued_at":"2026-07-05T03:51:17.558088Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:51:17.558088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Latency Fairness Optimization on Wireless Networks through Deep Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Villena-Rodr\\'iguez, F. J. Mart\\'in-Vega, G. G\\'omez, M. C. Aguayo-Torres, M. L\\'opez-S\\'anchez","submitted_at":"2022-01-25T12:49:25Z","abstract_excerpt":"In this paper, we propose a novel deep reinforcement learning framework to maximize user fairness in terms of delay. To this end, we devise a new version of the modified largest weighted delay first (M-LWDF) algorithm, which is called $\\beta$-M-LWDF, aiming to fulfill an appropriate balance between user fairness and average delay. This balance is defined as a feasible region on the cumulative distribution function (CDF) of the user delay that allows identifying unfair states, feasible-fair states, and over-fair states. Simulation results reveal that our proposed framework outperforms tradition"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.10281","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.10281/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2201.10281","created_at":"2026-07-05T03:51:17.558142+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.10281v1","created_at":"2026-07-05T03:51:17.558142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.10281","created_at":"2026-07-05T03:51:17.558142+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDWOOBJ24THC","created_at":"2026-07-05T03:51:17.558142+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDWOOBJ24THCH42C","created_at":"2026-07-05T03:51:17.558142+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDWOOBJ2","created_at":"2026-07-05T03:51:17.558142+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/WDWOOBJ24THCH42CKRZHLOWPQB","json":"https://pith.science/pith/WDWOOBJ24THCH42CKRZHLOWPQB.json","graph_json":"https://pith.science/api/pith-number/WDWOOBJ24THCH42CKRZHLOWPQB/graph.json","events_json":"https://pith.science/api/pith-number/WDWOOBJ24THCH42CKRZHLOWPQB/events.json","paper":"https://pith.science/paper/WDWOOBJ2"},"agent_actions":{"view_html":"https://pith.science/pith/WDWOOBJ24THCH42CKRZHLOWPQB","download_json":"https://pith.science/pith/WDWOOBJ24THCH42CKRZHLOWPQB.json","view_paper":"https://pith.science/paper/WDWOOBJ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.10281&json=true","fetch_graph":"https://pith.science/api/pith-number/WDWOOBJ24THCH42CKRZHLOWPQB/graph.json","fetch_events":"https://pith.science/api/pith-number/WDWOOBJ24THCH42CKRZHLOWPQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDWOOBJ24THCH42CKRZHLOWPQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDWOOBJ24THCH42CKRZHLOWPQB/action/storage_attestation","attest_author":"https://pith.science/pith/WDWOOBJ24THCH42CKRZHLOWPQB/action/author_attestation","sign_citation":"https://pith.science/pith/WDWOOBJ24THCH42CKRZHLOWPQB/action/citation_signature","submit_replication":"https://pith.science/pith/WDWOOBJ24THCH42CKRZHLOWPQB/action/replication_record"}},"created_at":"2026-07-05T03:51:17.558142+00:00","updated_at":"2026-07-05T03:51:17.558142+00:00"}