{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:3GZRC4VEXJZDWSRM7MIGNJTVPW","short_pith_number":"pith:3GZRC4VE","schema_version":"1.0","canonical_sha256":"d9b31172a4ba723b4a2cfb1066a6757da9018d4c4e8064fc4f3b35406cfb4756","source":{"kind":"arxiv","id":"2012.01991","version":1},"attestation_state":"computed","paper":{"title":"Dynamic RAN Slicing for Service-Oriented Vehicular Networks via Constrained Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.LG","authors_text":"Conghao Zhou, Mushu Li, Nan Chen, Weihua Zhuang, Wen Wu, Xuemin Shen, Xu Li","submitted_at":"2020-12-03T15:08:38Z","abstract_excerpt":"In this paper, we investigate a radio access network (RAN) slicing problem for Internet of vehicles (IoV) services with different quality of service (QoS) requirements, in which multiple logically-isolated slices are constructed on a common roadside network infrastructure. A dynamic RAN slicing framework is presented to dynamically allocate radio spectrum and computing resource, and distribute computation workloads for the slices. To obtain an optimal RAN slicing policy for accommodating the spatial-temporal dynamics of vehicle traffic density, we first formulate a constrained RAN slicing prob"},"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":"2012.01991","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-03T15:08:38Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"a48f4791fd976cb292e442b85955dff2b1f493f6b04ce7bcb5ca4911ae144264","abstract_canon_sha256":"3929cdd1282373bd88519097387a1f33e51f6024172840d612bdbbabbd104c03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:56:52.118082Z","signature_b64":"adu+Zs1mFBaUmLYvfzC/KxNzue+/RwATMjdaOVwBTOqVqRVM+yfScdrJaj6xdzC9vgbxpNMCJicwOpIu/uSuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9b31172a4ba723b4a2cfb1066a6757da9018d4c4e8064fc4f3b35406cfb4756","last_reissued_at":"2026-07-05T01:56:52.117703Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:56:52.117703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic RAN Slicing for Service-Oriented Vehicular Networks via Constrained Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.LG","authors_text":"Conghao Zhou, Mushu Li, Nan Chen, Weihua Zhuang, Wen Wu, Xuemin Shen, Xu Li","submitted_at":"2020-12-03T15:08:38Z","abstract_excerpt":"In this paper, we investigate a radio access network (RAN) slicing problem for Internet of vehicles (IoV) services with different quality of service (QoS) requirements, in which multiple logically-isolated slices are constructed on a common roadside network infrastructure. A dynamic RAN slicing framework is presented to dynamically allocate radio spectrum and computing resource, and distribute computation workloads for the slices. To obtain an optimal RAN slicing policy for accommodating the spatial-temporal dynamics of vehicle traffic density, we first formulate a constrained RAN slicing prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.01991","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/2012.01991/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":"2012.01991","created_at":"2026-07-05T01:56:52.117759+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.01991v1","created_at":"2026-07-05T01:56:52.117759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.01991","created_at":"2026-07-05T01:56:52.117759+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GZRC4VEXJZD","created_at":"2026-07-05T01:56:52.117759+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GZRC4VEXJZDWSRM","created_at":"2026-07-05T01:56:52.117759+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GZRC4VE","created_at":"2026-07-05T01:56:52.117759+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/3GZRC4VEXJZDWSRM7MIGNJTVPW","json":"https://pith.science/pith/3GZRC4VEXJZDWSRM7MIGNJTVPW.json","graph_json":"https://pith.science/api/pith-number/3GZRC4VEXJZDWSRM7MIGNJTVPW/graph.json","events_json":"https://pith.science/api/pith-number/3GZRC4VEXJZDWSRM7MIGNJTVPW/events.json","paper":"https://pith.science/paper/3GZRC4VE"},"agent_actions":{"view_html":"https://pith.science/pith/3GZRC4VEXJZDWSRM7MIGNJTVPW","download_json":"https://pith.science/pith/3GZRC4VEXJZDWSRM7MIGNJTVPW.json","view_paper":"https://pith.science/paper/3GZRC4VE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.01991&json=true","fetch_graph":"https://pith.science/api/pith-number/3GZRC4VEXJZDWSRM7MIGNJTVPW/graph.json","fetch_events":"https://pith.science/api/pith-number/3GZRC4VEXJZDWSRM7MIGNJTVPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GZRC4VEXJZDWSRM7MIGNJTVPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GZRC4VEXJZDWSRM7MIGNJTVPW/action/storage_attestation","attest_author":"https://pith.science/pith/3GZRC4VEXJZDWSRM7MIGNJTVPW/action/author_attestation","sign_citation":"https://pith.science/pith/3GZRC4VEXJZDWSRM7MIGNJTVPW/action/citation_signature","submit_replication":"https://pith.science/pith/3GZRC4VEXJZDWSRM7MIGNJTVPW/action/replication_record"}},"created_at":"2026-07-05T01:56:52.117759+00:00","updated_at":"2026-07-05T01:56:52.117759+00:00"}