{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T19:44:39Z","timestamp":1770320679779,"version":"3.49.0"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T00:00:00Z","timestamp":1767916800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T00:00:00Z","timestamp":1767916800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,1,9]]},"DOI":"10.1109\/ccnc65079.2026.11366542","type":"proceedings-article","created":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T20:45:15Z","timestamp":1770237915000},"page":"1-4","source":"Crossref","is-referenced-by-count":0,"title":["Interpretable Reinforcement Learning for Load Balancing using Kolmogorov-Arnold Networks"],"prefix":"10.1109","author":[{"given":"Kamal","family":"Singh","sequence":"first","affiliation":[{"name":"Université Jean Monnet Saint-Étienne, CNRS,Inst. d’Optique Graduate School, Lab. Hubert Curien,Saint-Étienne,France,F-42023"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sami","family":"Marouani","sequence":"additional","affiliation":[{"name":"Université Jean Monnet Saint-Étienne, CNRS,Inst. d’Optique Graduate School, Lab. Hubert Curien,Saint-Étienne,France,F-42023"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmad Al","family":"Sheikh","sequence":"additional","affiliation":[{"name":"QoS Design,Toulouse,France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pham","family":"Tran Anh Quang","sequence":"additional","affiliation":[{"name":"Huawei Technologies Ltd.,Paris Research Center,France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amaury","family":"Habrard","sequence":"additional","affiliation":[{"name":"Université Jean Monnet Saint-Étienne, CNRS,Inst. d’Optique Graduate School, Lab. Hubert Curien,Saint-Étienne,France,F-42023"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"KAN: Kolmogorov-arnold networks","author":"Liu","year":"2024"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.17487\/rfc5439"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.17487\/rfc3209"},{"key":"ref4","article-title":"RFC 8986: Segment Routing over IPv6 (SRv6) Network Programming","author":"Filsfils","year":"2021"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159926"},{"key":"ref6","article-title":"A deep-reinforcement learning approach for software-defined networking routing optimization","author":"Stampa","year":"2017"},{"key":"ref7","article-title":"Reward constrained policy optimization","author":"Tessler","year":"2018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS59830.2024.10575399"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2024.107985"},{"key":"ref10","article-title":"Distilling the knowledge in a neural network","author":"Hinton","year":"2015"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM55648.2025.11044492"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405859"},{"key":"ref13","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.23919\/ICCAS63016.2024.10773080"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3345768.3355908"},{"key":"ref16","article-title":"Deep symbolic regression: Recovering mathematical expressions from data via risk-seeking policy gradients","volume-title":"ICLR","author":"Petersen"},{"key":"ref17","article-title":"UCMP Description \u2013 Unequal Cost Multi-Path (UCMP)","year":"2024"}],"event":{"name":"2026 IEEE 23rd Consumer Communications & Networking Conference (CCNC)","location":"Las Vegas, NV, USA","start":{"date-parts":[[2026,1,9]]},"end":{"date-parts":[[2026,1,12]]}},"container-title":["2026 IEEE 23rd Consumer Communications & Networking Conference (CCNC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11366253\/11366254\/11366542.pdf?arnumber=11366542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:20:46Z","timestamp":1770272446000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11366542\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,9]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/ccnc65079.2026.11366542","relation":{},"subject":[],"published":{"date-parts":[[2026,1,9]]}}}