{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:14Z","timestamp":1750219814544,"version":"3.41.0"},"reference-count":85,"publisher":"Association for Computing Machinery (ACM)","license":[{"start":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T00:00:00Z","timestamp":1691712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D program of China","doi-asserted-by":"crossref","award":["2021YFA1000900"],"award-info":[{"award-number":["2021YFA1000900"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["62272432"],"award-info":[{"award-number":["62272432"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Provincial NSF of Anhui","award":["2208085MF163"],"award-info":[{"award-number":["2208085MF163"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM J. Exp. Algorithmics"],"published-print":{"date-parts":[[2023,12,31]]},"abstract":"<jats:p>Many real-world problems can be formulated as the alignment between two geometric patterns. Previously, a great amount of research focus on the alignment of two-dimensional (2D) or 3D patterns in the field of computer vision. Recently, the alignment problem in high dimensions finds several novel applications in practice. However, the research is still rather limited in the algorithmic aspect. To the best of our knowledge, most existing approaches are just simple extensions of their counterparts for 2D and 3D cases and often suffer from the issues such as high computational complexities. In this article, we propose an effective framework to compress the high-dimensional geometric patterns. Any existing alignment method can be applied to the compressed geometric patterns and the time complexity can be significantly reduced. Our idea is inspired by the observation that high-dimensional data often has a low intrinsic dimension. Our framework is a \u201cdata-dependent\u201d approach that has the complexity depending on the intrinsic dimension of the input data. Our experimental results reveal that running the alignment algorithm on compressed patterns can achieve similar qualities, comparing with the results on the original patterns, but the runtimes (including the times cost for compression) are substantially lower.<\/jats:p>","DOI":"10.1145\/3604910","type":"journal-article","created":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T02:29:53Z","timestamp":1687400993000},"page":"1-32","source":"Crossref","is-referenced-by-count":0,"title":["A Data-dependent Approach for High-dimensional (Robust) Wasserstein Alignment"],"prefix":"10.1145","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1307-6077","authenticated-orcid":false,"given":"Hu","family":"Ding","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4524-8507","authenticated-orcid":false,"given":"Wenjie","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-8474-4910","authenticated-orcid":false,"given":"Mingquan","family":"Ye","sequence":"additional","affiliation":[{"name":"University of Illinois Chicago, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,11]]},"reference":[{"key":"e_1_3_4_2_2","volume-title":"Proceedings of the 10th International Conference on Learning Representations (ICLR\u201922)","author":"Aboagye Prince Osei","year":"2022","unstructured":"Prince Osei Aboagye, Yan Zheng, Chin-Chia Michael Yeh, Junpeng Wang, Wei Zhang, Liang Wang, Hao Yang, and Jeff M. Phillips. 2022. Normalization of language embeddings for cross-lingual alignment. In Proceedings of the 10th International Conference on Learning Representations (ICLR\u201922). OpenReview.net."},{"key":"e_1_3_4_3_2","first-page":"7:1\u20137:16","volume-title":"Proceedings of the 33rd International Symposium on Computational Geometry (SoCG\u201917)","author":"Agarwal Pankaj K.","year":"2017","unstructured":"Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, and Allen Xiao. 2017. Faster algorithms for the geometric transportation problem. In Proceedings of the 33rd International Symposium on Computational Geometry (SoCG\u201917). 7:1\u20137:16."},{"key":"e_1_3_4_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997856"},{"key":"e_1_3_4_5_2","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja Ravindra K.","year":"1993","unstructured":"Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall."},{"key":"e_1_3_4_6_2","first-page":"1964","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems","author":"Altschuler Jason","year":"2017","unstructured":"Jason Altschuler, Jonathan Weed, and Philippe Rigollet. 2017. Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration. In Proceedings of the Annual Conference on Neural Information Processing Systems. 1964\u20131974."},{"key":"e_1_3_4_7_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1214"},{"key":"e_1_3_4_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.25"},{"key":"e_1_3_4_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591805"},{"key":"e_1_3_4_10_2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/3357713.3384321","volume-title":"Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC\u201920)","author":"Andoni Alexandr","year":"2020","unstructured":"Alexandr Andoni, Clifford Stein, and Peilin Zhong. 2020. Parallel approximate undirected shortest paths via low hop emulators. In Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC\u201920), Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath, and Julia Chuzhoy (Eds.). ACM, 322\u2013335."},{"key":"e_1_3_4_11_2","first-page":"1027","volume-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Arthur David","year":"2007","unstructured":"David Arthur and Sergei Vassilvitskii. 2007. K-means++ the advantages of careful seeding. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms. 1027\u20131035."},{"key":"e_1_3_4_12_2","volume-title":"Problems of Learning on Manifolds","author":"Belkin Mikhail","year":"2003","unstructured":"Mikhail Belkin. 2003. Problems of Learning on Manifolds. The University of Chicago."},{"key":"e_1_3_4_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5152-4"},{"key":"e_1_3_4_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/34.121791"},{"key":"e_1_3_4_15_2","first-page":"290","volume-title":"Uncertainty in Artificial Intelligence","author":"Beugnot Gaspard","year":"2021","unstructured":"Gaspard Beugnot, Aude Genevay, Kristjan Greenewald, and Justin Solomon. 2021. Improving approximate optimal transport distances using quantization. In Uncertainty in Artificial Intelligence. PMLR, 290\u2013300."},{"key":"e_1_3_4_16_2","first-page":"129","volume-title":"Proceedings of the 21st Annual Conference on Neural Information Processing Systems","author":"Blitzer John","year":"2007","unstructured":"John Blitzer, Koby Crammer, Alex Kulesza, Fernando Pereira, and Jennifer Wortman. 2007. Learning bounds for domain adaptation. In Proceedings of the 21st Annual Conference on Neural Information Processing Systems. 129\u2013136."},{"key":"e_1_3_4_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2006.10.001"},{"key":"e_1_3_4_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-013-0667-3"},{"key":"e_1_3_4_19_2","first-page":"23270","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS\u201921)","author":"Chapel Laetitia","year":"2021","unstructured":"Laetitia Chapel, R\u00e9mi Flamary, Haoran Wu, C\u00e9dric F\u00e9votte, and Gilles Gasso. 2021. Unbalanced optimal transport through non-negative penalized linear regression. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS\u201921), Marc\u2019Aurelio Ranzato, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, and Jennifer Wortman Vaughan (Eds.). 23270\u201323282."},{"key":"e_1_3_4_20_2","doi-asserted-by":"crossref","unstructured":"Li Chen Rasmus Kyng Yang P. Liu Richard Peng Maximilian Probst Gutenberg and Sushant Sachdeva. 2022. Maximum flow and minimum-cost flow in almost-linear time. In IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS\u201922) . IEEE 612\u2013623.","DOI":"10.1109\/FOCS54457.2022.00064"},{"key":"e_1_3_4_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519979"},{"key":"e_1_3_4_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.1999.790393"},{"key":"e_1_3_4_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/SMI.2005.1"},{"key":"e_1_3_4_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2615921"},{"key":"e_1_3_4_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2615921"},{"key":"e_1_3_4_26_2","first-page":"2292","volume-title":"Proceedings of the 27th Annual Conference on Neural Information Processing Systems.","author":"Cuturi Marco","year":"2013","unstructured":"Marco Cuturi. 2013. Sinkhorn distances: Lightspeed computation of optimal transport. In Proceedings of the 27th Annual Conference on Neural Information Processing Systems.2292\u20132300."},{"key":"e_1_3_4_27_2","first-page":"317","volume-title":"Proceedinsg of the Conference on Learning Theory","author":"Dasgupta Sanjoy","year":"2013","unstructured":"Sanjoy Dasgupta and Kaushik Sinha. 2013. Randomized partition trees for exact nearest neighbor search. In Proceedinsg of the Conference on Learning Theory. 317\u2013337."},{"key":"e_1_3_4_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-020-01531-7"},{"key":"e_1_3_4_29_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976700.71"},{"key":"e_1_3_4_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0173-4"},{"key":"e_1_3_4_31_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011460"},{"key":"e_1_3_4_32_2","doi-asserted-by":"crossref","unstructured":"Dan Feldman. 2020. Core-sets: An updated survey. WIREs Data Min. Knowl. Discov. 10 1 (2020) 23\u201344.","DOI":"10.1002\/widm.1335"},{"key":"e_1_3_4_33_2","unstructured":"Kyle Fox and Jiashuai Lu. 2022. A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread. J. Comput. Geom. 13 1 (2022) 204\u2013225."},{"key":"e_1_3_4_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76368"},{"key":"e_1_3_4_35_2","first-page":"2066","volume-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition","author":"Gong Boqing","year":"2012","unstructured":"Boqing Gong, Yuan Shi, Fei Sha, and Kristen Grauman. 2012. Geodesic flow kernel for unsupervised domain adaptation. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. IEEE, 2066\u20132073."},{"key":"e_1_3_4_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_3_4_37_2","first-page":"1880","volume-title":"Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics","author":"Grave Edouard","year":"2019","unstructured":"Edouard Grave, Armand Joulin, and Quentin Berthet. 2019. Unsupervised alignment of embeddings with wasserstein procrustes. In Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics. PMLR, 1880\u20131890."},{"key":"e_1_3_4_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_4_39_2","first-page":"120","volume-title":"Proceedings of the International Conference on Artificial Intelligence and Statistics (AISTATS\u201905)","author":"Ham Jihun","year":"2005","unstructured":"Jihun Ham, Daniel D. Lee, and Lawrence K. Saul. 2005. Semisupervised alignment of manifolds. In Proceedings of the International Conference on Artificial Intelligence and Statistics (AISTATS\u201905). 120\u2013127."},{"key":"e_1_3_4_40_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446281"},{"key":"e_1_3_4_41_2","first-page":"39","volume-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Indyk Piotr","year":"2007","unstructured":"Piotr Indyk. 2007. A near linear time constant factor approximation for Euclidean bichromatic matching (cost). In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 39\u201342."},{"key":"e_1_3_4_42_2","volume-title":"Workshop on Statistical and Computational Theories of Vision (at ICCV\u201903)","author":"Indyk Piotr","year":"2003","unstructured":"Piotr Indyk and N. Thaper. 2003. Fast color image retrieval via embeddings. In Workshop on Statistical and Computational Theories of Vision (at ICCV\u201903)."},{"key":"e_1_3_4_43_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/484"},{"key":"e_1_3_4_44_2","unstructured":"Ibrahim Jubran Alaa Maalouf Ron Kimmel and Dan Feldman. 2021. Provably approximated ICP. arXiv:2101.03588. Retrieved from https:\/\/arxiv.org\/abs\/2101.03588."},{"key":"e_1_3_4_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510013"},{"key":"e_1_3_4_46_2","first-page":"15:1\u201315:14","volume-title":"Proceedings of the 35th International Symposium on Computational Geometry","author":"Khesin Andrey Boris","year":"2019","unstructured":"Andrey Boris Khesin, Aleksandar Nikolov, and Dmitry Paramonov. 2019. Preconditioning for the geometric transportation problem. In Proceedings of the 35th International Symposium on Computational Geometry. 15:1\u201315:14."},{"key":"e_1_3_4_47_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1000232"},{"key":"e_1_3_4_48_2","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1007\/11602613_101","volume-title":"International Symposium on Algorithms and Computation","author":"Klein Oliver","year":"2005","unstructured":"Oliver Klein and Remco C. Veltkamp. 2005. Approximation algorithms for computing the earth mover\u2019s distance under transformations. In International Symposium on Algorithms and Computation. Springer, 1019\u20131028."},{"key":"e_1_3_4_49_2","first-page":"798","volume-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Krauthgamer Robert","year":"2004","unstructured":"Robert Krauthgamer and James R. Lee. 2004. Navigating nets: Simple algorithms for proximity search. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 798\u2013807."},{"key":"e_1_3_4_50_2","first-page":"957","volume-title":"Proceedings of the International Conference on Machine Learning","author":"Kusner Matt","year":"2015","unstructured":"Matt Kusner, Yu Sun, Nicholas Kolkin, and Kilian Weinberger. 2015. From word embeddings to document distances. In Proceedings of the International Conference on Machine Learning. 957\u2013966."},{"key":"e_1_3_4_51_2","doi-asserted-by":"publisher","DOI":"10.1112\/S0024609302001200"},{"key":"e_1_3_4_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.80"},{"key":"e_1_3_4_53_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.52"},{"key":"e_1_3_4_54_2","article-title":"On constant factor approximation for earth mover distance over doubling metrics","volume":"1002","author":"Li Shi","year":"2010","unstructured":"Shi Li. 2010. On constant factor approximation for earth mover distance over doubling metrics. CoRR abs\/1002.4034.","journal-title":"CoRR"},{"key":"e_1_3_4_55_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10504"},{"key":"e_1_3_4_56_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_4_57_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-01085-9"},{"key":"e_1_3_4_58_2","doi-asserted-by":"publisher","DOI":"10.5555\/1557624"},{"key":"e_1_3_4_59_2","article-title":"Exploiting similarities among languages for machine translation","author":"Mikolov Tomas","year":"2013","unstructured":"Tomas Mikolov, Quoc V. Le, and Ilya Sutskever. 2013. Exploiting similarities among languages for machine translation. arXiv:1309.4168. Retrieved from https:\/\/arxiv.org\/abs\/1309.4168.","journal-title":"arXiv:1309.4168"},{"key":"e_1_3_4_60_2","first-page":"7850","volume-title":"International Conference on Machine Learning","author":"Mukherjee Debarghya","year":"2021","unstructured":"Debarghya Mukherjee, Aritra Guha, Justin M. Solomon, Yuekai Sun, and Mikhail Yurochkin. 2021. Outlier-robust optimal transport. In International Conference on Machine Learning. PMLR, 7850\u20137860."},{"key":"e_1_3_4_61_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13218-017-0519-3"},{"key":"e_1_3_4_62_2","article-title":"Low-cost and faster tracking systems using core-sets for pose-estimation","volume":"1511","author":"Nasser Soliman","year":"2015","unstructured":"Soliman Nasser, Ibrahim Jubran, and Dan Feldman. 2015. Low-cost and faster tracking systems using core-sets for pose-estimation. CoRR abs\/1511.09120 (2015).","journal-title":"CoRR"},{"key":"e_1_3_4_63_2","doi-asserted-by":"publisher","DOI":"10.21236\/ADA457044"},{"key":"e_1_3_4_64_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02614365"},{"key":"e_1_3_4_65_2","doi-asserted-by":"publisher","DOI":"10.5555\/3112670.3113031"},{"key":"e_1_3_4_66_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.191"},{"key":"e_1_3_4_67_2","article-title":"Mapping estimation for discrete optimal transport","volume":"29","author":"Perrot Micha\u00ebl","year":"2016","unstructured":"Micha\u00ebl Perrot, Nicolas Courty, R\u00e9mi Flamary, and Amaury Habrard. 2016. Mapping estimation for discrete optimal transport. In Advances in Neural Information Processing Systems, 29.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_4_68_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"e_1_3_4_69_2","article-title":"A network synthesis model for generating protein interaction network families","volume":"7","author":"Mohammad Ebrahim Sahraeian Sayed","year":"2012","unstructured":"Ebrahim Sahraeian Sayed Mohammad and Byung-Jun Yoon. 2012. A network synthesis model for generating protein interaction network families. PloS One 7 (August2012).","journal-title":"PloS One"},{"key":"e_1_3_4_70_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289451"},{"key":"e_1_3_4_71_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.29"},{"key":"e_1_3_4_72_2","first-page":"385","volume-title":"Proceedings of the 44th Symposium on Theory of Computing Conference (STOC\u201912)","author":"Sharathkumar R.","year":"2012","unstructured":"R. Sharathkumar and Pankaj K. Agarwal. 2012. A near-linear time \\(\\epsilon\\) -approximation algorithm for geometric bipartite matching. In Proceedings of the 44th Symposium on Theory of Computing Conference (STOC\u201912). 385\u2013394."},{"key":"e_1_3_4_73_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.49"},{"key":"e_1_3_4_74_2","doi-asserted-by":"publisher","DOI":"10.1142\/S021952590200047X"},{"key":"e_1_3_4_75_2","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007399"},{"key":"e_1_3_4_76_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579369"},{"key":"e_1_3_4_77_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-007-0077-5"},{"key":"e_1_3_4_78_2","doi-asserted-by":"publisher","DOI":"10.1137\/0218080"},{"key":"e_1_3_4_79_2","first-page":"805","volume-title":"Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Varadarajan Kasturi R.","year":"1999","unstructured":"Kasturi R. Varadarajan and Pankaj K. Agarwal. 1999. Approximation algorithms for bipartite and non-bipartite matching in the plane. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms. 805\u2013814."},{"key":"e_1_3_4_80_2","doi-asserted-by":"publisher","DOI":"10.1159\/000067642"},{"key":"e_1_3_4_81_2","article-title":"Topics in optimal transportation","volume":"58","author":"Villani C\u00e9dric","year":"2008","unstructured":"C\u00e9dric Villani. 2008. Topics in optimal transportation. Am. Math. Soc. 58 (2008).","journal-title":"Am. Math. Soc."},{"key":"e_1_3_4_82_2","doi-asserted-by":"publisher","DOI":"10.1137\/1007077"},{"key":"e_1_3_4_83_2","doi-asserted-by":"crossref","unstructured":"C. Wang P. Krafft S. Mahadevan Y. Ma and Y. Fu. 2011. Manifold alignment. In Manifold Learning: Theory and Applications CRC Press. 95\u2013120.","DOI":"10.1201\/b11431-6"},{"key":"e_1_3_4_84_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.csbj.2017.07.004"},{"key":"e_1_3_4_85_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1520752113"},{"key":"e_1_3_4_86_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1207"}],"container-title":["ACM Journal of Experimental Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3604910","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3604910","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:05Z","timestamp":1750178765000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3604910"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,11]]},"references-count":85,"alternative-id":["10.1145\/3604910"],"URL":"https:\/\/doi.org\/10.1145\/3604910","relation":{},"ISSN":["1084-6654","1084-6654"],"issn-type":[{"type":"print","value":"1084-6654"},{"type":"electronic","value":"1084-6654"}],"subject":[],"published":{"date-parts":[[2023,8,11]]}}}