{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,24]],"date-time":"2026-08-24T17:29:38Z","timestamp":1787592578006,"version":"build-2736575974"},"reference-count":67,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T00:00:00Z","timestamp":1707696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Science Foundation","award":["1947135, 2134079, 2316233, 2324770"],"award-info":[{"award-number":["1947135, 2134079, 2316233, 2324770"]}]},{"name":"National Science Foundation Program on Fairness in AI in collaboration with Amazon","award":["1939725"],"award-info":[{"award-number":["1939725"]}]},{"DOI":"10.13039\/100000185","name":"DARPA","doi-asserted-by":"crossref","award":["HR001121C0165"],"award-info":[{"award-number":["HR001121C0165"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100005825","name":"NIFA","doi-asserted-by":"crossref","award":["2020-67021-32799"],"award-info":[{"award-number":["2020-67021-32799"]}],"id":[{"id":"10.13039\/100005825","id-type":"DOI","asserted-by":"crossref"}]},{"name":"DHS","award":["17STQAC00001-07-00"],"award-info":[{"award-number":["17STQAC00001-07-00"]}]},{"name":"ARO","award":["W911NF2110088"],"award-info":[{"award-number":["W911NF2110088"]}]},{"name":"C3.ai Digital Transformation Institute, MIT-IBM Watson AI Lab, and IBM-Illinois Discovery Accelerator Institute"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,5,31]]},"abstract":"<jats:p>\n                    Contrastive learning is an effective unsupervised method in graph representation learning. The key component of contrastive learning lies in the construction of positive and negative samples. Previous methods usually utilize the proximity of nodes in the graph as the principle. Recently, the data-augmentation-based contrastive learning method has advanced to show great power in the visual domain, and some works have extended this method from images to graphs. However, unlike the data augmentation on images, the data augmentation on graphs is far less intuitive and it is much harder to provide high-quality contrastive samples, which leaves much space for improvement. In this work, by introducing an adversarial graph view for data augmentation, we propose a simple but effective method,\n                    <jats:italic>Adversarial Graph Contrastive Learning<\/jats:italic>\n                    (\n                    <jats:sc>ArieL<\/jats:sc>\n                    ), to extract informative contrastive samples within reasonable constraints. We develop a new technique called\n                    <jats:italic>information regularization<\/jats:italic>\n                    for stable training and use subgraph sampling for scalability. We generalize our method from node-level contrastive learning to the graph level by treating each graph instance as a super-node.\n                    <jats:sc>ArieL<\/jats:sc>\n                    consistently outperforms the current graph contrastive learning methods for both node-level and graph-level classification tasks on real-world datasets. We further demonstrate that\n                    <jats:sc>ArieL<\/jats:sc>\n                    is more robust in the face of adversarial attacks.\n                  <\/jats:p>","DOI":"10.1145\/3638054","type":"journal-article","created":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T06:31:29Z","timestamp":1703226689000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["<scp>ArieL<\/scp>\n                    : Adversarial Graph Contrastive Learning"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2464-7226","authenticated-orcid":false,"given":"Shengyu","family":"Feng","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1564-6499","authenticated-orcid":false,"given":"Baoyu","family":"Jing","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3338-6371","authenticated-orcid":false,"given":"Yada","family":"Zhu","sequence":"additional","affiliation":[{"name":"IBM Research, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4405-3887","authenticated-orcid":false,"given":"Hanghang","family":"Tong","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,2,12]]},"reference":[{"key":"e_1_3_2_2_2","volume-title":"PAKDD","author":"Adhikari Bijaya","year":"2018","unstructured":"Bijaya Adhikari, Yao Zhang, Naren Ramakrishnan, and B. Aditya Prakash. 2018. Sub2Vec: Feature learning for subgraphs. In PAKDD."},{"key":"e_1_3_2_3_2","unstructured":"Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2019. Adversarial Attacks on Node Embeddings via Graph Poisoning. arxiv:1809.01093 [cs.LG]"},{"key":"e_1_3_2_4_2","first-page":"2787","volume-title":"Advances in Neural Information Processing Systems","author":"Bordes Antoine","year":"2013","unstructured":"Antoine Bordes, Nicolas Usunier, Alberto Garcia-Duran, Jason Weston, and Oksana Yakhnenko. 2013. Translating embeddings for modeling multi-relational data. In Advances in Neural Information Processing Systems, C. J. C. Burges, L. Bottou, M. Welling, Z. Ghahramani, and K. Q. Weinberger (Eds.), Vol. 26. Curran Associates, Inc., 2787\u20132795. https:\/\/proceedings.neurips.cc\/paper\/2013\/file\/1cecc7a77928ca8133fa24680a88d2f9-Paper.pdf"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"e_1_3_2_6_2","unstructured":"Ting Chen Simon Kornblith Mohammad Norouzi and Geoffrey Hinton. 2020. A Simple Framework for Contrastive Learning of Visual Representations. arxiv:2002.05709 [cs.LG]"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.5555\/1146355"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","unstructured":"Shengyu Feng Baoyu Jing Yada Zhu and Hanghang Tong. 2022. Adversarial Graph Contrastive Learning with Information Regularization. 10.48550\/ARXIV.2202.06491","DOI":"10.48550\/ARXIV.2202.06491"},{"key":"e_1_3_2_9_2","unstructured":"Ian J. Goodfellow Jonathon Shlens and Christian Szegedy. 2015. Explaining and Harnessing Adversarial Examples. arxiv:1412.6572 [stat.ML]"},{"key":"e_1_3_2_10_2","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable Feature Learning for Networks. arxiv:1607.00653 [cs.SI]","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_11_2","unstructured":"Kaveh Hassani and Amir Hosein Khasahmadi. 2020. Contrastive Multi-View Representation Learning on Graphs. arxiv:2006.05582 [cs.LG]"},{"key":"e_1_3_2_12_2","unstructured":"Kaiming He Haoqi Fan Yuxin Wu Saining Xie and Ross Girshick. 2020. Momentum Contrast for Unsupervised Visual Representation Learning. arxiv:1911.05722 [cs.CV]"},{"key":"e_1_3_2_13_2","unstructured":"R Devon Hjelm Alex Fedorov Samuel Lavoie-Marchildon Karan Grewal Phil Bachman Adam Trischler and Yoshua Bengio. 2019. Learning Deep Representations by Mutual Information Estimation and Maximization. arxiv:1808.06670 [stat.ML]"},{"key":"e_1_3_2_14_2","unstructured":"Chih-Hui Ho and Nuno Vasconcelos. 2020. Contrastive Learning with Adversarial Examples. arxiv:2010.12050 [cs.CV]"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","unstructured":"Sergey Ioffe and Christian Szegedy. 2015. Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift. 10.48550\/ARXIV.1502.03167","DOI":"10.48550\/ARXIV.1502.03167"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1067"},{"key":"e_1_3_2_17_2","unstructured":"Ziyu Jiang Tianlong Chen Ting Chen and Zhangyang Wang. 2020. Robust Pre-Training by Adversarial Contrastive Learning. arxiv:2010.13337 [cs.CV]"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","unstructured":"Baoyu Jing Shengyu Feng Yuejia Xiang Xi Chen Yu Chen and Hanghang Tong. 2021. X-GOAL: Multiplex heterogeneous graph prototypical contrastive learning. (2021). 10.48550\/ARXIV.2109.03560","DOI":"10.48550\/ARXIV.2109.03560"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449971"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449969"},{"key":"e_1_3_2_21_2","article-title":"STERLING: Synergistic representation learning on bipartite graphs","author":"Jing Baoyu","year":"2023","unstructured":"Baoyu Jing, Yuchen Yan, Kaize Ding, Chanyoung Park, Yada Zhu, Huan Liu, and Hanghang Tong. 2023. STERLING: Synergistic representation learning on bipartite graphs. arXiv preprint arXiv:2302.05428 (2023).","journal-title":"arXiv preprint arXiv:2302.05428"},{"key":"e_1_3_2_22_2","volume-title":"NeurIPS 2022 Workshop: New Frontiers in Graph Learning","author":"Jing Baoyu","year":"2022","unstructured":"Baoyu Jing, Yuchen Yan, Yada Zhu, and Hanghang Tong. 2022. COIN: Co-cluster infomax for bipartite graphs. In NeurIPS 2022 Workshop: New Frontiers in Graph Learning."},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.11"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","unstructured":"Li Jing Pascal Vincent Yann LeCun and Yuandong Tian. 2021. Understanding dimensional collapse in contrastive self-supervised learning. (2021). 10.48550\/ARXIV.2110.09348","DOI":"10.48550\/ARXIV.2110.09348"},{"key":"e_1_3_2_25_2","unstructured":"Nikola Jovanovi\u0107 Zhao Meng Lukas Faber and Roger Wattenhofer. 2021. Towards Robust Graph Contrastive Learning. arxiv:2102.13085 [cs.LG]"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622563"},{"key":"e_1_3_2_27_2","unstructured":"Minseon Kim Jihoon Tack and Sung Ju Hwang. 2020. Adversarial Self-Supervised Contrastive Learning. arxiv:2006.07589 [cs.LG]"},{"key":"e_1_3_2_28_2","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. arxiv:1609.02907 [cs.LG]"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512208"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/2.36"},{"key":"e_1_3_2_32_2","unstructured":"Jiaqi Ma Junwei Deng and Qiaozhu Mei. 2021. Adversarial Attack on Graph Neural Networks as an Influence Maximization Problem. arxiv:2106.10785 [cs.LG]"},{"key":"e_1_3_2_33_2","unstructured":"Aleksander Madry Aleksandar Makelov Ludwig Schmidt Dimitris Tsipras and Adrian Vladu. 2019. Towards Deep Learning Models Resistant to Adversarial Attacks. arxiv:1706.06083 [stat.ML]"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","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. 10.48550\/ARXIV.2007.08663","DOI":"10.48550\/ARXIV.2007.08663"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","unstructured":"Annamalai Narayanan Mahinthan Chandramohan Rajasekar Venkatesan Lihui Chen Yang Liu and Shantanu Jaiswal. 2017. graph2vec: Learning Distributed Representations of Graphs. 10.48550\/ARXIV.1707.05005","DOI":"10.48550\/ARXIV.1707.05005"},{"key":"e_1_3_2_36_2","volume-title":"The PageRank Citation Ranking: Bringing Order to the Web.","author":"Page Lawrence","year":"1999","unstructured":"Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. 1999. The PageRank Citation Ranking: Bringing Order to the Web.Technical Report 1999-66. Stanford InfoLab. http:\/\/ilpubs.stanford.edu:8090\/422\/Previous number = SIDL-WP-1999-0120."},{"key":"e_1_3_2_37_2","doi-asserted-by":"crossref","unstructured":"Zhen Peng Wenbing Huang Minnan Luo Qinghua Zheng Yu Rong Tingyang Xu and Junzhou Huang. 2020. Graph Representation Learning via Graphical Mutual Information Maximization. arxiv:2002.01169 [cs.LG]","DOI":"10.1145\/3366423.3380112"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403168"},{"key":"e_1_3_2_40_2","volume-title":"International Conference on Learning Representations","author":"Robinson Joshua David","year":"2021","unstructured":"Joshua David Robinson, Ching-Yao Chuang, Suvrit Sra, and Stefanie Jegelka. 2021. Contrastive learning with hard negative samples. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=CR1XOQ0UTh-"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3424672"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","unstructured":"Benedek Rozemberczki Carl Allen and Rik Sarkar. 2019. Multi-scale Attributed Node Embedding. 10.48550\/ARXIV.1909.13021","DOI":"10.48550\/ARXIV.1909.13021"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","unstructured":"Benedek Rozemberczki and Rik Sarkar. 2020. Characteristic functions on graphs: Birds of a feather from statistical descriptors to parametric models. (2020). 10.48550\/ARXIV.2005.07959","DOI":"10.48550\/ARXIV.2005.07959"},{"key":"e_1_3_2_44_2","unstructured":"Oleksandr Shchur Maximilian Mumme Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2019. Pitfalls of Graph Neural Network Evaluation. arxiv:1811.05868 [cs.LG]"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","unstructured":"Fan-Yun Sun Jordan Hoffmann Vikas Verma and Jian Tang. 2019. InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization. 10.48550\/ARXIV.1908.01000","DOI":"10.48550\/ARXIV.1908.01000"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3480244"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380149"},{"key":"e_1_3_2_48_2","unstructured":"Susheel Suresh Pan Li Cong Hao and Jennifer Neville. 2021. Adversarial Graph Augmentation to Improve Graph Contrastive Learning. arxiv:2106.05819 [cs.LG]"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"e_1_3_2_50_2","unstructured":"Aaron van den Oord Yazhe Li and Oriol Vinyals. 2019. Representation Learning with Contrastive Predictive Coding. arxiv:1807.03748 [cs.LG]"},{"key":"e_1_3_2_51_2","unstructured":"Petar Veli\u010dkovi\u0107 Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. arxiv:1710.10903 [stat.ML]"},{"key":"e_1_3_2_52_2","unstructured":"Petar Veli\u010dkovi\u0107 William Fedus William L. Hamilton Pietro Li\u00f2 Yoshua Bengio and R. Devon Hjelm. 2018. Deep Graph Infomax. arxiv:1809.10341 [stat.ML]"},{"key":"e_1_3_2_53_2","article-title":"Characterizing long-tail categories on graphs","author":"Wang Haohui","year":"2023","unstructured":"Haohui Wang, Baoyu Jing, Kaize Ding, Yada Zhu, and Dawei Zhou. 2023. Characterizing long-tail categories on graphs. arXiv preprint arXiv:2305.09938 (2023).","journal-title":"arXiv preprint arXiv:2305.09938"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3269252"},{"key":"e_1_3_2_55_2","volume-title":"International Conference on Learning Representations","author":"Wang Yifei","year":"2022","unstructured":"Yifei Wang, Qi Zhang, Yisen Wang, Jiansheng Yang, and Zhouchen Lin. 2022. Chaos is a ladder: A new theoretical understanding of contrastive learning via augmentation overlap. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=ECvgmYVyeUz"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"e_1_3_2_57_2","volume-title":"AAAI Conference on Artificial Intelligence","author":"Xu Jiarong","year":"2020","unstructured":"Jiarong Xu, Junru Chen, Yang Yang, Yizhou Sun, Chunping Wang, and Jiangang Lu. 2020. Unsupervised adversarially robust representation learning on graphs. In AAAI Conference on Artificial Intelligence. https:\/\/api.semanticscholar.org\/CorpusID:227305618"},{"key":"e_1_3_2_58_2","unstructured":"Kaidi Xu Hongge Chen Sijia Liu Pin-Yu Chen Tsui-Wei Weng Mingyi Hong and Xue Lin. 2019. Topology Attack and Defense for Graph Neural Networks: An Optimization Perspective. arxiv:1906.04214 [cs.LG]"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","unstructured":"Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2018. How Powerful Are Graph Neural Networks?10.48550\/ARXIV.1810.00826","DOI":"10.48550\/ARXIV.1810.00826"},{"key":"e_1_3_2_60_2","volume-title":"37th Conference on Neural Information Processing Systems","author":"Yan Yuchen","year":"2023","unstructured":"Yuchen Yan, Baoyu Jing, Lihui Liu, Ruijie Wang, Jinning Li, Tarek Abdelzaher, and Hanghang Tong. 2023. Reconciling competing sampling strategies of network embedding. In 37th Conference on Neural Information Processing Systems."},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16585"},{"key":"e_1_3_2_62_2","unstructured":"Zhilin Yang William W. Cohen and Ruslan Salakhutdinov. 2016. Revisiting Semi-Supervised Learning with Graph Embeddings. arxiv:1603.08861 [cs.LG]"},{"key":"e_1_3_2_63_2","unstructured":"Yuning You Tianlong Chen Yongduo Sui Ting Chen Zhangyang Wang and Yang Shen. 2020. Graph Contrastive Learning with Augmentations. arxiv:2010.13902 [cs.LG]"},{"key":"e_1_3_2_64_2","unstructured":"Tong Zhao Yozen Liu Leonardo Neves Oliver Woodford Meng Jiang and Neil Shah. 2020. Data Augmentation for Graph Neural Networks. arxiv:2006.06830 [cs.LG]"},{"key":"e_1_3_2_65_2","unstructured":"Yanqiao Zhu Yichen Xu Feng Yu Qiang Liu Shu Wu and Liang Wang. 2020. Deep Graph Contrastive Representation Learning. arxiv:2006.04131 [cs.LG]"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220078"},{"key":"e_1_3_2_68_2","volume-title":"International Conference on Learning Representations","author":"Z\u00fcgner Daniel","year":"2019","unstructured":"Daniel Z\u00fcgner and Stephan G\u00fcnnemann. 2019. Adversarial attacks on graph neural networks via meta learning. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=Bylnx209YX"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638054","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638054","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T12:35:53Z","timestamp":1750163753000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,12]]},"references-count":67,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,5,31]]}},"alternative-id":["10.1145\/3638054"],"URL":"https:\/\/doi.org\/10.1145\/3638054","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,12]]},"assertion":[{"value":"2022-08-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-13","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}