{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T18:48:29Z","timestamp":1758394109292,"version":"3.41.0"},"reference-count":60,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T00:00:00Z","timestamp":1699920000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006831","name":"United States Air Force","doi-asserted-by":"crossref","award":["FA8702-15-D-0001"],"award-info":[{"award-number":["FA8702-15-D-0001"]}],"id":[{"id":"10.13039\/100006831","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Combat Capabilities Development Command Army Research Laboratory","award":["W911NF-13-2-0045"],"award-info":[{"award-number":["W911NF-13-2-0045"]}]},{"name":"Under Secretary of Defense for Research and Engineering","award":["FA8702-15-D-0001"],"award-info":[{"award-number":["FA8702-15-D-0001"]}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"crossref","award":["W911NF1810208, W911NF1910241"],"award-info":[{"award-number":["W911NF1810208, W911NF1910241"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Science Foundation","award":["IIS-1905558"],"award-info":[{"award-number":["IIS-1905558"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,2,29]]},"abstract":"<jats:p>Identifying shortest paths between nodes in a network is a common graph analysis problem that is important for many applications involving routing of resources. An adversary that can manipulate the graph structure could alter traffic patterns to gain some benefit (e.g., make more money by directing traffic to a toll road). This article presents the<jats:italic>Force Path Cut<\/jats:italic>problem, in which an adversary removes edges from a graph to make a particular path the shortest between its terminal nodes. We prove that the optimization version of this problem is APX-hard but introduce<jats:monospace>PATHATTACK<\/jats:monospace>, a polynomial-time approximation algorithm that guarantees a solution within a logarithmic factor of the optimal value. In addition, we introduce the<jats:italic>Force Edge Cut<\/jats:italic>and<jats:italic>Force Node Cut<\/jats:italic>problems, in which the adversary targets a particular edge or node, respectively, rather than an entire path. We derive a nonconvex optimization formulation for these problems and derive a heuristic algorithm that uses<jats:monospace>PATHATTACK<\/jats:monospace>as a subroutine. We demonstrate all of these algorithms on a diverse set of real and synthetic networks, illustrating where the proposed algorithms provide the greatest improvement over baseline methods.<\/jats:p>","DOI":"10.1145\/3622941","type":"journal-article","created":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T11:49:12Z","timestamp":1694432952000},"page":"1-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Attacking Shortest Paths by Cutting Edges"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1649-1401","authenticated-orcid":false,"given":"Benjamin A.","family":"Miller","sequence":"first","affiliation":[{"name":"Northeastern University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6154-1466","authenticated-orcid":false,"given":"Zohair","family":"Shafi","sequence":"additional","affiliation":[{"name":"Northeastern University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1308-2311","authenticated-orcid":false,"given":"Wheeler","family":"Ruml","sequence":"additional","affiliation":[{"name":"University of New Hampshire, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2471-5345","authenticated-orcid":false,"given":"Yevgeniy","family":"Vorobeychik","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1892-1188","authenticated-orcid":false,"given":"Tina","family":"Eliassi-Rad","sequence":"additional","affiliation":[{"name":"Northeastern University, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8446-4993","authenticated-orcid":false,"given":"Scott","family":"Alfeld","sequence":"additional","affiliation":[{"name":"Amherst College, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,11,14]]},"reference":[{"key":"e_1_3_7_2_2","doi-asserted-by":"publisher","DOI":"10.5555\/767778.769030"},{"key":"e_1_3_7_3_2","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"key":"e_1_3_7_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800250314"},{"key":"e_1_3_7_5_2","doi-asserted-by":"publisher","DOI":"10.5555\/3113624.3114149"},{"issue":"48","key":"e_1_3_7_6_2","first-page":"E11221\u2013E11230","article-title":"Simplicial closure and higher-order link prediction","volume":"115","author":"Benson Austin R.","year":"2018","unstructured":"Austin R. Benson, Rediet Abebe, Michael T. Schaub, Ali Jadbabaie, and Jon Kleinberg. 2018. Simplicial closure and higher-order link prediction. Proceedings of the National Academy of Sciences 115, 48 (2018), E11221\u2013E11230.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"e_1_3_7_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2015.11.005"},{"key":"e_1_3_7_8_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_3_7_9_2","unstructured":"Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2019. Adversarial attacks on node embeddings via graph poisoning. In Proceedings of the 36th International Conference on Machine Learning (ICML\u201919) . PMLR 695\u2013704."},{"key":"e_1_3_7_10_2","doi-asserted-by":"crossref","unstructured":"Martim Brand\u00e3o Amanda Coles and Daniele Magazzeni. 2021. Explaining path plan optimality: Fast explanation methods for navigation meshes using full and incremental inverse optimization. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS\u201921) Vol. 31. AAAI Press Palo Alto CA 56\u201364.","DOI":"10.1609\/icaps.v31i1.15947"},{"key":"e_1_3_7_11_2","doi-asserted-by":"crossref","unstructured":"Mikael Call and Kaj Holmberg. 2011. Complexity of inverse shortest path routing. In Network Optimization (INOC\u201911) . Springer Berlin 339\u2013353.","DOI":"10.1007\/978-3-642-21527-8_39"},{"key":"e_1_3_7_12_2","doi-asserted-by":"crossref","unstructured":"Heng Chang Yu Rong Tingyang Xu Wenbing Huang Honglei Zhang Peng Cui Wenwu Zhu and Junzhou Huang. 2020. A restricted black-box adversarial framework towards attacking graph embedding models. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI\u201920) . AAAI Press Palo Alto CA 3389\u20133396.","DOI":"10.1609\/aaai.v34i04.5741"},{"key":"e_1_3_7_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2912801"},{"issue":"1","key":"e_1_3_7_14_2","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TCSS.2020.3031596","article-title":"Multiscale evolutionary perturbation attack on community detection","volume":"8","author":"Chen Jinyin","year":"2020","unstructured":"Jinyin Chen, Yixian Chen, Lihong Chen, Minghao Zhao, and Qi Xuan. 2020. Multiscale evolutionary perturbation attack on community detection. IEEE Transactions on Computational Social Systems 8, 1 (2020), 62\u201375.","journal-title":"IEEE Transactions on Computational Social Systems"},{"key":"e_1_3_7_15_2","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1809.02797"},{"key":"e_1_3_7_16_2","first-page":"219","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","year":"1990","unstructured":"Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. 1990. Hash tables. In Introduction to Algorithms. MIT Press, Cambridge, MA, 219\u2013243."},{"key":"e_1_3_7_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/1840747.1840750"},{"key":"e_1_3_7_18_2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-48777-8_9","volume-title":"International Conference on Integer Programming and Combinatorial Optimization","author":"Cunningham William H.","year":"1999","unstructured":"William H. Cunningham and Lawrence Tang. 1999. Optimal 3-terminal cuts and linear programming. In International Conference on Integer Programming and Combinatorial Optimization. Springer, Springer, Berlin,114\u2013125."},{"key":"e_1_3_7_19_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792225297"},{"key":"e_1_3_7_20_2","unstructured":"Hanjun Dai Hui Li Tian Tian Xin Huang Lin Wang Jun Zhu and Le Song. 2018. Adversarial attack on graph structured data. In Proceedings of the 35th International Conference on Machine Learning (ICML\u201918) . PMLR 1115\u20131124."},{"issue":"9","key":"e_1_3_7_21_2","first-page":"10 pages","article-title":"Inverse minimum cut problem with lower and upper bounds","volume":"8","author":"Deaconu Adrian","year":"2020","unstructured":"Adrian Deaconu and Laura Ciupala. 2020. Inverse minimum cut problem with lower and upper bounds. Mathematics 8, 9 (2020), 10 pages.","journal-title":"Mathematics"},{"key":"e_1_3_7_22_2","doi-asserted-by":"crossref","unstructured":"Bistra Dilkina Katherine J. Lai and Carla P. Gomes. 2011. Upgrading shortest paths in networks. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR\u201911) . Springer Berlin 76\u201391.","DOI":"10.1007\/978-3-642-21311-3_9"},{"key":"e_1_3_7_23_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"e_1_3_7_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2776133"},{"key":"e_1_3_7_25_2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0120921","volume-title":"Mathematical Programming at Oberwolfach","author":"G\u00e1cs Peter","year":"1981","unstructured":"Peter G\u00e1cs and Laszlo Lov\u00e1sz. 1981. Khachiyan\u2019s algorithm for linear programming. In Mathematical Programming at Oberwolfach. Springer, Berlin, 61\u201368."},{"key":"e_1_3_7_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579273"},{"key":"e_1_3_7_27_2","unstructured":"Manish Jain Dmytro Korzhyk Ond\u0159ej Van\u011bk Vincent Conitzer Michal P\u011bchou\u010dek and Milind Tambe. 2011. A double oracle algorithm for zero-sum security games on graphs. In Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201911) . IFAAMAS Richland SC 327\u2013334."},{"issue":"1","key":"e_1_3_7_28_2","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.ejor.2010.03.029","article-title":"Inverse minimum cost flow problems under the weighted Hamming distance","volume":"207","author":"Jiang Yiwei","year":"2010","unstructured":"Yiwei Jiang, Longcheng Liu, Biao Wu, and Enyu Yao. 2010. Inverse minimum cost flow problems under the weighted Hamming distance. European Journal of Operational Research 207, 1 (2010), 50\u201354.","journal-title":"European Journal of Operational Research"},{"key":"e_1_3_7_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2020.3001182"},{"key":"e_1_3_7_30_2","first-page":"95","volume-title":"Cooperative Control: Models, Applications and Algorithms","author":"Jun Myungsoo","year":"2003","unstructured":"Myungsoo Jun and Raffaello D\u2019Andrea. 2003. Path planning for unmanned aerial vehicles in uncertain and adversarial environments. In Cooperative Control: Models, Applications and Algorithms. Springer US, Boston, MA, 95\u2013110."},{"key":"e_1_3_7_31_2","doi-asserted-by":"publisher","DOI":"10.2172\/1481570"},{"key":"e_1_3_7_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.019"},{"issue":"1","key":"e_1_3_7_33_2","first-page":"1","article-title":"In-depth data on the network structure and hourly activity of the Central Chilean power grid","volume":"5","author":"Kim Heetae","year":"2018","unstructured":"Heetae Kim, David Olave-Rojas, Eduardo \u00c1lvarez-Miranda, and Seung-Woo Son. 2018. In-depth data on the network structure and hourly activity of the Central Chilean power grid. Scientific Data 5, 1 (2018), 1\u201310.","journal-title":"Scientific Data"},{"key":"e_1_3_7_34_2","unstructured":"Yin Tat Lee and Aaron Sidford. 2015. Efficient inverse maintenance and faster algorithms for linear programming. In IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS\u201915) . IEEE Piscataway NJ 230\u2013249."},{"key":"e_1_3_7_35_2","doi-asserted-by":"crossref","unstructured":"Jure Leskovec Jon Kleinberg and Christos Faloutsos. 2005. Graphs over time: Densification laws shrinking diameters and possible explanations. In Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining (KDD\u201905) . ACM New York NY 177\u2013187.","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_7_36_2","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_7_37_2","unstructured":"Joshua Letchford and Yevgeniy Vorobeychik. 2013. Optimal interdiction of attack plans. In Proceedings of the 12th International Conference on Autonomous Agents and Multi-Agent Systems . IFAAMAS Richland SC 199\u2013206."},{"key":"e_1_3_7_38_2","doi-asserted-by":"crossref","unstructured":"Jia Li Honglei Zhang Zhichao Han Yu Rong Hong Cheng and Junzhou Huang. 2020. Adversarial attack on community detection by hiding individuals. In Proceedings of The Web Conference (WWW\u201920) . ACM New York NY 917\u2013927.","DOI":"10.1145\/3366423.3380171"},{"key":"e_1_3_7_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-006-9006-8"},{"key":"e_1_3_7_40_2","doi-asserted-by":"crossref","unstructured":"Sourav Medya Petko Bogdanov and Ambuj Singh. 2016. Towards scalable network delay minimization. In IEEE 16th International Conference on Data Mining (ICDM\u201916) . IEEE Piscataway NJ 1083\u20131088.","DOI":"10.1109\/ICDM.2016.0140"},{"key":"e_1_3_7_41_2","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213889"},{"key":"e_1_3_7_42_2","doi-asserted-by":"crossref","unstructured":"Adam Meyerson and Brian Tagiku. 2009. Minimizing average shortest path distances via shortcut edge addition. In Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques (APPROX\u2013RANDOM\u201909) . Springer Berlin 272\u2013285.","DOI":"10.1007\/978-3-642-03685-9_21"},{"key":"e_1_3_7_43_2","doi-asserted-by":"crossref","unstructured":"Benjamin A. Miller Zohair Shafi Wheeler Ruml Yevgeniy Vorobeychik Tina Eliassi-Rad and Scott Alfeld. 2021. PATHATTACK: Attacking shortest paths in complex networks. In Machine Learning and Knowledge Discovery in Databases. Research Track (ECML PKDD\u201921) Nuria Oliver Fernando P\u00e9rez-Cruz Stefan Kramer Jesse Read and Jose A. Lozano (Eds.). Springer International Publishing Cham 532\u2013547.","DOI":"10.1007\/978-3-030-86520-7_33"},{"key":"e_1_3_7_44_2","doi-asserted-by":"crossref","unstructured":"Shishir Nagaraja. 2010. The impact of unlinkability on adversarial community detection: Effects and countermeasures. In Privacy Enhancing Technologies (PETS\u201910) . Springer Berlin 253\u2013272.","DOI":"10.1007\/978-3-642-14527-8_15"},{"key":"e_1_3_7_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00175-7"},{"key":"e_1_3_7_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00438-3"},{"key":"e_1_3_7_47_2","doi-asserted-by":"crossref","unstructured":"Ran Raz and Shmuel Safra. 1997. A sub-constant error-probability low-degree test and a sub-constant error-probability PCP characterization of NP. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC\u201997) . ACM New York NY 475\u2013484.","DOI":"10.1145\/258533.258641"},{"issue":"1","key":"e_1_3_7_48_2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.2298\/YJOR150624009T","article-title":"Efficient algorithms for the reverse shortest path problem on trees under the Hamming distance","volume":"27","author":"Tayyebi Javad","year":"2016","unstructured":"Javad Tayyebi and Massoud Aman. 2016. Efficient algorithms for the reverse shortest path problem on trees under the Hamming distance. Yugoslav Journal of Operations Research 27, 1 (2016), 46\u201360.","journal-title":"Yugoslav Journal of Operations Research"},{"key":"e_1_3_7_49_2","doi-asserted-by":"crossref","unstructured":"Hanghang Tong B. Aditya Prakash Tina Eliassi-Rad Michalis Faloutsos and Christos Faloutsos. 2012. Gelling and melting large graphs by edge manipulation. In Proceedings of the 21st ACM International Conference on Information and Knowledge Management (CIKM\u201912) . ACM New York NY 245\u2013254.","DOI":"10.1145\/2396761.2396795"},{"key":"e_1_3_7_50_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7"},{"key":"e_1_3_7_51_2","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/978-3-662-04565-7_14","volume-title":"Approximation Algorithms","author":"Vazirani Vijay V.","year":"2003","unstructured":"Vijay V. Vazirani. 2003. Rounding applied to set cover. In Approximation Algorithms. Springer, Berlin, 118\u2013123."},{"key":"e_1_3_7_52_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41562-017-0290-3"},{"key":"e_1_3_7_53_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.2.243"},{"key":"e_1_3_7_54_2","unstructured":"Robert West Joelle Pineau and Doina Precup. 2009. Wikispeedia: An online game for inferring semantic distances between concepts. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI\u201909) . AAAI Press Palo Alto CA 1598\u20131603."},{"key":"e_1_3_7_55_2","doi-asserted-by":"crossref","unstructured":"Huijun Wu Chen Wang Yuriy Tyshetskiy Andrew Docherty Kai Lu and Liming Zhu. 2019. Adversarial examples for graph data: Deep insights into attack and defense. In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI\u201919) . IJCAI 4816\u20134823.","DOI":"10.24963\/ijcai.2019\/669"},{"key":"e_1_3_7_56_2","doi-asserted-by":"crossref","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. In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI\u201919) . IJCAI 3961\u20133967.","DOI":"10.24963\/ijcai.2019\/550"},{"issue":"1","key":"e_1_3_7_57_2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF03167381","article-title":"An inverse problem of the weighted shortest path problem","volume":"12","author":"Xu Shaoji","year":"1995","unstructured":"Shaoji Xu and Jianzhong Zhang. 1995. An inverse problem of the weighted shortest path problem. Japan Journal of Industrial and Applied Mathematics 12, 1 (1995), 47\u201359.","journal-title":"Japan Journal of Industrial and Applied Mathematics"},{"issue":"4","key":"e_1_3_7_58_2","first-page":"571","article-title":"Inverse shortest path problems under Hamming distance","volume":"36","author":"Zhang Bin-wu","year":"2008","unstructured":"Bin-wu Zhang and Qin Wang. 2008. Inverse shortest path problems under Hamming distance. Journal of Hohai University (Natural Sciences) 36, 4 (July2008), 571\u2013574.","journal-title":"Journal of Hohai University (Natural Sciences)"},{"key":"e_1_3_7_59_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022429905385"},{"issue":"3","key":"e_1_3_7_60_2","first-page":"347","article-title":"A column generation method for inverse shortest path problems","volume":"41","author":"Zhang Jianzhong","year":"1995","unstructured":"Jianzhong Zhang, Zhongfan Ma, and Chao Yang. 1995. A column generation method for inverse shortest path problems. Zeitschrift f\u00fcr Operations Research 41, 3 (1995), 347\u2013358.","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"e_1_3_7_61_2","doi-asserted-by":"crossref","unstructured":"Daniel Z\u00fcgner Amir Akbarnejad and Stephan G\u00fcnnemann. 2018. Adversarial attacks on neural networks for graph data. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD\u201918) . ACM New York NY 2847\u20132856.","DOI":"10.1145\/3219819.3220078"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3622941","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3622941","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:57:28Z","timestamp":1750298248000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3622941"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,14]]},"references-count":60,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2,29]]}},"alternative-id":["10.1145\/3622941"],"URL":"https:\/\/doi.org\/10.1145\/3622941","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2023,11,14]]},"assertion":[{"value":"2023-01-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-08-17","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-11-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}