{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T05:46:15Z","timestamp":1777873575096,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":86,"publisher":"ACM","funder":[{"name":"NSFC","award":["2370201, 62222607"],"award-info":[{"award-number":["2370201, 62222607"]}]},{"DOI":"10.13039\/501100006374","name":"Ant Group","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,3]]},"DOI":"10.1145\/3711896.3736859","type":"proceedings-article","created":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T20:52:41Z","timestamp":1754254361000},"page":"2550-2561","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["BiQAP: Neural Bi-level Optimization-based Framework for Solving Quadratic Assignment Problems"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7033-4207","authenticated-orcid":false,"given":"Liangliang","family":"Shi","sequence":"first","affiliation":[{"name":"Shanghai Institute for Mathematics and Interdisciplinary Sciences, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-4199-0298","authenticated-orcid":false,"given":"Haoran","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6134-6601","authenticated-orcid":false,"given":"Shuheng","family":"Shen","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8992-9833","authenticated-orcid":false,"given":"Changhua","family":"Meng","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6159-619X","authenticated-orcid":false,"given":"Weiqiang","family":"Wang","sequence":"additional","affiliation":[{"name":"Ant Group, hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9639-7679","authenticated-orcid":false,"given":"Junchi","family":"Yan","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5220\/0005209202710278"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489513"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290967"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5720"},{"key":"e_1_3_2_1_5_1","unstructured":"Irwan Bello Hieu Pham Quoc V Le Mohammad Norouzi and Samy Bengio. 2016. Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940(2016)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/141000439"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"e_1_3_2_1_8_1","unstructured":"Xavier Bresson and Thomas Laurent. 2018. An experimental study of neural networks for variable graphs. (2018)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.52202\/075280-1769"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008293323270"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58529-7_32"},{"key":"e_1_3_2_1_12_1","volume-title":"Learning to perform local rewriting for combinatorial optimization. Advances in neural information processing systems","author":"Chen Xinyun","year":"2019","unstructured":"Xinyun Chen and Yuandong Tian. 2019. Learning to perform local rewriting for combinatorial optimization. Advances in neural information processing systems, Vol. 32 (2019)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15555-0_36"},{"key":"e_1_3_2_1_14_1","volume-title":"Asian conference on machine learning. PMLR, 465-480","author":"Costa Paulo R","year":"2020","unstructured":"Paulo R d O Costa, Jason Rhuggenaath, Yingqian Zhang, and Alp Akcay. 2020. Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning. In Asian conference on machine learning. PMLR, 465-480."},{"key":"e_1_3_2_1_15_1","volume-title":"Maximization of a linear function of variables subject to linear inequalities. Activity analysis of production and allocation","author":"Dantzig George B","year":"1951","unstructured":"George B Dantzig. 1951. Maximization of a linear function of variables subject to linear inequalities. Activity analysis of production and allocation, Vol. 13 (1951), 339-347."},{"key":"e_1_3_2_1_16_1","unstructured":"A. David B. Robert C. Vasek and C. William. 2006. Concorde TSP Solver. https:\/\/www.math.uwaterloo.ca\/tsp\/concorde.html."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Stephan Dempe. 2020. Bilevel optimization: theory algorithms applications and a bibliography. Bilevel optimization: advances and next challenges(2020) 581-672.","DOI":"10.1007\/978-3-030-52119-6_20"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03848-8_5"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"CS Edwards. 1980. A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem. Combinatorial optimization II(1980) 35-52.","DOI":"10.1007\/BFb0120905"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.05.027"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1981.156"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.3115\/1699510.1699513"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3520304.3533982"},{"key":"e_1_3_2_1_24_1","volume-title":"Mamba: Linear-time sequence modeling with selective state spaces. arXiv preprint arXiv:2312.00752(2023).","author":"Gu Albert","year":"2023","unstructured":"Albert Gu and Tri Dao. 2023. Mamba: Linear-time sequence modeling with selective state spaces. arXiv preprint arXiv:2312.00752(2023)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/b101971"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00063-5"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012252420779"},{"key":"e_1_3_2_1_28_1","volume-title":"The traveling-salesman problem and minimum spanning trees. Operations research","author":"Held Michael","year":"1970","unstructured":"Michael Held and Richard M Karp. 1970. The traveling-salesman problem and minimum spanning trees. Operations research, Vol. 18, 6 (1970), 1138-1162."},{"key":"e_1_3_2_1_29_1","volume-title":"International Conference on Learning Representations.","author":"Hottung Andr\u00e9","year":"2021","unstructured":"Andr\u00e9 Hottung, Bhanu Bhandari, and Kevin Tierney. 2021. Learning a latent search space for routing problems using variational autoencoders. In International Conference on Learning Representations."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-73778-7_164"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-022-09327-y"},{"key":"e_1_3_2_1_32_1","unstructured":"Chaitanya K Joshi Thomas Laurent and Xavier Bresson. 2019. An efficient graph convolutional network technique for the travelling salesman problem. arXiv preprint arXiv:1906.01227(2019)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808695"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.52202\/068431-0141"},{"key":"e_1_3_2_1_35_1","unstructured":"Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907(2016)."},{"key":"e_1_3_2_1_36_1","volume-title":"Herke Van Hoof, and Max Welling","author":"Kool Wouter","year":"2018","unstructured":"Wouter Kool, Herke Van Hoof, and Max Welling. 2018. Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475(2018)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Tjalling C Koopmans and Martin Beckmann. 1957. Assignment problems and the location of economic activities. Econometrica: journal of the Econometric Society(1957) 53-76.","DOI":"10.2307\/1907742"},{"key":"e_1_3_2_1_38_1","volume-title":"The Hungarian method for the assignment problem. Naval research logistics quarterly","author":"Kuhn Harold W","year":"1955","unstructured":"Harold W Kuhn. 1955. The Hungarian method for the assignment problem. Naval research logistics quarterly, Vol. 2, 1-2 (1955), 83-97."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1196480"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.52202\/075280-0948"},{"key":"e_1_3_2_1_41_1","volume-title":"The quadratic assignment problem. Management science","author":"Lawler Eugene L","year":"1963","unstructured":"Eugene L Lawler. 1963. The quadratic assignment problem. Management science, Vol. 9, 4 (1963), 586-599."},{"key":"e_1_3_2_1_42_1","volume-title":"Tree-sliced variants of Wasserstein distances. Advances in neural information processing systems","author":"Le Tam","year":"2019","unstructured":"Tam Le, Makoto Yamada, Kenji Fukumizu, and Marco Cuturi. 2019. Tree-sliced variants of Wasserstein distances. Advances in neural information processing systems, Vol. 32 (2019)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.20"},{"key":"e_1_3_2_1_44_1","volume-title":"An integer projected fixed point method for graph matching and map inference. Advances in neural information processing systems","author":"Leordeanu Marius","year":"2009","unstructured":"Marius Leordeanu, Martial Hebert, and Rahul Sukthankar. 2009. An integer projected fixed point method for graph matching and map inference. Advances in neural information processing systems, Vol. 22 (2009)."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.01.013"},{"key":"e_1_3_2_1_46_1","volume-title":"An effective heuristic algorithm for the traveling-salesman problem. Operations research","author":"Lin Shen","year":"1973","unstructured":"Shen Lin and Brian W Kernighan. 1973. An effective heuristic algorithm for the traveling-salesman problem. Operations research, Vol. 21, 2 (1973), 498-516."},{"key":"e_1_3_2_1_47_1","volume-title":"Darts: Differentiable architecture search. arXiv preprint arXiv:1806.09055(2018).","author":"Liu Hanxiao","year":"2018","unstructured":"Hanxiao Liu, Karen Simonyan, and Yiming Yang. 2018. Darts: Differentiable architecture search. arXiv preprint arXiv:1806.09055(2018)."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-012-0284-8"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.3390\/axioms3030335"},{"key":"e_1_3_2_1_50_1","unstructured":"Gaspard Monge. 1781. M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. Mem. Math. Phys. Acad. Royale Sci.( 1781) 666-704."},{"key":"e_1_3_2_1_51_1","volume-title":"SSPR 2006 and SPR 2006, Hong Kong, China, August 17-19, 2006. Proceedings. Springer, 163-172","author":"Neuhaus Michel","year":"2006","unstructured":"Michel Neuhaus, Kaspar Riesen, and Horst Bunke. 2006. Fast suboptimal algorithms for the computation of graph edit distance. In Structural, Syntactic, and Statistical Pattern Recognition: Joint IAPR International Workshops, SSPR 2006 and SPR 2006, Hong Kong, China, August 17-19, 2006. Proceedings. Springer, 163-172."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSW.2018.8439919"},{"key":"e_1_3_2_1_53_1","volume-title":"Strategic facility location: A review. European journal of operational research","author":"Owen Susan Hesse","year":"1998","unstructured":"Susan Hesse Owen and Mark S Daskin. 1998. Strategic facility location: A review. European journal of operational research, Vol. 111, 3 (1998), 423-447."},{"key":"e_1_3_2_1_54_1","volume-title":"International conference on machine learning. PMLR, 2664-2672","author":"Peyr\u00e9 Gabriel","year":"2016","unstructured":"Gabriel Peyr\u00e9, Marco Cuturi, and Justin Solomon. 2016. Gromov-wasserstein averaging of kernel and distance matrices. In International conference on machine learning. PMLR, 2664-2672."},{"key":"e_1_3_2_1_55_1","volume-title":"International Conference on Learning Representations.","author":"Phatak Abhijeet","year":"2023","unstructured":"Abhijeet Phatak, Sharath Raghvendra, Chittaranjan Tripathy, and Kaiyi Zhang. 2023. Computing all optimal partial transports. In International Conference on Learning Representations."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.14778\/3594512.3594514"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.52202\/068431-1851"},{"key":"e_1_3_2_1_58_1","volume-title":"International Conference on Machine Learning.","author":"Raghvendra Sharath","year":"2024","unstructured":"Sharath Raghvendra, Pouyan Shirzadian, and Kaiyi Zhang. 2024. A New Robust Partial p -Wasserstein-Based Metric for Comparing Distributions. In International Conference on Machine Learning."},{"key":"e_1_3_2_1_59_1","first-page":"21","article-title":"Speeding up graph edit distance computation with a bipartite heuristic","author":"Riesen Kaspar","year":"2007","unstructured":"Kaspar Riesen, Stefan Fankhauser, and Horst Bunke. 2007. Speeding up graph edit distance computation with a bipartite heuristic.. In MLG. Citeseer, 21-24.","journal-title":"MLG. Citeseer"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"e_1_3_2_1_61_1","volume-title":"Markus Hagenbuchner, and Gabriele Monfardini.","author":"Scarselli Franco","year":"2008","unstructured":"Franco Scarselli, Marco Gori, Ah Chung Tsoi, Markus Hagenbuchner, and Gabriele Monfardini. 2008. The graph neural network model. IEEE transactions on neural networks, Vol. 20, 1 (2008), 61-80."},{"key":"e_1_3_2_1_62_1","volume-title":"Forty-first International Conference on Machine Learning.","author":"Shi Liangliang","year":"2024","unstructured":"Liangliang Shi, Jack Fan, and Junchi Yan. 2024a. OT-CLIP: Understanding and Generalizing CLIP via Optimal Transport. In Forty-first International Conference on Machine Learning."},{"key":"e_1_3_2_1_63_1","volume-title":"Intelligent Automation & Soft Computing","volume":"26","author":"Shi Liangliang","year":"2020","unstructured":"Liangliang Shi, Peili Lu, and Junchi Yan. 2020. Causality Learning from Time Series Data for the Industrial Finance Analysis via the Multi-Dimensional Point Process. Intelligent Automation & Soft Computing, Vol. 26, 5 (2020)."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i13.29419"},{"key":"e_1_3_2_1_65_1","volume-title":"International conference on machine learning. PMLR, 31408-31421","author":"Shi Liangliang","year":"2023","unstructured":"Liangliang Shi, Gu Zhang, Haoyu Zhen, Jintao Fan, and Junchi Yan. 2023. Understanding and generalizing contrastive learning from the inverse optimal transport perspective. In International conference on machine learning. PMLR, 31408-31421."},{"key":"e_1_3_2_1_66_1","volume-title":"Advances in Neural Information Processing Systems","volume":"36","author":"Shi Liangliang","year":"2024","unstructured":"Liangliang Shi, Haoyu Zhen, Gu Zhang, and Junchi Yan. 2024c. Relative entropic optimal transport: a (prior-aware) matching perspective to (unbalanced) classification. Advances in Neural Information Processing Systems, Vol. 36 (2024)."},{"key":"e_1_3_2_1_67_1","volume-title":"A relationship between arbitrary positive matrices and doubly stochastic matrices. The annals of mathematical statistics","author":"Sinkhorn Richard","year":"1964","unstructured":"Richard Sinkhorn. 1964. A relationship between arbitrary positive matrices and doubly stochastic matrices. The annals of mathematical statistics, Vol. 35, 2 (1964), 876-879."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.52202\/075280-0164"},{"key":"e_1_3_2_1_69_1","unstructured":"Petar Veli\u010dkovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio and Yoshua Bengio. 2017. Graph attention networks. arXiv preprint arXiv:1710.10903(2017)."},{"key":"e_1_3_2_1_70_1","volume-title":"Pointer networks. Advances in neural information processing systems","author":"Vinyals Oriol","year":"2015","unstructured":"Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly. 2015. Pointer networks. Advances in neural information processing systems, Vol. 28 (2015)."},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671693"},{"key":"e_1_3_2_1_72_1","first-page":"1","article-title":"Pygmtools: A Python Graph Matching Toolkit","volume":"25","author":"Wang Runzhong","year":"2024","unstructured":"Runzhong Wang, Ziao Guo, Wenzheng Pan, Jiale Ma, Yikai Zhang, Nan Yang, Qi Liu, Longxuan Wei, Hanxue Zhang, Chang Liu, Zetian Jiang, Xiaokang Yang, and Junchi Yan. 2024a. Pygmtools: A Python Graph Matching Toolkit. Journal of Machine Learning Research, Vol. 25, 33 (2024), 1-7. https:\/\/jmlr.org\/papers\/v25\/23-0572.html","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00315"},{"key":"e_1_3_2_1_74_1","volume-title":"Combinatorial learning of robust deep graph matching: an embedding based approach","author":"Wang Runzhong","year":"2020","unstructured":"Runzhong Wang, Junchi Yan, and Xiaokang Yang. 2020. Combinatorial learning of robust deep graph matching: an embedding based approach. IEEE transactions on pattern analysis and machine intelligence, Vol. 45, 6 (2020), 6984-7000."},{"key":"e_1_3_2_1_75_1","first-page":"5261","article-title":"Neural graph matching network: Learning lawler's quadratic assignment problem with extension to hypergraph and multiple-graph matching","volume":"44","author":"Wang Runzhong","year":"2021","unstructured":"Runzhong Wang, Junchi Yan, and Xiaokang Yang. 2021a. Neural graph matching network: Learning lawler's quadratic assignment problem with extension to hypergraph and multiple-graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 44, 9 (2021), 5261-5279.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00520"},{"key":"e_1_3_2_1_77_1","volume-title":"Graph matching with adaptive and branching path following","author":"Wang Tao","year":"2017","unstructured":"Tao Wang, Haibin Ling, Congyan Lang, and Songhe Feng. 2017. Graph matching with adaptive and branching path following. IEEE transactions on pattern analysis and machine intelligence, Vol. 40, 12 (2017), 2853-2867."},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-012-0566-z"},{"key":"e_1_3_2_1_79_1","unstructured":"Wei Xia Juan Vera and Luis F Zuluaga. 2015. Globally solving non-convex quadratic programs via linear integer programming techniques. arXiv preprint arXiv:1511.02423(2015)."},{"key":"e_1_3_2_1_80_1","unstructured":"Junchi Yan Shuang Yang and Edwin Hancock. 2020. Learning Graph Matching and Related Combinatorial Optimization Problems. In IJCAI."},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911996.2912035"},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00056"},{"key":"e_1_3_2_1_83_1","volume-title":"International Conference on Machine Learning. PMLR, 39903-39912","author":"Ye Xinyu","year":"2023","unstructured":"Xinyu Ye, Ge Yan, and Junchi Yan. 2023. Towards quantum machine learning for constrained combinatorial optimization: a quantum qap solver. In International Conference on Machine Learning. PMLR, 39903-39912."},{"key":"e_1_3_2_1_84_1","volume-title":"International conference on learning representations.","author":"Yu Tianshu","year":"2019","unstructured":"Tianshu Yu, Runzhong Wang, Junchi Yan, and Baoxin Li. 2019. Learning deep graph matching with channel-independent embedding and hungarian attention. In International conference on learning representations."},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i05.6226"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3016529"}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Toronto ON Canada","acronym":"KDD '25","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711896.3736859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T18:03:25Z","timestamp":1777572205000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711896.3736859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"references-count":86,"alternative-id":["10.1145\/3711896.3736859","10.1145\/3711896"],"URL":"https:\/\/doi.org\/10.1145\/3711896.3736859","relation":{},"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"2025-08-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}