{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T08:13:24Z","timestamp":1786090404455,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T00:00:00Z","timestamp":1697846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF (National Science Foundation)","award":["IIS-2153326"],"award-info":[{"award-number":["IIS-2153326"]}]},{"name":"NSF (National Science Foundation)","award":["IIS-2212145"],"award-info":[{"award-number":["IIS-2212145"]}]},{"name":"NSF (National Science Foundation)","award":["IIS-1909702"],"award-info":[{"award-number":["IIS-1909702"]}]},{"name":"Department of Homeland Security (DHS) CINA","award":["E205949D"],"award-info":[{"award-number":["E205949D"]}]},{"name":"Army Research Office","award":["W911NF-21-1-0198"],"award-info":[{"award-number":["W911NF-21-1-0198"]}]},{"name":"Cisco Faculty Research Award"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,21]]},"DOI":"10.1145\/3583780.3615092","type":"proceedings-article","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T07:45:26Z","timestamp":1697874326000},"page":"669-678","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Towards Fair Graph Neural Networks via Graph Counterfactual"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3921-7640","authenticated-orcid":false,"given":"Zhimeng","family":"Guo","sequence":"first","affiliation":[{"name":"The Pennsylvania State University, State College, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8167-7947","authenticated-orcid":false,"given":"Jialiang","family":"Li","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9180-1433","authenticated-orcid":false,"given":"Teng","family":"Xiao","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University, State College, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4985-8724","authenticated-orcid":false,"given":"Yao","family":"Ma","sequence":"additional","affiliation":[{"name":"Rensselaer Polytechnic Institute, Troy, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3448-4878","authenticated-orcid":false,"given":"Suhang","family":"Wang","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University, State College, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,10,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Chirag Agarwal Himabindu Lakkaraju and Marinka Zitnik. 2021. Towards a unified framework for fair and stable graph representation learning. In Uncertainty in Artificial Intelligence. PMLR 2114--2124. Chirag Agarwal Himabindu Lakkaraju and Marinka Zitnik. 2021. Towards a unified framework for fair and stable graph representation learning. In Uncertainty in Artificial Intelligence. PMLR 2114--2124."},{"key":"e_1_3_2_1_2_1","unstructured":"Arthur Asuncion and David Newman. 2007. UCI machine learning repository. (2007). Arthur Asuncion and David Newman. 2007. UCI machine learning repository. (2007)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00271"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Enyan Dai Limeng Cui Zhengyang Wang Xianfeng Tang Yinghan Wang Monica Cheng Bing Yin and Suhang Wang. 2023. A unified framework of graph information bottleneck for robustness and membership privacy. In KDD. Enyan Dai Limeng Cui Zhengyang Wang Xianfeng Tang Yinghan Wang Monica Cheng Bing Yin and Suhang Wang. 2023. A unified framework of graph information bottleneck for robustness and membership privacy. In KDD.","DOI":"10.1145\/3580305.3599248"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Enyan Dai and Suhang Wang. 2021. Say no to the discrimination: Learning fair graph neural networks with limited sensitive attribute information. In WSDM. 680--688. Enyan Dai and Suhang Wang. 2021. Say no to the discrimination: Learning fair graph neural networks with limited sensitive attribute information. In WSDM. 680--688.","DOI":"10.1145\/3437963.3441752"},{"key":"e_1_3_2_1_6_1","volume-title":"Robustness, Fairness, and Explainability. ArXiv","author":"Dai Enyan","year":"2022","unstructured":"Enyan Dai , Tianxiang Zhao , Huaisheng Zhu , Jun Xu , Zhimeng Guo , Hui Liu , Jiliang Tang , and Suhang Wang . 2022. A Comprehensive Survey on Trustworthy Graph Neural Networks: Privacy , Robustness, Fairness, and Explainability. ArXiv , Vol. abs\/ 2204 .08570 ( 2022 ). Enyan Dai, Tianxiang Zhao, Huaisheng Zhu, Jun Xu, Zhimeng Guo, Hui Liu, Jiliang Tang, and Suhang Wang. 2022. A Comprehensive Survey on Trustworthy Graph Neural Networks: Privacy, Robustness, Fairness, and Explainability. ArXiv, Vol. abs\/2204.08570 (2022)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512173"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"e_1_3_2_1_9_1","volume-title":"Counterfactual Learning on Graphs: A Survey. arXiv","author":"Guo Zhimeng","year":"2023","unstructured":"Zhimeng Guo , Teng Xiao , Charu Aggarwal , Hui Liu , and Suhang Wang . 2023. Counterfactual Learning on Graphs: A Survey. arXiv , Vol. abs\/ 2304 .01391 ( 2023 ). Zhimeng Guo, Teng Xiao, Charu Aggarwal, Hui Liu, and Suhang Wang. 2023. Counterfactual Learning on Graphs: A Survey. arXiv, Vol. abs\/2304.01391 (2023)."},{"key":"e_1_3_2_1_10_1","volume-title":"Graph Representation Learning","author":"Hamilton William L.","unstructured":"William L. Hamilton . 2020. Graph Representation Learning . Vol. 14 . Morgan &#38; Claypool Publishers . 1--159 pages. William L. Hamilton. 2020. Graph Representation Learning. Vol. 14. Morgan &#38; Claypool Publishers. 1--159 pages."},{"key":"e_1_3_2_1_11_1","volume-title":"Conference on Neural Information Processing Systems (NeurIPS). 1024--1034","author":"Hamilton William L.","year":"2017","unstructured":"William L. Hamilton , Zhitao Ying , and Jure Leskovec . 2017 . Inductive Representation Learning on Large Graphs .. In Conference on Neural Information Processing Systems (NeurIPS). 1024--1034 . William L. Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive Representation Learning on Large Graphs.. In Conference on Neural Information Processing Systems (NeurIPS). 1024--1034."},{"key":"e_1_3_2_1_12_1","unstructured":"Moritz Hardt Eric Price and Nati Srebro. 2016. Equality of Opportunity in Supervised Learning.. In NeurIPS. 3315--3323. Moritz Hardt Eric Price and Nati Srebro. 2016. Equality of Opportunity in Supervised Learning.. In NeurIPS. 3315--3323."},{"key":"e_1_3_2_1_13_1","volume-title":"International Conference on Learning Representations (ICLR).","author":"Higgins Irina","year":"2017","unstructured":"Irina Higgins , Lo\" ic Matthey, Arka Pal , Christopher P. Burgess , Xavier Glorot , Matthew M. Botvinick , Shakir Mohamed , and Alexander Lerchner . 2017 . beta-VAE: Learning Basic Visual Concepts with a Constrained Variational Framework .. In International Conference on Learning Representations (ICLR). Irina Higgins, Lo\" ic Matthey, Arka Pal, Christopher P. Burgess, Xavier Glorot, Matthew M. Botvinick, Shakir Mohamed, and Alexander Lerchner. 2017. beta-VAE: Learning Basic Visual Concepts with a Constrained Variational Framework.. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_1_14_1","volume-title":"Fmp: Toward fair graph message passing against topology bias. ArXiv","author":"Jiang Zhimeng","year":"2022","unstructured":"Zhimeng Jiang , Xiaotian Han , Chao Fan , Zirui Liu , Na Zou , Ali Mostafavi , and Xia Hu . 2022 . Fmp: Toward fair graph message passing against topology bias. ArXiv , Vol. abs\/ 2202 .04187 (2022). Zhimeng Jiang, Xiaotian Han, Chao Fan, Zirui Liu, Na Zou, Ali Mostafavi, and Xia Hu. 2022. Fmp: Toward fair graph message passing against topology bias. ArXiv, Vol. abs\/2202.04187 (2022)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICMTMA50254.2020.00108"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/15377938.2014.984045"},{"key":"e_1_3_2_1_17_1","volume-title":"Variational graph auto-encoders. ArXiv","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling . 2016. Variational graph auto-encoders. ArXiv , Vol. abs\/ 1611 .07308 ( 2016 ). Thomas N Kipf and Max Welling. 2016. Variational graph auto-encoders. ArXiv, Vol. abs\/1611.07308 (2016)."},{"key":"e_1_3_2_1_18_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. Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks.. In ICLR."},{"key":"e_1_3_2_1_19_1","volume-title":"Fairness-aware node representation learning. ArXiv","author":"Kose Deniz","year":"2021","unstructured":"\" Oyk\" u Deniz Kose and Yanning Shen . 2021. Fairness-aware node representation learning. ArXiv , Vol. abs\/ 2106 .05391 ( 2021 ). \" Oyk\" u Deniz Kose and Yanning Shen. 2021. Fairness-aware node representation learning. ArXiv, Vol. abs\/2106.05391 (2021)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.06.075"},{"key":"e_1_3_2_1_21_1","volume-title":"Counterfactual fairness. Advances in neural information processing systems","author":"Kusner Matt J","year":"2017","unstructured":"Matt J Kusner , Joshua Loftus , Chris Russell , and Ricardo Silva . 2017. Counterfactual fairness. Advances in neural information processing systems , Vol. 30 ( 2017 ). Matt J Kusner, Joshua Loftus, Chris Russell, and Ricardo Silva. 2017. Counterfactual fairness. Advances in neural information processing systems, Vol. 30 (2017)."},{"key":"e_1_3_2_1_22_1","volume-title":"International Conference on Machine Learning (ICML). 13209--13224","author":"Li Rui","year":"2022","unstructured":"Rui Li , Jianan Zhao , Chaozhuo Li , Di He , Yiqi Wang , Yuming Liu , Hao Sun , Senzhang Wang , Weiwei Deng , Yanming Shen , Xing Xie , and Qi Zhang . 2022 . HousE: Knowledge Graph Embedding with Householder Parameterization .. In International Conference on Machine Learning (ICML). 13209--13224 . Rui Li, Jianan Zhao, Chaozhuo Li, Di He, Yiqi Wang, Yuming Liu, Hao Sun, Senzhang Wang, Weiwei Deng, Yanming Shen, Xing Xie, and Qi Zhang. 2022. HousE: Knowledge Graph Embedding with Householder Parameterization.. In International Conference on Machine Learning (ICML). 13209--13224."},{"key":"e_1_3_2_1_23_1","volume-title":"International Conference on Learning Representations (ICLR).","author":"Liu Yi","year":"2022","unstructured":"Yi Liu , Limei Wang , Meng Liu , Yuchao Lin , Xuan Zhang , Bora Oztekin , and Shuiwang Ji . 2022 . Spherical message passing for 3d molecular graphs . In International Conference on Learning Representations (ICLR). Yi Liu, Limei Wang, Meng Liu, Yuchao Lin, Xuan Zhang, Bora Oztekin, and Shuiwang Ji. 2022. Spherical message passing for 3d molecular graphs. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_1_24_1","volume-title":"Aaresh Farrokh Bhathena, and Yiyang Lu","author":"Loveland Donald","year":"2022","unstructured":"Donald Loveland , Jiayi Pan , Aaresh Farrokh Bhathena, and Yiyang Lu . 2022 . FairEdit: Preserving Fairness in Graph Neural Networks through Greedy Graph Editing. ArXiv , Vol. abs\/ 2201 .03681 (2022). Donald Loveland, Jiayi Pan, Aaresh Farrokh Bhathena, and Yiyang Lu. 2022. FairEdit: Preserving Fairness in Graph Neural Networks through Greedy Graph Editing. ArXiv, Vol. abs\/2201.03681 (2022)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498391"},{"key":"e_1_3_2_1_26_1","volume-title":"Zemel","author":"Madras David","year":"2018","unstructured":"David Madras , Elliot Creager , Toniann Pitassi , and Richard S . Zemel . 2018 . Learning Adversarially Fair and Transferable Representations.. In ICML. 3381--3390. David Madras, Elliot Creager, Toniann Pitassi, and Richard S. Zemel. 2018. Learning Adversarially Fair and Transferable Representations.. In ICML. 3381--3390."},{"key":"e_1_3_2_1_27_1","volume-title":"Survey on causal-based machine learning fairness notions. ArXiv","author":"Makhlouf Karima","year":"2020","unstructured":"Karima Makhlouf , Sami Zhioua , and Catuscia Palamidessi . 2020. Survey on causal-based machine learning fairness notions. ArXiv , Vol. abs\/ 2010 .09553 ( 2020 ). Karima Makhlouf, Sami Zhioua, and Catuscia Palamidessi. 2020. Survey on causal-based machine learning fairness notions. ArXiv, Vol. abs\/2010.09553 (2020)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3457607"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/456"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1108\/IJBM-10-2014-0140"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1080\/00949655.2018.1505197"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1951.tb00088.x"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Yongduo Sui Xiang Wang Jiancan Wu Min Lin Xiangnan He and Tat-Seng Chua. 2022. Causal attention for interpretable and generalizable graph classification. In KDD. 1696--1705. Yongduo Sui Xiang Wang Jiancan Wu Min Lin Xiangnan He and Tat-Seng Chua. 2022. Causal attention for interpretable and generalizable graph classification. In KDD. 1696--1705.","DOI":"10.1145\/3534678.3539366"},{"key":"e_1_3_2_1_34_1","volume-title":"International Conference on Learning Representations (ICLR).","author":"Velickovic Petar","unstructured":"Petar Velickovic , Guillem Cucurull , Arantxa Casanova , Adriana Romero , Pietro Li ` o, and Yoshua Bengio. 2018. Graph Attention Networks .. In International Conference on Learning Representations (ICLR). Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li` o, and Yoshua Bengio. 2018. Graph Attention Networks.. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_2_1_36_1","first-page":"620","article-title":"Decoupled self-supervised learning for graphs","volume":"35","author":"Xiao Teng","year":"2022","unstructured":"Teng Xiao , Zhengyu Chen , Zhimeng Guo , Zeyang Zhuang , and Suhang Wang . 2022 . Decoupled self-supervised learning for graphs . Advances in Neural Information Processing Systems , Vol. 35 (2022), 620 -- 634 . Teng Xiao, Zhengyu Chen, Zhimeng Guo, Zeyang Zhuang, and Suhang Wang. 2022. Decoupled self-supervised learning for graphs. Advances in Neural Information Processing Systems, Vol. 35 (2022), 620--634.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467451"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16579"},{"key":"e_1_3_2_1_39_1","volume-title":"International Conference on Learning Representations (ICLR).","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 (ICLR). Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2019. How Powerful are Graph Neural Networks?. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00947"},{"key":"e_1_3_2_1_41_1","volume-title":"The comparisons of data mining techniques for the predictive accuracy of probability of default of credit card clients. Expert systems with applications","author":"Yeh Cheng","year":"2009","unstructured":"I- Cheng Yeh and Che-hui Lien. 2009. The comparisons of data mining techniques for the predictive accuracy of probability of default of credit card clients. Expert systems with applications , Vol. 36 , 2 ( 2009 ), 2473--2480. I-Cheng Yeh and Che-hui Lien. 2009. The comparisons of data mining techniques for the predictive accuracy of probability of default of credit card clients. Expert systems with applications, Vol. 36, 2 (2009), 2473--2480."},{"key":"e_1_3_2_1_42_1","volume-title":"Explainability in graph neural networks: A taxonomic survey","author":"Yuan Hao","year":"2022","unstructured":"Hao Yuan , Haiyang Yu , Shurui Gui , and Shuiwang Ji. 2022. Explainability in graph neural networks: A taxonomic survey . IEEE Transactions on Pattern Analysis and Machine Intelligence ( 2022 ). Hao Yuan, Haiyang Yu, Shurui Gui, and Shuiwang Ji. 2022. Explainability in graph neural networks: A taxonomic survey. IEEE Transactions on Pattern Analysis and Machine Intelligence (2022)."},{"key":"e_1_3_2_1_43_1","volume-title":"International Conference on Machine Learning (ICML). 325--333","author":"Zemel Richard S.","year":"2013","unstructured":"Richard S. Zemel , Yu Wu , Kevin Swersky , Toniann Pitassi , and Cynthia Dwork . 2013 . Learning Fair Representations .. In International Conference on Machine Learning (ICML). 325--333 . Richard S. Zemel, Yu Wu, Kevin Swersky, Toniann Pitassi, and Cynthia Dwork. 2013. Learning Fair Representations.. In International Conference on Machine Learning (ICML). 325--333."},{"key":"e_1_3_2_1_44_1","volume-title":"NeurIPS","volume":"31","author":"Zhang Muhan","year":"2018","unstructured":"Muhan Zhang and Yixin Chen . 2018 . Link prediction based on graph neural networks . NeurIPS , Vol. 31 (2018). Muhan Zhang and Yixin Chen. 2018. Link prediction based on graph neural networks. NeurIPS, Vol. 31 (2018)."},{"key":"e_1_3_2_1_45_1","volume-title":"International Conference on Machine Learning (ICML). 26911--26926","author":"Zhao Tong","year":"2022","unstructured":"Tong Zhao , Gang Liu , Daheng Wang , Wenhao Yu , and Meng Jiang . 2022 . Learning from Counterfactual Links for Link Prediction .. In International Conference on Machine Learning (ICML). 26911--26926 . Tong Zhao, Gang Liu, Daheng Wang, Wenhao Yu, and Meng Jiang. 2022. Learning from Counterfactual Links for Link Prediction.. In International Conference on Machine Learning (ICML). 26911--26926."},{"key":"e_1_3_2_1_46_1","volume-title":"Fairness-aware Message Passing for Graph Neural Networks. arXiv preprint arXiv:2306.11132","author":"Zhu Huaisheng","year":"2023","unstructured":"Huaisheng Zhu , Guoji Fu , Zhimeng Guo , Zhiwei Zhang , Teng Xiao , and Suhang Wang . 2023. Fairness-aware Message Passing for Graph Neural Networks. arXiv preprint arXiv:2306.11132 ( 2023 ). Huaisheng Zhu, Guoji Fu, Zhimeng Guo, Zhiwei Zhang, Teng Xiao, and Suhang Wang. 2023. Fairness-aware Message Passing for Graph Neural Networks. arXiv preprint arXiv:2306.11132 (2023)."}],"event":{"name":"CIKM '23: The 32nd ACM International Conference on Information and Knowledge Management","location":"Birmingham United Kingdom","acronym":"CIKM '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 32nd ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3615092","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583780.3615092","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583780.3615092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:56Z","timestamp":1750178216000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3615092"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,21]]},"references-count":46,"alternative-id":["10.1145\/3583780.3615092","10.1145\/3583780"],"URL":"https:\/\/doi.org\/10.1145\/3583780.3615092","relation":{},"subject":[],"published":{"date-parts":[[2023,10,21]]},"assertion":[{"value":"2023-10-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}