{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T17:23:23Z","timestamp":1768670603911,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF CAREER award","award":["1942789"],"award-info":[{"award-number":["1942789"]}]},{"name":"ISF Grant","award":["1861\/16"],"award-info":[{"award-number":["1861\/16"]}]},{"name":"ERC project","award":["HSS (852952)"],"award-info":[{"award-number":["HSS (852952)"]}]},{"name":"NSF grant","award":["1646671"],"award-info":[{"award-number":["1646671"]}]},{"name":"NSF CNS grant","award":["1814919"],"award-info":[{"award-number":["1814919"]}]},{"name":"Johns Hopkins University Catalyst award"},{"name":"AFOSR Award","award":["FA9550-17-1-0069"],"award-info":[{"award-number":["FA9550-17-1-0069"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,21]]},"DOI":"10.1145\/3465084.3467897","type":"proceedings-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T21:09:28Z","timestamp":1627074568000},"page":"319-330","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Breaking the O(\u221a n)-Bit Barrier"],"prefix":"10.1145","author":[{"given":"Elette","family":"Boyle","sequence":"first","affiliation":[{"name":"IDC, Herzliya, Israel"}]},{"given":"Ran","family":"Cohen","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}]},{"given":"Aarushi","family":"Goel","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Revisited. In Proceedings of the 38th Annual ACM Symposium on Principles of Distributed Computing (PODC). 317--326","author":"Abraham Ittai","year":"2019","unstructured":"Ittai Abraham , T.-H. Hubert Chan , Danny Dolev , Kartik Nayak , Rafael Pass , Ling Ren , and Elaine Shi . 2019 a. Communication Complexity of Byzantine Agreement , Revisited. In Proceedings of the 38th Annual ACM Symposium on Principles of Distributed Computing (PODC). 317--326 . Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, and Elaine Shi. 2019 a. Communication Complexity of Byzantine Agreement, Revisited. In Proceedings of the 38th Annual ACM Symposium on Principles of Distributed Computing (PODC). 317--326."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Ittai Abraham Srinivas Devadas Danny Dolev Kartik Nayak and Ling Ren. 2019 b. Synchronous Byzantine Agreement with Expected O(1) Rounds Expected O(n(2)) Communication and Optimal Resilience. In Financial Cryptography and Data Security. 320--334.  Ittai Abraham Srinivas Devadas Danny Dolev Kartik Nayak and Ling Ren. 2019 b. Synchronous Byzantine Agreement with Expected O(1) Rounds Expected O(n(2)) Communication and Optimal Resilience. In Financial Cryptography and Data Security. 320--334.","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180453"},{"key":"e_1_3_2_2_5_1","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC). 1--10","author":"Ben-Or Michael","year":"1988","unstructured":"Michael Ben-Or , Shafi Goldwasser , and Avi Wigderson . 1988 . Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) . In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC). 1--10 . Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC). 1--10."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-016-9241-9"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488623"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_13"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36288-6_3"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39200-9_26"},{"key":"e_1_3_2_2_11_1","volume-title":"38th Annual International Cryptology Conference (CRYPTO), part III. 243--272","author":"Boyle Elette","unstructured":"Elette Boyle , Ran Cohen , Deepesh Data , and Pavel Hub\u00e1 vc ek. 2018a. Must the Communication Graph of MPC Protocols be an Expander? . In 38th Annual International Cryptology Conference (CRYPTO), part III. 243--272 . Elette Boyle, Ran Cohen, Deepesh Data, and Pavel Hub\u00e1 vc ek. 2018a. Must the Communication Graph of MPC Protocols be an Expander?. In 38th Annual International Cryptology Conference (CRYPTO), part III. 243--272."},{"key":"e_1_3_2_2_13_1","volume-title":"Proceedings of the 10th Theory of Cryptography Conference (TCC). 356--376","author":"Boyle Elette","year":"2013","unstructured":"Elette Boyle , Shafi Goldwasser , and Stefano Tessaro . 2013 . Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting . In Proceedings of the 10th Theory of Cryptography Conference (TCC). 356--376 . Elette Boyle, Shafi Goldwasser, and Stefano Tessaro. 2013. Communication Locality in Secure Multi-party Computation - How to Run Sublinear Algorithms in a Distributed Setting. In Proceedings of the 10th Theory of Cryptography Conference (TCC). 356--376."},{"key":"e_1_3_2_2_14_1","volume-title":"Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP). 24:1--24:16","author":"Boyle Elette","year":"2018","unstructured":"Elette Boyle , Abhishek Jain , Manoj Prabhakaran , and Ching-Hua Yu . 2018 b. The Bottleneck Complexity of Secure Multiparty Computation . In Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP). 24:1--24:16 . Elette Boyle, Abhishek Jain, Manoj Prabhakaran, and Ching-Hua Yu. 2018b. The Bottleneck Complexity of Secure Multiparty Computation. In Proceedings of the 45th International Colloquium on Automata, Languages, and Programming (ICALP). 24:1--24:16."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484243"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1009380.1009677"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49387-8_11"},{"key":"e_1_3_2_2_18_1","volume-title":"Consensus Through Herding. In 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), part I. 720--749","author":"Hubert Chan T.-H.","year":"2019","unstructured":"T.-H. Hubert Chan , Rafael Pass , and Elaine Shi . 2019 . Consensus Through Herding. In 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), part I. 720--749 . T.-H. Hubert Chan, Rafael Pass, and Elaine Shi. 2019. Consensus Through Herding. In 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), part I. 720--749."},{"key":"e_1_3_2_2_19_1","volume-title":"Proceedings of the 23rd International Conference on the Theory and Practice of Public-Key Cryptography (PKC), part II. 246--265","author":"Hubert Chan T.-H.","year":"2020","unstructured":"T.-H. Hubert Chan , Rafael Pass , and Elaine Shi . 2020 . Sublinear-Round Byzantine Agreement Under Corrupt Majority . In Proceedings of the 23rd International Conference on the Theory and Practice of Public-Key Cryptography (PKC), part II. 246--265 . T.-H. Hubert Chan, Rafael Pass, and Elaine Shi. 2020. Sublinear-Round Byzantine Agreement Under Corrupt Majority. In Proceedings of the 23rd International Conference on the Theory and Practice of Public-Key Cryptography (PKC), part II. 246--265."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688102"},{"key":"e_1_3_2_2_21_1","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC). 11--19","author":"Chaum David","year":"1988","unstructured":"David Chaum , Claude Cr\u00e9 peau, and Ivan Damg\u00e5rd . 1988 . Multiparty Unconditionally Secure Protocols (Extended Abstract) . In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC). 11--19 . David Chaum, Claude Cr\u00e9 peau, and Ivan Damg\u00e5rd. 1988. Multiparty Unconditionally Secure Protocols (Extended Abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC). 11--19."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.02.001"},{"key":"e_1_3_2_2_23_1","unstructured":"Alessandro Chiesa and Eran Tromer. 2010. Proof-Carrying Data and Hearsay Arguments from Signature Cards. In Innovations in Computer Science - ICS. 310--331.  Alessandro Chiesa and Eran Tromer. 2010. Proof-Carrying Data and Hearsay Arguments from Signature Cards. In Innovations in Computer Science - ICS. 310--331."},{"key":"e_1_3_2_2_24_1","volume-title":"Proceedings of the 17th Annual ACM Symposium on Theory of Computing (STOC). 383--395","author":"Chor Benny","year":"1985","unstructured":"Benny Chor , Shafi Goldwasser , Silvio Micali , and Baruch Awerbuch . 1985 . Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract) . In Proceedings of the 17th Annual ACM Symposium on Theory of Computing (STOC). 383--395 . Benny Chor, Shafi Goldwasser, Silvio Micali, and Baruch Awerbuch. 1985. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract). In Proceedings of the 17th Annual ACM Symposium on Theory of Computing (STOC). 383--395."},{"key":"e_1_3_2_2_25_1","volume-title":"Proceedings of the 33rd International Symposium on Distributed Computing (DISC). 12:1--12:17","author":"Cohen Ran","year":"2019","unstructured":"Ran Cohen , Iftach Haitner , Nikolaos Makriyannis , Matan Orland , and Alex Samorodnitsky . 2019 . On the Round Complexity of Randomized Byzantine Agreement . In Proceedings of the 33rd International Symposium on Distributed Computing (DISC). 12:1--12:17 . Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, and Alex Samorodnitsky. 2019. On the Round Complexity of Randomized Byzantine Agreement. In Proceedings of the 33rd International Symposium on Distributed Computing (DISC). 12:1--12:17."},{"key":"e_1_3_2_2_26_1","volume-title":"Proceedings of the 34th International Symposium on Distributed Computing (DISC). 25:1--25:17","author":"Cohen Shir","year":"2020","unstructured":"Shir Cohen , Idit Keidar , and Alexander Spiegelman . 2020 . Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP . In Proceedings of the 34th International Symposium on Distributed Computing (DISC). 25:1--25:17 . Shir Cohen, Idit Keidar, and Alexander Spiegelman. 2020. Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP. In Proceedings of the 34th International Symposium on Distributed Computing (DISC). 25:1--25:17."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_4"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_23"},{"key":"e_1_3_2_2_29_1","volume-title":"Scalable Secure Multiparty Computation. In 25th Annual International Cryptology Conference (CRYPTO). 501--520","author":"Damg\u00e5rd Ivan","year":"2006","unstructured":"Ivan Damg\u00e5rd and Yuval Ishai . 2006 . Scalable Secure Multiparty Computation. In 25th Annual International Cryptology Conference (CRYPTO). 501--520 . Ivan Damg\u00e5rd and Yuval Ishai. 2006. Scalable Secure Multiparty Computation. In 25th Annual International Cryptology Conference (CRYPTO). 501--520."},{"key":"e_1_3_2_2_30_1","volume-title":"Scalable Multiparty Computation with Nearly Optimal Work and Resilience. In 27th Annual International Cryptology Conference (CRYPTO). 241--261","author":"Damg\u00e5rd Ivan","unstructured":"Ivan Damg\u00e5rd , Yuval Ishai , Mikkel Kr\u00f8igaard , Jesper Buus Nielsen , and Adam D. Smith . 2008 . Scalable Multiparty Computation with Nearly Optimal Work and Resilience. In 27th Annual International Cryptology Conference (CRYPTO). 241--261 . Ivan Damg\u00e5rd, Yuval Ishai, Mikkel Kr\u00f8igaard, Jesper Buus Nielsen, and Adam D. Smith. 2008. Scalable Multiparty Computation with Nearly Optimal Work and Resilience. In 27th Annual International Cryptology Conference (CRYPTO). 241--261."},{"key":"e_1_3_2_2_31_1","volume-title":"Threshold Cryptosystems. In 8th Annual International Cryptology Conference (CRYPTO). 307--315","author":"Desmedt Yvo","year":"1989","unstructured":"Yvo Desmedt and Yair Frankel . 1989 . Threshold Cryptosystems. In 8th Annual International Cryptology Conference (CRYPTO). 307--315 . Yvo Desmedt and Yair Frankel. 1989. Threshold Cryptosystems. In 8th Annual International Cryptology Conference (CRYPTO). 307--315."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217061"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01843568"},{"key":"e_1_3_2_2_36_1","volume-title":"Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC). 31--41","author":"Juan","unstructured":"Juan A. Garay and Yoram Moses. 1993. Fully polynomial Byzantine agreement in t1 rounds . In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC). 31--41 . Juan A. Garay and Yoram Moses. 1993. Fully polynomial Byzantine agreement in t1 rounds. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC). 31--41."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2881"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993651"},{"key":"e_1_3_2_2_39_1","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC). 218--229","author":"Goldreich Oded","year":"1987","unstructured":"Oded Goldreich , Silvio Micali , and Avi Wigderson . 1987 . How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority . In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC). 218--229 . Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC). 218--229."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Divya Gupta and Amit Sahai. 2014. On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption. In INDOCRYPT. 71--88.  Divya Gupta and Amit Sahai. 2014. On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption. In INDOCRYPT. 71--88.","DOI":"10.1007\/978-3-319-13039-2_5"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0069-x"},{"key":"e_1_3_2_2_42_1","first-page":"1","article-title":"A public-key cryptosystem suitable for digital multisignatures","volume":"71","author":"Itakura K.","year":"1983","unstructured":"K. Itakura and K. Nakamura . 1983 . A public-key cryptosystem suitable for digital multisignatures . NEC Research & Development , Vol. 71 (1983), 1 -- 8 . K. Itakura and K. Nakamura. 1983. A public-key cryptosystem suitable for digital multisignatures. NEC Research & Development, Vol. 71 (1983), 1--8.","journal-title":"NEC Research & Development"},{"key":"e_1_3_2_2_43_1","volume-title":"On Expected Constant-Round Protocols for Byzantine Agreement. In 25th Annual International Cryptology Conference (CRYPTO). 445--462","author":"Katz Jonathan","year":"2006","unstructured":"Jonathan Katz and Chiu-Yuen Koo . 2006 . On Expected Constant-Round Protocols for Byzantine Agreement. In 25th Annual International Cryptology Conference (CRYPTO). 445--462 . Jonathan Katz and Chiu-Yuen Koo. 2006. On Expected Constant-Round Protocols for Byzantine Agreement. In 25th Annual International Cryptology Conference (CRYPTO). 445--462."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-010-9069-7"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/1946143.1946161"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04355-0_47"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989727.1989732"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109667"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217857"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-012-9126-5"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365746"},{"key":"e_1_3_2_2_54_1","volume-title":"Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS). 120--130","author":"Micali Silvio","unstructured":"Silvio Micali , Michael O. Rabin , and Salil P. Vadhan . 1999. Verifiable Random Functions . In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS). 120--130 . Silvio Micali, Michael O. Rabin, and Salil P. Vadhan. 1999. Verifiable Random Functions. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS). 120--130."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_2_2_56_1","volume-title":"Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS). 73--85","author":"Rabin Tal","year":"1989","unstructured":"Tal Rabin and Michael Ben-Or . 1989 . Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract) . In Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS). 73--85 . Tal Rabin and Michael Ben-Or. 1989. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract). In Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS). 73--85."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.5555\/1802614.1802616"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_15"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_14"},{"key":"e_1_3_2_2_60_1","volume-title":"Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS). 160--164","author":"Chi-Chih Yao Andrew","year":"1982","unstructured":"Andrew Chi-Chih Yao . 1982 . Protocols for Secure Computations (Extended Abstract) . In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS). 160--164 . Andrew Chi-Chih Yao. 1982. Protocols for Secure Computations (Extended Abstract). In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS). 160--164."}],"event":{"name":"PODC '21: ACM Symposium on Principles of Distributed Computing","location":"Virtual Event Italy","acronym":"PODC '21","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467897","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:25Z","timestamp":1750191505000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467897"}},"subtitle":["Byzantine Agreement with Polylog Bits Per Party"],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":58,"alternative-id":["10.1145\/3465084.3467897","10.1145\/3465084"],"URL":"https:\/\/doi.org\/10.1145\/3465084.3467897","relation":{},"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2021-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}