{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T06:43:42Z","timestamp":1776840222919,"version":"3.51.2"},"reference-count":54,"publisher":"American Mathematical Society (AMS)","issue":"355","license":[{"start":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T00:00:00Z","timestamp":1762560000000},"content-version":"am","delay-in-days":365,"URL":"https:\/\/www.ams.org\/publications\/copyright-and-permissions"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"

\n Given a dissimilarity matrix, the metric nearness problem is to find the nearest matrix of distances that satisfy the triangle inequalities. This problem has wide applications, such as sensor networks, image processing, and so on. But it is of great challenge even to obtain a moderately accurate solution due to the\n \n \n \n \n O<\/mml:mi>\n (<\/mml:mo>\n \n n<\/mml:mi>\n \n 3<\/mml:mn>\n <\/mml:mrow>\n <\/mml:msup>\n )<\/mml:mo>\n <\/mml:mrow>\n O(n^{3})<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n metric constraints and the nonsmooth objective function which is usually a weighted\n \n \n \n \n \n \u2113\n \n <\/mml:mi>\n \n p<\/mml:mi>\n <\/mml:mrow>\n <\/mml:msub>\n \\ell _{p}<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n norm based distance. In this paper, we propose a delayed constraint generation method with each subproblem solved by the semismooth Newton based proximal augmented Lagrangian method (PALM) for the metric nearness problem. Due to the high memory requirement for the storage of the matrix related to the metric constraints, we take advantage of the special structure of the matrix and do not need to store the corresponding constraint matrix. A pleasing aspect of our algorithm is that we can solve these problems involving up to\n \n \n \n \n 10<\/mml:mn>\n \n 8<\/mml:mn>\n <\/mml:mrow>\n <\/mml:msup>\n 10^{8}<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n variables and\n \n \n \n \n 10<\/mml:mn>\n \n 13<\/mml:mn>\n <\/mml:mrow>\n <\/mml:msup>\n 10^{13}<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n constraints. Numerical experiments demonstrate the efficiency of our algorithm.\n <\/p>\n

\n Concerning the theory, firstly, under a mild condition, we establish a calmness condition which is very essential for the analysis of local convergence rate of PALM. Secondly, we prove the equivalence between the dual nondegeneracy condition and nonsingularity of the generalized Jacobian for the inner subproblem of PALM. Thirdly, for the\n \n \n \n \n \n \u2113\n \n <\/mml:mi>\n \n 1<\/mml:mn>\n <\/mml:mrow>\n <\/mml:msub>\n \\ell _{1}<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n or\n \n \n \n \n \n \u2113\n \n <\/mml:mi>\n \n \n \u221e\n \n <\/mml:mi>\n <\/mml:mrow>\n <\/mml:msub>\n \\ell _{\\infty }<\/mml:annotation>\n <\/mml:semantics>\n <\/mml:math>\n <\/inline-formula>\n norm based problem, without the strict complementarity condition, we also prove the equivalence between the dual nondegeneracy condition and the uniqueness of the primal solution.\n <\/p>","DOI":"10.1090\/mcom\/4026","type":"journal-article","created":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T12:55:49Z","timestamp":1728046549000},"page":"2495-2532","source":"Crossref","is-referenced-by-count":0,"title":["An efficient algorithm for the \u2113_{\ud835\udc5d} norm based metric nearness problem"],"prefix":"10.1090","volume":"94","author":[{"given":"Peipei","family":"Tang","sequence":"first","affiliation":[]},{"given":"Bo","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Chengjing","family":"Wang","sequence":"additional","affiliation":[]}],"member":"14","published-online":{"date-parts":[[2024,11,8]]},"reference":[{"issue":"1-3","key":"1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","article-title":"Correlation clustering","volume":"56","author":"Bansal, Nikhil","year":"2004","journal-title":"Mach. Learn.","ISSN":"https:\/\/id.crossref.org\/issn\/0885-6125","issn-type":"print"},{"key":"2","doi-asserted-by":"crossref","unstructured":"D. Batra, R. Sukthankar, and T. Chen, Semi-supervised clustering via learnt codeword distances, Proceedings of the British Machine Vision Conference 2008, Leeds, September 2008.","DOI":"10.5244\/C.22.90"},{"issue":"2","key":"3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF01027691","article-title":"On the convergence of von Neumann\u2019s alternating projection algorithm for two sets","volume":"1","author":"Bauschke, H. H.","year":"1993","journal-title":"Set-Valued Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0927-6947","issn-type":"print"},{"issue":"4","key":"4","doi-asserted-by":"publisher","first-page":"2863","DOI":"10.1137\/20M1358669","article-title":"Infeasibility and error bound imply finite convergence of alternating projections","volume":"31","author":"Behling, Roger","year":"2021","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"1-2","key":"5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10107-011-0486-7","article-title":"The effect of calmness on the solution set of systems of nonlinear equations","volume":"137","author":"Behling, Roger","year":"2013","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"key":"6","unstructured":"D. Bertsimas and J. N. Tsitsiklis, Introduction to Linear Optimization, vol. 6, Athena Scientific, Belmont, MA, 1997."},{"key":"7","series-title":"Springer Series in Operations Research","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation analysis of optimization problems","author":"Bonnans, J. Fr\u00e9d\u00e9ric","year":"2000","ISBN":"https:\/\/id.crossref.org\/isbn\/0387987053"},{"issue":"1","key":"8","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/060653391","article-title":"The metric nearness problem","volume":"30","author":"Brickell, Justin","year":"2008","journal-title":"SIAM J. Matrix Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0895-4798","issn-type":"print"},{"key":"9","series-title":"Classics in Applied Mathematics","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and nonsmooth analysis","volume":"5","author":"Clarke, F. H.","year":"1990","ISBN":"https:\/\/id.crossref.org\/isbn\/0898712564","edition":"2"},{"issue":"1-2","key":"10","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10107-015-0946-6","article-title":"Fast projection onto the simplex and the \ud835\udc59\u2081 ball","volume":"158","author":"Condat, Laurent","year":"2016","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"1","key":"11","doi-asserted-by":"publisher","first-page":"Art. 1, 25","DOI":"10.1145\/2049662.2049663","article-title":"The University of Florida sparse matrix collection","volume":"38","author":"Davis, Timothy A.","year":"2011","journal-title":"ACM Trans. Math. Software","ISSN":"https:\/\/id.crossref.org\/issn\/0098-3500","issn-type":"print"},{"key":"12","unstructured":"I. S. Dhillon, S. Sra, and J. A. Tropp, Triangle fixing algorithms for the metric nearness problem, 17th International Conference on Neural Information Processing Systems (NIPS\u201904), MIT Press, Cambridge, MA, USA, 2004, pp. 361\u2013368, 2004."},{"key":"13","doi-asserted-by":"crossref","unstructured":"A. L. Dontchev and R. T. Rockafellar, Implicit Functions and Solution Mappings: A View from Variational Analysis, Springer, New York, 2009.","DOI":"10.1007\/978-0-387-87821-8"},{"issue":"6","key":"14","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1007\/s10208-015-9279-3","article-title":"Transversality and alternating projections for nonconvex sets","volume":"15","author":"Drusvyatskiy, D.","year":"2015","journal-title":"Found. Comput. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/1615-3375","issn-type":"print"},{"issue":"384","key":"15","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1080\/01621459.1983.10477029","article-title":"An algorithm for restricted least squares regression","volume":"78","author":"Dykstra, Richard L.","year":"1983","journal-title":"J. Amer. Statist. Assoc.","ISSN":"https:\/\/id.crossref.org\/issn\/0162-1459","issn-type":"print"},{"issue":"3","key":"16","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","article-title":"On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators","volume":"55","author":"Eckstein, Jonathan","year":"1992","journal-title":"Math. Programming","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"key":"17","series-title":"Fundamentals of Algorithms","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971941","volume-title":"Alternating projection methods","volume":"8","author":"Escalante, Ren\u00e9","year":"2011","ISBN":"https:\/\/id.crossref.org\/isbn\/9781611971934"},{"key":"18","series-title":"Springer Series in Operations Research","isbn-type":"print","volume-title":"Finite-dimensional variational inequalities and complementarity problems. Vol. II","author":"Facchinei, Francisco","year":"2003","ISBN":"https:\/\/id.crossref.org\/isbn\/038795581X"},{"key":"19","doi-asserted-by":"crossref","unstructured":"D. Gabay and B. Mercier, A dual algorithm for the solution of nonlinear variational problems via finite element approximation, Comput. Math. Appl. 2 (1976), 17\u201340.","DOI":"10.1016\/0898-1221(76)90003-1"},{"key":"20","doi-asserted-by":"crossref","unstructured":"M. Gabidolla, A. Iskakov, M. F. Demirci, and A. Yazici, On approximating metric nearness through deep learning, Artificial Intelligence and Soft Computing, ICAISC 2019, Lecture Notes in Computer Science, vol. 11508, Springer, Cham, 2019, pp. 62\u201372.","DOI":"10.1007\/978-3-030-20912-4_6"},{"key":"21","doi-asserted-by":"crossref","unstructured":"C. Gentile, Distributed sensor location through linear programming with triangle inequality constraints, IEEE Trans. Wirel. Commun. 6 (2007), no. 7, 2572\u20132581.","DOI":"10.1109\/TWC.2007.05907"},{"key":"22","isbn-type":"print","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-94-017-9054-3_4","article-title":"On alternating direction methods of multipliers: a historical perspective","author":"Glowinski, Roland","year":"2014","ISBN":"https:\/\/id.crossref.org\/isbn\/9789401790536"},{"key":"23","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1051\/m2an\/197509R200411","article-title":"Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9, d\u2019une classe de probl\u00e8mes de Dirichlet non lin\u00e9aires","volume":"9","author":"Glowinski, R.","year":"1975","journal-title":"Rev. Fran\\c{c}aise Automat. Informat. Recherche Op\\'{e}rationnelle S\\'{e}r. Rouge Anal. Num\\'{e}r.","ISSN":"https:\/\/id.crossref.org\/issn\/0397-9342","issn-type":"print"},{"issue":"3","key":"24","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1023\/A:1022653001160","article-title":"Newton and quasi-Newton methods for normal maps with polyhedral sets","volume":"94","author":"Han, J.","year":"1997","journal-title":"J. Optim. Theory Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0022-3239","issn-type":"print"},{"key":"25","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00927673","article-title":"Multiplier and gradient methods","volume":"4","author":"Hestenes, Magnus R.","year":"1969","journal-title":"J. Optim. Theory Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0022-3239","issn-type":"print"},{"key":"26","isbn-type":"print","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imamat\/22.1.1","article-title":"Matrix nearness problems and applications","author":"Higham, N. J.","year":"1989","ISBN":"https:\/\/id.crossref.org\/isbn\/0198536259"},{"key":"27","doi-asserted-by":"crossref","unstructured":"J.-B. Hiriart-Urruty, J.-J. Strodiot, and V.H. Nguyen, Generalized Hessian matrix and second-order optimality conditions for problems with \ud835\udc36^{1,1} data, Applied Mathematics and Optimization 11 (1984), 43\u201356.","DOI":"10.1007\/BF01442169"},{"issue":"1-2","key":"28","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s10107-012-0586-z","article-title":"A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems","volume":"142","author":"Izmailov, Alexey F.","year":"2013","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"1","key":"29","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s11228-017-0446-3","article-title":"About intrinsic transversality of pairs of sets","volume":"26","author":"Kruger, Alexander Y.","year":"2018","journal-title":"Set-Valued Var. Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/1877-0533","issn-type":"print"},{"issue":"1-2","key":"30","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10107-016-1039-x","article-title":"Set regularities and feasibility problems","volume":"168","author":"Kruger, Alexander Y.","year":"2018","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"3","key":"31","first-page":"823","article-title":"Regularity of collections of sets and convergence of inexact alternating projections","volume":"23","author":"Kruger, Alexander Y.","year":"2016","journal-title":"J. Convex Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0944-6532","issn-type":"print"},{"key":"32","doi-asserted-by":"crossref","unstructured":"J. B. Kruskal and M. Wish, Multidimensional Scaling, no. 07-011, Quantitative Applications in the Social Sciences, Sage Publications, 1978.","DOI":"10.4135\/9781412985130"},{"key":"33","unstructured":"J. Leskovec and A. Krevl, SNAP datasets: Stanford large network dataset collection, 2014, \\url{http:\/\/snap.stanford.edu\/data}."},{"issue":"3","key":"34","doi-asserted-by":"publisher","first-page":"2410","DOI":"10.1137\/19M1251795","article-title":"An asymptotically superlinearly convergent semismooth Newton augmented Lagrangian method for linear programming","volume":"30","author":"Li, Xudong","year":"2020","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"1-2","key":"35","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10107-018-1342-9","article-title":"On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope","volume":"179","author":"Li, Xudong","year":"2020","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"2","key":"36","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s12532-021-00210-0","article-title":"An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems","volume":"14","author":"Lin, Meixia","year":"2022","journal-title":"Math. Program. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/1867-2949","issn-type":"print"},{"issue":"22","key":"37","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/bfb0121017","article-title":"Normal solutions of linear programs","author":"Mangasarian, O. L.","year":"1984","journal-title":"Math. Programming Stud.","ISSN":"https:\/\/id.crossref.org\/issn\/0303-3929","issn-type":"print"},{"issue":"2-3","key":"38","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s10107-005-0629-9","article-title":"Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization","volume":"104","author":"Meng, Fanwen","year":"2005","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"key":"39","unstructured":"R. H. Pearce, Towards a general formulation of lazy constraints, Ph.D. Thesis, The University of Queensland, 2019."},{"key":"40","first-page":"283","article-title":"A method for nonlinear constraints in minimization problems","author":"Powell, M. J. D.","year":"1969"},{"key":"41","doi-asserted-by":"crossref","unstructured":"S. M. Robinson, Some continuity properties of polyhedral multifunctions, Mathematical Programming at Oberwolfach, Springer Berlin Heidelberg, Berlin, Heidelberg, 1981, pp. 206\u2013214.","DOI":"10.1007\/BFb0120929"},{"key":"42","series-title":"Princeton Mathematical Series, No. 28","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"Rockafellar, R. Tyrrell","year":"1970"},{"issue":"2","key":"43","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.1.2.97","article-title":"Augmented Lagrangians and applications of the proximal point algorithm in convex programming","volume":"1","author":"Rockafellar, R. T.","year":"1976","journal-title":"Math. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0364-765X","issn-type":"print"},{"issue":"5","key":"44","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","article-title":"Monotone operators and the proximal point algorithm","volume":"14","author":"Rockafellar, R. Tyrrell","year":"1976","journal-title":"SIAM J. Control Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/0363-0129","issn-type":"print"},{"key":"45","series-title":"Grundlehren der mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational analysis","volume":"317","author":"Rockafellar, R. Tyrrell","year":"1998","ISBN":"https:\/\/id.crossref.org\/isbn\/3540627723"},{"key":"46","unstructured":"V. Roth, J. Laub, J. M. Buhmann, and K.-R. M\u00fcller, Going metric: denoising pairwise data, Proceedings of the 15th International Conference on Neural Information Processing Systems (Cambridge, MA, USA), NIPS\u201902, MIT Press, 2002, pp. 841\u2013848."},{"key":"47","doi-asserted-by":"crossref","unstructured":"V. Roth, J. Laub, M. Kawanabe, and J. M. Buhmann, Optimal cluster preserving embedding of non-metric proximity data, IEEE Trans. Pattern Anal. Mach. Intell. 25 (2002), 1540\u20131551.","DOI":"10.1109\/TPAMI.2003.1251147"},{"key":"48","doi-asserted-by":"crossref","unstructured":"C. Ruggles, N. Veldt, and D. F. Gleich, A parallel projection method for metric constrained optimization, 2020 Proceedings of the SIAM Workshop on Combinatorial Scientific Computing (CSC), 2020, pp. 43\u201353.","DOI":"10.1137\/1.9781611976229.5"},{"issue":"4","key":"49","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/A:1008777829180","article-title":"A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator","volume":"7","author":"Solodov, M. V.","year":"1999","journal-title":"Set-Valued Anal.","ISSN":"https:\/\/id.crossref.org\/issn\/0927-6947","issn-type":"print"},{"issue":"2","key":"50","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1287\/moor.25.2.214.12222","article-title":"An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions","volume":"25","author":"Solodov, M. V.","year":"2000","journal-title":"Math. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0364-765X","issn-type":"print"},{"key":"51","first-page":"Paper No. [326], 54","article-title":"Project and forget: solving large-scale metric constrained problems","volume":"23","author":"Sonthalia, Rishi","year":"2022","journal-title":"J. Mach. Learn. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/1532-4435","issn-type":"print"},{"issue":"2","key":"52","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/18M1217152","article-title":"Metric-constrained optimization for graph clustering algorithms","volume":"1","author":"Veldt, Nate","year":"2019","journal-title":"SIAM J. Math. Data Sci."},{"key":"53","doi-asserted-by":"crossref","unstructured":"S. N. Vitaladevuni and R. Basri, Co-clustering of image segments using convex optimization applied to em neuronal reconstruction, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2010, pp. 2203\u20132210.","DOI":"10.1109\/CVPR.2010.5539901"},{"key":"54","unstructured":"E. P. Xing, A.Y. Ng, M.I. Jordan, and S. Russell, Distance metric learning, with application to clustering with side-information, Proceedings of the 15th International Conference on Neural Information Processing Systems, 2002, pp. 521\u2013528."}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.ams.org\/mcom\/2025-94-355\/S0025-5718-2024-04026-7\/S0025-5718-2024-04026-7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T05:46:50Z","timestamp":1776836810000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2025-94-355\/S0025-5718-2024-04026-7\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,8]]},"references-count":54,"journal-issue":{"issue":"355","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["S0025-5718-2024-04026-7"],"URL":"https:\/\/doi.org\/10.1090\/mcom\/4026","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2024,11,8]]}}}