{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,7]],"date-time":"2026-09-07T23:55:11Z","timestamp":1788825311564,"version":"build-2803163510"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Army Young Investigator Award","award":["W911NF1810397"],"award-info":[{"award-number":["W911NF1810397"]}]},{"name":"Google Faculty Research Award","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}]},{"name":"Amazon Faculty Research Award","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}]},{"name":"NSF","award":["IIS 1845491"],"award-info":[{"award-number":["IIS 1845491"]}]},{"name":"Adobe Data Science Research Faculty Award","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3340531.3412136","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T06:32:45Z","timestamp":1603089165000},"page":"1985-1988","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["CONE-Align"],"prefix":"10.1145","author":[{"given":"Xiyuan","family":"Chen","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, Ann Arbor, MI, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Heimann","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, Ann Arbor, MI, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fatemeh","family":"Vahedian","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, Ann Arbor, MI, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danai","family":"Koutra","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, Ann Arbor, MI, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"NeurIPS","author":"Allen-Zhu Zeyuan","year":"2016","unstructured":"Zeyuan Allen-Zhu and Yuanzhi Li. Lazysvd : Even faster svd decomposition yet without agonizing pain . In NeurIPS , 2016 . Zeyuan Allen-Zhu and Yuanzhi Li. Lazysvd: Even faster svd decomposition yet without agonizing pain. In NeurIPS, 2016."},{"key":"e_1_3_2_2_2_1","volume-title":"NeurIPS","author":"Altschuler Jason","year":"2019","unstructured":"Jason Altschuler , Francis Bach , Alessandro Rudi , and Jonathan Niles-Weed . Massively scalable sinkhorn distances via the nystr\u00f6m method . In NeurIPS , 2019 . Jason Altschuler, Francis Bach, Alessandro Rudi, and Jonathan Niles-Weed. Massively scalable sinkhorn distances via the nystr\u00f6m method. In NeurIPS, 2019."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.135"},{"key":"e_1_3_2_2_4_1","volume-title":"The biogrid interaction database: 2008 update. Nucleic acids research, 36(suppl 1):D637--D640","author":"Breitkreutz Bobby-Joe","year":"2008","unstructured":"Bobby-Joe Breitkreutz , Chris Stark , The biogrid interaction database: 2008 update. Nucleic acids research, 36(suppl 1):D637--D640 , 2008 . Bobby-Joe Breitkreutz, Chris Stark, et al. The biogrid interaction database: 2008 update. Nucleic acids research, 36(suppl 1):D637--D640, 2008."},{"key":"e_1_3_2_2_5_1","volume-title":"NeurIPS","author":"Cuturi Marco","year":"2013","unstructured":"Marco Cuturi . Sinkhorn distances : Lightspeed computation of optimal transport . In NeurIPS , 2013 . Marco Cuturi. Sinkhorn distances: Lightspeed computation of optimal transport. In NeurIPS, 2013."},{"key":"e_1_3_2_2_6_1","volume-title":"Deep adversarial network alignment. arXiv preprint arXiv:1902.10307","author":"Derr Tyler","year":"2019","unstructured":"Tyler Derr , Hamid Karimi , Xiaorui Liu , Jiejun Xu , and Jiliang Tang . Deep adversarial network alignment. arXiv preprint arXiv:1902.10307 , 2019 . Tyler Derr, Hamid Karimi, Xiaorui Liu, Jiejun Xu, and Jiliang Tang. Deep adversarial network alignment. arXiv preprint arXiv:1902.10307, 2019."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/312"},{"key":"e_1_3_2_2_8_1","volume-title":"An algorithm for quadratic programming. Naval research logistics quarterly, 3(1--2):95--110","author":"Frank Marguerite","year":"1956","unstructured":"Marguerite Frank and Philip Wolfe . An algorithm for quadratic programming. Naval research logistics quarterly, 3(1--2):95--110 , 1956 . Marguerite Frank and Philip Wolfe. An algorithm for quadratic programming. Naval research logistics quarterly, 3(1--2):95--110, 1956."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.03.022"},{"key":"e_1_3_2_2_11_1","volume-title":"AISTATS","author":"Grave Edouard","year":"2019","unstructured":"Edouard Grave , Armand Joulin , and Quentin Berthet . Unsupervised alignment of embeddings with wasserstein procrustes . In AISTATS , 2019 . Edouard Grave, Armand Joulin, and Quentin Berthet. Unsupervised alignment of embeddings with wasserstein procrustes. In AISTATS, 2019."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00039"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271788"},{"key":"e_1_3_2_2_15_1","volume-title":"EPFL","author":"Kazemi Ehsan","year":"2016","unstructured":"Ehsan Kazemi . Network alignment : Theory, algorithms, and applications. Technical report , EPFL , 2016 . Ehsan Kazemi. Network alignment: Theory, algorithms, and applications. Technical report, EPFL, 2016."},{"key":"e_1_3_2_2_16_1","volume-title":"WWW","author":"Kunegis J\u00e9r\u00f4me","year":"2013","unstructured":"J\u00e9r\u00f4me Kunegis . Konect : the koblenz network collection . In WWW , 2013 . J\u00e9r\u00f4me Kunegis. Konect: the koblenz network collection. In WWW, 2013."},{"key":"e_1_3_2_2_17_1","volume-title":"ICLR","author":"Lample Guillaume","year":"2018","unstructured":"Guillaume Lample , Alexis Conneau , Marc'Aurelio Ranzato , Ludovic Denoyer , and Herv\u00e9 J\u00e9gou . Word translation without parallel data . In ICLR , 2018 . Guillaume Lample, Alexis Conneau, Marc'Aurelio Ranzato, Ludovic Denoyer, and Herv\u00e9 J\u00e9gou. Word translation without parallel data. In ICLR, 2018."},{"key":"e_1_3_2_2_18_1","unstructured":"Jure Leskovec and Andrej Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014.  Jure Leskovec and Andrej Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014."},{"key":"e_1_3_2_2_19_1","volume-title":"IJCAI","author":"Liu Li","year":"2016","unstructured":"Li Liu , William K Cheung , Xin Li , and Lejian Liao . Aligning users across social networks using network embedding . In IJCAI , 2016 . Li Liu, William K Cheung, Xin Li, and Lejian Liao. Aligning users across social networks using network embedding. In IJCAI, 2016."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159706"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098061"},{"key":"e_1_3_2_2_23_1","volume-title":"TKDD","author":"Rossi Ryan A","year":"2020","unstructured":"Ryan A Rossi , Di Jin , Sungchul Kim , Nesreen K Ahmed , Danai Koutra , and John Boaz Lee . On proximity and structural role-based embeddings in networks: Misconceptions, methods, and applications . TKDD , 2020 . Ryan A Rossi, Di Jin, Sungchul Kim, Nesreen K Ahmed, Danai Koutra, and John Boaz Lee. On proximity and structural role-based embeddings in networks: Misconceptions, methods, and applications. TKDD, 2020."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289451"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939766"}],"event":{"name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","location":"Virtual Event Ireland","acronym":"CIKM '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 29th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412136","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3412136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:30Z","timestamp":1750197750000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412136"}},"subtitle":["Consistent Network Alignment with Proximity-Preserving Node Embedding"],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":25,"alternative-id":["10.1145\/3340531.3412136","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3412136","relation":{},"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"2020-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}