{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T22:34:04Z","timestamp":1785191644915,"version":"3.55.0"},"reference-count":60,"publisher":"Association for Computing Machinery (ACM)","issue":"9","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2024,5]]},"abstract":"<jats:p>Recently, Bessa et al. (PODS 2023) showed that sketches based on coordinated weighted sampling theoretically and empirically outperform popular linear sketching methods like Johnson-Lindentrauss projection and CountSketch for the ubiquitous problem of inner product estimation. We further develop this finding by introducing and analyzing two alternative sampling-based methods. In contrast to the computationally expensive algorithm in Bessa et al., our methods run in linear time (to compute the sketch) and perform better in practice, significantly beating linear sketching on a variety of tasks. For example, they provide state-of-the-art results for estimating the correlation between columns in unjoined tables, a problem that we show how to reduce to inner product estimation in a black-box way. While based on known sampling techniques (threshold and priority sampling) we introduce significant new theoretical analysis to prove approximation guarantees for our methods.<\/jats:p>","DOI":"10.14778\/3665844.3665850","type":"journal-article","created":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T22:19:07Z","timestamp":1722982747000},"page":"2185-2197","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Sampling Methods for Inner Product Sketching"],"prefix":"10.14778","volume":"17","author":[{"given":"Majid","family":"Daliri","sequence":"first","affiliation":[{"name":"New York University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juliana","family":"Freire","sequence":"additional","affiliation":[{"name":"New York University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christopher","family":"Musco","sequence":"additional","affiliation":[{"name":"New York University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A\u00e9cio","family":"Santos","sequence":"additional","affiliation":[{"name":"New York University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haoxiang","family":"Zhang","sequence":"additional","affiliation":[{"name":"New York University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,8,6]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. Syst. Sci., 66(4). Preliminary version in the 20th Symposium on Principles of Database Systems (PODS)","author":"Achlioptas D.","year":"2003","unstructured":"Achlioptas, D. (2003). Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. Syst. Sci., 66(4). Preliminary version in the 20th Symposium on Principles of Database Systems (PODS)."},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 24th Symposium on Principles of Database Systems (PODS).","author":"Alon N.","year":"2005","unstructured":"Alon, N., Duffield, N., Lund, C., and Thorup, M. (2005). Estimating arbitrary subset sums with few probes. In Proceedings of the 24th Symposium on Principles of Database Systems (PODS)."},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the 18th Symposium on Principles of Database Systems (PODS).","author":"Alon N.","unstructured":"Alon, N., Gibbons, P. B., Matias, Y., and Szegedy, M. (1999a). Tracking join and self-join sizes in limited storage. In Proceedings of the 18th Symposium on Principles of Database Systems (PODS)."},{"key":"e_1_2_1_4_1","article-title":"The space complexity of approximating the frequency moments","author":"Alon N.","year":"1999","unstructured":"Alon, N., Matias, Y., and Szegedy, M. (1999b). The space complexity of approximating the frequency moments. Journal of Computer and System Sciences, 58(1).","journal-title":"Journal of Computer and System Sciences, 58(1)."},{"key":"e_1_2_1_5_1","volume-title":"An algorithmic theory of learning: Robust concepts and random projection. Machine Learning, 63(2)","author":"Arriaga R. I.","year":"2006","unstructured":"Arriaga, R. I. and Vempala, S. (2006). An algorithmic theory of learning: Robust concepts and random projection. Machine Learning, 63(2)."},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 42nd Symposium on Principles of Database Systems (PODS).","author":"Bessa A.","year":"2023","unstructured":"Bessa, A., Daliri, M., Freire, J., Musco, C., Musco, C., Santos, A., and Zhang, H. (2023). Weighted minwise hashing beats linear sketching for inner product estimation. In Proceedings of the 42nd Symposium on Principles of Database Systems (PODS)."},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data.","author":"Beyer K.","year":"2007","unstructured":"Beyer, K., Haas, P. J., Reinwald, B., Sismanis, Y., and Gemulla, R. (2007). On synopses for distinct-value estimation under multiset operations. In Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data."},{"key":"e_1_2_1_8_1","volume-title":"Proceedings. Compression and Complexity of SEQUENCES","author":"Broder A.","year":"1997","unstructured":"Broder, A. (1997). On the resemblance and containment of documents. In Proceedings. Compression and Complexity of SEQUENCES 1997."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 35th IEEE International Conference on Data Engineering (ICDE).","author":"Castro Fernandez R.","year":"2019","unstructured":"Castro Fernandez, R., Min, J., Nava, D., and Madden, S. (2019). Lazo: A cardinality-based method for coupled estimation of jaccard similarity and containment. In Proceedings of the 35th IEEE International Conference on Data Engineering (ICDE)."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC).","author":"Charikar M.","year":"2002","unstructured":"Charikar, M. (2002). Similarity estimation techniques from rounding algorithms. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC)."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP).","author":"Charikar M.","year":"2002","unstructured":"Charikar, M., Chen, K., and Farach-Colton, M. (2002). Finding frequent items in data streams. In Proceedings of the 29th International Colloquium on Automata, Languages and Programming (ICALP)."},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 2017 ACM International Conference on Management of Data.","author":"Chen Y.","year":"2017","unstructured":"Chen, Y. and Yi, K. (2017). Two-level sampling for join size estimation. In Proceedings of the 2017 ACM International Conference on Management of Data."},{"key":"e_1_2_1_13_1","volume-title":"Proc. VLDB Endow., 13(9).","author":"Chepurko N.","year":"2020","unstructured":"Chepurko, N., Marcus, R., Zgraggen, E., Fernandez, R. C., Kraska, T., and Karger, D. (2020). Arda: automatic relational data augmentation for machine learning. Proc. VLDB Endow., 13(9)."},{"key":"e_1_2_1_14_1","volume-title":"Hashing techniques: A survey and taxonomy. ACM Comput. Surv., 50(1)","author":"Chi L.","year":"2017","unstructured":"Chi, L. and Zhu, X. (2017). Hashing techniques: A survey and taxonomy. ACM Comput. Surv., 50(1)."},{"key":"e_1_2_1_15_1","volume-title":"Dartminhash: Fast sketching for weighted sets. arXiv:2005.11547","author":"Christiani T.","year":"2020","unstructured":"Christiani, T. (2020). Dartminhash: Fast sketching for weighted sets. arXiv:2005.11547."},{"key":"e_1_2_1_16_1","volume-title":"2015 Third IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb).","author":"Cohen E.","year":"2015","unstructured":"Cohen, E. (2015). Multi-objective weighted sampling. In 2015 Third IEEE Workshop on Hot Topics in Web Systems and Technologies (HotWeb)."},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 42nd Symposium on Principles of Database Systems (PODS).","author":"Cohen E.","year":"2023","unstructured":"Cohen, E. (2023). Sampling big ideas in query optimization. In Proceedings of the 42nd Symposium on Principles of Database Systems (PODS)."},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the 2007 ACM Symposium on Principles of Distributed Computing (PODC).","author":"Cohen E.","year":"2007","unstructured":"Cohen, E. and Kaplan, H. (2007). Summarizing data using bottom-k sketches. In Proceedings of the 2007 ACM Symposium on Principles of Distributed Computing (PODC)."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX).","author":"Cohen E.","year":"2013","unstructured":"Cohen, E. and Kaplan, H. (2013). What you can do with coordinated samples. In Proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)."},{"key":"e_1_2_1_20_1","volume-title":"Proc. VLDB Endow., 2(1).","author":"Cohen E.","year":"2009","unstructured":"Cohen, E., Kaplan, H., and Sen, S. (2009). Coordinated weighted sampling for estimating aggregates over multiple weight assignments. Proc. VLDB Endow., 2(1)."},{"key":"e_1_2_1_21_1","first-page":"21092","volume-title":"Advances in Neural Information Processing Systems","volume":"33","author":"Cohen E.","year":"2020","unstructured":"Cohen, E., Pagh, R., and Woodruff, D. (2020). Wor and p's: Sketches for \\ell_p-sampling without replacement. In Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., and Lin, H., editors, Advances in Neural Information Processing Systems, volume 33, pages 21092--21104. Curran Associates, Inc."},{"key":"e_1_2_1_22_1","volume-title":"Sketch techniques for approximate query processing. Foundations and Trends in Databases","author":"Cormode G.","year":"2011","unstructured":"Cormode, G. (2011). Sketch techniques for approximate query processing. Foundations and Trends in Databases. NOW publishers."},{"key":"e_1_2_1_23_1","volume-title":"Proc. VLDB Endow.","author":"Cormode G.","year":"2005","unstructured":"Cormode, G. and Garofalakis, M. (2005). Sketching streams through the net: Distributed approximate query tracking. Proc. VLDB Endow."},{"key":"e_1_2_1_24_1","volume-title":"Frequency Moments, and Applications","author":"Cormode G.","year":"2016","unstructured":"Cormode, G. and Garofalakis, M. (2016). Join Sizes, Frequency Moments, and Applications. Springer Berlin Heidelberg."},{"key":"e_1_2_1_25_1","volume-title":"Histograms, Wavelets, Sketches. Foundations and Trends in Databases","author":"Cormode G.","year":"2011","unstructured":"Cormode, G., Garofalakis, M., Haas, P., and Jermaine, C. (2011). Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches. Foundations and Trends in Databases. NOW publishers."},{"key":"e_1_2_1_26_1","volume-title":"Sampling methods for inner product sketching. arXiv:2309.16157","author":"Daliri M.","year":"2023","unstructured":"Daliri, M., Freire, J., Musco, C., Santos, A., and Zhang, H. (2023a). Sampling methods for inner product sketching. arXiv:2309.16157."},{"key":"e_1_2_1_27_1","series-title":"SIAM Symposium on Simplicity in Algorithms (SOSA24)","volume-title":"Simple analysis of priority sampling","author":"Daliri M.","year":"2023","unstructured":"Daliri, M., Freire, J., Musco, C., Santos, A., and Zhang, H. (2023b). Simple analysis of priority sampling. SIAM Symposium on Simplicity in Algorithms (SOSA24)."},{"key":"e_1_2_1_28_1","volume-title":"An elementary proof of a theorem of johnson and lindenstrauss. Random Structures & Algorithms, 22(1)","author":"Dasgupta S.","year":"2003","unstructured":"Dasgupta, S. and Gupta, A. (2003). An elementary proof of a theorem of johnson and lindenstrauss. Random Structures & Algorithms, 22(1)."},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS","author":"Duffield N.","year":"2004","unstructured":"Duffield, N., Lund, C., and Thorup, M. (2004). Flow sampling under hard resource constraints. In Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2004)."},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.2005.846400","article-title":"Learn more, sample less: control of volume and variance in network measurement","author":"Duffield N.","year":"2005","unstructured":"Duffield, N., Lund, C., and Thorup, M. (2005). Learn more, sample less: control of volume and variance in network measurement. IEEE Transactions on Information Theory, 51(5).","journal-title":"IEEE Transactions on Information Theory, 51(5)."},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD).","author":"Ertl O.","year":"2018","unstructured":"Ertl, O. (2018). Bagminhash - minwise hashing algorithm for weighted sets. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)."},{"key":"e_1_2_1_32_1","volume-title":"24th International Conference on Extending Database Technology (EDBT).","author":"Esmailoghli M.","year":"2021","unstructured":"Esmailoghli, M., Quian\u00e9-Ruiz, J.-A., and Abedjan, Z. (2021). Cocoa: Correlation coefficient-aware data augmentation. In 24th International Conference on Extending Database Technology (EDBT)."},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 22nd IEEE International Conference on Data Engineering (ICDE).","author":"Estan C.","year":"2006","unstructured":"Estan, C. and Naughton, J. (2006). End-biased samples for join cardinality estimation. In Proceedings of the 22nd IEEE International Conference on Data Engineering (ICDE)."},{"key":"e_1_2_1_34_1","volume-title":"On adaptive sampling. Computing, 43(4)","author":"Flajolet P.","year":"1990","unstructured":"Flajolet, P. (1990). On adaptive sampling. Computing, 43(4)."},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 15th ACM International Conference on Information and Knowledge Management (CIKM).","author":"Gollapudi S.","year":"2006","unstructured":"Gollapudi, S. and Panigrahy, R. (2006). Exploiting asymmetry in hierarchical topic extraction. In Proceedings of the 15th ACM International Conference on Information and Knowledge Management (CIKM)."},{"key":"e_1_2_1_36_1","volume-title":"Generating correlated data. Outline of the Statistical Pages Folder","author":"Howell D.","year":"2018","unstructured":"Howell, D. (2018). Generating correlated data. Outline of the Statistical Pages Folder."},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the 2010 IEEE International Conference on Data Mining (ICDM).","author":"Ioffe S.","year":"2010","unstructured":"Ioffe, S. (2010). Improved consistent sampling, weighted minhash and l1 sketching. In Proceedings of the 2010 IEEE International Conference on Data Mining (ICDM)."},{"key":"e_1_2_1_38_1","volume-title":"2022 IEEE 38th International Conference on Data Engineering Workshops (ICDEW). IEEE.","author":"Ionescu A.","year":"2022","unstructured":"Ionescu, A., Hai, R., Fragkoulis, M., and Katsifodimos, A. (2022). Join path-based data augmentation for decision trees. In 2022 IEEE 38th International Conference on Data Engineering Workshops (ICDEW). IEEE."},{"key":"e_1_2_1_39_1","article-title":"A quantized johnson-lindenstrauss lemma: The finding of buffon's needle","author":"Jacques L.","year":"2015","unstructured":"Jacques, L. (2015). A quantized johnson-lindenstrauss lemma: The finding of buffon's needle. IEEE Transactions on Information Theory, 61(9).","journal-title":"IEEE Transactions on Information Theory, 61(9)."},{"key":"e_1_2_1_40_1","first-page":"544","volume-title":"Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"Jayaram R.","year":"2018","unstructured":"Jayaram, R. and Woodruff, D. P. (2018). Perfect lp sampling in a data stream. In Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 544--555."},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the 19th International World Wide Web Conference (WWW)","author":"Kwak H.","year":"2010","unstructured":"Kwak, H., Lee, C., Park, H., and Moon, S. (2010). What is Twitter, a social network or a news media? In Proceedings of the 19th International World Wide Web Conference (WWW), New York, NY, USA. ACM."},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the 38th International Conference on Machine Learning (ICML). PMLR.","author":"Larsen K. G.","year":"2021","unstructured":"Larsen, K. G., Pagh, R., and T\u011btek, J. (2021). Countsketches, feature hashing and the median of three. In Proceedings of the 38th International Conference on Machine Learning (ICML). PMLR."},{"key":"e_1_2_1_43_1","volume-title":"Advances in Neural Information Processing Systems 19 (NeurIPS)","author":"Li P.","year":"2006","unstructured":"Li, P., Church, K., and Hastie, T. (2006). Conditional random sampling: A sketch-based sampling technique for sparse data. In Advances in Neural Information Processing Systems 19 (NeurIPS), volume 19."},{"key":"e_1_2_1_44_1","volume-title":"Theory and applications of b-bit minwise hashing. Commun. ACM, 54(8)","author":"Li P.","year":"2011","unstructured":"Li, P. and K\u00f6nig, A. C. (2011). Theory and applications of b-bit minwise hashing. Commun. ACM, 54(8)."},{"key":"e_1_2_1_45_1","volume-title":"Proceedings of the 38th IEEE International Conference on Data Engineering (ICDE).","author":"Liu J.","year":"2022","unstructured":"Liu, J., Chai, C., Luo, Y., Lou, Y., Feng, J., and Tang, N. (2022). Feature augmentation with reinforcement learning. In Proceedings of the 38th IEEE International Conference on Data Engineering (ICDE)."},{"key":"e_1_2_1_47_1","volume-title":"20 newsgroups dataset. https:\/\/scikit-learn.org\/stable\/modules\/generated\/sklearn.datasets.fetch_20newsgroups.html","author":"Mitchell T.","year":"1997","unstructured":"Mitchell, T. (1997). 20 newsgroups dataset. https:\/\/scikit-learn.org\/stable\/modules\/generated\/sklearn.datasets.fetch_20newsgroups.html."},{"key":"e_1_2_1_48_1","article-title":"Sequential poisson sampling","author":"Ohlsson E.","year":"1998","unstructured":"Ohlsson, E. (1998). Sequential poisson sampling. Journal of Official Statistics, 14(2).","journal-title":"Journal of Official Statistics, 14(2)."},{"key":"e_1_2_1_49_1","volume-title":"Proceedings of the 33rd Symposium on Principles of Database Systems (PODS).","author":"Pagh R.","year":"2014","unstructured":"Pagh, R., St\u00f6ckel, M., and Woodruff, D. P. (2014). Is min-wise hashing optimal for summarizing set intersection? In Proceedings of the 33rd Symposium on Principles of Database Systems (PODS)."},{"key":"e_1_2_1_50_1","volume-title":"Sketches for size of join estimation. ACM Transactions on Database Systems (TODS), 33(3)","author":"Rusu F.","year":"2008","unstructured":"Rusu, F. and Dobra, A. (2008). Sketches for size of join estimation. ACM Transactions on Database Systems (TODS), 33(3)."},{"key":"e_1_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Salton G. Wong A. and Yang C.-S. (1975). A vector space model for automatic indexing. Communications of the ACM 18(11).","DOI":"10.1145\/361219.361220"},{"key":"e_1_2_1_52_1","volume-title":"Proceedings of the 2021 ACM SIGMOD International Conference on Management of Data.","author":"Santos A.","year":"2021","unstructured":"Santos, A., Bessa, A., Chirigati, F., Musco, C., and Freire, J. (2021). Correlation sketches for approximate join-correlation queries. In Proceedings of the 2021 ACM SIGMOD International Conference on Management of Data."},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the 38th IEEE International Conference on Data Engineering (ICDE).","author":"Santos A.","year":"2022","unstructured":"Santos, A., Bessa, A., Musco, C., and Freire, J. (2022). A sketch-based index for correlated dataset search. In Proceedings of the 38th IEEE International Conference on Data Engineering (ICDE)."},{"key":"e_1_2_1_54_1","volume-title":"Advances in Neural Information Processing Systems 29 (NeurIPS).","author":"Shrivastava A.","year":"2016","unstructured":"Shrivastava, A. (2016). Simple and efficient weighted minwise hashing. In Advances in Neural Information Processing Systems 29 (NeurIPS)."},{"key":"e_1_2_1_55_1","volume-title":"Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC).","author":"Szegedy M.","year":"2006","unstructured":"Szegedy, M. (2006). The DLT priority sampling is essentially optimal. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC)."},{"key":"e_1_2_1_56_1","volume-title":"Proceedings of the 15th European Symposium on Algorithms (ESA). Springer Berlin Heidelberg.","author":"Szegedy M.","year":"2007","unstructured":"Szegedy, M. and Thorup, M. (2007). On the variance of subset sum estimation. In Proceedings of the 15th European Symposium on Algorithms (ESA). Springer Berlin Heidelberg."},{"key":"e_1_2_1_57_1","volume-title":"Proc. VLDB Endow., 8(12)","author":"Vengerov D.","year":"2015","unstructured":"Vengerov, D., Menck, A. C., Zait, M., and Chakkappen, S. P. (2015). Join size estimation subject to filter conditions. Proc. VLDB Endow., 8(12)."},{"key":"e_1_2_1_58_1","volume-title":"World bank group finances. https:\/\/finances.worldbank.org\/","author":"World Bank","year":"2023","unstructured":"World Bank (2023). World bank group finances. https:\/\/finances.worldbank.org\/."},{"key":"e_1_2_1_59_1","volume-title":"Proceedings of the 35th IEEE International Conference on Data Engineering (ICDE).","author":"Yang Y.","year":"2019","unstructured":"Yang, Y., Zhang, Y., Zhang, W., and Huang, Z. (2019). Gb-kmv: An augmented kmv sketch for approximate containment similarity search. In Proceedings of the 35th IEEE International Conference on Data Engineering (ICDE)."},{"key":"e_1_2_1_60_1","volume-title":"Tpch skew. https:\/\/github.com\/YSU-Data-Lab\/TPC-H-Skew","author":"Yu F.","year":"2022","unstructured":"Yu, F. (2022). Tpch skew. https:\/\/github.com\/YSU-Data-Lab\/TPC-H-Skew."},{"key":"e_1_2_1_61_1","volume-title":"Proc. VLDB Endow., 9(12)","author":"Zhu E.","year":"2016","unstructured":"Zhu, E., Nargesian, F., Pu, K. Q., and Miller, R. J. (2016). LSH ensemble: Internet-scale domain search. Proc. VLDB Endow., 9(12)."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3665844.3665850","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T22:28:53Z","timestamp":1722983333000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3665844.3665850"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":60,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["10.14778\/3665844.3665850"],"URL":"https:\/\/doi.org\/10.14778\/3665844.3665850","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2024,5]]},"assertion":[{"value":"2024-08-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}