{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T11:58:02Z","timestamp":1777895882963,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["OAC-2117997, IIS-2239565"],"award-info":[{"award-number":["OAC-2117997, IIS-2239565"]}],"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":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645672","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"980-991","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Learning Scalable Structural Representations for Link Prediction with Bloom Signatures"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-1753-9933","authenticated-orcid":false,"given":"Tianyi","family":"Zhang","sequence":"first","affiliation":[{"name":"Rice University, Houston, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9277-6150","authenticated-orcid":false,"given":"Haoteng","family":"Yin","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-9047-1303","authenticated-orcid":false,"given":"Rongzhe","family":"Wei","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3742-0845","authenticated-orcid":false,"given":"Pan","family":"Li","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5042-2856","authenticated-orcid":false,"given":"Anshumali","family":"Shrivastava","sequence":"additional","affiliation":[{"name":"Rice University &amp; ThirdAI Corp., Houston, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Friends and neighbors on the web. Social networks 25, 3","author":"Adamic Lada A","year":"2003","unstructured":"Lada A Adamic and Eytan Adar. 2003. Friends and neighbors on the web. Social networks 25, 3 (2003), 211--230."},{"key":"e_1_3_2_2_2_1","volume-title":"Emergence of scaling in random networks. Science 286, 5439","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. Science 286, 5439 (1999), 509--512."},{"key":"e_1_3_2_2_3_1","volume-title":"Proceedings of KDD Cup and Workshop","volume":"2007","author":"Bennett James","year":"2007","unstructured":"James Bennett, Stan Lanning, et al. 2007. The netflix prize. In Proceedings of KDD Cup and Workshop, Vol. 2007. New York, 35."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_2_5_1","volume-title":"Network applications of bloom filters: A survey. Internet mathematics 1, 4","author":"Broder Andrei","year":"2004","unstructured":"Andrei Broder and Michael Mitzenmacher. 2004. Network applications of bloom filters: A survey. Internet mathematics 1, 4 (2004), 485--509."},{"key":"e_1_3_2_2_6_1","volume-title":"Graph Neural Networks for Link Prediction with Subgraph Sketching. In International Conference on Learning Representations.","author":"Chamberlain Benjamin Paul","year":"2023","unstructured":"Benjamin Paul Chamberlain, Sergey Shirobokov, Emanuele Rossi, Fabrizio Frasca, Thomas Markovich, Nils Hammerla, Michael M Bronstein, and Max Hansmire. 2023. Graph Neural Networks for Link Prediction with Subgraph Sketching. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_7_1","first-page":"10383","article-title":"Can graph neural networks count substructures","volume":"33","author":"Chen Zhengdao","year":"2020","unstructured":"Zhengdao Chen, Lei Chen, Soledad Villar, and Joan Bruna. 2020. Can graph neural networks count substructures? Advances in Neural Information Processing Systems 33 (2020), 10383--10395.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_8_1","volume-title":"On random graphs I. Publ. math. debrecen 6, 290--297","author":"P","year":"1959","unstructured":"P ERDdS and A R&wi. 1959. On random graphs I. Publ. math. debrecen 6, 290--297 (1959), 18."},{"key":"e_1_3_2_2_9_1","volume-title":"International Conference on Machine Learning. PMLR, 1263--1272","author":"Gilmer Justin","year":"2017","unstructured":"Justin Gilmer, Samuel S Schoenholz, Patrick F Riley, Oriol Vinyals, and George E Dahl. 2017. Neural message passing for quantum chemistry. In International Conference on Machine Learning. PMLR, 1263--1272."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_11_1","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume":"30","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. Advances in Neural Information Processing Systems 30 (2017), 1025--1035.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_12_1","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume":"33","author":"Hu Weihua","year":"2020","unstructured":"Weihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong, Hongyu Ren, Bowen Liu, Michele Catasta, and Jure Leskovec. 2020. Open graph benchmark: Datasets for machine learning on graphs. Advances in Neural Information Processing Systems 33 (2020), 22118--22133.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_13_1","first-page":"241","article-title":"Distribution de la flore alpine dans le bassin des Dranses et dans quelques r\u00e9gions voisines","volume":"37","author":"Jaccard Paul","year":"1901","unstructured":"Paul Jaccard. 1901. Distribution de la flore alpine dans le bassin des Dranses et dans quelques r\u00e9gions voisines. Bull Soc Vaudoise Sci Nat 37 (1901), 241--272.","journal-title":"Bull Soc Vaudoise Sci Nat"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"John Jumper Richard Evans Alexander Pritzel Tim Green Michael Figurnov Olaf Ronneberger Kathryn Tunyasuvunakool Russ Bates Augustin ?\u00eddek Anna Potapenko et al. 2021. Highly accurate protein structure prediction with AlphaFold. Nature 596 7873 (2021) 583--589.","DOI":"10.1038\/s41586-021-03819-2"},{"key":"e_1_3_2_2_15_1","volume-title":"International Conference on Learning Representations.","author":"Diederik","unstructured":"Diederik P. Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_16_1","volume-title":"International Conference on Learning Representations.","author":"Kipf Thomas N","year":"2017","unstructured":"Thomas N Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_17_1","first-page":"5896","article-title":"Geodesic Graph Neural Network for Efficient Graph Representation Learning","volume":"35","author":"Kong Lecheng","year":"2022","unstructured":"Lecheng Kong, Yixin Chen, and Muhan Zhang. 2022. Geodesic Graph Neural Network for Efficient Graph Representation Learning. Advances in Neural Information Processing Systems 35 (2022), 5896--5909.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_18_1","volume-title":"Evaluating Graph Neural Networks for Link Prediction: Current Pitfalls and New Benchmarking. In Thirty-seventh Conference on Neural Information Processing Systems Datasets and Benchmarks Track.","author":"Li Juanhui","year":"2023","unstructured":"Juanhui Li, Harry Shomer, Haitao Mao, Shenglai Zeng, Yao Ma, Neil Shah, Jiliang Tang, and Dawei Yin. 2023. Evaluating Graph Neural Networks for Link Prediction: Current Pitfalls and New Benchmarking. In Thirty-seventh Conference on Neural Information Processing Systems Datasets and Benchmarks Track."},{"key":"e_1_3_2_2_19_1","first-page":"4465","article-title":"Distance Encoding: Design Provably More Powerful Neural Networks for Graph Representation Learning","volume":"33","author":"Li Pan","year":"2020","unstructured":"Pan Li, Yanbang Wang, Hongwei Wang, and Jure Leskovec. 2020. Distance Encoding: Design Provably More Powerful Neural Networks for Graph Representation Learning. Advances in Neural Information Processing Systems 33 (2020), 4465--4478.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"e_1_3_2_2_21_1","volume-title":"Whole Brain Vessel Graphs: A Dataset and Benchmark for Graph Learning and Neuroscience. In Thirty-fifth Conference on Neural Information Processing Systems Datasets and Benchmarks Track.","author":"Paetzold Johannes C","year":"2021","unstructured":"Johannes C Paetzold, Julian McGinnis, Suprosanna Shit, Ivan Ezhov, Paul B\u00fcschl, Chinmay Prabhakar, Anjany Sekuboyina, Mihail Todorov, Georgios Kaissis, Ali Ert\u00fcrk, et al. 2021. Whole Brain Vessel Graphs: A Dataset and Benchmark for Graph Learning and Neuroscience. In Thirty-fifth Conference on Neural Information Processing Systems Datasets and Benchmarks Track."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00061"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159706"},{"key":"e_1_3_2_2_25_1","volume-title":"International Conference on Learning Representations.","author":"Srinivasan Balasubramaniam","year":"2020","unstructured":"Balasubramaniam Srinivasan and Bruno Ribeiro. 2020. On the equivalence between positional node embeddings and structural graph representations. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_26_1","volume-title":"Drug response prediction as a link prediction problem. Scientific reports 7, 1","author":"Stanfield Zachary","year":"2017","unstructured":"Zachary Stanfield, Mustafa Coskun, and Mehmet Koyut\u00fcrk. 2017. Drug response prediction as a link prediction problem. Scientific reports 7, 1 (2017), 40321."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Damian Szklarczyk Annika L Gable David Lyon Alexander Junge Stefan Wyder Jaime Huerta-Cepas Milan Simonovic Nadezhda T Doncheva John H Morris Peer Bork et al. 2019. STRING v11: protein--protein association networks with increased coverage supporting functional discovery in genome-wide experimental datasets. Nucleic acids research 47 D1 (2019) D607--D613.","DOI":"10.1093\/nar\/gky1131"},{"key":"e_1_3_2_2_28_1","volume-title":"International Conference on Machine Learning. PMLR, 9448--9457","author":"Teru Komal","year":"2020","unstructured":"Komal Teru, Etienne Denis, and Will Hamilton. 2020. Inductive relation prediction by subgraph reasoning. In International Conference on Machine Learning. PMLR, 9448--9457."},{"key":"e_1_3_2_2_29_1","volume-title":"International Conference on Learning Representations.","author":"Velickovic Petar","year":"2018","unstructured":"Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2018. Graph attention networks. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_30_1","volume-title":"Improving Graph Neural Networks on Multi-node Tasks with Labeling Tricks. arXiv preprint arXiv:2304.10074","author":"Wang Xiyuan","year":"2023","unstructured":"Xiyuan Wang, Pan Li, and Muhan Zhang. 2023. Improving Graph Neural Networks on Multi-node Tasks with Labeling Tricks. arXiv preprint arXiv:2304.10074 (2023)."},{"key":"e_1_3_2_2_31_1","volume-title":"Neural Common Neighbor with Completion for Link Prediction. arXiv preprint arXiv:2302.00890","author":"Wang Xiyuan","year":"2023","unstructured":"Xiyuan Wang, Haotong Yang, and Muhan Zhang. 2023. Neural Common Neighbor with Completion for Link Prediction. arXiv preprint arXiv:2302.00890 (2023)."},{"key":"e_1_3_2_2_32_1","volume-title":"International Conference on Learning Representations.","author":"Xu Keyulu","year":"2019","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2019. How Powerful are Graph Neural Networks?. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3611479.3611499"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551831"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17283"},{"key":"e_1_3_2_2_36_1","first-page":"13683","article-title":"Neo-gnns: Neighborhood overlap-aware graph neural networks for link prediction","volume":"34","author":"Yun Seongjun","year":"2021","unstructured":"Seongjun Yun, Seoyoon Kim, Junhyun Lee, Jaewoo Kang, and Hyunwoo J Kim. 2021. Neo-gnns: Neighborhood overlap-aware graph neural networks for link prediction. Advances in Neural Information Processing Systems 34 (2021), 13683--13694.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_37_1","first-page":"5165","article-title":"Link prediction based on graph neural networks","volume":"31","author":"Zhang Muhan","year":"2018","unstructured":"Muhan Zhang and Yixin Chen. 2018. Link prediction based on graph neural networks. Advances in Neural Information Processing Systems 31 (2018), 5165--5175.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_38_1","volume-title":"Inductive Matrix Completion Based on Graph Neural Networks. In International Conference on Learning Representations.","author":"Zhang Muhan","year":"2020","unstructured":"Muhan Zhang and Yixin Chen. 2020. Inductive Matrix Completion Based on Graph Neural Networks. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_39_1","first-page":"9061","article-title":"Labeling Trick: A Theory of Using Graph Neural Networks for Multi-Node Representation Learning","volume":"34","author":"Zhang Muhan","year":"2021","unstructured":"Muhan Zhang, Pan Li, Yinglong Xia, Kai Wang, and Long Jin. 2021. Labeling Trick: A Theory of Using Graph Neural Networks for Multi-Node Representation Learning. Advances in Neural Information Processing Systems 34 (2021), 9061--9073.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2009-00335-8"},{"key":"e_1_3_2_2_41_1","first-page":"29476","article-title":"Neural bellman-ford networks: A general graph neural network framework for link prediction","volume":"34","author":"Zhu Zhaocheng","year":"2021","unstructured":"Zhaocheng Zhu, Zuobai Zhang, Louis-Pascal Xhonneux, and Jian Tang. 2021. Neural bellman-ford networks: A general graph neural network framework for link prediction. Advances in Neural Information Processing Systems 34 (2021), 29476--29490.","journal-title":"Advances in Neural Information Processing Systems"}],"event":{"name":"WWW '24: The ACM Web Conference 2024","location":"Singapore Singapore","acronym":"WWW '24","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645672","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:26:02Z","timestamp":1755822362000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645672"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":41,"alternative-id":["10.1145\/3589334.3645672","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645672","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}