{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T16:51:30Z","timestamp":1726851090285},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T00:00:00Z","timestamp":1630800000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T00:00:00Z","timestamp":1630800000000},"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":[[2021,9,5]]},"DOI":"10.1109\/iscc53001.2021.9631546","type":"proceedings-article","created":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T20:46:50Z","timestamp":1639601210000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["An Analysis of Multi-hop Iterative Approximate Byzantine Consensus with Local Communication"],"prefix":"10.1109","author":[{"given":"Matthew","family":"Ding","sequence":"first","affiliation":[{"name":"MIT PRIMES, Westford Academy,Westford,USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.07.010"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2005.42"},{"journal-title":"Reaching approximate byzantine consensus with multi-hop communication","year":"2015","author":"su","key":"ref12"},{"journal-title":"Iterative approximate byzantine consensus in arbitrary directed graphs - part ii Synchronous and asynchronous systems","year":"2012","author":"vaidya","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1006\/aama.2001.0720"},{"journal-title":"primes-project-2021","year":"0","author":"ding","key":"ref15"},{"journal-title":"Network Science","year":"0","author":"barabasi","key":"ref16"},{"journal-title":"Relay protocol for approximate byzantine consensus","year":"2021","author":"ding","key":"ref17"},{"journal-title":"Consensus of multi-agent networks in the presence of adversaries using only local information","year":"2012","author":"leblanc","key":"ref18"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/5925.5931"},{"journal-title":"Matrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs","year":"2012","author":"vaidya","key":"ref6"},{"journal-title":"Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs","year":"2012","author":"vaidya","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_14"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"journal-title":"Essentials of Blockchain Technology","year":"2019","author":"correia","key":"ref2"},{"journal-title":"Asynchronous byzantine agreement in incomplete networks [technical report]","year":"2020","author":"wang","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"}],"event":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2021,9,5]]},"location":"Athens, Greece","end":{"date-parts":[[2021,9,8]]}},"container-title":["2021 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9631377\/9631248\/09631546.pdf?arnumber=9631546","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T22:59:49Z","timestamp":1659481189000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9631546\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,5]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/iscc53001.2021.9631546","relation":{},"subject":[],"published":{"date-parts":[[2021,9,5]]}}}