{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T07:52:15Z","timestamp":1768290735233,"version":"3.49.0"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["2515982"],"award-info":[{"award-number":["2515982"]}]},{"name":"NSF","award":["2505381"],"award-info":[{"award-number":["2505381"]}]},{"name":"NSF","award":["2348279"],"award-info":[{"award-number":["2348279"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Mobile Comput."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1109\/tmc.2025.3602966","type":"journal-article","created":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T19:24:10Z","timestamp":1756236250000},"page":"1499-1512","source":"Crossref","is-referenced-by-count":0,"title":["Learning the Optimal Path and DNN Partition for Collaborative Edge Inference"],"prefix":"10.1109","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-5781-613X","authenticated-orcid":false,"given":"Yin","family":"Huang","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Florida, Gainesville, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6275-6506","authenticated-orcid":false,"given":"Letian","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Middle Tennessee State University, Murfreesboro, TN, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0515-1647","authenticated-orcid":false,"given":"Jie","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Florida, Gainesville, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2016.2584538"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2017.2761740"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2013.01.010"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.011.2000195"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3093337.3037698"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2019.2947893"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2023.3279271"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737614"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450051"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2946140"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2981338"},{"key":"ref12","first-page":"1","article-title":"Distributing deep neural networks with containerized partitions at the edge","volume-title":"Proc. 2nd USENIX Workshop Hot Top. Edge Comput.","author":"Zhou"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155237"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3042320"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3205410"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00110"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4485"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2858384"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2024.3357874"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/WoWMoM57956.2023.00015"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2024.3486728"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2015.2448520"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2016.2593486"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2018.2881191"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICWS.2019.00025"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737560"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2023.3275851"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2983119"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2020.2985080"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref33","first-page":"23:42.1","article-title":"The best of both worlds: Stochastic and adversarial bandits","volume-title":"Proc. 25th Annu. Conf. Learn. Theory","author":"Bubeck"},{"key":"ref34","first-page":"1287","article-title":"One practical algorithm for both stochastic and adversarial bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Seldin"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188918"},{"key":"ref36","first-page":"1562","article-title":"Better algorithms for stochastic bandits with adversarial corruptions","volume-title":"Proc. 32nd Conf. Learn. Theory","author":"Gupta"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/9.7243"},{"key":"ref38","first-page":"9127","article-title":"An algorithm for stochastic and adversarial bandits with switching costs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Rouyer"},{"key":"ref39","first-page":"15800","article-title":"Better best of both worlds bounds for bandits with switching costs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Amir"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10228900"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISLPED.2019.8824955"},{"key":"ref42","first-page":"2312","article-title":"Improved algorithms for linear stochastic bandits","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Abbasi-Yadkori"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.91"}],"container-title":["IEEE Transactions on Mobile Computing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/7755\/11345503\/11141772-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7755\/11345503\/11141772.pdf?arnumber=11141772","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T23:59:32Z","timestamp":1768262372000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11141772\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":44,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tmc.2025.3602966","relation":{},"ISSN":["1536-1233","1558-0660","2161-9875"],"issn-type":[{"value":"1536-1233","type":"print"},{"value":"1558-0660","type":"electronic"},{"value":"2161-9875","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2]]}}}