{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GKQF2AF3YX6LJMHIDJHT7PWOGR","short_pith_number":"pith:GKQF2AF3","schema_version":"1.0","canonical_sha256":"32a05d00bbc5fcb4b0e81a4f3fbece346c975098de8b70771ef7882b0194b4ae","source":{"kind":"arxiv","id":"2009.06579","version":1},"attestation_state":"computed","paper":{"title":"Reinforcement Learning for Dynamic Resource Optimization in 5G Radio Access Network Slicing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NI","authors_text":"Tugba Erpek, Yalin E. Sagduyu, Yi Shi","submitted_at":"2020-09-14T17:10:17Z","abstract_excerpt":"The paper presents a reinforcement learning solution to dynamic resource allocation for 5G radio access network slicing. Available communication resources (frequency-time blocks and transmit powers) and computational resources (processor usage) are allocated to stochastic arrivals of network slice requests. Each request arrives with priority (weight), throughput, computational resource, and latency (deadline) requirements, and if feasible, it is served with available communication and computational resources allocated over its requested duration. As each decision of resource allocation makes s"},"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":"2009.06579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2020-09-14T17:10:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4678f32a67a3b8eb29d98f47d1ab49415beda8f281cdb7f212ef46485e8fc5b0","abstract_canon_sha256":"4c8e921d6b59f8fda791beb89b685562271adfa752e4af63e0b1e12e1efe665f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:35:09.741626Z","signature_b64":"seGGBlvZPLvP95w/yClFS1NFKLUw/LtSq2FMaJPRZvw6+sKJknK609XykK+tQTF6lOWFqhQqAJ26+FCvSQ4QCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32a05d00bbc5fcb4b0e81a4f3fbece346c975098de8b70771ef7882b0194b4ae","last_reissued_at":"2026-07-05T01:35:09.741232Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:35:09.741232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reinforcement Learning for Dynamic Resource Optimization in 5G Radio Access Network Slicing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NI","authors_text":"Tugba Erpek, Yalin E. Sagduyu, Yi Shi","submitted_at":"2020-09-14T17:10:17Z","abstract_excerpt":"The paper presents a reinforcement learning solution to dynamic resource allocation for 5G radio access network slicing. Available communication resources (frequency-time blocks and transmit powers) and computational resources (processor usage) are allocated to stochastic arrivals of network slice requests. Each request arrives with priority (weight), throughput, computational resource, and latency (deadline) requirements, and if feasible, it is served with available communication and computational resources allocated over its requested duration. As each decision of resource allocation makes s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.06579","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/2009.06579/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":"2009.06579","created_at":"2026-07-05T01:35:09.741291+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.06579v1","created_at":"2026-07-05T01:35:09.741291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.06579","created_at":"2026-07-05T01:35:09.741291+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKQF2AF3YX6L","created_at":"2026-07-05T01:35:09.741291+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKQF2AF3YX6LJMHI","created_at":"2026-07-05T01:35:09.741291+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKQF2AF3","created_at":"2026-07-05T01:35:09.741291+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/GKQF2AF3YX6LJMHIDJHT7PWOGR","json":"https://pith.science/pith/GKQF2AF3YX6LJMHIDJHT7PWOGR.json","graph_json":"https://pith.science/api/pith-number/GKQF2AF3YX6LJMHIDJHT7PWOGR/graph.json","events_json":"https://pith.science/api/pith-number/GKQF2AF3YX6LJMHIDJHT7PWOGR/events.json","paper":"https://pith.science/paper/GKQF2AF3"},"agent_actions":{"view_html":"https://pith.science/pith/GKQF2AF3YX6LJMHIDJHT7PWOGR","download_json":"https://pith.science/pith/GKQF2AF3YX6LJMHIDJHT7PWOGR.json","view_paper":"https://pith.science/paper/GKQF2AF3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.06579&json=true","fetch_graph":"https://pith.science/api/pith-number/GKQF2AF3YX6LJMHIDJHT7PWOGR/graph.json","fetch_events":"https://pith.science/api/pith-number/GKQF2AF3YX6LJMHIDJHT7PWOGR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKQF2AF3YX6LJMHIDJHT7PWOGR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKQF2AF3YX6LJMHIDJHT7PWOGR/action/storage_attestation","attest_author":"https://pith.science/pith/GKQF2AF3YX6LJMHIDJHT7PWOGR/action/author_attestation","sign_citation":"https://pith.science/pith/GKQF2AF3YX6LJMHIDJHT7PWOGR/action/citation_signature","submit_replication":"https://pith.science/pith/GKQF2AF3YX6LJMHIDJHT7PWOGR/action/replication_record"}},"created_at":"2026-07-05T01:35:09.741291+00:00","updated_at":"2026-07-05T01:35:09.741291+00:00"}