{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T20:42:44Z","timestamp":1771620164271,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T00:00:00Z","timestamp":1681862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T00:00:00Z","timestamp":1681862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100008736","name":"Fondo de Fomento al Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["1210362"],"award-info":[{"award-number":["1210362"]}],"id":[{"id":"10.13039\/501100008736","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Millennium Science Initiative","award":["NCN17_059"],"award-info":[{"award-number":["NCN17_059"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this work, we conduct the first systematic study of stochastic variational inequality (SVI) and stochastic saddle point (SSP) problems under the constraint of differential privacy (DP). We propose two algorithms: Noisy Stochastic Extragradient (NSEG) and Noisy Inexact Stochastic Proximal Point (NISPP). We show that a stochastic approximation variant of these algorithms attains risk bounds vanishing as a function of the dataset size, with respect to the strong gap function; and a sampling with replacement variant achieves optimal risk bounds with respect to a weak gap function. We also show lower bounds of the same order on weak gap function. Hence, our algorithms are optimal. Key to our analysis is the investigation of algorithmic stability bounds, both of which are new even in the nonprivate case. The dependence of the running time of the sampling with replacement algorithms, with respect to the dataset size <jats:italic>n<\/jats:italic>, is <jats:inline-formula><jats:alternatives><jats:tex-math>$$n^2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> for NSEG and <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\widetilde{O}}(n^{3\/2})$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mover>\n                      <mml:mi>O<\/mml:mi>\n                      <mml:mo>~<\/mml:mo>\n                    <\/mml:mover>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:msup>\n                        <mml:mi>n<\/mml:mi>\n                        <mml:mrow>\n                          <mml:mn>3<\/mml:mn>\n                          <mml:mo>\/<\/mml:mo>\n                          <mml:mn>2<\/mml:mn>\n                        <\/mml:mrow>\n                      <\/mml:msup>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> for NISPP.<\/jats:p>","DOI":"10.1007\/s10107-023-01953-5","type":"journal-article","created":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T18:02:34Z","timestamp":1681927354000},"page":"255-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems"],"prefix":"10.1007","volume":"204","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4219-4849","authenticated-orcid":false,"given":"Digvijay","family":"Boob","sequence":"first","affiliation":[]},{"given":"Crist\u00f3bal","family":"Guzm\u00e1n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,19]]},"reference":[{"key":"1953_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Chu, A., Goodfellow, I., McMahan, H.B., Mironov, I., Talwar, K., Zhang, L.: Deep learning with differential privacy. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, pp. 308\u2013318. ACM (2016)","DOI":"10.1145\/2976749.2978318"},{"key":"1953_CR2","unstructured":"Asi, H., Feldman, V., Koren, T., Talwar, K.: Private stochastic convex optimization: optimal rates in l1 geometry. In: M. Meila, T. Zhang (eds.) Proceedings of the 38th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol. 139, pp. 393\u2013403. PMLR (2021)"},{"key":"1953_CR3","doi-asserted-by":"crossref","unstructured":"Auslender, A., Teboulle, M.: Interior projection-like methods for monotone variational inequalities. Math. Program. 104(1), 39\u201368 (2005)","DOI":"10.1007\/s10107-004-0568-x"},{"key":"1953_CR4","unstructured":"Bassily, R., Feldman, V., Guzm\u00e1n, C., Talwar, K.: Stability of stochastic gradient descent on nonsmooth convex losses. In: H. Larochelle, M. Ranzato, R. Hadsell, M.F. Balcan, H. Lin (eds.) Advances in Neural Information Processing Systems, vol. 33, pp. 4381\u20134391. Curran Associates, Inc. (2020). https:\/\/proceedings.neurips.cc\/paper\/2020\/file\/2e2c4bf7ceaa4712a72dd5ee136dc9a8-Paper.pdf"},{"key":"1953_CR5","doi-asserted-by":"crossref","unstructured":"Bassily, R., Feldman, V., Talwar, K., Guha Thakurta, A.: Private stochastic convex optimization with optimal rates. In: Advances in Neural Information Processing Systems, vol. 32. Curran Associates, Inc. (2019)","DOI":"10.1145\/3357713.3384335"},{"key":"1953_CR6","unstructured":"Bassily, R., Guzman, C., Nandi, A.: Non-euclidean differentially private stochastic convex optimization. In: M. Belkin, S. Kpotufe (eds.) Proceedings of Thirty Fourth Conference on Learning Theory, Proceedings of Machine Learning Research, vol. 134, pp. 474\u2013499. PMLR (2021)"},{"key":"1953_CR7","doi-asserted-by":"crossref","unstructured":"Bassily, R., Smith, A., Thakurta, A.: Differentially private empirical risk minimization: efficient algorithms and tight error bounds (2014)","DOI":"10.1109\/FOCS.2014.56"},{"key":"1953_CR8","doi-asserted-by":"publisher","unstructured":"Bousquet, O., Elisseeff, A.: Stability and generalization. J. Mach. Learn. Res. 2, 499\u2013526 (2002). https:\/\/doi.org\/10.1162\/153244302760200704","DOI":"10.1162\/153244302760200704"},{"key":"1953_CR9","unstructured":"Bousquet, O., Klochkov, Y., Zhivotovskiy, N.: Sharper bounds for uniformly stable algorithms. In: J. Abernethy, S. Agarwal (eds.) Proceedings of Thirty Third Conference on Learning Theory, Proceedings of Machine Learning Research, vol. 125, pp. 610\u2013626. PMLR (2020)"},{"key":"1953_CR10","doi-asserted-by":"crossref","unstructured":"Bun, M., Steinke, T.: Concentrated differential privacy: Simplifications, extensions, and lower bounds. In: Theory of Cryptography Conference, pp. 635\u2013658. Springer (2016)","DOI":"10.1007\/978-3-662-53641-4_24"},{"key":"1953_CR11","unstructured":"Chaudhuri, K., Monteleoni, C.: Privacy-preserving logistic regression. In: NIPS (2008)"},{"issue":"Mar","key":"1953_CR12","first-page":"1069","volume":"12","author":"K Chaudhuri","year":"2011","unstructured":"Chaudhuri, K., Monteleoni, C., Sarwate, A.D.: Differentially private empirical risk minimization. J. Mach. Learn. Res. 12(Mar), 1069\u20131109 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1953_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/rssb.12454","volume":"84","author":"J Dong","year":"2022","unstructured":"Dong, J., Roth, A., Su, W.J., et al.: Gaussian differential privacy. J. R. Stat. Soc. B 84(1), 3\u201337 (2022)","journal-title":"J. R. Stat. Soc. B"},{"key":"1953_CR14","unstructured":"Duchi, J.C., Ruan, F.: The right complexity measure in locally private estimation: it is not the fisher information. arXiv preprint arXiv:1806.05756 (2018)"},{"key":"1953_CR15","doi-asserted-by":"publisher","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Proceedings of the 3rd Conference on Theory of Cryptography, TCC\u201906, pp. 265\u2013284. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/11681878_14","DOI":"10.1007\/11681878_14"},{"issue":"3\u20134","key":"1953_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1561\/0400000042","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci. 9(3\u20134), 211\u2013407 (2014). https:\/\/doi.org\/10.1561\/0400000042","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"1953_CR17","doi-asserted-by":"publisher","unstructured":"Dwork, C., Rothblum, G.N., Vadhan, S.P.: Boosting and differential privacy. In: 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23\u201326, 2010, Las Vegas, Nevada, USA, pp. 51\u201360. IEEE Computer Society (2010). https:\/\/doi.org\/10.1109\/FOCS.2010.12","DOI":"10.1109\/FOCS.2010.12"},{"key":"1953_CR18","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2007","unstructured":"Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer, Berlin (2007)"},{"key":"1953_CR19","doi-asserted-by":"publisher","unstructured":"Feldman, V., Koren, T., Talwar, K.: Private stochastic convex optimization: optimal rates in linear time. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, pp. 439\u2013449. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3357713.3384335","DOI":"10.1145\/3357713.3384335"},{"key":"1953_CR20","doi-asserted-by":"publisher","unstructured":"Feldman, V., Mironov, I., Talwar, K., Thakurta, A.: Privacy amplification by iteration. In: M. Thorup (ed.) 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7\u20139, 2018, pp. 521\u2013532. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/FOCS.2018.00056","DOI":"10.1109\/FOCS.2018.00056"},{"key":"1953_CR21","unstructured":"Feldman, V., Vondrak, J.: High probability generalization bounds for uniformly stable algorithms with nearly optimal rate. In: A. Beygelzimer, D. Hsu (eds.) Proceedings of the Thirty-Second Conference on Learning Theory, Proceedings of Machine Learning Research, vol. 99, pp. 1270\u20131279. PMLR, Phoenix, USA (2019)"},{"key":"1953_CR22","doi-asserted-by":"crossref","unstructured":"Gupta, A., Ligett, K., McSherry, F., Roth, A., Talwar, K.: Differentially private combinatorial optimization. In: M. Charikar (ed.) Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010, pp. 1106\u20131125. SIAM (2010)","DOI":"10.1137\/1.9781611973075.90"},{"key":"1953_CR23","unstructured":"Hardt, M., Recht, B., Singer, Y.: Train faster, generalize better: Stability of stochastic gradient descent. In: M.F. Balcan, K.Q. Weinberger (eds.) Proceedings of The 33rd International Conference on Machine Learning, Proceedings of Machine Learning Research, vol. 48, pp. 1225\u20131234. PMLR, New York (2016)"},{"key":"1953_CR24","unstructured":"Hsieh, Y., Iutzeler, F., Malick, J., Mertikopoulos, P.: On the convergence of single-call stochastic extra-gradient methods. In: H.M. Wallach, H. Larochelle, A. Beygelzimer, F. d\u2019Alch\u00e9-Buc, E.B. Fox, R. Garnett (eds.) Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, 8\u201314 December 2019, Vancouver, BC, Canada, pp. 6936\u20136946 (2019). http:\/\/papers.nips.cc\/paper\/8917-on-the-convergence-of-single-call-stochastic-extra-gradient-methods"},{"issue":"1","key":"1953_CR25","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1137\/17M1144799","volume":"29","author":"AN Iusem","year":"2019","unstructured":"Iusem, A.N., Jofr\u00e9, A., Oliveira, R.I., Thompson, P.: Variance-based extragradient methods with line search for stochastic variational inequalities. SIAM J. Optim. 29(1), 175\u2013206 (2019). https:\/\/doi.org\/10.1137\/17M1144799","journal-title":"SIAM J. Optim."},{"key":"1953_CR26","unstructured":"Jain, P., Kothari, P., Thakurta, A.: Differentially private online learning. In: 25th Annual Conference on Learning Theory (COLT), pp. 24.1\u201324.34 (2012)"},{"key":"1953_CR27","unstructured":"Jain, P., Thakurta, A.: (near) dimension independent risk bounds for differentially private learning. In: ICML (2014)"},{"key":"1953_CR28","doi-asserted-by":"publisher","unstructured":"Jalilzadeh, A., Shanbhag, U.V.: A proximal-point algorithm with variable sample-sizes (ppawss) for monotone stochastic variational inequality problems. In: 2019 Winter Simulation Conference (WSC), pp. 3551\u20133562 (2019). https:\/\/doi.org\/10.1109\/WSC40007.2019.9004836","DOI":"10.1109\/WSC40007.2019.9004836"},{"key":"1953_CR29","doi-asserted-by":"crossref","unstructured":"Juditsky, A., Nemirovski, A.: First order methods for nonsmooth convex large-scale optimization, i: General Purpose Methods. MIT Press (2012)","DOI":"10.7551\/mitpress\/8996.003.0007"},{"issue":"1","key":"1953_CR30","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1214\/10-SSY011","volume":"1","author":"A Juditsky","year":"2011","unstructured":"Juditsky, A., Nemirovski, A.S., Tauvel, C.: Solving variational inequalities with Stochastic Mirror-Prox algorithm. Stoch. Syst. 1(1), 17\u201358 (2011). https:\/\/doi.org\/10.1214\/10-SSY011","journal-title":"Stoch. Syst."},{"key":"1953_CR31","doi-asserted-by":"crossref","unstructured":"Kasiviswanathan, S.P., Lee, H.K., Nissim, K., Raskhodnikova, S., Smith, A.: What can we learn privately? In: 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 531\u2013540. IEEE (2008)","DOI":"10.1109\/FOCS.2008.27"},{"key":"1953_CR32","unstructured":"Kifer, D., Smith, A., Thakurta, A.: Private convex empirical risk minimization and high-dimensional regression. In: Conference on Learning Theory, pp. 25\u20131 (2012)"},{"key":"1953_CR33","first-page":"747","volume":"12","author":"G Korpelevich","year":"1976","unstructured":"Korpelevich, G.: The extragradient method for finding saddle points and other problems. Matecon 12, 747\u2013756 (1976)","journal-title":"Matecon"},{"key":"1953_CR34","unstructured":"Kotsalis, G., Lan, G., Li, T.: Simple and optimal methods for stochastic variational inequalities, i: operator extrapolation (2020)"},{"key":"1953_CR35","unstructured":"Lei, Y., Yang, Z., Yang, T., Ying, Y.: Stability and generalization of stochastic gradient methods for minimax problems. In: International Conference on Machine Learning, pp. 6175\u20136186. PMLR (2021)"},{"key":"1953_CR36","unstructured":"Li, T., Sanjabi, M., Beirami, A., Smith, V.: Fair resource allocation in federated learning. In: 8th International Conference on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, April 26\u201330, 2020. OpenReview.net (2020). https:\/\/openreview.net\/forum?id=ByexElSYDr"},{"key":"1953_CR37","doi-asserted-by":"crossref","unstructured":"Mironov, I.: R\u00e9nyi differential privacy. In: Proceedings of 30th IEEE Computer Security Foundations Symposium (CSF), pp. 263\u2013275 (2017). https:\/\/arxiv.org\/abs\/1702.07476","DOI":"10.1109\/CSF.2017.11"},{"issue":"1","key":"1953_CR38","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A.: Prox-method with rate of convergence o(1\/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15(1), 229\u2013251 (2004). https:\/\/doi.org\/10.1137\/S1052623403425629","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1953_CR39","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"1953_CR40","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A Nemirovsky","year":"1983","unstructured":"Nemirovsky, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983)"},{"issue":"2","key":"1953_CR41","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10107-006-0034-z","volume":"109","author":"Y Nesterov","year":"2007","unstructured":"Nesterov, Y.: Dual extrapolation and its applications to solving variational inequalities and related problems. Math. Program. 109(2), 319\u2013344 (2007)","journal-title":"Math. Program."},{"key":"1953_CR42","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"Jv Neumann","year":"1928","unstructured":"Neumann, Jv.: Zur theorie der gesellschaftsspiele. Math. Ann. 100, 295\u2013320 (1928)","journal-title":"Math. Ann."},{"issue":"5","key":"1953_CR43","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control. Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control. Optim."},{"key":"1953_CR44","first-page":"2635","volume":"11","author":"S Shalev-Shwartz","year":"2010","unstructured":"Shalev-Shwartz, S., Shamir, O., Srebro, N., Sridharan, K.: Learnability, stability and uniform convergence. J. Mach. Learn. Res. 11, 2635\u20132670 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1953_CR45","doi-asserted-by":"publisher","first-page":"171","DOI":"10.2140\/pjm.1958.8.171","volume":"8","author":"M Sion","year":"1958","unstructured":"Sion, M.: On general minimax theorems. Pac. J. Math. 8(1), 171\u2013176 (1958)","journal-title":"Pac. J. Math."},{"key":"1953_CR46","doi-asserted-by":"crossref","unstructured":"Steinke, T., Ullman, J.R.: Between pure and approximate differential privacy. J. Priv. Confident. 7(2) (2016)","DOI":"10.29012\/jpc.v7i2.648"},{"key":"1953_CR47","doi-asserted-by":"crossref","unstructured":"Ullman, J.: Private multiplicative weights beyond linear queries. In: Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 303\u2013312. ACM (2015)","DOI":"10.1145\/2745754.2745755"},{"key":"1953_CR48","doi-asserted-by":"publisher","unstructured":"Vershynin, R.: High-Dimensional Probability: An Introduction with Applications in Data Science. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press (2018). https:\/\/doi.org\/10.1017\/9781108231596","DOI":"10.1017\/9781108231596"},{"key":"1953_CR49","unstructured":"Williamson, R., Menon, A.: Fairness risk measures. In: K. Chaudhuri, R. Salakhutdinov (eds.) Proceedings of the 36th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol. 97, pp. 6786\u20136797. PMLR (2019)"},{"key":"1953_CR50","unstructured":"Zhang, J., Hong, M., Wang, M., Zhang, S.: Generalization bounds for stochastic saddle point problems. In: Proceedings of The 24th International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, vol. 130, pp. 568\u2013576. PMLR (2021)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01953-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-01953-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01953-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T21:32:31Z","timestamp":1708032751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-01953-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,19]]},"references-count":50,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1953"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-01953-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,19]]},"assertion":[{"value":"2 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}