{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T08:37:31Z","timestamp":1777106251659,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T00:00:00Z","timestamp":1566172800000},"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":[[2019,8,19]]},"DOI":"10.1145\/3341302.3342082","type":"proceedings-article","created":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T19:32:36Z","timestamp":1565811156000},"page":"303-317","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":67,"title":["Graphene"],"prefix":"10.1145","author":[{"given":"A. Pinar","family":"Ozisik","sequence":"first","affiliation":[{"name":"Univ. of Massachusetts Amherst"}]},{"given":"Gavin","family":"Andresen","sequence":"additional","affiliation":[{"name":"Univ. of Massachusetts Amherst"}]},{"given":"Brian N.","family":"Levine","sequence":"additional","affiliation":[{"name":"Univ. of Massachusetts Amherst"}]},{"given":"Darren","family":"Tapp","sequence":"additional","affiliation":[{"name":"Dash.org"}]},{"given":"George","family":"Bissias","sequence":"additional","affiliation":[{"name":"Univ. of Massachusetts Amherst"}]},{"given":"Sunny","family":"Katkuri","sequence":"additional","affiliation":[{"name":"Univ. of Massachusetts Amherst"}]}],"member":"320","published-online":{"date-parts":[[2019,8,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Proc. Progress in Cryptology (INDOCRYPT). 489--508","author":"Aumasson Jean-Philippe","unstructured":"Jean-Philippe Aumasson and Daniel J. Bernstein . (December 2012). SipHash: A Fast Short-Input PRF . In Proc. Progress in Cryptology (INDOCRYPT). 489--508 . Jean-Philippe Aumasson and Daniel J. Bernstein. (December 2012). SipHash: A Fast Short-Input PRF. In Proc. Progress in Cryptology (INDOCRYPT). 489--508."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(76)90071-5"},{"key":"e_1_3_2_2_3_1","volume-title":"Graphene Pull Request. https:\/\/github.com\/BitcoinUnlimited\/BitcoinUnlimited\/pull\/973. (July","author":"Bissias George","year":"2018","unstructured":"George Bissias . 2018. Graphene Pull Request. https:\/\/github.com\/BitcoinUnlimited\/BitcoinUnlimited\/pull\/973. (July 2018 ). George Bissias. 2018. Graphene Pull Request. https:\/\/github.com\/BitcoinUnlimited\/BitcoinUnlimited\/pull\/973. (July 2018)."},{"key":"e_1_3_2_2_4_1","volume-title":"An Algorithm for Bounding the Probability of r-core Formation in k-uniform Random Hypergraphs. arXiv preprint. (Feb 1","author":"Bissias George","year":"2019","unstructured":"George Bissias . 2019. An Algorithm for Bounding the Probability of r-core Formation in k-uniform Random Hypergraphs. arXiv preprint. (Feb 1 2019 ). http:\/\/arxiv.org\/abs\/1901.04934 George Bissias. 2019. An Algorithm for Bounding the Probability of r-core Formation in k-uniform Random Hypergraphs. arXiv preprint. (Feb 1 2019). http:\/\/arxiv.org\/abs\/1901.04934"},{"key":"e_1_3_2_2_5_1","volume-title":"BUIP093: Graphene Relay. https:\/\/github.com\/BitcoinUnlimited\/BUIP\/blob\/master\/093.mediawiki. (July 26","author":"Bissias George","year":"2018","unstructured":"George Bissias and Brian Levine . 2018. BUIP093: Graphene Relay. https:\/\/github.com\/BitcoinUnlimited\/BUIP\/blob\/master\/093.mediawiki. (July 26 2018 ). George Bissias and Brian Levine. 2018. BUIP093: Graphene Relay. https:\/\/github.com\/BitcoinUnlimited\/BUIP\/blob\/master\/093.mediawiki. (July 26 2018)."},{"key":"e_1_3_2_2_6_1","volume-title":"The Bitcoin ABC Vision. https:\/\/medium.com\/@Bitcoin_ABC\/the-bitcoin-abc-vision-f7f87755979f. (August 24","author":"Bitcoin ABC.","year":"2018","unstructured":"Bitcoin ABC. 2018. The Bitcoin ABC Vision. https:\/\/medium.com\/@Bitcoin_ABC\/the-bitcoin-abc-vision-f7f87755979f. (August 24 2018 ). Bitcoin ABC. 2018. The Bitcoin ABC Vision. https:\/\/medium.com\/@Bitcoin_ABC\/the-bitcoin-abc-vision-f7f87755979f. (August 24 2018)."},{"key":"e_1_3_2_2_7_1","unstructured":"Bitcoin Unlimited. 2018. Bitcoin Cash Development And Testing Accord: Bitcoin Unlimited Statement. https:\/\/www.bitcoinunlimited.info\/cash-development-plan. (2018).  Bitcoin Unlimited. 2018. Bitcoin Cash Development And Testing Accord: Bitcoin Unlimited Statement. https:\/\/www.bitcoinunlimited.info\/cash-development-plan. (2018)."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028589"},{"key":"e_1_3_2_2_10_1","volume-title":"Network applications of bloom filters: A survey. Internet mathematics 1, 4","author":"Broder Andrei","year":"2004","unstructured":"Andrei Broder and Michael Mitzenmacher . 2004. Network applications of bloom filters: A survey. Internet mathematics 1, 4 ( 2004 ), 485--509. Andrei Broder and Michael Mitzenmacher. 2004. Network applications of bloom filters: A survey. Internet mathematics 1, 4 (2004), 485--509."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795294165"},{"key":"e_1_3_2_2_12_1","volume-title":"Casper the Friendly Finality Gadget. https:\/\/arxiv.org\/abs\/1710.09437. (Oct","author":"Buterin Vitalik","year":"2017","unstructured":"Vitalik Buterin and Virgil Griffith . 2017. Casper the Friendly Finality Gadget. https:\/\/arxiv.org\/abs\/1710.09437. (Oct 2017 ). Vitalik Buterin and Virgil Griffith. 2017. Casper the Friendly Finality Gadget. https:\/\/arxiv.org\/abs\/1710.09437. (Oct 2017)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.836103"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804332"},{"key":"e_1_3_2_2_15_1","volume-title":"BIP152: Compact Block Relay. https:\/\/github.com\/bitcoin\/bips\/blob\/master\/bip-0152.mediawiki. (April","author":"Corallo Matt","year":"2016","unstructured":"Matt Corallo . 2016. BIP152: Compact Block Relay. https:\/\/github.com\/bitcoin\/bips\/blob\/master\/bip-0152.mediawiki. (April 2016 ). Matt Corallo. 2016. BIP152: Compact Block Relay. https:\/\/github.com\/bitcoin\/bips\/blob\/master\/bip-0152.mediawiki. (April 2016)."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53357-4_8"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2016.23187"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2013.6688704"},{"key":"e_1_3_2_2_19_1","volume-title":"Proc. International Conference on Formal Methods in Computer-Aided Design (FMCAD). Springer-Verlag, 367--381","author":"Peter","unstructured":"Peter C. Dillinger and Panagiotis Manolios. (November 2004). Bloom Filters in Probabilistic Verification . In Proc. International Conference on Formal Methods in Computer-Aided Design (FMCAD). Springer-Verlag, 367--381 . Peter C. Dillinger and Panagiotis Manolios. (November 2004). Bloom Filters in Probabilistic Verification. In Proc. International Conference on Formal Methods in Computer-Aided Design (FMCAD). Springer-Verlag, 367--381."},{"key":"e_1_3_2_2_20_1","volume-title":"Proc. Model Checking Software (SPIN). 57--75","author":"Peter","unstructured":"Peter C. Dillinger and Panagiotis Manolios. (April 2004). Fast and Accurate Bitstate Verification for SPIN . In Proc. Model Checking Software (SPIN). 57--75 . Peter C. Dillinger and Panagiotis Manolios. (April 2004). Fast and Accurate Bitstate Verification for SPIN. In Proc. Model Checking Software (SPIN). 57--75."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"},{"key":"e_1_3_2_2_22_1","volume-title":"The Bitcoin Lightning Network: Scalable Off-Chain Instant Payments. htttps:\/\/lightning.nettwork\/lightning-network-paper.pdf. (Jan","author":"Dryja Thaddeus","year":"2016","unstructured":"Thaddeus Dryja and Joseph Poon . 2016. The Bitcoin Lightning Network: Scalable Off-Chain Instant Payments. htttps:\/\/lightning.nettwork\/lightning-network-paper.pdf. (Jan 2016 ). Thaddeus Dryja and Joseph Poon. 2016. The Bitcoin Lightning Network: Scalable Off-Chain Instant Payments. htttps:\/\/lightning.nettwork\/lightning-network-paper.pdf. (Jan 2016)."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018462"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402977"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053907"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120248"},{"key":"e_1_3_2_2_31_1","volume-title":"Improve block transfer efficiency using Graphene #17724. https:\/\/github.com\/ethereum\/go-ethereum\/pull\/17724. (September 20","author":"Katkuri Sunny","year":"2018","unstructured":"Sunny Katkuri . 2018. Improve block transfer efficiency using Graphene #17724. https:\/\/github.com\/ethereum\/go-ethereum\/pull\/17724. (September 20 2018 ). Sunny Katkuri. 2018. Improve block transfer efficiency using Graphene #17724. https:\/\/github.com\/ethereum\/go-ethereum\/pull\/17724. (September 20 2018)."},{"key":"e_1_3_2_2_32_1","first-page":"2","article-title":"Less Hashing, Same Performance: Building a Better Bloom Filter","volume":"33","author":"Kirsch Adam","year":"2006","unstructured":"Adam Kirsch and Michael Mitzenmacher . 2006 . Less Hashing, Same Performance: Building a Better Bloom Filter . Random Structures & Algorithms 33 , 2 (September 2006), 187--218. Adam Kirsch and Michael Mitzenmacher. 2006. Less Hashing, Same Performance: Building a Better Bloom Filter. Random Structures & Algorithms 33, 2 (September 2006), 187--218.","journal-title":"Random Structures & Algorithms"},{"key":"e_1_3_2_2_33_1","volume-title":"Proc. USENIX Security Symposium. 279--296","author":"Kogias Eleftherios Kokoris","year":"2016","unstructured":"Eleftherios Kokoris Kogias , Philipp Jovanovic , Nicolas Gailly , Ismail Khoffi , Linus Gasser , and Bryan Ford . (August 2016 ). Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing . In Proc. USENIX Security Symposium. 279--296 . Eleftherios Kokoris Kogias, Philipp Jovanovic, Nicolas Gailly, Ismail Khoffi, Linus Gasser, and Bryan Ford. (August 2016). Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing. In Proc. USENIX Security Symposium. 279--296."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.000-5"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.17"},{"key":"e_1_3_2_2_36_1","volume-title":"IBLT Optimization. https:\/\/github.com\/umass-forensics\/IBLT-optimization. (August","author":"Levine Brian","year":"2018","unstructured":"Brian Levine and Gavin Andresen . 2018. IBLT Optimization. https:\/\/github.com\/umass-forensics\/IBLT-optimization. (August 2018 ). Brian Levine and Gavin Andresen. 2018. IBLT Optimization. https:\/\/github.com\/umass-forensics\/IBLT-optimization. (August 2018)."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47854-7_33"},{"key":"e_1_3_2_2_38_1","first-page":"427","article-title":"Some Logarithm Inequalities","volume":"63","author":"Love Eric Russell","year":"1980","unstructured":"Eric Russell Love . 1980 . Some Logarithm Inequalities . The Mathematical Gazette (The Mathematical Association) 63 , 427 (March 1980), 55--57. https:\/\/www.jstor.org\/stable\/3615890 Eric Russell Love. 1980. Some Logarithm Inequalities. The Mathematical Gazette (The Mathematical Association) 63, 427 (March 1980), 55--57. https:\/\/www.jstor.org\/stable\/3615890","journal-title":"The Mathematical Gazette (The Mathematical Association)"},{"key":"e_1_3_2_2_39_1","volume-title":"Optimizing Bloom Filter: Challenges, Solutions, and Comparisons","author":"Luo Lailong","year":"1804","unstructured":"Lailong Luo , Deke Guo , Richard T.B. Ma , Ori Rottenstreich , and Xueshan Luo . 2019. Optimizing Bloom Filter: Challenges, Solutions, and Comparisons . IEEE Communications Surveys Tutorials (see also arXiv: 1804 .04777) 21, 2 (Second quarter 2019), 1912--1949. Lailong Luo, Deke Guo, Richard T.B. Ma, Ori Rottenstreich, and Xueshan Luo. 2019. Optimizing Bloom Filter: Challenges, Solutions, and Comparisons. IEEE Communications Surveys Tutorials (see also arXiv:1804.04777) 21, 2 (Second quarter 2019), 1912--1949."},{"key":"e_1_3_2_2_40_1","volume-title":"Advances in Cryptology (CRYPTO '87)","author":"Merkle Ralph C.","year":"1987","unstructured":"Ralph C. Merkle . ( 1987 ). A Digital Signature Based on a Conventional Encryption Function . In Advances in Cryptology (CRYPTO '87) . August, 369--378. Ralph C. Merkle. (1987). A Digital Signature Based on a Conventional Encryption Function. In Advances in Cryptology (CRYPTO '87). August, 369--378."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.815784"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-017-0316-0"},{"key":"e_1_3_2_2_43_1","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"Mitzenmacher Michael","unstructured":"Michael Mitzenmacher and Eli Upfal . 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis . Cambridge University Press . 61--89 pages. Michael Mitzenmacher and Eli Upfal. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press. 61--89 pages."},{"key":"e_1_3_2_2_44_1","volume-title":"Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA). 672--681","author":"Molloy Michael","year":"2004","unstructured":"Michael Molloy . (January 2004 ). The Pure Literal Rule Threshold and Cores in Random Hypergraphs . In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA). 672--681 . http:\/\/dl.acm.org\/citation.cfm?id=982792.982896 Michael Molloy. (January 2004). The Pure Literal Rule Threshold and Cores in Random Hypergraphs. In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA). 672--681. http:\/\/dl.acm.org\/citation.cfm?id=982792.982896"},{"key":"e_1_3_2_2_45_1","volume-title":"Bitcoin: A Peer-to-Peer Electronic Cash System. (May","author":"Nakamoto Satoshi","year":"2009","unstructured":"Satoshi Nakamoto . 2009 . Bitcoin: A Peer-to-Peer Electronic Cash System. (May 2009). https:\/\/bitcoin.org\/bitcoin.pdf Satoshi Nakamoto. 2009. Bitcoin: A Peer-to-Peer Electronic Cash System. (May 2009). https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"e_1_3_2_2_46_1","volume-title":"Proc. of International Workshop on Cryptocurrencies and Blockchain Technology (ESORICS Workshop). 420--428","author":"Ozisik A. Pinar","year":"2017","unstructured":"A. Pinar Ozisik , Gavin Andresen , George Bissias , Amir Houmansadr , and Brian Neil Levine . (September 2017 ). Graphene: A New Protocol for Block Propagation Using Set Reconciliation . In Proc. of International Workshop on Cryptocurrencies and Blockchain Technology (ESORICS Workshop). 420--428 . A. Pinar Ozisik, Gavin Andresen, George Bissias, Amir Houmansadr, and Brian Neil Levine. (September 2017). Graphene: A New Protocol for Block Propagation Using Set Reconciliation. In Proc. of International Workshop on Cryptocurrencies and Blockchain Technology (ESORICS Workshop). 420--428."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.11.015"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47854-7_32"},{"key":"e_1_3_2_2_50_1","volume-title":"Proc. Scaling Bitcoin Conference.","author":"Suisani Andrea","year":"2017","unstructured":"Andrea Suisani , Andrew Clifford , Andrew Stone , Erik Beijnoff , Peter Rizun , Peter Tschipper , Alexandra Fedorova , Chen Feng , Victoria Lemieux , and Stefan Matthews . (November 2017 ). Measuring maximum sustained transaction through-put on a global network of Bitcoin nodes. https:\/\/scalingbitcoin.org\/stanford2017\/Day1\/Stanford_2017.pptx.pdf . In Proc. Scaling Bitcoin Conference. Andrea Suisani, Andrew Clifford, Andrew Stone, Erik Beijnoff, Peter Rizun, Peter Tschipper, Alexandra Fedorova, Chen Feng, Victoria Lemieux, and Stefan Matthews. (November 2017). Measuring maximum sustained transaction through-put on a global network of Bitcoin nodes. https:\/\/scalingbitcoin.org\/stanford2017\/Day1\/Stanford_2017.pptx.pdf. In Proc. Scaling Bitcoin Conference."},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2011.031611.00024"},{"key":"e_1_3_2_2_52_1","volume-title":"Benefits of LTOR in block entropy encoding. https:\/\/medium.com\/@j_73307\/benefits-of-ltor-in-block-entropy-encoding-or-8d5b77cc2ab0. (September","author":"Toomim Jonathan","year":"2018","unstructured":"Jonathan Toomim . 2018. Benefits of LTOR in block entropy encoding. https:\/\/medium.com\/@j_73307\/benefits-of-ltor-in-block-entropy-encoding-or-8d5b77cc2ab0. (September 2018 ). Jonathan Toomim. 2018. Benefits of LTOR in block entropy encoding. https:\/\/medium.com\/@j_73307\/benefits-of-ltor-in-block-entropy-encoding-or-8d5b77cc2ab0. (September 2018)."},{"key":"e_1_3_2_2_53_1","volume-title":"Block propagation data from Bitcoin Cash's stress test. https:\/\/medium.com\/@j_73307\/block-propagation-data-from-bitcoin-cashs-stress-test-5b1d7d39a234. (September","author":"Toomim Jonathan","year":"2018","unstructured":"Jonathan Toomim . 2018. Block propagation data from Bitcoin Cash's stress test. https:\/\/medium.com\/@j_73307\/block-propagation-data-from-bitcoin-cashs-stress-test-5b1d7d39a234. (September 2018 ). Jonathan Toomim. 2018. Block propagation data from Bitcoin Cash's stress test. https:\/\/medium.com\/@j_73307\/block-propagation-data-from-bitcoin-cashs-stress-test-5b1d7d39a234. (September 2018)."},{"key":"e_1_3_2_2_54_1","volume-title":"BUIP010 Xtreme Thinblocks. https:\/\/bitco.in\/forum\/threads\/buip010-passed-xtreme-thinblocks.774\/. (Jan","author":"Tschipper Peter","year":"2016","unstructured":"Peter Tschipper . 2016. BUIP010 Xtreme Thinblocks. https:\/\/bitco.in\/forum\/threads\/buip010-passed-xtreme-thinblocks.774\/. (Jan 2016 ). Peter Tschipper. 2016. BUIP010 Xtreme Thinblocks. https:\/\/bitco.in\/forum\/threads\/buip010-passed-xtreme-thinblocks.774\/. (Jan 2016)."},{"key":"e_1_3_2_2_55_1","volume-title":"Ethereum: A Secure Decentralised Generalised Transaction Ledger. https:\/\/ethereum.github.io\/yellowpaper\/paper.pdf. (June","author":"Wood Gavin","year":"2018","unstructured":"Gavin Wood . 2018 . Ethereum: A Secure Decentralised Generalised Transaction Ledger. https:\/\/ethereum.github.io\/yellowpaper\/paper.pdf. (June 2018). Gavin Wood. 2018. Ethereum: A Secure Decentralised Generalised Transaction Ledger. https:\/\/ethereum.github.io\/yellowpaper\/paper.pdf. (June 2018)."},{"key":"e_1_3_2_2_56_1","unstructured":"Pieter Wuille. 2018. Minisketch: a library for BCH-based set reconciliation. https:\/\/github.com\/sipa\/minisketch\/blob\/master\/doc\/math.md. (2018).  Pieter Wuille. 2018. Minisketch: a library for BCH-based set reconciliation. https:\/\/github.com\/sipa\/minisketch\/blob\/master\/doc\/math.md. (2018)."}],"event":{"name":"SIGCOMM '19: ACM SIGCOMM 2019 Conference","location":"Beijing China","acronym":"SIGCOMM '19","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the ACM Special Interest Group on Data Communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341302.3342082","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341302.3342082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:12:57Z","timestamp":1750201977000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341302.3342082"}},"subtitle":["efficient interactive set reconciliation applied to blockchain propagation"],"short-title":[],"issued":{"date-parts":[[2019,8,19]]},"references-count":56,"alternative-id":["10.1145\/3341302.3342082","10.1145\/3341302"],"URL":"https:\/\/doi.org\/10.1145\/3341302.3342082","relation":{},"subject":[],"published":{"date-parts":[[2019,8,19]]},"assertion":[{"value":"2019-08-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}