{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T22:14:29Z","timestamp":1784585669074,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T00:00:00Z","timestamp":1677456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Science Foundation","award":["IIS 1817046"],"award-info":[{"award-number":["IIS 1817046"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,2,27]]},"DOI":"10.1145\/3539597.3570376","type":"proceedings-article","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T23:27:00Z","timestamp":1677108420000},"page":"141-149","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["Global Counterfactual Explainer for Graph Neural Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1480-4494","authenticated-orcid":false,"given":"Zexi","family":"Huang","sequence":"first","affiliation":[{"name":"University of California, Santa Barbara, Santa Barbara, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8092-5024","authenticated-orcid":false,"given":"Mert","family":"Kosan","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara, Santa Barbara, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0996-2807","authenticated-orcid":false,"given":"Sourav","family":"Medya","sequence":"additional","affiliation":[{"name":"University of Illinois Chicago, Chicago, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4147-9372","authenticated-orcid":false,"given":"Sayan","family":"Ranu","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Delhi, Delhi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1997-7140","authenticated-orcid":false,"given":"Ambuj","family":"Singh","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara, Santa Barbara, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,2,27]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Carlo Abrate and Francesco Bonchi. 2021. Counterfactual graphs for explainable classification of brain networks. In SIGKDD.","DOI":"10.1145\/3447548.3467154"},{"key":"e_1_3_2_2_2_1","volume-title":"Jian Pei, Lanjun Wang, Peter Cho-Ho Lam, and Yong Zhang.","author":"Bajaj Mohit","year":"2021","unstructured":"Mohit Bajaj, Lingyang Chu, Zi Yu Xue, Jian Pei, Lanjun Wang, Peter Cho-Ho Lam, and Yong Zhang. 2021. Robust Counterfactual Explanations on Graph Neural Networks. In NeurIPS."},{"key":"e_1_3_2_2_3_1","unstructured":"Ravinder Bhattoo Sayan Ranu and NM Krishnan. 2022. Learning Articulated Rigid Body Dynamics with Lagrangian Graph Neural Network. In NeurIPS."},{"key":"e_1_3_2_2_4_1","unstructured":"Karsten Borgwardt Nicol Schraudolph and SVN Vishwanathan. 2006. Fast computation of graph kernels. In NeurIPS."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"e_1_3_2_2_6_1","unstructured":"Fabrizio Costa and Kurt De Grave. 2010. Fast neighborhood subgraph pairwise distance kernel. In ICML."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(03)00628-4"},{"key":"e_1_3_2_2_8_1","volume-title":"TIGGER: Scalable Generative Modelling for Temporal Interaction Graphs. In AAAI.","author":"Gupta Shubham","year":"2022","unstructured":"Shubham Gupta, Sahil Manchanda, Srikanta Bedathur, and Sayan Ranu. 2022. TIGGER: Scalable Generative Modelling for Temporal Interaction Graphs. In AAAI."},{"key":"e_1_3_2_2_9_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Zexi Huang Arlei Silva and Ambuj Singh. 2021. A broader picture of random-walk based graph embedding. In SIGKDD.","DOI":"10.1145\/3447548.3467300"},{"key":"e_1_3_2_2_11_1","volume-title":"POLE: Polarized Embedding for Signed Networks. In WSDM.","author":"Huang Zexi","year":"2022","unstructured":"Zexi Huang, Arlei Silva, and Ambuj Singh. 2022. POLE: Polarized Embedding for Signed Networks. In WSDM."},{"key":"e_1_3_2_2_12_1","volume-title":"Drug--target affinity prediction using graph neural network and contact maps. RSC advances","author":"Jiang Mingjian","year":"2020","unstructured":"Mingjian Jiang, Zhen Li, Shugang Zhang, Shuang Wang, Xiaofeng Wang, Qing Yuan, and Zhiqiang Wei. 2020. Drug--target affinity prediction using graph neural network and contact maps. RSC advances, Vol. 10, 35 (2020), 20701--20712."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1021\/jm040835a"},{"key":"e_1_3_2_2_14_1","volume-title":"Adam: A method for stochastic optimization. arXiv:1412.6980","author":"Kingma Diederik P","year":"2014","unstructured":"Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_2_15_1","unstructured":"Thomas N Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In ICLR."},{"key":"e_1_3_2_2_16_1","unstructured":"Johannes Klicpera Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2018. Predict then propagate: Graph neural networks meet personalized pagerank. In ICLR."},{"key":"e_1_3_2_2_17_1","volume-title":"Event detection on dynamic graphs. arXiv preprint arXiv:2110.12148","author":"Kosan Mert","year":"2021","unstructured":"Mert Kosan, Arlei Silva, Sourav Medya, Brian Uzzi, and Ambuj Singh. 2021. Event detection on dynamic graphs. arXiv preprint arXiv:2110.12148 (2021)."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Yongjiang Liang and Peixiang Zhao. 2017. Similarity Search in Graph Databases: A Multi-Layered Indexing Approach. In ICDE. 783--794.","DOI":"10.1109\/ICDE.2017.129"},{"key":"e_1_3_2_2_19_1","volume-title":"Gabriele Tolomei, Maarten De Rijke, and Fabrizio Silvestri.","author":"Lucic Ana","year":"2022","unstructured":"Ana Lucic, Maartje A Ter Hoeve, Gabriele Tolomei, Maarten De Rijke, and Fabrizio Silvestri. 2022. Cf-gnnexplainer: Counterfactual explanations for graph neural networks. In AISTATS."},{"key":"e_1_3_2_2_20_1","unstructured":"Dongsheng Luo Wei Cheng Dongkuan Xu Wenchao Yu Bo Zong Haifeng Chen and Xiang Zhang. 2020. Parameterized explainer for graph neural network. In NeurIPS."},{"key":"e_1_3_2_2_21_1","volume-title":"Gcomb: Learning budget-constrained combinatorial algorithms over billion-sized graphs. In NeurIPS.","author":"Manchanda Sahil","year":"2020","unstructured":"Sahil Manchanda, Akash Mittal, Anuj Dhawan, Sourav Medya, Sayan Ranu, and Ambuj Singh. 2020. Gcomb: Learning budget-constrained combinatorial algorithms over billion-sized graphs. In NeurIPS."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Sourav Medya Mohammad Rasoolinejad Yang Yang and Brian Uzzi. 2022. An Exploratory Study of Stock Price Movements from Earnings Calls. In WebConf.","DOI":"10.1145\/3487553.3524205"},{"key":"e_1_3_2_2_23_1","unstructured":"Qiaozhu Mei Jian Guo and Dragomir Radev. 2010. Divrank: the interplay of prestige and diversity in information networks. In SIGKDD."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Ahmed Metwally Divyakant Agrawal and Amr El Abbadi. 2005. Efficient computation of frequent and top-k elements in data streams. In ICDT.","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"e_1_3_2_2_25_1","volume-title":"Chip Placement with Deep Reinforcement Learning. CoRR","author":"Mirhoseini Azalia","year":"2020","unstructured":"Azalia Mirhoseini, Anna Goldie, Mustafa Yazgan, Joe W. J. Jiang, Ebrahim M. Songhori, Shen Wang, Young-Joon Lee, Eric Johnson, Omkar Pathak, Sungmin Bae, Azade Nazi, Jiwoo Pak, Andy Tong, Kavya Srinivasa, William Hang, Emre Tuncer, Anand Babu, Quoc V. Le, James Laudon, Richard Ho, Roger Carpenter, and Jeff Dean. 2020. Chip Placement with Deep Reinforcement Learning. CoRR, Vol. abs\/2004.10746 (2020)."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Dheepikaa Natarajan and Sayan Ranu. 2016. A scalable and generic framework to mine top-k representative subgraph patterns. In ICDM.","DOI":"10.1109\/ICDM.2016.0048"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Sunil Nishad Shubhangi Agarwal Arnab Bhattacharya and Sayan Ranu. 2021. GraphReach: Position-Aware Graph Neural Network using Reachability Estimations. In IJCAI.","DOI":"10.24963\/ijcai.2021\/211"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01205239"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_30_1","volume-title":"GREED: A Neural Framework for Learning Graph Distance Functions. In NeurIPS.","author":"Ranjan Rishab","year":"2022","unstructured":"Rishab Ranjan, Siddharth Grover, Sourav Medya, Venkatesan Chakravarthy, Yogish Sabharwal, and Sayan Ranu. 2022. GREED: A Neural Framework for Learning Graph Distance Functions. In NeurIPS."},{"key":"e_1_3_2_2_31_1","unstructured":"Kaivalya Rawal and Himabindu Lakkaraju. 2020. Beyond individualized recourse: Interpretable and interactive summaries of actionable recourses. In NeurIPS."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89689-0_33"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"e_1_3_2_2_34_1","volume-title":"Michael R Angelastro","author":"Sarubbi Edoardo","year":"1993","unstructured":"Edoardo Sarubbi, Pier Fausto Seneci, Michael R Angelastro, Norton P Peet, Maurizio Denaro, and Khalid Islam. 1993. Peptide aldehydes as inhibitors of HIV protease. FEBS letters, Vol. 319, 3 (1993), 253--256."},{"key":"e_1_3_2_2_35_1","volume-title":"JMLR","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. JMLR, Vol. 12, 9 (2011)."},{"key":"e_1_3_2_2_36_1","unstructured":"Juntao Tan Shijie Geng Zuohui Fu Yingqiang Ge Shuyuan Xu Yunqi Li and Yongfeng Zhang. 2022. Learning and evaluating graph neural network explanations based on counterfactual and factual reasoning. In WebConf."},{"key":"e_1_3_2_2_37_1","volume-title":"N M Anoop Krishnan, and Sayan Ranu","author":"Thangamuthu Abishek","year":"2022","unstructured":"Abishek Thangamuthu, Gunjan Kumar, Suresh Bishnoi, Ravinder Bhattoo, N M Anoop Krishnan, and Sayan Ranu. 2022. Unravelling the Performance of Physics-informed Graph Neural Networks for Dynamical Systems. In NeurIPS."},{"key":"e_1_3_2_2_38_1","unstructured":"Petar Velivc kovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. In ICLR."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57959-7"},{"key":"e_1_3_2_2_40_1","volume-title":"Pgm-explainer: Probabilistic graphical model explanations for graph neural networks. In NeurIPS.","author":"Vu Minh","year":"2020","unstructured":"Minh Vu and My T Thai. 2020. Pgm-explainer: Probabilistic graphical model explanations for graph neural networks. In NeurIPS."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Nikil Wale and George Karypis. 2006. Comparison of Descriptor Spaces for Chemical Compound Retrieval and Classification. In ICDM.","DOI":"10.21236\/ADA444816"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Yuke Wang Boyuan Feng and Yufei Ding. 2022. QGTC: accelerating quantized graph neural networks via GPU tensor core. In PPoPP.","DOI":"10.1145\/3503221.3508408"},{"key":"e_1_3_2_2_43_1","unstructured":"Yuke Wang Boyuan Feng Gushu Li Shuangchen Li Lei Deng Yuan Xie and Yufei Ding. 2021. GNNAdvisor: An Efficient Runtime System for GNN Acceleration on GPUs. In OSDI."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.drudis.2021.02.011"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Shuang-Hong Yang Bo Long Alex Smola Narayanan Sadagopan Zhaohui Zheng and Hongyuan Zha. 2011. Like like alike: joint friendship and interest propagation in social networks. In WebConf.","DOI":"10.1145\/1963405.1963481"},{"key":"e_1_3_2_2_46_1","volume-title":"Gnnexplainer: Generating explanations for graph neural networks. In NeurIPS.","author":"Ying Rex","year":"2019","unstructured":"Rex Ying, Dylan Bourgeois, Jiaxuan You, Marinka Zitnik, and Jure Leskovec. 2019. Gnnexplainer: Generating explanations for graph neural networks. In NeurIPS."},{"key":"e_1_3_2_2_47_1","volume-title":"XGNN: Towards Model-Level Explanations of Graph Neural Networks. In SIGKDD.","author":"Yuan Hao","year":"2020","unstructured":"Hao Yuan, Jiliang Tang, Xia Hu, and Shuiwang Ji. 2020. XGNN: Towards Model-Level Explanations of Graph Neural Networks. In SIGKDD."},{"key":"e_1_3_2_2_48_1","unstructured":"Tong Zhao Gang Liu Daheng Wang Wenhao Yu and Meng Jiang. 2022. Learning from Counterfactual Links for Link Prediction. In ICML."}],"event":{"name":"WSDM '23: The Sixteenth ACM International Conference on Web Search and Data Mining","location":"Singapore Singapore","acronym":"WSDM '23","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3539597.3570376","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3539597.3570376","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:29Z","timestamp":1750182689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3539597.3570376"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,27]]},"references-count":48,"alternative-id":["10.1145\/3539597.3570376","10.1145\/3539597"],"URL":"https:\/\/doi.org\/10.1145\/3539597.3570376","relation":{},"subject":[],"published":{"date-parts":[[2023,2,27]]},"assertion":[{"value":"2023-02-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}