{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2ENPOVURZIQULZJKB5IKZOIV3J","short_pith_number":"pith:2ENPOVUR","schema_version":"1.0","canonical_sha256":"d11af75691ca2145e52a0f50acb915da5f0f6f67475cb120fba692e658c4cff3","source":{"kind":"arxiv","id":"2502.15918","version":1},"attestation_state":"computed","paper":{"title":"InSlicing: Interpretable Learning-Assisted Network Slice Configuration 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-02-21T20:24:11Z","abstract_excerpt":"Network slicing is a key technology enabling the flexibility and efficiency of 5G networks, offering customized services for diverse applications. However, existing methods face challenges in adapting to dynamic network environments and lack interpretability in performance models. In this paper, we propose a novel interpretable network slice configuration algorithm (\\emph{InSlicing}) in open radio access networks, by integrating Kolmogorov-Arnold Networks (KANs) and hybrid optimization process. On the one hand, we use KANs to approximate and learn the unknown performance function of individual"},"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":"2502.15918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2025-02-21T20:24:11Z","cross_cats_sorted":[],"title_canon_sha256":"1a99cc7507f6a8c3d3ed4112a5457d653ea0a66547f85c7959079f06fcac44c3","abstract_canon_sha256":"874efb762eb39784584f3d79998a32c0dcf3ee0d612c4f3ddd937d4661976cd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:18.391377Z","signature_b64":"wqzC+x6+KgwnatqQrV6qlNnQDbupbGCGrIRtxB8QGZ+lGH/awG9kD6D4+lPXmK3/qduelISDWrTpdOhE0H04DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d11af75691ca2145e52a0f50acb915da5f0f6f67475cb120fba692e658c4cff3","last_reissued_at":"2026-07-05T10:18:18.390936Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:18.390936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"InSlicing: Interpretable Learning-Assisted Network Slice Configuration 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-02-21T20:24:11Z","abstract_excerpt":"Network slicing is a key technology enabling the flexibility and efficiency of 5G networks, offering customized services for diverse applications. However, existing methods face challenges in adapting to dynamic network environments and lack interpretability in performance models. In this paper, we propose a novel interpretable network slice configuration algorithm (\\emph{InSlicing}) in open radio access networks, by integrating Kolmogorov-Arnold Networks (KANs) and hybrid optimization process. On the one hand, we use KANs to approximate and learn the unknown performance function of individual"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.15918","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/2502.15918/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":"2502.15918","created_at":"2026-07-05T10:18:18.390994+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.15918v1","created_at":"2026-07-05T10:18:18.390994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.15918","created_at":"2026-07-05T10:18:18.390994+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ENPOVURZIQU","created_at":"2026-07-05T10:18:18.390994+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ENPOVURZIQULZJK","created_at":"2026-07-05T10:18:18.390994+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ENPOVUR","created_at":"2026-07-05T10:18:18.390994+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07242","citing_title":"DORA: Dynamic O-RAN Resource Allocation for Multi-Slice 5G Networks","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2ENPOVURZIQULZJKB5IKZOIV3J","json":"https://pith.science/pith/2ENPOVURZIQULZJKB5IKZOIV3J.json","graph_json":"https://pith.science/api/pith-number/2ENPOVURZIQULZJKB5IKZOIV3J/graph.json","events_json":"https://pith.science/api/pith-number/2ENPOVURZIQULZJKB5IKZOIV3J/events.json","paper":"https://pith.science/paper/2ENPOVUR"},"agent_actions":{"view_html":"https://pith.science/pith/2ENPOVURZIQULZJKB5IKZOIV3J","download_json":"https://pith.science/pith/2ENPOVURZIQULZJKB5IKZOIV3J.json","view_paper":"https://pith.science/paper/2ENPOVUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.15918&json=true","fetch_graph":"https://pith.science/api/pith-number/2ENPOVURZIQULZJKB5IKZOIV3J/graph.json","fetch_events":"https://pith.science/api/pith-number/2ENPOVURZIQULZJKB5IKZOIV3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ENPOVURZIQULZJKB5IKZOIV3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ENPOVURZIQULZJKB5IKZOIV3J/action/storage_attestation","attest_author":"https://pith.science/pith/2ENPOVURZIQULZJKB5IKZOIV3J/action/author_attestation","sign_citation":"https://pith.science/pith/2ENPOVURZIQULZJKB5IKZOIV3J/action/citation_signature","submit_replication":"https://pith.science/pith/2ENPOVURZIQULZJKB5IKZOIV3J/action/replication_record"}},"created_at":"2026-07-05T10:18:18.390994+00:00","updated_at":"2026-07-05T10:18:18.390994+00:00"}