{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T06:18:12Z","timestamp":1764829092973,"version":"3.41.0"},"reference-count":71,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T00:00:00Z","timestamp":1686614400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["No. U1811263 and No. 62202338"],"award-info":[{"award-number":["No. U1811263 and No. 62202338"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2023,6,13]]},"abstract":"<jats:p>This paper studies the problem of fair clustering on heterogeneous information networks (HINs) by considering constraints on structural and sensitive attributes. We propose a Prerequisite-driven Fair Clustering (PDFC ) algorithm to solve this problem. Specifically, we define the structural constraint on the connection among nodes in HINs by combining meta-paths and prerequisite meta-paths and introduce Fairlets as the balance constraint. Under two constraints, we learn node embeddings based on graph models and perform theCholesky decomposition to obtain their orthogonal embeddings. We fuse node embeddings under constraints, define the loss function of PDFC, and perform k-means to achieve clustering. In addition, we design an update strategy of the adjacency matrix to achieve dynamic PDFC over time. Compared with several fair clustering algorithms on three real-world datasets, our experimental results verify the effectiveness and efficiency of PDFC.<\/jats:p>","DOI":"10.1145\/3589267","type":"journal-article","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:26:45Z","timestamp":1687292805000},"page":"1-27","source":"Crossref","is-referenced-by-count":4,"title":["Prerequisite-driven Fair Clustering on Heterogeneous Information Networks"],"prefix":"10.1145","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4087-6798","authenticated-orcid":false,"given":"Juntao","family":"Zhang","sequence":"first","affiliation":[{"name":"Wuhan University, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5461-4281","authenticated-orcid":false,"given":"Sheng","family":"Wang","sequence":"additional","affiliation":[{"name":"Wuhan University, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2911-0070","authenticated-orcid":false,"given":"Yuan","family":"Sun","sequence":"additional","affiliation":[{"name":"La Trobe University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1062-0970","authenticated-orcid":false,"given":"Zhiyong","family":"Peng","sequence":"additional","affiliation":[{"name":"Wuhan University, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,20]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Mohsen Abbasi Aditya Bhaskara and Suresh Venkatasubramanian. 2021. Fair Clustering via Equitable Group Representations. In FAccT. 504--514.","DOI":"10.1145\/3442188.3445913"},{"volume-title":"Deepak P, and Sowmya S. Sundaram.","year":"2020","key":"e_1_2_2_2_1","unstructured":"020)]% Abraham0S20, Savitha Sam Abraham, Deepak P, and Sowmya S. Sundaram. 2020. Fairness in Clustering with Multiple Sensitive Attributes. In EDBT. 287--298."},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1080\/00031305.1992.10475879"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2954869"},{"key":"e_1_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Abolfazl Asudeh H. V. Jagadish Julia Stoyanovich and Gautam Das. 2019. Designing Fair Ranking Schemes. In SIGMOD. 1259--1276.","DOI":"10.1145\/3299869.3300079"},{"key":"e_1_2_2_6_1","unstructured":"Arturs Backurs Piotr Indyk Krzysztof Onak Baruch Schieber Ali Vakilian and Tal Wagner. 2019. Scalable Fair Clustering. In ICML. 405--413."},{"key":"e_1_2_2_7_1","unstructured":"Suman Kalyan Bera Deeparnab Chakrabarty Nicolas Flores and Maryam Negahbani. 2019. Fair Algorithms for Clustering. In NeurIPS. 4955--4966."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3516431.3516438"},{"key":"e_1_2_2_9_1","unstructured":"Michele Borassi Alessandro Epasto Silvio Lattanzi Sergei Vassilvitskii and Morteza Zadimoghaddam. 2020. Sliding Window Algorithms for k-Clustering Problems. In NeurIPS. 8716--8727."},{"key":"e_1_2_2_10_1","volume-title":"Hamilton","author":"Bose Avishek Joey","year":"2019","unstructured":"Avishek Joey Bose and William L. Hamilton. 2019. Compositional Fairness Constraints for Graph Embeddings. In ICML. 715--724."},{"key":"e_1_2_2_11_1","volume-title":"Edith Elkind, Ayumi Igarashi, and Dominik Peters.","author":"Bouveret Sylvain","year":"2017","unstructured":"Sylvain Bouveret, Katar'i na Cechl\u00e1 rov\u00e1, Edith Elkind, Ayumi Igarashi, and Dominik Peters. 2017. Fair Division of a Graph. In IJCAI. 135--141."},{"key":"e_1_2_2_12_1","unstructured":"Paul S. Bradley Olvi L. Mangasarian and W. Nick Street. 1996. Clustering via Concave Minimization. In NeurIPS. 368--374."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90140-Q"},{"key":"e_1_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Ioannis Caragiannis Evi Micha and Nisarg Shah. 2022. A Little Charity Guarantees Fair Connected Graph Partitioning. In AAAI. 4908--4916.","DOI":"10.1609\/aaai.v36i5.20420"},{"key":"e_1_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Deepayan Chakrabarti Ravi Kumar and Andrew Tomkins. 2006. Evolutionary clustering. In KDD. 554--560.","DOI":"10.1145\/1150402.1150467"},{"key":"e_1_2_2_16_1","unstructured":"Vaggos Chatziafratis Rad Niazadeh and Moses Charikar. 2018. Hierarchical Clustering with Structural Constraints. In ICML. 773--782."},{"key":"e_1_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Lu Chen Yunjun Gao Yuanliang Zhang Christian S. Jensen and Bolong Zheng. 2019b. Efficient and Incremental Clustering Algorithms on Star-Schema Heterogeneous Graphs. In ICDE. 256--267.","DOI":"10.1109\/ICDE.2019.00031"},{"key":"e_1_2_2_18_1","unstructured":"Xingyu Chen Brandon Fain Liang Lyu and Kamesh Munagala. 2019a. Proportionally Fair Clustering. In ICML. 1032--1041."},{"key":"e_1_2_2_19_1","unstructured":"Flavio Chierichetti Ravi Kumar Silvio Lattanzi and Sergei Vassilvitskii. 2017. Fair Clustering Through Fairlets. In NeurIPS. 5029--5037."},{"key":"e_1_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Yushun Dong Jian Kang Hanghang Tong and Jundong Li. 2021. Individual Fairness for Graph Neural Networks: A Ranking based Approach. In KDD. 300--310.","DOI":"10.1145\/3447548.3467266"},{"key":"e_1_2_2_21_1","volume-title":"Fairness in Graph Mining: A Survey. CoRR","author":"Dong Yushun","year":"2022","unstructured":"Yushun Dong, Jing Ma, Chen Chen, and Jundong Li. 2022. Fairness in Graph Mining: A Survey. CoRR, Vol. abs\/2204.09888 (2022)."},{"key":"e_1_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Mohammadreza Esfandiari Dong Wei Sihem Amer-Yahia and Senjuti Basu Roy. 2019. Optimizing Peer Learning in Online Groups with Affinities. In KDD. 1216--1226.","DOI":"10.1145\/3292500.3330945"},{"key":"e_1_2_2_23_1","volume-title":"Vempala","author":"Ghadiri Mehrdad","year":"2021","unstructured":"Mehrdad Ghadiri, Samira Samadi, and Santosh S. Vempala. 2021. Socially Fair k-Means Clustering. In FAccT. 438--448."},{"key":"e_1_2_2_24_1","volume-title":"Reinforced MOOCs Concept Recommendation in Heterogeneous Information Networks. CoRR","author":"Gong Jibing","year":"2022","unstructured":"Jibing Gong, Yao Wan, Ye Liu, Xuewen Li, Yi Zhao, Cheng Wang, Qing Li, Wenzheng Feng, and Jie Tang. 2022. Reinforced MOOCs Concept Recommendation in Heterogeneous Information Networks. CoRR, Vol. abs\/2203.11011 (2022)."},{"key":"e_1_2_2_25_1","volume-title":"Yu","author":"Gong Jibing","year":"2020","unstructured":"Jibing Gong, Shen Wang, Jinlong Wang, Wenzheng Feng, Hao Peng, Jie Tang, and Philip S. Yu. 2020. Attentional Graph Convolutional Networks for Knowledge Concept Recommendation in MOOCs in a Heterogeneous View. In SIGIR. 79--88."},{"key":"e_1_2_2_26_1","first-page":"351","article-title":"Efficient Dynamic Clustering: Capturing Patterns from Historical Cluster Evolution","volume":"2","author":"Gu Binbin","year":"2022","unstructured":"Binbin Gu, Saeed Kargar, and Faisal Nawab. 2022. Efficient Dynamic Clustering: Capturing Patterns from Historical Cluster Evolution. In EDBT. 2:351--2:363.","journal-title":"EDBT."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.07.042"},{"key":"e_1_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Maliha Tashfia Islam Anna Fariha Alexandra Meliou and Babak Salimi. 2022. Through the Data Management Lens: Experimental Analysis and Evaluation of Fair Classification. In SIGMOD. 232--246.","DOI":"10.1145\/3514221.3517841"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.93"},{"key":"e_1_2_2_30_1","volume-title":"The Homophily Principle in Social Network Analysis. CoRR","author":"Khanam Kazi Zainab","year":"2020","unstructured":"Kazi Zainab Khanam, Gautam Srivastava, and Vijay Mago. 2020. The Homophily Principle in Social Network Analysis. CoRR, Vol. abs\/2008.10383 (2020)."},{"key":"e_1_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Bogyeong Kim Kyoseung Koo Undraa Enkhbat and Bongki Moon. 2022. DenForest: Enabling Fast Deletion in Incremental Density-Based Clustering over Sliding Windows. In SIGMOD. 296--309.","DOI":"10.1145\/3514221.3517833"},{"key":"e_1_2_2_32_1","volume-title":"DISC: Density-Based Incremental Clustering by Striding over Streaming Data. In ICDE. 828--839.","author":"Kim Bogyeong","year":"2021","unstructured":"Bogyeong Kim, Kyoseung Koo, Juhun Kim, and Bongki Moon. 2021. DISC: Density-Based Incremental Clustering by Striding over Streaming Data. In ICDE. 828--839."},{"key":"e_1_2_2_33_1","volume-title":"Kingma and Jimmy Ba","author":"Diederik","year":"2015","unstructured":"Diederik P. Kingma and Jimmy Ba. 2015. Adam: A Method for Stochastic Optimization. In ICLR."},{"key":"e_1_2_2_34_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."},{"key":"e_1_2_2_35_1","volume-title":"Manning","author":"Klein Dan","year":"2002","unstructured":"Dan Klein, Sepandar D. Kamvar, and Christopher D. Manning. 2002. From Instance-level Constraints to Space-Level Constraints: Making the Most of Prior Knowledge in Data Clustering. In ICML. 307--314."},{"key":"e_1_2_2_36_1","unstructured":"Matth\"a us Kleindessner Samira Samadi Pranjal Awasthi and Jamie Morgenstern. 2019. Guarantees for Spectral Clustering with Fairness Constraints. In ICML. 3458--3467."},{"key":"e_1_2_2_37_1","unstructured":"Bo Li Lijun Li Ankang Sun Chenhao Wang and Yingfan Wang. 2021b. Approximate Group Fairness for Clustering. In ICML. 6381--6391."},{"key":"e_1_2_2_38_1","unstructured":"Peizhao Li Yifei Wang Han Zhao Pengyu Hong and Hongfu Liu. 2021c. On Dyadic Fairness: Exploring and Mitigating Bias in Graph Connections. In ICLR."},{"key":"e_1_2_2_39_1","volume-title":"Untangling the network effects of productivity and prominence among scientists. Nature communications","author":"Li Weihua","year":"2022","unstructured":"Weihua Li, Sam Zhang, Zhiming Zheng, Skyler J Cranmer, and Aaron Clauset. 2022. Untangling the network effects of productivity and prominence among scientists. Nature communications, Vol. 13, 1 (2022), 1--11."},{"key":"e_1_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Xiang Li Danhao Ding Ben Kao Yizhou Sun and Nikos Mamoulis. 2021a. Leveraging Meta-path Contexts for Classification in Heterogeneous Information Networks. In ICDE. 912--923.","DOI":"10.1109\/ICDE51399.2021.00084"},{"key":"e_1_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Xiang Li Ben Kao Zhaochun Ren and Dawei Yin. 2019. Spectral Clustering in Heterogeneous Information Networks. In AAAI. 4221--4228.","DOI":"10.1609\/aaai.v33i01.33014221"},{"key":"e_1_2_2_42_1","unstructured":"Xiang Li Yao Wu Martin Ester Ben Kao Xin Wang and Yudian Zheng. 2017. Semi-supervised Clustering in Attributed Heterogeneous Information Networks. In WWW. 1621--1629."},{"key":"e_1_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Jiali Mao Qiuge Song Cheqing Jin Zhigang Zhang and Aoying Zhou. 2016. TSCluWin: Trajectory Stream Clustering over Sliding Window. In DASFAA. 133--148.","DOI":"10.1007\/978-3-319-32049-6_9"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3376901"},{"key":"e_1_2_2_45_1","first-page":"485","article-title":"FairLOF","volume":"6","author":"Savitha Sam Abraham Deepak","year":"2021","unstructured":"Deepak P and Savitha Sam Abraham. 2021. FairLOF: Fairness in Outlier Detection. Data Sci. Eng., Vol. 6, 4 (2021), 485--499.","journal-title":"Fairness in Outlier Detection. Data Sci. Eng."},{"key":"e_1_2_2_46_1","volume-title":"Fairwalk: Towards Fair Graph Embedding. In IJCAI. 3289--3295.","author":"Rahman Tahleen A.","year":"2019","unstructured":"Tahleen A. Rahman, Bartlomiej Surma, Michael Backes, and Yang Zhang. 2019. Fairwalk: Towards Fair Graph Embedding. In IJCAI. 3289--3295."},{"key":"e_1_2_2_47_1","unstructured":"Aida Rahmattalabi Phebe Vayanos Anthony Fulginiti Eric Rice Bryan Wilder Amulya Yadav and Milind Tambe. 2019. Exploring Algorithmic Fairness in Robust Graph Covering Problems. In NeurIPS. 15750--15761."},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319901"},{"key":"e_1_2_2_49_1","first-page":"1","article-title":"Fair Correlation Clustering in General Graphs","volume":"37","author":"Schwartz Roy","year":"2022","unstructured":"Roy Schwartz and Roded Zats. 2022. Fair Correlation Clustering in General Graphs. In APPROX\/RANDOM. 37:1--37:19.","journal-title":"APPROX\/RANDOM."},{"key":"e_1_2_2_50_1","unstructured":"Uri Shaham Kelly P. Stanton Henry Li Ronen Basri Boaz Nadler and Yuval Kluger. 2018. SpectralNet: Spectral Clustering using Deep Neural Networks. In ICLR."},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_2_2_52_1","doi-asserted-by":"crossref","unstructured":"Hanyu Song Peizhao Li and Hongfu Liu. 2021. Deep Clustering based Fair Outlier Detection. In KDD Feida Zhu Beng Chin Ooi and Chunyan Miao (Eds.). 1481--1489.","DOI":"10.1145\/3447548.3467225"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.5555\/2371211"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402736"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/3554821.3554901"},{"key":"e_1_2_2_56_1","doi-asserted-by":"crossref","unstructured":"Jie Tang Jing Zhang Limin Yao Juanzi Li Li Zhang and Zhong Su. 2008. ArnetMiner: extraction and mining of academic social networks. In KDD. 990--998.","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"e_1_2_2_58_1","doi-asserted-by":"crossref","unstructured":"Hanchen Wang Rong Hu Ying Zhang Lu Qin Wei Wang and Wenjie Zhang. 2022. Neural Subgraph Counting with Wasserstein Estimator. In SIGMOD. 160--175.","DOI":"10.1145\/3514221.3526163"},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.14778\/3357377.3357380"},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.14778\/3425879.3425887"},{"key":"e_1_2_2_61_1","volume-title":"Yu","author":"Wang Xiao","year":"2019","unstructured":"Xiao Wang, Houye Ji, Chuan Shi, Bai Wang, Yanfang Ye, Peng Cui, and Philip S. Yu. 2019b. Heterogeneous Graph Attention Network. In WWW. 2022--2032."},{"key":"e_1_2_2_62_1","doi-asserted-by":"crossref","unstructured":"Samuel F. Way Daniel B. Larremore and Aaron Clauset. 2016. Gender Productivity and Prestige in Computer Science Faculty Hiring Networks. In WWW. 1169--1179.","DOI":"10.1145\/2872427.2883073"},{"key":"e_1_2_2_63_1","volume-title":"Baruch Schieber, and Senjuti Basu Roy.","author":"Wei Dong","year":"2022","unstructured":"Dong Wei, Md Mouinul Islam, Baruch Schieber, and Senjuti Basu Roy. 2022. Rank Aggregation with Proportionate Fairness. In SIGMOD. 262--275."},{"key":"e_1_2_2_64_1","volume-title":"Zi Huang, and Xiaofang Zhou.","author":"Yin Hongzhi","year":"2018","unstructured":"Hongzhi Yin, Lei Zou, Quoc Viet Hung Nguyen, Zi Huang, and Xiaofang Zhou. 2018. Joint Event-Partner Recommendation in Event-Based Social Networks. In ICDE. 929--940."},{"key":"e_1_2_2_65_1","doi-asserted-by":"crossref","unstructured":"Jingyi You Chenlong Hu Hidetaka Kamigaito Kotaro Funakoshi and Manabu Okumura. 2021. Robust Dynamic Clustering for Temporal Networks. In CIKM. 2424--2433.","DOI":"10.1145\/3459637.3482473"},{"key":"e_1_2_2_66_1","unstructured":"Jifan Yu Gan Luo Tong Xiao Qingyang Zhong Yuquan Wang Wenzheng Feng Junyi Luo Chenyu Wang Lei Hou Juanzi Li Zhiyuan Liu and Jie Tang. 2020. MOOCCube: A Large-scale Data Repository for NLP Applications in MOOCs. In ACL. 3135--3142."},{"key":"e_1_2_2_67_1","doi-asserted-by":"crossref","unstructured":"Jifan Yu Yuquan Wang Qingyang Zhong Gan Luo Yiming Mao Kai Sun Wenzheng Feng Wei Xu Shulin Cao Kaisheng Zeng Zijun Yao Lei Hou Yankai Lin Peng Li Jie Zhou Bin Xu Juanzi Li Jie Tang and Maosong Sun. 2021. MOOCCubeX: A Large Knowledge-centered Repository for Adaptive Learning in MOOCs. In CIKM. 4643--4652.","DOI":"10.1145\/3459637.3482010"},{"key":"e_1_2_2_68_1","volume-title":"James R. Foulds, Yangqiu Song, and Shimei Pan.","author":"Zeng Ziqian","year":"2021","unstructured":"Ziqian Zeng, Rashidul Islam, Kamrun Naher Keya, James R. Foulds, Yangqiu Song, and Shimei Pan. 2021. Fair Representation Learning for Heterogeneous Information Networks. In ICWSM. 877--887."},{"key":"e_1_2_2_69_1","volume-title":"Navathe","author":"Zhang Hantian","year":"2021","unstructured":"Hantian Zhang, Xu Chu, Abolfazl Asudeh, and Shamkant B. Navathe. 2021a. OmniFair: A Declarative System for Model-Agnostic Group Fairness in Machine Learning. In SIGMOD. 2076--2088."},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2021.05.026"},{"key":"e_1_2_2_71_1","doi-asserted-by":"crossref","unstructured":"Imtiaz Masud Ziko Jing Yuan Eric Granger and Ismail Ben Ayed. 2021. Variational Fair Clustering. In AAAI. 11202--11209.","DOI":"10.1609\/aaai.v35i12.17336"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589267","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:54Z","timestamp":1750182534000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,13]]},"references-count":71,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6,13]]}},"alternative-id":["10.1145\/3589267"],"URL":"https:\/\/doi.org\/10.1145\/3589267","relation":{},"ISSN":["2836-6573"],"issn-type":[{"type":"electronic","value":"2836-6573"}],"subject":[],"published":{"date-parts":[[2023,6,13]]}}}