{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T19:54:57Z","timestamp":1770321297549,"version":"3.49.0"},"reference-count":10,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,1,9]]},"DOI":"10.1109\/ccnc65079.2026.11366559","type":"proceedings-article","created":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T20:45:15Z","timestamp":1770237915000},"page":"1-2","source":"Crossref","is-referenced-by-count":0,"title":["FaithFL: Trust-Weighted Federated Learning under Byzantine Threats for Resource-Constrained IoT"],"prefix":"10.1109","author":[{"given":"Ravi","family":"Gupta","sequence":"first","affiliation":[{"name":"AMD Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guneet","family":"Bhatia","sequence":"additional","affiliation":[{"name":"Siemens Energy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul Pratap","family":"Singh","sequence":"additional","affiliation":[{"name":"Oracle Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proceedings of AISTATS","author":"McMahan"},{"key":"ref2","article-title":"Federated optimization in heterogeneous networks","volume-title":"Proceedings of MLSys","author":"Li"},{"key":"ref3","first-page":"119","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume-title":"Proceedings of NeurIPS","author":"Blanchard"},{"key":"ref4","first-page":"1415","article-title":"FLAME: Taming backdoors in federated learning","volume-title":"Proceedings of USENIX Security Symposium","author":"Nguyen"},{"key":"ref5","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","volume-title":"Proceedings of NeurIPS","author":"Alistarh"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref8","first-page":"5132","article-title":"SCAFFOLD: Stochastic controlled averaging for federated learning","volume-title":"Proceedings of ICML","author":"Karimireddy"},{"key":"ref9","first-page":"5650","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proceedings of ICML","author":"Yin"},{"key":"ref10","first-page":"16070","article-title":"Attack of the tails: Yes, you really can backdoor federated learning","volume-title":"Proceedings of NeurIPS","author":"Wang"}],"event":{"name":"2026 IEEE 23rd Consumer Communications &amp; 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 &amp;amp; Networking Conference (CCNC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11366253\/11366254\/11366559.pdf?arnumber=11366559","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:36:20Z","timestamp":1770273380000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11366559\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,9]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/ccnc65079.2026.11366559","relation":{},"subject":[],"published":{"date-parts":[[2026,1,9]]}}}