{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CKGXRS2ETGBLWMGDUTUSSHT7NA","short_pith_number":"pith:CKGXRS2E","schema_version":"1.0","canonical_sha256":"128d78cb449982bb30c3a4e9291e7f682aebd145fc773a2a1c6f8e0886b4caa4","source":{"kind":"arxiv","id":"1902.09696","version":1},"attestation_state":"computed","paper":{"title":"Optimal and Fast Real-time Resources Slicing with Deep Dueling Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NI","authors_text":"Diep N. Nguyen, Dinh Thai Hoang, Eryk Dutkiewicz, Nguyen Van Huynh","submitted_at":"2019-02-26T01:46:01Z","abstract_excerpt":"Effective network slicing requires an infrastructure/network provider to deal with the uncertain demand and real-time dynamics of network resource requests. Another challenge is the combinatorial optimization of numerous resources, e.g., radio, computing, and storage. This article develops an optimal and fast real-time resource slicing framework that maximizes the long-term return of the network provider while taking into account the uncertainty of resource demand from tenants. Specifically, we first propose a novel system model which enables the network provider to effectively slice various t"},"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":"1902.09696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2019-02-26T01:46:01Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2cea437e097fc2fb536136659be7fa544a28c86ce68543a02a5a9970c3a33aac","abstract_canon_sha256":"173d982b4335890f6c4645a61aef396e72dbff14bda28051a2ad14e07e645a19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:35.557961Z","signature_b64":"IHPEwDkwB8MEI7G0dLD/yeAHRI2OAZzCa++XCurjHXPYZAx3H4YTUIEakc5ooO5qc1VZ/vfAvLmjnx1Csp9aCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"128d78cb449982bb30c3a4e9291e7f682aebd145fc773a2a1c6f8e0886b4caa4","last_reissued_at":"2026-05-17T23:52:35.557488Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:35.557488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal and Fast Real-time Resources Slicing with Deep Dueling Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NI","authors_text":"Diep N. Nguyen, Dinh Thai Hoang, Eryk Dutkiewicz, Nguyen Van Huynh","submitted_at":"2019-02-26T01:46:01Z","abstract_excerpt":"Effective network slicing requires an infrastructure/network provider to deal with the uncertain demand and real-time dynamics of network resource requests. Another challenge is the combinatorial optimization of numerous resources, e.g., radio, computing, and storage. This article develops an optimal and fast real-time resource slicing framework that maximizes the long-term return of the network provider while taking into account the uncertainty of resource demand from tenants. Specifically, we first propose a novel system model which enables the network provider to effectively slice various t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09696","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":"1902.09696","created_at":"2026-05-17T23:52:35.557565+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.09696v1","created_at":"2026-05-17T23:52:35.557565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09696","created_at":"2026-05-17T23:52:35.557565+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKGXRS2ETGBL","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKGXRS2ETGBLWMGD","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKGXRS2E","created_at":"2026-05-18T12:33:15.570797+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/CKGXRS2ETGBLWMGDUTUSSHT7NA","json":"https://pith.science/pith/CKGXRS2ETGBLWMGDUTUSSHT7NA.json","graph_json":"https://pith.science/api/pith-number/CKGXRS2ETGBLWMGDUTUSSHT7NA/graph.json","events_json":"https://pith.science/api/pith-number/CKGXRS2ETGBLWMGDUTUSSHT7NA/events.json","paper":"https://pith.science/paper/CKGXRS2E"},"agent_actions":{"view_html":"https://pith.science/pith/CKGXRS2ETGBLWMGDUTUSSHT7NA","download_json":"https://pith.science/pith/CKGXRS2ETGBLWMGDUTUSSHT7NA.json","view_paper":"https://pith.science/paper/CKGXRS2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.09696&json=true","fetch_graph":"https://pith.science/api/pith-number/CKGXRS2ETGBLWMGDUTUSSHT7NA/graph.json","fetch_events":"https://pith.science/api/pith-number/CKGXRS2ETGBLWMGDUTUSSHT7NA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKGXRS2ETGBLWMGDUTUSSHT7NA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKGXRS2ETGBLWMGDUTUSSHT7NA/action/storage_attestation","attest_author":"https://pith.science/pith/CKGXRS2ETGBLWMGDUTUSSHT7NA/action/author_attestation","sign_citation":"https://pith.science/pith/CKGXRS2ETGBLWMGDUTUSSHT7NA/action/citation_signature","submit_replication":"https://pith.science/pith/CKGXRS2ETGBLWMGDUTUSSHT7NA/action/replication_record"}},"created_at":"2026-05-17T23:52:35.557565+00:00","updated_at":"2026-05-17T23:52:35.557565+00:00"}