{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T04:01:51Z","timestamp":1747368111493,"version":"3.40.5"},"reference-count":4,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T00:00:00Z","timestamp":1736899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T00:00:00Z","timestamp":1736899200000},"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,1,15]]},"DOI":"10.1109\/icoin63865.2025.10993151","type":"proceedings-article","created":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T17:30:44Z","timestamp":1747243844000},"page":"57-60","source":"Crossref","is-referenced-by-count":0,"title":["Exploration Efficiency of Random Walks in Dynamic Graph"],"prefix":"10.1109","author":[{"given":"Daiki","family":"Nakagawa","sequence":"first","affiliation":[{"name":"Kwansei Gakuin University,School of Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryotaro","family":"Matsuo","sequence":"additional","affiliation":[{"name":"Fukuoka University,Faculty of Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"Ohsaki","sequence":"additional","affiliation":[{"name":"Kwansei Gakuin University,School of Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1609\/aaai.v34i04.5936"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1016\/j.physa.2022.127029"},{"key":"ref3","first-page":"121","article-title":"How to explore a fast-changing world","volume-title":"Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP)","author":"Avin"},{"key":"ref4","first-page":"93","article-title":"Random walks on dynamic graphs: Mixing times, hitting times, and return probabilities","volume-title":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)","volume":"132","author":"Sauerwald"}],"event":{"name":"2025 International Conference on Information Networking (ICOIN)","start":{"date-parts":[[2025,1,15]]},"location":"Chiang Mai, Thailand","end":{"date-parts":[[2025,1,17]]}},"container-title":["2025 International Conference on Information Networking (ICOIN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10992637\/10992586\/10993151.pdf?arnumber=10993151","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T04:34:46Z","timestamp":1747283686000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10993151\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,15]]},"references-count":4,"URL":"https:\/\/doi.org\/10.1109\/icoin63865.2025.10993151","relation":{},"subject":[],"published":{"date-parts":[[2025,1,15]]}}}