{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T15:30:55Z","timestamp":1775662255827,"version":"3.50.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"U.K. Research and Innovation","award":["EP\/Y036786\/1"],"award-info":[{"award-number":["EP\/Y036786\/1"]}]},{"DOI":"10.13039\/100018693","name":"HORIZON EUROPE Framework Programme","doi-asserted-by":"publisher","award":["101129910"],"award-info":[{"award-number":["101129910"]}],"id":[{"id":"10.13039\/100018693","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/ton.2026.3654114","type":"journal-article","created":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:39:51Z","timestamp":1768423191000},"page":"3303-3318","source":"Crossref","is-referenced-by-count":1,"title":["Incentivizing Multi-Tenant Split Federated Learning for Foundation Models at the Network Edge"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8688-1026","authenticated-orcid":false,"given":"Songyuan","family":"Li","sequence":"first","affiliation":[{"name":"Department of Computer Science, Faculty of Environment, Science and Economy, University of Exeter, Exeter, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5406-8420","authenticated-orcid":false,"given":"Jia","family":"Hu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Environment, Science and Economy, University of Exeter, Exeter, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1395-7314","authenticated-orcid":false,"given":"Geyong","family":"Min","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Environment, Science and Economy, University of Exeter, Exeter, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4154-8529","authenticated-orcid":false,"given":"Haojun","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.24818\/ida-ql\/2019.5"},{"key":"ref2","article-title":"Llama 2: Open foundation and fine-tuned chat models","author":"Touvron","year":"2023","journal-title":"arXiv:2307.09288"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599572"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52733.2024.01297"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3570361.3592505"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20825"},{"key":"ref7","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. 20th Int. Conf. Artif. Intell. Statist.","volume":"54","author":"McMahan"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2018.05.003"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2024.3359040"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2024.3349617"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2024.3489642"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/spe.3252"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2023.3262482"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2023.3342435"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2021.3062708"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2022.3195207"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS57875.2023.00027"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2023.3312208"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2024.3379659"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS60910.2024.00088"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP49622.2020.9259382"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3636534.3690668"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1066"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSUSC.2023.3250487"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2020.3003079"},{"key":"ref26","volume-title":"Microeconomic Theory","author":"Mas-Colell","year":"1995"},{"key":"ref27","first-page":"572:1","article-title":"Achieving linear speedup in non-IID federated bilevel learning","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Huang"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796935"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2699226"},{"key":"ref30","first-page":"1","article-title":"Accelerating federated learning with split learning on locally generated losses","volume-title":"Proc. ICML Workshop Federated Learn. User Privacy Data Confidentiality","author":"Han"},{"key":"ref31","first-page":"14068","article-title":"Group knowledge transfer: Federated learning of large CNNs at the edge","volume-title":"Proc. NIPS","volume":"33","author":"He"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2904348"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796818"},{"key":"ref34","volume-title":"Game Theory and Experimental Games: The Study of Strategic Interaction","author":"Colman","year":"2016"},{"key":"ref35","first-page":"1","article-title":"An image is worth 16\u00d716 words: Transformers for image recognition at scale","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Dosovitskiy"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10599-4_29"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00290"},{"key":"ref38","first-page":"28492","article-title":"Robust speech recognition via large-scale weak supervision","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Radford"},{"key":"ref39","first-page":"4218","article-title":"Common voice: A massively-multilingual speech corpus","volume-title":"Proc. 12th Lang. Resour. Eval. Conf.","author":"Ardila"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.findings-acl.449"},{"key":"ref41","first-page":"1","article-title":"OPTQ: Accurate quantization for generative pre-trained transformers","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Frantar"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.009.2400244"}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/11317935\/11353066.pdf?arnumber=11353066","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T21:16:16Z","timestamp":1771622176000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11353066\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/ton.2026.3654114","relation":{},"ISSN":["2998-4157"],"issn-type":[{"value":"2998-4157","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}