{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SGLWGOSJSAI7RUIR5SES4MGHRA","short_pith_number":"pith:SGLWGOSJ","schema_version":"1.0","canonical_sha256":"9197633a499011f8d111ec892e30c7883a05b23c7b8c205246d842cfe8b58e45","source":{"kind":"arxiv","id":"1908.03242","version":1},"attestation_state":"computed","paper":{"title":"Deep Reinforcement Learning for Network Slicing with Heterogeneous Resource Requirements and Time Varying Traffic Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anwar Walid, Jaehoon Koo, Muntasir Raihan Rahman, Veena B. Mendiratta","submitted_at":"2019-08-08T19:28:37Z","abstract_excerpt":"Efficient network slicing is vital to deal with the highly variable and dynamic characteristics of network traffic generated by a varied range of applications. The problem is made more challenging with the advent of new technologies such as 5G and new architectures such as SDN and NFV. Network slicing addresses a challenging dynamic network resource allocation problem where a single network infrastructure is divided into (virtual) multiple slices to meet the demands of different users with varying requirements, the main challenges being --- the traffic arrival characteristics and the job resou"},"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":"1908.03242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-08-08T19:28:37Z","cross_cats_sorted":[],"title_canon_sha256":"26de60a108c18ed2e0a5d768325280e4a3c2434f259e792b1be88e4218c9c347","abstract_canon_sha256":"5c4c3078405df3dda1bffe8cd4365fb0bc4751057300ef2f371871a2bb28de0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:37.666875Z","signature_b64":"S6tI22Chky9FngbnQwOXxyJ/EdeQdHEbT4wJ2kTvsEzXrvjpKaGumheXJhhl3lpibRS7adzT57n5JCBPpqrOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9197633a499011f8d111ec892e30c7883a05b23c7b8c205246d842cfe8b58e45","last_reissued_at":"2026-07-04T23:52:37.666490Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:37.666490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Reinforcement Learning for Network Slicing with Heterogeneous Resource Requirements and Time Varying Traffic Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anwar Walid, Jaehoon Koo, Muntasir Raihan Rahman, Veena B. Mendiratta","submitted_at":"2019-08-08T19:28:37Z","abstract_excerpt":"Efficient network slicing is vital to deal with the highly variable and dynamic characteristics of network traffic generated by a varied range of applications. The problem is made more challenging with the advent of new technologies such as 5G and new architectures such as SDN and NFV. Network slicing addresses a challenging dynamic network resource allocation problem where a single network infrastructure is divided into (virtual) multiple slices to meet the demands of different users with varying requirements, the main challenges being --- the traffic arrival characteristics and the job resou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03242","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/1908.03242/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":"1908.03242","created_at":"2026-07-04T23:52:37.666545+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03242v1","created_at":"2026-07-04T23:52:37.666545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03242","created_at":"2026-07-04T23:52:37.666545+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGLWGOSJSAI7","created_at":"2026-07-04T23:52:37.666545+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGLWGOSJSAI7RUIR","created_at":"2026-07-04T23:52:37.666545+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGLWGOSJ","created_at":"2026-07-04T23:52:37.666545+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/SGLWGOSJSAI7RUIR5SES4MGHRA","json":"https://pith.science/pith/SGLWGOSJSAI7RUIR5SES4MGHRA.json","graph_json":"https://pith.science/api/pith-number/SGLWGOSJSAI7RUIR5SES4MGHRA/graph.json","events_json":"https://pith.science/api/pith-number/SGLWGOSJSAI7RUIR5SES4MGHRA/events.json","paper":"https://pith.science/paper/SGLWGOSJ"},"agent_actions":{"view_html":"https://pith.science/pith/SGLWGOSJSAI7RUIR5SES4MGHRA","download_json":"https://pith.science/pith/SGLWGOSJSAI7RUIR5SES4MGHRA.json","view_paper":"https://pith.science/paper/SGLWGOSJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03242&json=true","fetch_graph":"https://pith.science/api/pith-number/SGLWGOSJSAI7RUIR5SES4MGHRA/graph.json","fetch_events":"https://pith.science/api/pith-number/SGLWGOSJSAI7RUIR5SES4MGHRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGLWGOSJSAI7RUIR5SES4MGHRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGLWGOSJSAI7RUIR5SES4MGHRA/action/storage_attestation","attest_author":"https://pith.science/pith/SGLWGOSJSAI7RUIR5SES4MGHRA/action/author_attestation","sign_citation":"https://pith.science/pith/SGLWGOSJSAI7RUIR5SES4MGHRA/action/citation_signature","submit_replication":"https://pith.science/pith/SGLWGOSJSAI7RUIR5SES4MGHRA/action/replication_record"}},"created_at":"2026-07-04T23:52:37.666545+00:00","updated_at":"2026-07-04T23:52:37.666545+00:00"}