{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T11:13:53Z","timestamp":1770462833055,"version":"3.49.0"},"reference-count":94,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T00:00:00Z","timestamp":1685059200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP220101434; DE190101118"],"award-info":[{"award-number":["DP220101434; DE190101118"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2023,5,26]]},"abstract":"<jats:p>A successful campaign should be able to attract investment from the brand, and meanwhile manage the conflicting interests in the campaign cost between the brand and the influencers. As such, the agency between these two stakeholders plays a vital role. Motivated by the above, we stand in the agency's shoes to formulate an interesting yet practical problem, namely Profit Divergence Minimization in Investment-Persuasive Influencer Marketing Campaign (PDMIC). This problem aims to (i) minimize the divergence of the actual hiring prices from the asking prices of the influencers and meanwhile (ii) maintain the attractiveness of the pricing scheme for the influencers to the brand. We show that this problem is NP-hard. To mitigate the challenge of the extremely large searching space of the hiring prices of the influencers, we solve this problem by firstly considering a restrictive searching sub-space and then gradually expanding the searching sub-space to the whole space in the end (specifically, from binary price choices to a set of integer prices and then to any price in the feasible price range). We propose effective yet efficient approximate algorithms for solving the problem in each of these settings. Extensive experiments demonstrate the superiority of our methods.<\/jats:p>","DOI":"10.1145\/3588934","type":"journal-article","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T17:42:05Z","timestamp":1685468525000},"page":"1-27","source":"Crossref","is-referenced-by-count":4,"title":["Managing Conflicting Interests of Stakeholders in Influencer Marketing"],"prefix":"10.1145","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9165-758X","authenticated-orcid":false,"given":"Shixun","family":"Huang","sequence":"first","affiliation":[{"name":"RMIT University, Melbourne, VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9101-1503","authenticated-orcid":false,"given":"Junhao","family":"Gan","sequence":"additional","affiliation":[{"name":"University of Melbourne, Melbourne, VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2477-381X","authenticated-orcid":false,"given":"Zhifeng","family":"Bao","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4741-801X","authenticated-orcid":false,"given":"Wenqing","family":"Lin","sequence":"additional","affiliation":[{"name":"Tencent, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,5,30]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"2009. https:\/\/courses.engr.illinois.edu\/cs598csc\/sp2009\/lectures\/lecture_4.pdf."},{"key":"e_1_2_2_2_1","unstructured":"2016. https:\/\/resource.co\/article\/material-gains-through-brokerage-services-11506."},{"key":"e_1_2_2_3_1","unstructured":"2017. https:\/\/www.emarketer.com\/Article\/Influencer-Marketing-Prices-Rising-UK\/1016283."},{"key":"e_1_2_2_4_1","unstructured":"2019. https:\/\/buffer.com\/resources\/micro-influencers\/."},{"key":"e_1_2_2_5_1","unstructured":"2019. https:\/\/later.com\/blog\/instagram-influencers-costs\/."},{"key":"e_1_2_2_6_1","unstructured":"2019. https:\/\/bondai.co\/blog\/6-types-of-influencers\/."},{"key":"e_1_2_2_7_1","unstructured":"2020. https:\/\/socialpubli.com\/blog\/how-influencer-agency-work\/."},{"key":"e_1_2_2_8_1","unstructured":"2020. https:\/\/influencermarketinghub.com\/micro-influencers-vs-celebrities\/."},{"key":"e_1_2_2_9_1","unstructured":"2020. https:\/\/www.oracle.com\/a\/ocom\/docs\/cloud\/oracle-451-research-advisory-blog-adopting.pdf."},{"key":"e_1_2_2_10_1","unstructured":"2020. https:\/\/reusewood.org\/guide\/material-brokerage."},{"key":"e_1_2_2_11_1","unstructured":"2020. https:\/\/blog.planoly.com\/calculate-influencer-rates."},{"key":"e_1_2_2_12_1","unstructured":"2021. https:\/\/www.marketingdive.com\/news\/social-commerce-drive-influencer-marketing-evolution-2022\/611546\/."},{"key":"e_1_2_2_13_1","unstructured":"2021. https:\/\/www.forbes.com\/sites\/forbesagencycouncil\/2021\/06\/02\/micro-influencers-when-smaller-is-better\/'sh= 591ee7d1539b."},{"key":"e_1_2_2_14_1","unstructured":"2021. https:\/\/www.marketingcharts.com\/digital\/social-media-116631."},{"key":"e_1_2_2_15_1","unstructured":"2021. https:\/\/www.indeed.com\/career-advice\/career-development\/tiered-pricing-template."},{"key":"e_1_2_2_16_1","unstructured":"2021. https:\/\/www.businessofapps.com\/marketplace\/influencer-marketing\/research\/influencer-marketing-costs\/."},{"key":"e_1_2_2_17_1","unstructured":"2021. https:\/\/blog.hootsuite.com\/instagram-influencer-rates\/\/."},{"key":"e_1_2_2_18_1","unstructured":"2021. https:\/\/hashtagpaid.com\/banknotes\/creator-rates."},{"key":"e_1_2_2_19_1","unstructured":"2022. https:\/\/fourthfloorcreative.co\/blog\/influencer-marketing-agency."},{"key":"e_1_2_2_20_1","unstructured":"2022. https:\/\/winkmodels.com.au\/much-cost-book-influencer\/."},{"key":"e_1_2_2_21_1","unstructured":"2022. https:\/\/www.britannica.com\/topic\/operations-research\/Resource-allocation."},{"key":"e_1_2_2_22_1","unstructured":"2022. https:\/\/quickbooks.intuit.com\/r\/midsize-business\/tiered-pricing\/."},{"key":"e_1_2_2_23_1","unstructured":"2022. https:\/\/blog.axway.com\/learning-center\/cloud-adoption\/multi-cloud-strategy."},{"key":"e_1_2_2_24_1","unstructured":"2022. https:\/\/gitfront.io\/r\/user-9366410\/jA9cWP7WK7Dg\/master\/."},{"key":"e_1_2_2_25_1","unstructured":"2022. https:\/\/www.andrewmacarthy.com\/andrew-macarthy-social-media\/instagram-influencer-pricing."},{"key":"e_1_2_2_26_1","unstructured":"2022. https:\/\/www.webfx.com\/influencer-marketing-pricing.html."},{"key":"e_1_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Akhil Arora Sainyam Galhotra and Sayan Ranu. 2017. Debunking the myths of influence maximization: An in-depth benchmarking study. In SIGMOD. 651--666.","DOI":"10.1145\/3218967"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_11"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137635"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752950"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-020-01461-4"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397244"},{"key":"e_1_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Christian Borgs Michael Brautbar Jennifer Chayes and Brendan Lucier. 2014. Maximizing social influence in nearly optimal time. In SODA. 946--957.","DOI":"10.1137\/1.9781611973402.70"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00179-5"},{"key":"e_1_2_2_35_1","volume-title":"Jeffrey Xu Yu, et al","author":"Cai Taotao","year":"2020","unstructured":"Taotao Cai, Jianxin Li, Ajmal S Mian, Timos Sellis, Jeffrey Xu Yu, et al. 2020. Target-aware holistic influence maximization in spatial social networks. TKDE (2020)."},{"key":"e_1_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Raul Castro Fernandez. 2022. Protecting Data Markets from Strategic Buyers. In SIGMOD. 1755--1769.","DOI":"10.1145\/3514221.3517855"},{"key":"e_1_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Lingjiao Chen Paraschos Koutris and Arun Kumar. 2019. Towards model-based pricing for machine learning in a data marketplace. In SIGMOD. 1535--1552.","DOI":"10.1145\/3299869.3300078"},{"key":"e_1_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Wei Chen Chi Wang and Yajun Wang. 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In SIGKDD. 1029--1038.","DOI":"10.1145\/1835804.1835934"},{"key":"e_1_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Wei Chen Yajun Wang and Siyu Yang. 2009. Efficient influence maximization in social networks. In SIGKDD. 199--208.","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Wei Chen Yifei Yuan and Li Zhang. 2010. Scalable influence maximization in social networks under the linear threshold model. In ICDM. 88--97.","DOI":"10.1109\/ICDM.2010.118"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1111\/1756-2171.12249"},{"key":"e_1_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Suqi Cheng Huawei Shen Junming Huang Wei Chen and Xueqi Cheng. 2014. IMRank: influence maximization via finding self-consistent ranking. In SIGIR. 475--484.","DOI":"10.1145\/2600428.2609592"},{"key":"e_1_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Suqi Cheng Huawei Shen Junming Huang Guoqing Zhang and Xueqi Cheng. 2013. Staticgreedy: solving the scalability-accuracy dilemma in influence maximization. In CIKM. 509--518.","DOI":"10.1145\/2505515.2505541"},{"key":"e_1_2_2_44_1","unstructured":"The Koblenz Network Collection. 2017. http:\/\/konect.uni-koblenz.de."},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064017"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.09.066"},{"key":"e_1_2_2_47_1","doi-asserted-by":"crossref","unstructured":"Sainyam Galhotra Akhil Arora and Shourya Roy. 2016. Holistic influence maximization: Combining scalability and efficiency with opinion-aware models. In SIGMOD. 1077--1088.","DOI":"10.1145\/2882903.2882929"},{"key":"e_1_2_2_48_1","volume-title":"Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing letters 12, 3","author":"Goldenberg Jacob","year":"2001","unstructured":"Jacob Goldenberg, Barak Libai, and Eitan Muller. 2001. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing letters 12, 3 (2001), 211--223."},{"key":"e_1_2_2_49_1","unstructured":"Amit Goyal Wei Lu and Laks VS Lakshmanan. 2011. Celf: optimizing the greedy algorithm for influence maximization in social networks. In WWW. 47--48."},{"key":"e_1_2_2_50_1","volume-title":"Simpath: An efficient algorithm for influence maximization under the linear threshold model. In ICDM. 211--220.","author":"Goyal Amit","year":"2011","unstructured":"Amit Goyal, Wei Lu, and Laks VS Lakshmanan. 2011. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In ICDM. 211--220."},{"key":"e_1_2_2_51_1","volume-title":"Threshold models of collective behavior. American journal of sociology 83, 6","author":"Granovetter Mark","year":"1978","unstructured":"Mark Granovetter. 1978. Threshold models of collective behavior. American journal of sociology 83, 6 (1978), 1420--1443."},{"key":"e_1_2_2_52_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3399661","article-title":"Influence maximization: Seeding based on community structure","volume":"14","author":"Guo Jianxiong","year":"2020","unstructured":"Jianxiong Guo and Weili Wu. 2020. Influence maximization: Seeding based on community structure. TKDD 14, 6 (2020), 1--22.","journal-title":"TKDD"},{"key":"e_1_2_2_53_1","doi-asserted-by":"crossref","unstructured":"Kai Han Benwei Wu Jing Tang Shuang Cui Cigdem Aslay and Laks VS Lakshmanan. 2021. Efficient and Effective Algorithms for Revenue Maximization in Social Advertising. In SIGMOD. 671--684.","DOI":"10.1145\/3448016.3459243"},{"key":"e_1_2_2_54_1","doi-asserted-by":"crossref","unstructured":"Shuo Han Fuzhen Zhuang Qing He and Zhongzhi Shi. 2014. Balanced seed selection for budgeted influence maximization in social networks. In PAKDD. 65--77.","DOI":"10.1007\/978-3-319-06608-0_6"},{"key":"e_1_2_2_55_1","doi-asserted-by":"crossref","unstructured":"Keke Huang Jing Tang Xiaokui Xiao Aixin Sun and Andrew Lim. 2020. Efficient approximation algorithms for adaptive target profit maximization. In ICDE. 649--660.","DOI":"10.1109\/ICDE48307.2020.00062"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00043"},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.14778\/3565816.3565821"},{"key":"e_1_2_2_58_1","volume-title":"Irie: Scalable and robust influence maximization in social networks. In ICDM. 918--923.","author":"Jung Kyomin","year":"2012","unstructured":"Kyomin Jung, Wooram Heo, and Wei Chen. 2012. Irie: Scalable and robust influence maximization in social networks. In ICDM. 918--923."},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112905"},{"key":"e_1_2_2_60_1","doi-asserted-by":"crossref","unstructured":"David Kempe Jon Kleinberg and \u00c9va Tardos. 2003. Maximizing the spread of influence through a social network. In SIGKDD. 137--146.","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_2_61_1","volume-title":"The dynamic and stochastic knapsack problem. Operations research 46, 1","author":"Kleywegt Anton J","year":"1998","unstructured":"Anton J Kleywegt and Jason D Papastavrou. 1998. The dynamic and stochastic knapsack problem. Operations research 46, 1 (1998), 17--35."},{"key":"e_1_2_2_62_1","doi-asserted-by":"crossref","unstructured":"Paraschos Koutris Prasang Upadhyaya Magdalena Balazinska Bill Howe and Dan Suciu. 2013. Toward practical query pricing with querymarket. In SIGMOD. 613--624.","DOI":"10.1145\/2463676.2465335"},{"key":"e_1_2_2_63_1","doi-asserted-by":"crossref","unstructured":"Siyu Lei Silviu Maniu Luyi Mo Reynold Cheng and Pierre Senellart. 2015. Online influence maximization. In SIGKDD. 645--654.","DOI":"10.1145\/2783258.2783271"},{"key":"e_1_2_2_64_1","doi-asserted-by":"crossref","unstructured":"Jure Leskovec Andreas Krause Carlos Guestrin Christos Faloutsos Jeanne VanBriesen and Natalie Glance. 2007. Cost-effective outbreak detection in networks. In SIGKDD. 420--429.","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2020.101522"},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.01.040"},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-021-00157-1"},{"key":"e_1_2_2_68_1","doi-asserted-by":"crossref","unstructured":"Ziyang Liu and Hakan Hacig\u00fcm\u00fcs. 2014. Online optimization and fair costing for dynamic data sharing in a cloud data market. In SIGMOD. 1359--1370.","DOI":"10.1145\/2588555.2593679"},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s1-28.1.486"},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3297001.3297005"},{"key":"e_1_2_2_71_1","volume-title":"An analysis of approximations for maximizing submodular set functions. Mathematical programming 14, 1","author":"Nemhauser George L","year":"1978","unstructured":"George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. 1978. An analysis of approximations for maximizing submodular set functions. Mathematical programming 14, 1 (1978), 265--294."},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130610"},{"key":"e_1_2_2_73_1","doi-asserted-by":"crossref","unstructured":"Naoto Ohsaka Takuya Akiba Yuichi Yoshida and Ken-ichi Kawarabayashi. 2014. Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations. In AAAI. 138--144.","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"e_1_2_2_74_1","first-page":"511","article-title":"Influence maximization using influence and susceptibility embeddings","volume":"14","author":"Panagopoulos George","year":"2020","unstructured":"George Panagopoulos, Fragkiskos D Malliaros, and Michalis Vazirgianis. 2020. Influence maximization using influence and susceptibility embeddings. In AAAI, Vol. 14. 511--521.","journal-title":"AAAI"},{"key":"e_1_2_2_75_1","unstructured":"Pierre Perrault Jennifer Healey Zheng Wen and Michal Valko. 2020. Budgeted online influence maximization. In ICML. 7620--7631."},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00186"},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00015-I"},{"key":"e_1_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/3380986"},{"key":"e_1_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-019-00778-5"},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3417748"},{"key":"e_1_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.27.3.503"},{"key":"e_1_2_2_82_1","doi-asserted-by":"crossref","unstructured":"Haiqi Sun Reynold Cheng Xiaokui Xiao Jing Yan Yudian Zheng and Yuqiu Qian. 2018. Maximizing social influence for the awareness threshold model. In DASFAA. 491--510.","DOI":"10.1007\/978-3-319-91452-7_32"},{"key":"e_1_2_2_83_1","doi-asserted-by":"crossref","unstructured":"Jing Tang Xueyan Tang and Junsong Yuan. 2016. Profit maximization for viral marketing in online social networks. In ICNP. 1--10.","DOI":"10.1109\/ICNP.2016.7784445"},{"key":"e_1_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2019.10.013"},{"key":"e_1_2_2_85_1","doi-asserted-by":"crossref","unstructured":"Youze Tang Yanchen Shi and Xiaokui Xiao. 2015. Influence maximization in near-linear time: A martingale approach. In SIGMOD. 1539--1554.","DOI":"10.1145\/2723372.2723734"},{"key":"e_1_2_2_86_1","doi-asserted-by":"crossref","unstructured":"Youze Tang Xiaokui Xiao and Yanchen Shi. 2014. Influence maximization: Near-optimal time complexity meets practical efficiency. In SIGMOD. 75--86.","DOI":"10.1145\/2588555.2593670"},{"key":"e_1_2_2_87_1","doi-asserted-by":"crossref","unstructured":"Yongxin Tong Libin Wang Zimu Zhou Lei Chen Bowen Du and Jieping Ye. 2018. Dynamic pricing in spatial crowdsourcing: A matching-based approach. In SIGMOD. 773--788.","DOI":"10.1145\/3183713.3196929"},{"key":"e_1_2_2_88_1","doi-asserted-by":"publisher","DOI":"10.3906\/elk-1907-122"},{"key":"e_1_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00123-5"},{"key":"e_1_2_2_90_1","volume-title":"International Symposium on Cluster, Cloud, and Grid Computing. 235--244","author":"Wu Linlin","year":"2013","unstructured":"Linlin Wu, Saurabh Kumar Garg, Rajkumar Buyya, Chao Chen, and Steve Versteeg. 2013. Automated SLA negotiation framework for cloud computing. In International Symposium on Cluster, Cloud, and Grid Computing. 235--244."},{"key":"e_1_2_2_91_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trd.2013.02.014"},{"key":"e_1_2_2_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330829"},{"key":"e_1_2_2_93_1","doi-asserted-by":"crossref","unstructured":"Yipeng Zhang Yuchen Li Zhifeng Bao Baihua Zheng and HV Jagadish. 2021. Minimizing the Regret of an Influence Provider. In SIGMOD. 2115--2127.","DOI":"10.1145\/3448016.3457257"},{"key":"e_1_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401961"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588934","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3588934","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:37Z","timestamp":1750178857000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588934"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,26]]},"references-count":94,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,5,26]]}},"alternative-id":["10.1145\/3588934"],"URL":"https:\/\/doi.org\/10.1145\/3588934","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,26]]}}}