{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:48Z","timestamp":1750219788454,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T00:00:00Z","timestamp":1686873600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,19]]},"DOI":"10.1145\/3583668.3594580","type":"proceedings-article","created":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T22:28:38Z","timestamp":1686954518000},"page":"274-277","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Breaking the\n            <i>f<\/i>\n            + 1 Barrier: Executing Payment Transactions in Parallel with Less than\n            <i>f<\/i>\n            + 1 Validations"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1872-1634","authenticated-orcid":false,"given":"Rida","family":"Bazzi","sequence":"first","affiliation":[{"name":"School of Computing and Augmented Intelligence, Arizona State University, Tempe, AZ, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9738-9021","authenticated-orcid":false,"given":"Sara","family":"Tucci-Piergiovanni","sequence":"additional","affiliation":[{"name":"CEA LIST, Paris-Saclay University, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2023,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Bazzi and Sara Tucci-Piergiovanni","author":"Rida","year":"2023","unstructured":"Rida A. Bazzi and Sara Tucci-Piergiovanni. 2023. Breaking the f +1 Barrier: Executing Payment Transactions in Parallel with Less than f +1 Validations. arXiv:2301.10149 [cs.DC]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20901-7_2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331589"},{"volume-title":"A non-consensus based decentralized financial transaction processing model with support for efficient auditing. Master's thesis","author":"Gupta Saurabh","key":"e_1_3_2_1_4_1","unstructured":"Saurabh Gupta. 2016. A non-consensus based decentralized financial transaction processing model with support for efficient auditing. Master's thesis. Arizona State University."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1909.10926"}],"event":{"name":"PODC '23: 2023 ACM Symposium on Principles of Distributed Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Orlando FL USA","acronym":"PODC '23"},"container-title":["Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594580","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583668.3594580","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:55Z","timestamp":1750178275000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594580"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,16]]},"references-count":5,"alternative-id":["10.1145\/3583668.3594580","10.1145\/3583668"],"URL":"https:\/\/doi.org\/10.1145\/3583668.3594580","relation":{},"subject":[],"published":{"date-parts":[[2023,6,16]]},"assertion":[{"value":"2023-06-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}