{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TDD5TRCXMJ2AIBOJWFJM5ZX76I","short_pith_number":"pith:TDD5TRCX","schema_version":"1.0","canonical_sha256":"98c7d9c45762740405c9b152cee6fff213e699b6fe250080ec1ad46ea7667caa","source":{"kind":"arxiv","id":"2501.06943","version":1},"attestation_state":"computed","paper":{"title":"AdaSlicing: Adaptive Online Network Slicing under Continual Network Dynamics in Open Radio Access Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahan Kak, Ming Zhao, Nakjung Choi, Qiang Liu, Yuru Zhang","submitted_at":"2025-01-12T21:40:15Z","abstract_excerpt":"Open radio access networks (e.g., O-RAN) facilitate fine-grained control (e.g., near-RT RIC) in next-generation networks, necessitating advanced AI/ML techniques in handling online resource orchestration in real-time. However, existing approaches can hardly adapt to time-evolving network dynamics in network slicing, leading to significant online performance degradation. In this paper, we propose AdaSlicing, a new adaptive network slicing system, to online learn to orchestrate virtual resources while efficiently adapting to continual network dynamics. The AdaSlicing system includes a new soft-i"},"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":"2501.06943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2025-01-12T21:40:15Z","cross_cats_sorted":[],"title_canon_sha256":"f265532daccbe9505bb9192f4f386519a8021c4572f7d6990decbcd22e1455cb","abstract_canon_sha256":"e6ba09ba635d8c9ed65c06f26abec649ddab3dc437a81c0c2476cce892a447b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:12.812247Z","signature_b64":"ys+u3w/GO6wV5ET5mLyi5Kxzj8PsUJDWhprfzfVwFYDz6l8rUmQxY4RwUI1wndOnbqiQyhxW6C4Yt8G7Kk9YDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98c7d9c45762740405c9b152cee6fff213e699b6fe250080ec1ad46ea7667caa","last_reissued_at":"2026-07-05T10:00:12.811698Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:12.811698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AdaSlicing: Adaptive Online Network Slicing under Continual Network Dynamics in Open Radio Access Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahan Kak, Ming Zhao, Nakjung Choi, Qiang Liu, Yuru Zhang","submitted_at":"2025-01-12T21:40:15Z","abstract_excerpt":"Open radio access networks (e.g., O-RAN) facilitate fine-grained control (e.g., near-RT RIC) in next-generation networks, necessitating advanced AI/ML techniques in handling online resource orchestration in real-time. However, existing approaches can hardly adapt to time-evolving network dynamics in network slicing, leading to significant online performance degradation. In this paper, we propose AdaSlicing, a new adaptive network slicing system, to online learn to orchestrate virtual resources while efficiently adapting to continual network dynamics. The AdaSlicing system includes a new soft-i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.06943","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/2501.06943/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":"2501.06943","created_at":"2026-07-05T10:00:12.811757+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.06943v1","created_at":"2026-07-05T10:00:12.811757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.06943","created_at":"2026-07-05T10:00:12.811757+00:00"},{"alias_kind":"pith_short_12","alias_value":"TDD5TRCXMJ2A","created_at":"2026-07-05T10:00:12.811757+00:00"},{"alias_kind":"pith_short_16","alias_value":"TDD5TRCXMJ2AIBOJ","created_at":"2026-07-05T10:00:12.811757+00:00"},{"alias_kind":"pith_short_8","alias_value":"TDD5TRCX","created_at":"2026-07-05T10:00:12.811757+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.01128","citing_title":"MORPH: Multi-Environment Orchestrated Reinforcement Learning for PRB Handling in O-RAN","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TDD5TRCXMJ2AIBOJWFJM5ZX76I","json":"https://pith.science/pith/TDD5TRCXMJ2AIBOJWFJM5ZX76I.json","graph_json":"https://pith.science/api/pith-number/TDD5TRCXMJ2AIBOJWFJM5ZX76I/graph.json","events_json":"https://pith.science/api/pith-number/TDD5TRCXMJ2AIBOJWFJM5ZX76I/events.json","paper":"https://pith.science/paper/TDD5TRCX"},"agent_actions":{"view_html":"https://pith.science/pith/TDD5TRCXMJ2AIBOJWFJM5ZX76I","download_json":"https://pith.science/pith/TDD5TRCXMJ2AIBOJWFJM5ZX76I.json","view_paper":"https://pith.science/paper/TDD5TRCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.06943&json=true","fetch_graph":"https://pith.science/api/pith-number/TDD5TRCXMJ2AIBOJWFJM5ZX76I/graph.json","fetch_events":"https://pith.science/api/pith-number/TDD5TRCXMJ2AIBOJWFJM5ZX76I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TDD5TRCXMJ2AIBOJWFJM5ZX76I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TDD5TRCXMJ2AIBOJWFJM5ZX76I/action/storage_attestation","attest_author":"https://pith.science/pith/TDD5TRCXMJ2AIBOJWFJM5ZX76I/action/author_attestation","sign_citation":"https://pith.science/pith/TDD5TRCXMJ2AIBOJWFJM5ZX76I/action/citation_signature","submit_replication":"https://pith.science/pith/TDD5TRCXMJ2AIBOJWFJM5ZX76I/action/replication_record"}},"created_at":"2026-07-05T10:00:12.811757+00:00","updated_at":"2026-07-05T10:00:12.811757+00:00"}