{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T06:10:30Z","timestamp":1756534230400,"version":"3.44.0"},"reference-count":7,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T00:00:00Z","timestamp":1754265600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T00:00:00Z","timestamp":1754265600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,8,4]]},"DOI":"10.1109\/icccn65249.2025.11133923","type":"proceedings-article","created":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T17:39:20Z","timestamp":1756489160000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["An Approximate Solution Using Graph Convolutional Network for a Load Balancing Problem in Communication Networks"],"prefix":"10.1109","author":[{"given":"Shota","family":"Osada","sequence":"first","affiliation":[{"name":"Soka University,Graduate School of Science and Engineering,Tokyo,Japan"}]},{"given":"Norihiko","family":"Shinomiya","sequence":"additional","affiliation":[{"name":"Soka University,Graduate School of Science and Engineering,Tokyo,Japan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC57223.2023.10074451"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/itc-cscc58803.2023.10212604"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCE-Taiwan62264.2024.10674659"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/access.2023.3268212"},{"article-title":"An efficient graph convolutional network technique for the travelling salesman problem","year":"2019","author":"Joshi","key":"ref5"},{"article-title":"Machine Learning for Combinatorial Optimization: a Methodological Tour d\u2019Horizon","year":"2018","author":"Bengio","key":"ref6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3389\/fams.2023.1155356"}],"event":{"name":"2025 34th International Conference on Computer Communications and Networks (ICCCN)","start":{"date-parts":[[2025,8,4]]},"location":"Tokyo, Japan","end":{"date-parts":[[2025,8,7]]}},"container-title":["2025 34th International Conference on Computer Communications and Networks (ICCCN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11133715\/11133717\/11133923.pdf?arnumber=11133923","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T05:38:11Z","timestamp":1756532291000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11133923\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,4]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/icccn65249.2025.11133923","relation":{},"subject":[],"published":{"date-parts":[[2025,8,4]]}}}