{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T07:30:51Z","timestamp":1772695851825,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,10]]},"DOI":"10.1145\/3746252.3761454","type":"proceedings-article","created":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T23:55:33Z","timestamp":1762559733000},"page":"6841-6844","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Retrieval of Graph Structured Objects: Theory and Applications"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-5262-2348","authenticated-orcid":false,"given":"Indradyumna","family":"Roy","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9419-7486","authenticated-orcid":false,"given":"Soumen","family":"Chakrabarti","sequence":"additional","affiliation":[{"name":"IIT Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9062-3636","authenticated-orcid":false,"given":"Abir","family":"De","sequence":"additional","affiliation":[{"name":"IIT Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"3287","volume-title":"Proceedings of the International Congress of Mathematicians: Rio de Janeiro","author":"Andoni Alexandr","year":"2018","unstructured":"Alexandr Andoni, Piotr Indyk, and Ilya Razenshteyn. 2018. Approximate nearest neighbor search in high dimensions. In Proceedings of the International Congress of Mathematicians: Rio de Janeiro 2018. World Scientific, 3287-3318."},{"key":"e_1_3_2_1_2_1","first-page":"4890","article-title":"Neural program induction for KBQA without gold programs or query annotations.. In IJCAI. Macao","author":"Ansari Ghulam Ahmed","year":"2019","unstructured":"Ghulam Ahmed Ansari, Amrita Saha, Vishwajeet Kumar, Mohan Bhambhani, Karthik Sankaranarayanan, and Soumen Chakrabarti. 2019. Neural program induction for KBQA without gold programs or query annotations.. In IJCAI. Macao, China, 4890-4896.","journal-title":"China"},{"key":"e_1_3_2_1_3_1","volume-title":"Dbpedia: A nucleus for a web of open data. In The semantic web","author":"Auer S\u00f6ren","year":"2007","unstructured":"S\u00f6ren Auer, Christian Bizer, Georgi Kobilarov, Jens Lehmann, Richard Cyganiak, and Zachary Ives. 2007. Dbpedia: A nucleus for a web of open data. In The semantic web. Springer, 722-735."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290967"},{"key":"e_1_3_2_1_5_1","unstructured":"Yunsheng Bai Hao Ding Ken Gu Yizhou Sun and Wei Wang. 2020. Learningbased efficient graph similarity computation via multi-scale convolutional set matching. In AAAI."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.emnlp-main.817"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"P. Chakraborty S. Ranu K. S. I. Mantri and A. De. 2023. Learning and Maximizing Influence in Social Networks Under Capacity Constraints. In WSDM.","DOI":"10.1145\/3539597.3570433"},{"key":"e_1_3_2_1_8_1","volume-title":"CommunityKG-RAG: Leveraging Community Structures in Knowledge Graphs for Advanced Retrieval-Augmented Generation in Fact-Checking. arXiv preprint arXiv:2408.08535","author":"Chang Rong-Ching","year":"2024","unstructured":"Rong-Ching Chang and Jiawei Zhang. 2024. CommunityKG-RAG: Leveraging Community Structures in Knowledge Graphs for Advanced Retrieval-Augmented Generation in Fact-Checking. arXiv preprint arXiv:2408.08535 (2024)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"A. De S. Bhattacharya P. Bhattacharya N. Ganguly and S. Chakrabarti. 2014. Learning a Linear Influence Model from Transient Opinion Dynamics. In CIKM.","DOI":"10.1145\/2661829.2662064"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"A. De S. Bhattacharya and N. Ganguly. 2018. Demarcating Endogenous and Exogenous Opinion Diffusion Process on Social Networks. In WWW.","DOI":"10.1145\/3178876.3186121"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2553665"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"P. Deshpande K. Marathe A. De and S. Sarawagi. 2021. Long Horizon Forecasting with Temporal Point Processes. In WSDM.","DOI":"10.1145\/3437963.3441740"},{"key":"e_1_3_2_1_15_1","unstructured":"V. Gupta S. Bedathur S. Bhattacharya and A. De. 2021. Learning Temporal Point Processes with Intermittent Observations. In AISTATS."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_17_1","volume-title":"Graph Edit Distance with General Costs Using Neural Set Divergence. arXiv preprint arXiv:2409.17687","author":"Jain Eeshaan","year":"2024","unstructured":"Eeshaan Jain, Indradyumna Roy, Saswat Meher, Soumen Chakrabarti, and Abir De. 2024. Graph Edit Distance with General Costs Using Neural Set Divergence. arXiv preprint arXiv:2409.17687 (2024)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298990"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1117"},{"key":"e_1_3_2_1_20_1","volume-title":"International conference on machine learning. PMLR, 3835-3845","author":"Li Yujia","year":"2019","unstructured":"Yujia Li, Chenjie Gu, Thomas Dullien, Oriol Vinyals, and Pushmeet Kohli. 2019. Graph matching networks for learning the similarity of graph structured objects. In International conference on machine learning. PMLR, 3835-3845."},{"key":"e_1_3_2_1_21_1","volume-title":"Deep Graph Matching and Searching for Semantic Code Retrieval. ACM Transactions on Knowledge Discovery from Data (TKDD) 15, 5","author":"Ling Xiang","year":"2021","unstructured":"Xiang Ling, Lingfei Wu, Saizhuo Wang, Gaoning Pan, Tengfei Ma, Fangli Xu, Alex X Liu, Chunming Wu, and Shouling Ji. 2021. Deep Graph Matching and Searching for Semantic Code Retrieval. ACM Transactions on Knowledge Discovery from Data (TKDD) 15, 5 (2021), 1-21. https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447571"},{"key":"e_1_3_2_1_22_1","unstructured":"Zhaoyu Lou Jiaxuan You Chengtao Wen Arquimedes Canedo Jure Leskovec et al. 2020. Neural Subgraph Matching. arXiv preprint arXiv:2007.03092 (2020)."},{"key":"e_1_3_2_1_23_1","volume-title":"Tudataset: A collection of benchmark datasets for learning with graphs. arXiv preprint arXiv:2007.08663","author":"Morris Christopher","year":"2020","unstructured":"Christopher Morris, Nils M Kriege, Franka Bause, Kristian Kersting, Petra Mutzel, and Marion Neumann. 2020. Tudataset: A collection of benchmark datasets for learning with graphs. arXiv preprint arXiv:2007.08663 (2020)."},{"key":"e_1_3_2_1_24_1","volume-title":"International Conference on Machine Learning. PMLR","author":"Neyshabur Behnam","year":"2015","unstructured":"Behnam Neyshabur and Nathan Srebro. 2015. On symmetric and asymmetric lshs for inner product search. In International Conference on Machine Learning. PMLR, 1926-1934."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/157485.164556"},{"key":"e_1_3_2_1_26_1","volume-title":"Thirty-Fifth Conference on Neural Information Processing Systems.","author":"Qin Can","year":"2021","unstructured":"Can Qin, Handong Zhao, Lichen Wang, Huan Wang, Yulun Zhang, and Yun Fu. 2021. Slow Learning and Fast Inference: Efficient Graph Similarity Computation via Knowledge Distillation. In Thirty-Fifth Conference on Neural Information Processing Systems."},{"key":"e_1_3_2_1_27_1","unstructured":"V. Raj I. Roy A. Ramachandran S. Chakrabarti and A. De. 2025. Charting the Design Space of Neural Graph Representations for Subgraph Matching. In ICLR."},{"key":"e_1_3_2_1_28_1","unstructured":"Ashwin Ramachandran Vaibhav Raj Indrayumna Roy Soumen Chakrabarti and Abir De. 2024. Iteratively Refined Early Interaction Alignment for Subgraph Matching based Graph Retrieval. In NeurIPS. https:\/\/neurips.cc\/virtual\/2024\/ poster\/93261"},{"key":"e_1_3_2_1_29_1","volume-title":"Locality Sensitive Hashing in Fourier Frequency Domain For Soft Set Containment Search. NeurIPS","author":"Roy Indradyumna","year":"2023","unstructured":"Indradyumna Roy, Rishi Agarwal, Soumen Chakrabarti, Anirban Dasgupta, and Abir De. 2023. Locality Sensitive Hashing in Fourier Frequency Domain For Soft Set Containment Search. NeurIPS (2023)."},{"key":"e_1_3_2_1_30_1","first-page":"32112","article-title":"Maximum Common Subgraph Guided Graph Retrieval: Late and Early Interaction Networks","volume":"35","author":"Roy Indradyumna","year":"2022","unstructured":"Indradyumna Roy, Soumen Chakrabarti, and Abir De. 2022. Maximum Common Subgraph Guided Graph Retrieval: Late and Early Interaction Networks. Advances in Neural Information Processing Systems 35 (2022), 32112-32126.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_31_1","volume-title":"Adversarial Permutation Guided Node Representations for Link Prediction. arXiv preprint arXiv:2012.08974","author":"Roy Indradyumna","year":"2020","unstructured":"Indradyumna Roy, Abir De, and Soumen Chakrabarti. 2020. Adversarial Permutation Guided Node Representations for Link Prediction. arXiv preprint arXiv:2012.08974 (2020)."},{"key":"e_1_3_2_1_32_1","unstructured":"I. Roy E. Jain S. Chakrabarti and A. De. 2025. Clique Number Estimation via Differentiable Functions of Adjacency Matrix Permutations. In ICLR."},{"key":"e_1_3_2_1_33_1","volume-title":"Soumen Chakrabarti, and Abir De.","author":"Roy Indradyumna","year":"2022","unstructured":"Indradyumna Roy, Venkata Sai Velugoti, Soumen Chakrabarti, and Abir De. 2022. Interpretable Neural Subgraph Matching for Graph Retrieval. (2022)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00262"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271726"},{"key":"e_1_3_2_1_36_1","volume-title":"STRM: A sister tweet reinforcement process for modeling hashtag popularity. In INFOCOM.","author":"Samanta B.","year":"2017","unstructured":"B. Samanta, A. De, and N. Ganguly. 2017. STRM: A sister tweet reinforcement process for modeling hashtag popularity. In INFOCOM."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488484"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-018-9348-8"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.412"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(00)00048-0"},{"key":"e_1_3_2_1_41_1","unstructured":"Harkanwar Singh Prachi Jain Soumen Chakrabarti et al. 2021. Multilingual Knowledge Graph Completion with Joint Relation and Entity Alignment. arXiv preprint arXiv:2104.08804 (2021)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1859891"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629489"},{"key":"e_1_3_2_1_44_1","volume-title":"A comprehensive survey on cross-modal retrieval. arXiv preprint arXiv:1607.06215","author":"Wang Kaiye","year":"2016","unstructured":"Kaiye Wang, Qiyue Yin, Wei Wang, Shu Wu, and Liang Wang. 2016. A comprehensive survey on cross-modal retrieval. arXiv preprint arXiv:1607.06215 (2016)."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"e_1_3_2_1_46_1","volume-title":"Toward better drug discovery with knowledge graph. Current opinion in structural biology 72","author":"Zeng Xiangxiang","year":"2022","unstructured":"Xiangxiang Zeng, Xinqi Tu, Yuansheng Liu, Xiangzheng Fu, and Yansen Su. 2022. Toward better drug discovery with knowledge graph. Current opinion in structural biology 72 (2022), 114-126."},{"key":"e_1_3_2_1_47_1","volume-title":"Efficient graph similarity computation with alignment regularization. NeurIPS","author":"Zhuo Wei","year":"2022","unstructured":"Wei Zhuo and Guang Tan. 2022. Efficient graph similarity computation with alignment regularization. NeurIPS (2022)."}],"event":{"name":"CIKM '25: The 34th ACM International Conference on Information and Knowledge Management","location":"Seoul Republic of Korea","acronym":"CIKM '25","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the 34th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3746252.3761454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:00:13Z","timestamp":1765497613000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3746252.3761454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,10]]},"references-count":47,"alternative-id":["10.1145\/3746252.3761454","10.1145\/3746252"],"URL":"https:\/\/doi.org\/10.1145\/3746252.3761454","relation":{},"subject":[],"published":{"date-parts":[[2025,11,10]]},"assertion":[{"value":"2025-11-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}