{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:10:16Z","timestamp":1785543016430,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T00:00:00Z","timestamp":1682812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1947135, 2134079, 1939725"],"award-info":[{"award-number":["1947135, 2134079, 1939725"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR001121C0165"],"award-info":[{"award-number":["HR001121C0165"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583357","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T23:30:51Z","timestamp":1682551851000},"page":"372-382","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["PARROT: Position-Aware Regularized Optimal Transport for Network Alignment"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5534-3401","authenticated-orcid":false,"given":"Zhichen","family":"Zeng","sequence":"first","affiliation":[{"name":"Computer Science, University of Illinois at Urbana-Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4509-5173","authenticated-orcid":false,"given":"Si","family":"Zhang","sequence":"additional","affiliation":[{"name":"Meta, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8155-5440","authenticated-orcid":false,"given":"Yinglong","family":"Xia","sequence":"additional","affiliation":[{"name":"Meta, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4405-3887","authenticated-orcid":false,"given":"Hanghang","family":"Tong","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Joint User Modeling Across Aligned Heterogeneous Sites Using Neural Networks. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 799\u2013815","author":"Cao Xuezhi","year":"2017","unstructured":"Xuezhi Cao and Yong Yu. 2017. Joint User Modeling Across Aligned Heterogeneous Sites Using Neural Networks. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 799\u2013815."},{"key":"e_1_3_2_1_2_1","volume-title":"International Conference on Machine Learning. PMLR, 1542\u20131553","author":"Chen Liqun","year":"2020","unstructured":"Liqun Chen, Zhe Gan, Yu Cheng, Linjie Li, Lawrence Carin, and Jingjing Liu. 2020. Graph optimal transport for cross-domain alignment. In International Conference on Machine Learning. PMLR, 1542\u20131553."},{"key":"e_1_3_2_1_3_1","volume-title":"Multilingual knowledge graph embeddings for cross-lingual knowledge alignment. arXiv preprint arXiv:1611.03954","author":"Chen Muhao","year":"2016","unstructured":"Muhao Chen, Yingtao Tian, Mohan Yang, and Carlo Zaniolo. 2016. Multilingual knowledge graph embeddings for cross-lingual knowledge alignment. arXiv preprint arXiv:1611.03954 (2016)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412136"},{"key":"e_1_3_2_1_5_1","unstructured":"Xiaokai Chu Xinxin Fan Di Yao Zhihua Zhu Jianhui Huang and Jingping Bi. 2019. Cross-network embedding for multi-network alignment. In The world wide web conference. 273\u2013284."},{"key":"e_1_3_2_1_6_1","volume-title":"Sinkhorn distances: Lightspeed computation of optimal transport. Advances in neural information processing systems 26","author":"Cuturi Marco","year":"2013","unstructured":"Marco Cuturi. 2013. Sinkhorn distances: Lightspeed computation of optimal transport. Advances in neural information processing systems 26 (2013), 2292\u20132300."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220002"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3470801"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271788"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3023589"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.152"},{"key":"e_1_3_2_1_12_1","unstructured":"Li Liu William\u00a0K Cheung Xin Li and Lejian Liao. 2016. Aligning Users across Social Networks Using Network Embedding.. In Ijcai. 1774\u20131780."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20738"},{"key":"e_1_3_2_1_14_1","volume-title":"GOT: An optimal transport framework for graph comparison. arXiv preprint arXiv:1906.02085","author":"Maretic Hermina\u00a0Petric","year":"2019","unstructured":"Hermina\u00a0Petric Maretic, Mireille\u00a0EL Gheche, Giovanni Chierchia, and Pascal Frossard. 2019. GOT: An optimal transport framework for graph comparison. arXiv preprint arXiv:1906.02085 (2019)."},{"key":"e_1_3_2_1_15_1","volume-title":"Wasserstein-based graph alignment. arXiv preprint arXiv:2003.06048","author":"Maretic Hermina\u00a0Petric","year":"2020","unstructured":"Hermina\u00a0Petric Maretic, Mireille\u00a0El Gheche, Matthias Minder, Giovanni Chierchia, and Pascal Frossard. 2020. Wasserstein-based graph alignment. arXiv preprint arXiv:2003.06048 (2020)."},{"key":"e_1_3_2_1_16_1","volume-title":"Learning latent permutations with gumbel-sinkhorn networks. arXiv preprint arXiv:1802.08665","author":"Mena Gonzalo","year":"2018","unstructured":"Gonzalo Mena, David Belanger, Scott Linderman, and Jasper Snoek. 2018. Learning latent permutations with gumbel-sinkhorn networks. arXiv preprint arXiv:1802.08665 (2018)."},{"key":"e_1_3_2_1_17_1","unstructured":"Gaspard Monge. 1781. M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. Histoire de l\u2019Acad\u00e9mie Royale des Sciences de Paris (1781)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623643"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/3298483.3298589"},{"key":"e_1_3_2_1_20_1","volume-title":"Graph Optimal Transport with Transition Couplings of Random Walks. arXiv preprint arXiv:2106.07106","author":"O\u2019Connor Kevin","year":"2021","unstructured":"Kevin O\u2019Connor, Bongsoo Yi, Kevin McGoff, and Andrew\u00a0B Nobel. 2021. Graph Optimal Transport with Transition Couplings of Random Walks. arXiv preprint arXiv:2106.07106 (2021)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512089"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680835519"},{"key":"e_1_3_2_1_23_1","volume-title":"International Conference on Machine Learning. PMLR, 2664\u20132672","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\u20132672."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Yousef Saad. 2003. Iterative methods for sparse linear systems. SIAM.","DOI":"10.1137\/1.9780898718003"},{"key":"e_1_3_2_1_25_1","volume-title":"Graph Matching via Optimal Transport. arXiv preprint arXiv:2111.05366","author":"Saad-Eldin Ali","year":"2021","unstructured":"Ali Saad-Eldin, Benjamin\u00a0D Pedigo, Carey\u00a0E Priebe, and Joshua\u00a0T Vogelstein. 2021. Graph Matching via Optimal Transport. arXiv preprint arXiv:2111.05366 (2021)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0806627105"},{"key":"e_1_3_2_1_27_1","volume-title":"Optimal transport-based alignment of learned character representations for string similarity. arXiv preprint arXiv:1907.10165","author":"Tam Derek","year":"2019","unstructured":"Derek Tam, Nicholas Monath, Ari Kobren, Aaron Traylor, Rajarshi Das, and Andrew McCallum. 2019. Optimal transport-based alignment of learned character representations for string similarity. arXiv preprint arXiv:1907.10165 (2019)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"e_1_3_2_1_30_1","unstructured":"Yujia Xie Xiangfeng Wang Ruijia Wang and Hongyuan Zha. 2020. A fast proximal point method for computing exact wasserstein distance. In Uncertainty in Artificial Intelligence. PMLR 433\u2013453."},{"key":"e_1_3_2_1_31_1","volume-title":"Scalable Gromov-Wasserstein learning for graph partitioning and matching. Advances in neural information processing systems 32","author":"Xu Hongteng","year":"2019","unstructured":"Hongteng Xu, Dixin Luo, and Lawrence Carin. 2019. Scalable Gromov-Wasserstein learning for graph partitioning and matching. Advances in neural information processing systems 32 (2019), 3052\u20133062."},{"key":"e_1_3_2_1_32_1","volume-title":"International conference on machine learning. PMLR, 6932\u20136941","author":"Xu Hongteng","year":"2019","unstructured":"Hongteng Xu, Dixin Luo, Hongyuan Zha, and Lawrence\u00a0Carin Duke. 2019. Gromov-wasserstein learning for graph matching and node embedding. In International conference on machine learning. PMLR, 6932\u20136941."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16585"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450053"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557291"},{"key":"e_1_3_2_1_36_1","volume-title":"International conference on machine learning. PMLR, 40\u201348","author":"Yang Zhilin","year":"2016","unstructured":"Zhilin Yang, William Cohen, and Ruslan Salakhudinov. 2016. Revisiting semi-supervised learning with graph embeddings. In International conference on machine learning. PMLR, 40\u201348."},{"key":"e_1_3_2_1_37_1","volume-title":"International Conference on Machine Learning. PMLR, 7134\u20137143","author":"You Jiaxuan","year":"2019","unstructured":"Jiaxuan You, Rex Ying, and Jure Leskovec. 2019. Position-aware graph neural networks. In International Conference on Machine Learning. PMLR, 7134\u20137143."},{"key":"e_1_3_2_1_38_1","unstructured":"Jiawei Zhang and S\u00a0Yu Philip. 2015. Integrated anchor and social link predictions across social networks. In Twenty-fourth international joint conference on artificial intelligence."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.114"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939766"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467331"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313484"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3384203"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403141"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9005663"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449886"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449823"}],"event":{"name":"WWW '23: The ACM Web Conference 2023","location":"Austin TX USA","acronym":"WWW '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583357","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3543507.3583357","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583357","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:23Z","timestamp":1750178243000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":47,"alternative-id":["10.1145\/3543507.3583357","10.1145\/3543507"],"URL":"https:\/\/doi.org\/10.1145\/3543507.3583357","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}