{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,27]],"date-time":"2026-08-27T23:10:23Z","timestamp":1787872223005,"version":"build-2784847793"},"publisher-location":"New York, NY, USA","reference-count":67,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CCF-2047061,CCF-1814409"],"award-info":[{"award-number":["CCF-2047061,CCF-1814409"]}]},{"name":"Google Research"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451110","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"612-625","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemma"],"prefix":"10.1145","author":[{"given":"Sepehr","family":"Assadi","sequence":"first","affiliation":[{"name":"Rutgers University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1502-9231","authenticated-orcid":false,"given":"Vishvajeet","family":"N","sequence":"additional","affiliation":[{"name":"Rutgers University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316361"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039799"},{"key":"e_1_3_2_1_3_1","volume-title":"MAX-CUT, Matching Size, and Other Problems. CoRR, abs\/2009.03038. To appear in FOCS","author":"Assadi Sepehr","year":"2020","unstructured":"Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, and Huacheng Yu. 2020. Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. CoRR, abs\/2009.03038. To appear in FOCS 2020, 2020."},{"key":"e_1_3_2_1_4_1","first-page":"1871","volume-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019","author":"Bafna Mitali","year":"2019","unstructured":"Mitali Bafna, Badih Ghazi, Noah Golowich, and Madhu Sudan. 2019. Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. Pages 1861\u20131871."},{"key":"e_1_3_2_1_5_1","volume-title":"43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Proceedings. Pages 209\u2013218","author":"Bar-Yossef Ziv","unstructured":"Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar. 2002. An Information Statistics Approach to Data Stream and Communication Complexity. In 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Proceedings. Pages 209\u2013218."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/545381.545464"},{"key":"e_1_3_2_1_7_1","volume-title":"Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams. In 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017","author":"Suman","year":"2017","unstructured":"Suman K. Bera and Amit Chakrabarti. 2017. Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams. In 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany. Pages 11:1\u201311:14."},{"key":"e_1_3_2_1_8_1","volume-title":"45th International Colloquium on Automata, Languages, and Programming, ICALP 2018","author":"Bhaskara Aditya","year":"2018","unstructured":"Aditya Bhaskara, Samira Daruki, and Suresh Venkatasubramanian. 2018. Sublinear Algorithms for MAXCUT and Correlation Clustering. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic. Pages 16:1\u201316:14."},{"key":"e_1_3_2_1_9_1","first-page":"755","volume-title":"Direct Products in Communication Complexity. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013","author":"Braverman Mark","year":"2013","unstructured":"Mark Braverman, Anup Rao, Omri Weinstein, and Amir Yehudayoff. 2013. Direct Products in Communication Complexity. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013. Pages 746\u2013755."},{"key":"e_1_3_2_1_10_1","first-page":"657","volume-title":"Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholmsm\u00e4ssan","author":"Braverman Vladimir","year":"2018","unstructured":"Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer, Yi Li, David P. Woodruff, and Lin F. Yang. 2018. Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order. In Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholmsm\u00e4ssan, Stockholm, Sweden, July 10-15, 2018. Pages 648\u2013657."},{"key":"e_1_3_2_1_11_1","volume-title":"40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Pages 244\u2013254","author":"Braverman Vladimir","year":"2013","unstructured":"Vladimir Braverman, Rafail Ostrovsky, and Dan Vilenchik. 2013. How Hard Is Counting Triangles in the Streaming Model? In Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Pages 244\u2013254."},{"key":"e_1_3_2_1_12_1","volume-title":"Peem Lerdputtipongporn, and Hariharan Srinivasulu.","author":"Brody Joshua","year":"2020","unstructured":"Joshua Brody, Jae Tak Kim, Peem Lerdputtipongporn, and Hariharan Srinivasulu. 2020. A Strong XOR Lemma for Randomized Query Complexity. CoRR, abs\/2007.05580, 2020."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0036-4"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings. Pages 263\u2013274","author":"Bury Marc","year":"2015","unstructured":"Marc Bury and Chris Schwiegelshohn. 2015. Sublinear Estimation of Weighted Matchings in Dynamic Data Streams. In Algorithms - ESA 2015 - 23rd Annual European Symposium, September 14-16, 2015, Proceedings. Pages 263\u2013274."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374470"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403244"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch92"},{"key":"e_1_3_2_1_18_1","volume-title":"Optimal Streaming Approximations for all Boolean Max-2CSPs. CoRR, abs\/2004.11796. To appear in FOCS","author":"Chou Chi-Ning","year":"2020","unstructured":"Chi-Ning Chou, Alexander Golovnev, and Santhoshini Velusamy. 2020. Optimal Streaming Approximations for all Boolean Max-2CSPs. CoRR, abs\/2004.11796. To appear in FOCS 2020, 2020."},{"key":"e_1_3_2_1_19_1","first-page":"2017","article-title":"A second look at counting triangles in graph streams (corrected)","volume":"683","author":"Cormode Graham","year":"2017","unstructured":"Graham Cormode and Hossein Jowhari. 2017. A second look at counting triangles in graph streams (corrected). Theor. Comput. Sci., 683, 2017. Pages 22\u201330.","journal-title":"Theor. Comput. Sci."},{"key":"e_1_3_2_1_20_1","first-page":"15","volume-title":"The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs. In 25th Annual European Symposium on Algorithms, ESA 2017","author":"Cormode Graham","year":"2017","unstructured":"Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, and S. Muthukrishnan. 2017. The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs. In 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017. Pages 29:1\u201329:15."},{"key":"e_1_3_2_1_21_1","volume-title":"APPROX\/RANDOM 2020, August 17-19, 2020, Virtual Conference. Pages 16:1\u201316:20","author":"Czumaj Artur","year":"2020","unstructured":"Artur Czumaj, Hendrik Fichtenberger, Pan Peng, and Christian Sohler. 2020. Testable Properties in General Graphs and Random Order Streaming. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2020, August 17-19, 2020, Virtual Conference. Pages 16:1\u201316:20."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.81"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.013"},{"key":"e_1_3_2_1_24_1","first-page":"5","article-title":"Graph Distances in the Data-Stream Model","volume":"38","author":"Feigenbaum Joan","year":"2008","unstructured":"Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, and Jian Zhang. 2008. Graph Distances in the Data-Stream Model. SIAM J. Comput., 38, 5, 2008. Pages 1709\u20131727.","journal-title":"SIAM J. Comput."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250866"},{"key":"e_1_3_2_1_26_1","volume-title":"Lower Bounds for XOR of Forrelations. CoRR, abs\/2007.03631","author":"Girish Uma","year":"2020","unstructured":"Uma Girish, Ran Raz, and Wei Zhan. 2020. Lower Bounds for XOR of Forrelations. CoRR, abs\/2007.03631, 2020."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich Noam Nisan and Avi Wigderson. 2011. On Yao's XOR-Lemma. In Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad Mihir Bellare Zvika Brakerski Shafi Goldwasser Shai Halevi Tali Kaufman Leonid Levin Noam Nisan Dana Ron Madhu Sudan Luca Trevisan Salil Vadhan Avi Wigderson David Zuckerman. Pages 273\u2013301.","DOI":"10.1007\/978-3-642-22670-0_23"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.66"},{"key":"e_1_3_2_1_29_1","volume-title":"36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I. Pages 513\u2013524","author":"Guha Sudipto","year":"2009","unstructured":"Sudipto Guha and Zhiyi Huang. 2009. Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams. In Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I. Pages 513\u2013524."},{"key":"e_1_3_2_1_30_1","volume-title":"35th International Colloquium, ICALP 2008, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games. Pages 760\u2013772","author":"Guha Sudipto","year":"2008","unstructured":"Sudipto Guha and Andrew McGregor. 2008. Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination. In Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games. Pages 760\u2013772."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/07069328X"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2013.37"},{"key":"e_1_3_2_1_33_1","volume-title":"APPROX\/RANDOM 2019","author":"Guruswami Venkatesan","year":"2019","unstructured":"Venkatesan Guruswami and Runzhou Tao. 2019. Streaming Hardness of Unique Games. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA. Pages 5:1\u20135:12."},{"key":"e_1_3_2_1_34_1","volume-title":"APPROX\/RANDOM 2017","author":"Guruswami Venkatesan","year":"2017","unstructured":"Venkatesan Guruswami, Ameya Velingker, and Santhoshini Velusamy. 2017. Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA. Pages 8:1\u20138:19."},{"key":"e_1_3_2_1_35_1","volume-title":"43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016","author":"Huang Zengfeng","year":"2016","unstructured":"Zengfeng Huang and Pan Peng. 2016. Dynamic Graph Stream Algorithms in o(n) Space. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy. Pages 18:1\u201318:16."},{"key":"e_1_3_2_1_36_1","first-page":"545","volume-title":"Hard-Core Distributions for Somewhat Hard Problems. In 36th Annual Symposium on Foundations of Computer Science","author":"Impagliazzo Russell","year":"1995","unstructured":"Russell Impagliazzo. 1995. Hard-Core Distributions for Somewhat Hard Problems. In 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995. Pages 538\u2013545."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258590"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.42"},{"key":"e_1_3_2_1_39_1","volume-title":"30th International Colloquium, ICALP 2003, June 30 - July 4, 2003. Proceedings. Pages 300\u2013315","author":"Jain Rahul","year":"2003","unstructured":"Rahul Jain, Jaikumar Radhakrishnan, and Pranab Sen. 2003. A Direct Sum Theorem in Communication Complexity via Message Compression. In Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, June 30 - July 4, 2003. Proceedings. Pages 300\u2013315."},{"key":"e_1_3_2_1_40_1","first-page":"567","volume-title":"The Sketching Complexity of Graph and Hypergraph Counting. In 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018","author":"Kallaugher John","year":"2018","unstructured":"John Kallaugher, Michael Kapralov, and Eric Price. 2018. The Sketching Complexity of Graph and Hypergraph Counting. In 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018. Pages 556\u2013567."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3294052.3319706"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634129"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.84"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039798"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316364"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.107"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688093"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22185"},{"key":"e_1_3_2_1_49_1","first-page":"739","volume-title":"Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016","author":"Li Yi","year":"2016","unstructured":"Yi Li and David P. Woodruff. 2016. On approximating functions of the singular values in a stream. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016. Pages 726\u2013739."},{"key":"e_1_3_2_1_50_1","first-page":"574","volume-title":"FCT 1979, Proceedings of the Conference on Algebraic, Arthmetic, and Categorial Methods in Computation Theory, Berlin\/Wendisch-Rietz","author":"Lov\u00e1sz L\u00e1szl\u00f3","year":"1979","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz. 1979. On determinants, matchings, and random algorithms. In Fundamentals of Computation Theory, FCT 1979, Proceedings of the Conference on Algebraic, Arthmetic, and Categorial Methods in Computation Theory, Berlin\/Wendisch-Rietz, Germany, September 17-21, 1979. Pages 565\u2013574."},{"key":"e_1_3_2_1_51_1","first-page":"12","volume-title":"APPROX\/RANDOM 2016","author":"McGregor Andrew","year":"2016","unstructured":"Andrew McGregor and Sofya Vorotnikova. 2016. Planar Matching in Streams Revisited. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2016, September 7-9, 2016. Pages 17:1\u201317:12."},{"key":"e_1_3_2_1_52_1","first-page":"4","volume-title":"Streaming Algorithm for Matchings in Low Arboricity Graphs. In 1st Symposium on Simplicity in Algorithms, SOSA 2018","author":"McGregor Andrew","year":"2018","unstructured":"Andrew McGregor and Sofya Vorotnikova. 2018. A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs. In 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018. Pages 14:1\u201314:4."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902283"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.125"},{"key":"e_1_3_2_1_55_1","volume-title":"44th International Colloquium on Automata, Languages, and Programming, ICALP 2017","author":"Monemizadeh Morteza","year":"2017","unstructured":"Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, and Christian Sohler. 2017. Testable Bounded Degree Graph Properties Are Random Order Streamable. In 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland. Pages 131:1\u2013131:14."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103463"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.157"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.42"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301413"},{"key":"e_1_3_2_1_60_1","volume-title":"APPROX\/RANDOM 2016","author":"Rao Anup","year":"2016","unstructured":"Anup Rao and Makrand Sinha. 2016. A Direct-Sum Theorem for Read-Once Branching Programs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2016, September 7-9, 2016, Paris, France. Pages 44:1\u201344:15."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-003-0175-x"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993643"},{"key":"e_1_3_2_1_63_1","first-page":"2","article-title":"The factorization of linear graphs","volume":"1","author":"Tutte William T","year":"1947","unstructured":"William T Tutte. 1947. The factorization of linear graphs. Journal of the London Mathematical Society, 1, 2, 1947. Pages 107\u2013111.","journal-title":"Journal of the London Mathematical Society"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.2"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2008.v004a007"},{"key":"e_1_3_2_1_66_1","first-page":"91","volume-title":"23rd Annual Symposium on Foundations of Computer Science","author":"Chi-Chih Yao Andrew","year":"1982","unstructured":"Andrew Chi-Chih Yao. 1982. Theory and Applications of Trapdoor Functions (Extended Abstract). In 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982. Pages 80\u201391."},{"key":"e_1_3_2_1_67_1","first-page":"2016","article-title":"Pointer chasing via triangular discrimination","volume":"23","author":"Yehudayoff Amir","year":"2016","unstructured":"Amir Yehudayoff. 2016. Pointer chasing via triangular discrimination. Electronic Colloquium on Computational Complexity (ECCC), 23, 2016. Pages 151.","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451110","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451110","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:53Z","timestamp":1750195493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":67,"alternative-id":["10.1145\/3406325.3451110","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451110","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}