{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:12:45Z","timestamp":1755839565131,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T00:00:00Z","timestamp":1689638400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,19]]},"DOI":"10.1145\/3539618.3591762","type":"proceedings-article","created":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T00:22:59Z","timestamp":1689726179000},"page":"1609-1618","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["SCHash: Speedy Simplicial Complex Neural Networks via Randomized Hashing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-8575-6422","authenticated-orcid":false,"given":"Xuan","family":"Tan","sequence":"first","affiliation":[{"name":"Central South University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0975-4613","authenticated-orcid":false,"given":"Wei","family":"Wu","sequence":"additional","affiliation":[{"name":"Central South University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5028-1064","authenticated-orcid":false,"given":"Chuan","family":"Luo","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,18]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"HyperSAGE: Generalizing Inductive Representation Learning on Hypergraphs. CoRR abs\/2010.04558","author":"Arya Devanshu","year":"2020","unstructured":"Devanshu Arya, Deepak K. Gupta, Stevan Rudinac, and Marcel Worring. 2020. HyperSAGE: Generalizing Inductive Representation Learning on Hypergraphs. CoRR abs\/2010.04558 (2020)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2_1","DOI":"10.1016\/j.patcog.2020.107637"},{"key":"e_1_3_2_2_3_1","first-page":"2987","article-title":"QUINT: Node Embedding using Network Hashing","volume":"35","author":"Bera Debajyoti","year":"2023","unstructured":"Debajyoti Bera, Rameshwar Pratap, Bhisham Dev Verma, Biswadeep Sen, and Tanmoy Chakraborty. 2023. QUINT: Node Embedding using Network Hashing. IEEE Transactions on Knowledge and Data Engineering 35, 3 (2023), 2987--3000.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"unstructured":"Cristian Bodnar Fabrizio Frasca Nina Otter Yuguang Wang Pietro Lio Guido F Montufar and Michael Bronstein. 2021. Weisfeiler and Lehman go Cellular: CW Networks. In NeurIPS. 2625--2640.","key":"e_1_3_2_2_4_1"},{"unstructured":"Cristian Bodnar Fabrizio Frasca Yuguang Wang Nina Otter Guido F Montufar Pietro Lio and Michael Bronstein. 2021. Weisfeiler and Lehman go Topological: Message Passing Simplicial Networks. In ICML. 1026--1037.","key":"e_1_3_2_2_5_1"},{"key":"e_1_3_2_2_6_1","first-page":"406","article-title":"The Simplex Tree","volume":"70","author":"Boissonnat Jean-Daniel","year":"2014","unstructured":"Jean-Daniel Boissonnat and Cl\u00e9ment Maria. 2014. The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes. Algorithmica 70, 3 (2014), 406--427.","journal-title":"An Efficient Data Structure for General Simplicial Complexes. Algorithmica"},{"unstructured":"Karsten M Borgwardt and Hans-Peter Kriegel. 2005. Shortest-Path Kernels on Graphs. In ICDM. 74--81.","key":"e_1_3_2_2_7_1"},{"key":"e_1_3_2_2_8_1","volume-title":"Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting","author":"Bouritsas Giorgos","year":"2022","unstructured":"Giorgos Bouritsas, Fabrizio Frasca, Stefanos P Zafeiriou, and Michael Bronstein. 2022. Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting. IEEE Transactions on Pattern Analysis and Machine Intelligence (2022)."},{"doi-asserted-by":"crossref","unstructured":"Andrei Z Broder Moses Charikar Alan M Frieze and Michael Mitzenmacher. 1998. Min-wise Independent Permutations. In STOC. 327--336.","key":"e_1_3_2_2_9_1","DOI":"10.1145\/276698.276781"},{"key":"e_1_3_2_2_10_1","volume-title":"NODESIG: Binary Node Embeddings via Random Walk Diffusion. In ASONAM. 68--75.","author":"Celikkanat Abdulkadir","year":"2022","unstructured":"Abdulkadir Celikkanat, Fragkiskos D Malliaros, and Apostolos N Papadopoulos. 2022. NODESIG: Binary Node Embeddings via Random Walk Diffusion. In ASONAM. 68--75."},{"doi-asserted-by":"crossref","unstructured":"Moses S Charikar. 2002. Similarity Estimation Techniques from Rounding Algorithms. In STOC. 380--388.","key":"e_1_3_2_2_11_1","DOI":"10.1145\/509907.509965"},{"doi-asserted-by":"crossref","unstructured":"Mingyang Chen Wen Zhang Yushan Zhu Hongting Zhou Zonggang Yuan Changliang Xu and Huajun Chen. 2022. Meta-Knowledge Transfer for Inductive Knowledge Graph Embedding. In SIGIR. 927--937.","key":"e_1_3_2_2_12_1","DOI":"10.1145\/3477495.3531757"},{"doi-asserted-by":"crossref","unstructured":"Yuzhou Chen Yulia R Gel and H Vincent Poor. 2022. BScNets: Block Simplicial Complex Neural Networks. In AAAI. 6333--6341.","key":"e_1_3_2_2_13_1","DOI":"10.1609\/aaai.v36i6.20583"},{"unstructured":"Zhengdao Chen Lei Chen Soledad Villar and Joan Bruna. 2020. Can Graph Neural Networks Count Substructures?. In NeurIPS. 10383--10395.","key":"e_1_3_2_2_14_1"},{"doi-asserted-by":"crossref","unstructured":"Chanyoung Chung and Joyce Jiyoung Whang. 2021. Knowledge Graph Embedding via Metagraph Learning. In SIGIR. 2212--2216.","key":"e_1_3_2_2_15_1","DOI":"10.1145\/3404835.3463072"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_16_1","DOI":"10.1145\/3477495.3532008"},{"doi-asserted-by":"crossref","unstructured":"David Easley and Jon Kleinberg. 2010. Networks Crowds and Markets: Reasoning about A Highly Connected World.","key":"e_1_3_2_2_17_1","DOI":"10.1017\/CBO9780511761942"},{"key":"e_1_3_2_2_18_1","volume-title":"Simplicial Neural Networks. In NeurIPS 2020 Workshop on Topological Data Analysis and Beyond.","author":"Ebli Stefania","year":"2020","unstructured":"Stefania Ebli, Micha\u00ebl Defferrard, and Gard Spreemann. 2020. Simplicial Neural Networks. In NeurIPS 2020 Workshop on Topological Data Analysis and Beyond."},{"doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable Feature Learning for Networks. In KDD. 855--864.","key":"e_1_3_2_2_19_1","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_2_20_1","volume-title":"NeurIPS 2020 Workshop on Topological Data Analysis and Beyond.","author":"Hacker Celia","year":"2020","unstructured":"Celia Hacker. 2020. K-simplex2vec: A Simplicial Extension of Node2vec. In NeurIPS 2020 Workshop on Topological Data Analysis and Beyond."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_21_1","DOI":"10.1080\/01621459.1963.10500830"},{"unstructured":"Hisashi Kashima Koji Tsuda and Akihiro Inokuchi. 2003. Marginalized Kernels between Labeled Graphs. In ICML. 321--328.","key":"e_1_3_2_2_22_1"},{"unstructured":"Kristian Kersting Nils M. Kriege Christopher Morris Petra Mutzel and Marion Neumann. 2016. Benchmark Data Sets for Graph Kernels. http:\/\/ graphkernels.cs.tu-dortmund.de","key":"e_1_3_2_2_23_1"},{"key":"e_1_3_2_2_24_1","volume-title":"Kipf and Max Welling","author":"Thomas","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_25_1","DOI":"10.1371\/journal.pcbi.1000385"},{"doi-asserted-by":"crossref","unstructured":"Geon Lee Seonggoo Kang and Joyce Jiyoung Whang. 2019. Hyperlink Classification via Structured Graph Embedding. In SIGIR. 1017--1020.","key":"e_1_3_2_2_26_1","DOI":"10.1145\/3331184.3331325"},{"key":"e_1_3_2_2_27_1","volume-title":"SGAT: Simplicial Graph Attention Network. In IJCAI. 3192--3200.","author":"Lee Hian","year":"2022","unstructured":"See Hian Lee, Feng Ji, and Wee Peng Tay. 2022. SGAT: Simplicial Graph Attention Network. In IJCAI. 3192--3200."},{"doi-asserted-by":"crossref","unstructured":"Bin Li Xingquan Zhu Lianhua Chi and Chengqi Zhang. 2012. Nested Subtree Hash Kernels for Large-scale Graph Classification over Streams. In ICDM. 399--408.","key":"e_1_3_2_2_28_1","DOI":"10.1109\/ICDM.2012.101"},{"doi-asserted-by":"crossref","unstructured":"Yao Ma Ziyi Guo Zhaocun Ren Jiliang Tang and Dawei Yin. 2020. Streaming Graph Neural Networks. In SIGIR. 719--728.","key":"e_1_3_2_2_29_1","DOI":"10.1145\/3397271.3401092"},{"doi-asserted-by":"crossref","unstructured":"Christopher Morris Nils M Kriege Kristian Kersting and Petra Mutzel. 2016. Faster Kernels for Graphs with Continuous Attributes via Hashing. In ICDM. 1095--1100.","key":"e_1_3_2_2_30_1","DOI":"10.1109\/ICDM.2016.0142"},{"unstructured":"Abubakr Muhammad and Magnus Egerstedt. 2006. Control Using Higher Order Laplacians in Network Topologies. In MTNS. 1024--1038.","key":"e_1_3_2_2_31_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_32_1","DOI":"10.1007\/s10994-015-5517-9"},{"doi-asserted-by":"crossref","unstructured":"Mark Newman. 2018. Networks.","key":"e_1_3_2_2_33_1","DOI":"10.1093\/oso\/9780198805090.001.0001"},{"doi-asserted-by":"crossref","unstructured":"Yunsheng Pang Yunxiang Zhao and Dongsheng Li. 2021. Graph Pooling via Coarsened Graph Infomax. In SIGIR. 2177--2181.","key":"e_1_3_2_2_34_1","DOI":"10.1145\/3404835.3463074"},{"unstructured":"T Mitchell Roddenberry Nicholas Glaze and Santiago Segarra. 2021. Principled Simplicial Neural Networks for Trajectory Prediction. In ICML. 9020--9029.","key":"e_1_3_2_2_35_1"},{"doi-asserted-by":"crossref","unstructured":"T Mitchell Roddenberry Michael T Schaub and Mustafa Hajij. 2022. Signal Processing on Cell Complexes. In ICASSP. 8852--8856.","key":"e_1_3_2_2_36_1","DOI":"10.1109\/ICASSP43922.2022.9747233"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_37_1","DOI":"10.1090\/S0002-9904-1934-05899-3"},{"doi-asserted-by":"crossref","unstructured":"Maciej Rybinski Liam Watts and Sarvnaz Karimi. 2022. A2A-API: A Prototype for Biomedical Information Retrieval Research and Benchmarking. In SIGIR. 3318--3322.","key":"e_1_3_2_2_38_1","DOI":"10.1145\/3477495.3531667"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_39_1","DOI":"10.1137\/18M1201019"},{"key":"e_1_3_2_2_40_1","article-title":"Weisfeiler-Lehman Graph Kernels","volume":"12","author":"Shervashidze Nino","year":"2011","unstructured":"Nino Shervashidze, Pascal Schweitzer, Erik Jan Van Leeuwen, Kurt Mehlhorn, and Karsten M Borgwardt. 2011. Weisfeiler-Lehman Graph Kernels. Journal of Machine Learning Research 12, 9 (2011).","journal-title":"Journal of Machine Learning Research"},{"unstructured":"Petar Veli?kovi? Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li and Yoshua Bengio. 2018. Graph Attention Networks. In ICLR.","key":"e_1_3_2_2_41_1"},{"doi-asserted-by":"crossref","unstructured":"Daixin Wang Peng Cui and Wenwu Zhu. 2016. Structural Deep Network Embedding. In KDD. 1225--1234.","key":"e_1_3_2_2_42_1","DOI":"10.1145\/2939672.2939753"},{"doi-asserted-by":"crossref","unstructured":"Yaqing Wang Song Wang Yanyan Li and Dejing Dou. 2022. Recognizing Medical Search Query Intent by Few-shot Learning. In SIGIR. 502--512.","key":"e_1_3_2_2_43_1","DOI":"10.1145\/3477495.3531789"},{"key":"e_1_3_2_2_44_1","first-page":"12","article-title":"A Reduction of a Graph to a Canonical Form and an Algebra Arising During this Reduction","volume":"2","author":"Weisfeiler Boris","year":"1968","unstructured":"Boris Weisfeiler and Andrei A Lehman. 1968. A Reduction of a Graph to a Canonical Form and an Algebra Arising During this Reduction. Nauchno-Technicheskaya Informatsia 2, 9 (1968), 12--16.","journal-title":"Nauchno-Technicheskaya Informatsia"},{"doi-asserted-by":"crossref","unstructured":"Adam C Wilkerson Terrence J Moore Ananthram Swami and Hamid Krim. 2013. Simplifying The Homology of Networks via Strong Collapses. In ICASSP. 5258--5262.","key":"e_1_3_2_2_45_1","DOI":"10.1109\/ICASSP.2013.6638666"},{"doi-asserted-by":"crossref","unstructured":"Le Wu Yonghui Yang Lei Chen Defu Lian Richang Hong and Meng Wang. 2020. Learning to Transfer Graph Embeddings for Inductive Graph Based Recommendation. In SIGIR. 1211--1220.","key":"e_1_3_2_2_46_1","DOI":"10.1145\/3397271.3401145"},{"key":"e_1_3_2_2_47_1","first-page":"2553","article-title":"A Review for Weighted MinHash Algorithms","volume":"34","author":"Wu Wei","year":"2022","unstructured":"Wei Wu, Bin Li, Ling Chen, Junbin Gao, and Chengqi Zhang. 2022. A Review for Weighted MinHash Algorithms. IEEE Transactions on Knowledge and Data Engineering 34, 6 (2022), 2553--2573.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"doi-asserted-by":"crossref","unstructured":"Wei Wu Bin Li Ling Chen and Chengqi Zhang. 2018. Efficient Attributed Network Embedding via Recursive Randomized Hashing. In IJCAI-18. 2861--2867.","key":"e_1_3_2_2_48_1","DOI":"10.24963\/ijcai.2018\/397"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_49_1","DOI":"10.1109\/TKDE.2017.2782278"},{"doi-asserted-by":"crossref","unstructured":"Wei Wu Bin Li Chuan Luo and Wolfgang Nejdl. 2021. Hashing-Accelerated Graph Neural Networks for Link Prediction. In WWW. 2910--2920.","key":"e_1_3_2_2_50_1","DOI":"10.1145\/3442381.3449884"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_51_1","DOI":"10.1109\/TNNLS.2020.2978386"},{"unstructured":"Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2019. How Powerful are Graph Neural Networks?. In ICLR.","key":"e_1_3_2_2_52_1"},{"unstructured":"Xifeng Yan and Jiawei Han. 2002. gSpan: Graph-based Substructure Pattern Mining. In ICDM. 721--724.","key":"e_1_3_2_2_53_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_54_1","DOI":"10.1109\/TKDE.2022.3149999"},{"doi-asserted-by":"crossref","unstructured":"Maosheng Yang Elvin Isufi and Geert Leus. 2022. Simplicial Convolutional Neural Networks. In ICASSP. 8847--8851.","key":"e_1_3_2_2_55_1","DOI":"10.1109\/ICASSP43922.2022.9746017"}],"event":{"sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"acronym":"SIGIR '23","name":"SIGIR '23: The 46th International ACM SIGIR Conference on Research and Development in Information Retrieval","location":"Taipei Taiwan"},"container-title":["Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3539618.3591762","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3539618.3591762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:01Z","timestamp":1750178821000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3539618.3591762"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,18]]},"references-count":55,"alternative-id":["10.1145\/3539618.3591762","10.1145\/3539618"],"URL":"https:\/\/doi.org\/10.1145\/3539618.3591762","relation":{},"subject":[],"published":{"date-parts":[[2023,7,18]]},"assertion":[{"value":"2023-07-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}