{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:23:44Z","timestamp":1766067824054,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T00:00:00Z","timestamp":1688860800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T00:00:00Z","timestamp":1688860800000},"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":[[2023,7,9]]},"DOI":"10.1109\/iscc58397.2023.10217999","type":"proceedings-article","created":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T13:46:48Z","timestamp":1693230408000},"page":"1221-1227","source":"Crossref","is-referenced-by-count":6,"title":["Komorebi: A DAG-based Asynchronous BFT Consensus via Sharding"],"prefix":"10.1109","author":[{"given":"Song","family":"Peng","sequence":"first","affiliation":[{"name":"Henan university of technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[{"name":"Henan university of technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingwen","family":"Chen","sequence":"additional","affiliation":[{"name":"Henan university of technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinlong","family":"He","sequence":"additional","affiliation":[{"name":"Henan university of technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaoqi","family":"Wang","sequence":"additional","affiliation":[{"name":"Henan university of technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2748"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92708-0_3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2018.00114"},{"key":"ref23","first-page":"524","article-title":"Secure and efficient asynchronous broadcast protocols","author":"cachin","year":"0","journal-title":"Advances in Cryptology - CRYPTO 2001 21st Annual International Cryptology Conference"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519594"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467905"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3213326"},{"key":"ref11","first-page":"9","article-title":"The swirlds hashgraph consensus algorithm: Fair, fast, byzantine fault tolerance","volume":"34","author":"baird","year":"2016","journal-title":"Swirlds Tech Reports SWIRLDS-TR-2016–01 Tech Rep"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36288-6_3"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2022.102503"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/1478077120963376"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IOT-TUSCANY.2018.8373021"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978389"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559361"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3028449"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243853"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3390\/a16010038"},{"journal-title":"Snowflake to Avalanche A novel metastable consensus protocol family for cryptocurrencies","year":"0","author":"rocket","key":"ref7"},{"key":"ref9","article-title":"Maximal extractable value (mev) protection on a dag","author":"malkhi","year":"2022","journal-title":"ArXiv Preprint"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3318041.3355458"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1080\/02691728.2022.2086086"},{"key":"ref6","first-page":"30","article-title":"The tangle","volume":"1","author":"popov","year":"2018","journal-title":"White Paper"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2020.2969706"}],"event":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2023,7,9]]},"location":"Gammarth, Tunisia","end":{"date-parts":[[2023,7,12]]}},"container-title":["2023 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10217219\/10217829\/10217999.pdf?arnumber=10217999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T13:50:03Z","timestamp":1695649803000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10217999\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,9]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/iscc58397.2023.10217999","relation":{},"subject":[],"published":{"date-parts":[[2023,7,9]]}}}