{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T05:13:37Z","timestamp":1741324417863,"version":"3.38.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T00:00:00Z","timestamp":1729296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T00:00:00Z","timestamp":1729296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2025,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Suppose <jats:italic>N<\/jats:italic> independent Bernoulli trials with success probabilities <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$p_1, p_2,\\ldots $$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>p<\/mml:mi>\n                      <mml:mn>1<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>p<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mo>\u2026<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> are observed sequentially at times of a mixed binomial process. The task is to maximise, by using a nonanticipating stopping strategy, the probability of stopping at the last success. The case <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$p_k=1\/k$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>p<\/mml:mi>\n                      <mml:mi>k<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                    <mml:mo>\/<\/mml:mo>\n                    <mml:mi>k<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> has been studied by many authors as a version of the familiar best choice problem, where both <jats:italic>N<\/jats:italic> and the observation times are random. We consider a more general profile <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$p_k=\\theta \/(\\theta +k-1)$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>p<\/mml:mi>\n                      <mml:mi>k<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mi>\u03b8<\/mml:mi>\n                    <mml:mo>\/<\/mml:mo>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:mi>\u03b8<\/mml:mi>\n                      <mml:mo>+<\/mml:mo>\n                      <mml:mi>k<\/mml:mi>\n                      <mml:mo>-<\/mml:mo>\n                      <mml:mn>1<\/mml:mn>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> and assume that the prior distribution of <jats:italic>N<\/jats:italic> is negative binomial with shape parameter <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\nu $$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03bd<\/mml:mi>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>, so the arrivals occur at times of a mixed Poisson process. The setting with two parameters offers a high flexibility in understanding the nature of the optimal strategy, which we show is intrinsically related to monotonicity properties of the Gaussian hypergeometric function. Using this connection, we find that the myopic stopping strategy is optimal if and only if <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\nu \\ge \\theta $$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>\u03bd<\/mml:mi>\n                    <mml:mo>\u2265<\/mml:mo>\n                    <mml:mi>\u03b8<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>. Furthermore, we derive formulas to assess the winning probability and discuss limit forms of the problem for large <jats:italic>N<\/jats:italic>.<\/jats:p>","DOI":"10.1007\/s00186-024-00880-1","type":"journal-article","created":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T20:30:43Z","timestamp":1729369843000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The last-success stopping problem with random observation times"],"prefix":"10.1007","volume":"101","author":[{"given":"Alexander","family":"Gnedin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3779-6981","authenticated-orcid":false,"given":"Zakaria","family":"Derbazi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,19]]},"reference":[{"key":"880_CR1","series-title":"EMS Monographs in Mathematics","doi-asserted-by":"publisher","DOI":"10.4171\/000","volume-title":"Logarithmic combinatorial structures: a probabilistic approach","author":"R Arratia","year":"2003","unstructured":"Arratia R, Barbour AD, Tavar\u00e9 S (2003) Logarithmic combinatorial structures: a probabilistic approach. EMS Monographs in Mathematics. European Mathematical Society, Berlin"},{"key":"880_CR2","unstructured":"Baskakov VA (1957) An instance of a sequence of linear positive operators in the space of continuous functions. In: Doklady Akademii Nauk, vol 113. Russian Academy of Sciences, Moscow, pp 249\u2013251"},{"key":"880_CR3","volume-title":"Higher transcendental functions","author":"H Bateman","year":"1953","unstructured":"Bateman H, Erd\u00e9lyi A (1953) Higher transcendental functions, vol 1. McGraw-Hill, New York"},{"key":"880_CR4","volume-title":"Best choice problems","author":"BA Berezovsky","year":"1984","unstructured":"Berezovsky BA, Gnedin AV (1984) Best choice problems. Academia Nauk USSR, Moscow"},{"issue":"2","key":"880_CR5","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1112\/S0025579300015217","volume":"35","author":"NH Bingham","year":"1988","unstructured":"Bingham NH (1988) Tauberian theorems for Jakimovski and Karamata-Stirling methods. Mathematika 35(2):216\u2013224","journal-title":"Mathematika"},{"key":"880_CR6","unstructured":"Browne S (1994) Records, mixed Poisson processes and optimal selection: an intensity approach. Technical report, Columbia University (Preprint)"},{"issue":"1","key":"880_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-4149(94)00022-L","volume":"55","author":"S Browne","year":"1995","unstructured":"Browne S, Bunge J (1995) Random record processes and state dependent thinning. Stoch Process Their Appl 55(1):131\u2013142","journal-title":"Stoch Process Their Appl"},{"key":"880_CR8","doi-asserted-by":"crossref","unstructured":"Bruss FT (1984) A unified approach to a class of best choice problems with an unknown number of options. Ann Probab 882\u2013889","DOI":"10.1214\/aop\/1176993237"},{"issue":"4","key":"880_CR9","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/3214216","volume":"24","author":"FT Bruss","year":"1987","unstructured":"Bruss FT (1987) On an optimal selection problem of Cowan and Zabczyk. J Appl Probab 24(4):918\u2013928","journal-title":"J Appl Probab"},{"issue":"2","key":"880_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0304-4149(88)90091-9","volume":"30","author":"FT Bruss","year":"1988","unstructured":"Bruss FT (1988) Invariant record processes and applications to best choice modelling. Stoch Process Their Appl 30(2):303\u2013316","journal-title":"Stoch Process Their Appl"},{"key":"880_CR11","doi-asserted-by":"crossref","unstructured":"Bruss FT (2000) Sum the odds to one and stop. Ann Probab 1384\u20131391","DOI":"10.1214\/aop\/1019160340"},{"key":"880_CR12","doi-asserted-by":"crossref","unstructured":"Bruss FT, Samuels SM (1987) A unified approach to a class of optimal selection problems with an unknown number of options. Ann Probab 824\u2013830","DOI":"10.1214\/aop\/1176992175"},{"key":"880_CR13","doi-asserted-by":"crossref","unstructured":"Bruss FT, Samuels SM (1990) Conditions for quasi-stationarity of the Bayes rule in selection problems with an unknown number of rankable options. Ann Probab 877\u2013886","DOI":"10.1214\/aop\/1176990864"},{"issue":"2","key":"880_CR14","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-4149(91)90094-S","volume":"38","author":"FT Bruss","year":"1991","unstructured":"Bruss FT, Rogers LCG (1991) Embedding optimal selection problems in a Poisson process. Stoch Process Their Appl 38(2):267\u2013278","journal-title":"Stoch Process Their Appl"},{"issue":"9","key":"880_CR15","doi-asserted-by":"publisher","first-page":"3239","DOI":"10.1016\/j.spa.2012.05.010","volume":"122","author":"FT Bruss","year":"2012","unstructured":"Bruss FT, Yor M (2012) Stochastic processes with proportional increments and the last-arrival problem. Stoch Process Their Appl 122(9):3239\u20133261","journal-title":"Stoch Process Their Appl"},{"key":"880_CR16","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1016\/j.spa.2021.04.011","volume":"150","author":"FT Bruss","year":"2022","unstructured":"Bruss FT, Rogers LCG (2022) The 1\/e-strategy is sub-optimal for the problem of best choice under no information. Stoch Process Their Appl 150:1059\u20131067","journal-title":"Stoch Process Their Appl"},{"key":"880_CR17","volume-title":"The theory of optimal stopping","author":"YS Chow","year":"1991","unstructured":"Chow YS, Robbins H, Siegmund D (1991) The theory of optimal stopping. Dover, New York"},{"key":"880_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.4064\/-5-1-47-51","volume":"5","author":"Z Ciesielski","year":"1979","unstructured":"Ciesielski Z, Zabczyk J (1979) A note on a selection problem. Banach Center Publ 5:47\u201351","journal-title":"Banach Center Publ"},{"issue":"3","key":"880_CR19","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1137\/1123066","volume":"23","author":"R Cowan","year":"1979","unstructured":"Cowan R, Zabczyk J (1979) An optimal selection problem associated with the Poisson process. Theory Probab Appl 23(3):584\u2013592","journal-title":"Theory Probab Appl"},{"issue":"1","key":"880_CR20","first-page":"1","volume":"31","author":"H Crane","year":"2016","unstructured":"Crane H (2016) The ubiquitous Ewens sampling formula. Stat Sci 31(1):1\u201319","journal-title":"Stat Sci"},{"key":"880_CR21","doi-asserted-by":"crossref","unstructured":"Curtiss DR (1918) Recent extensions of Descartes\u2019 rule of signs. Ann Math 251\u2013278","DOI":"10.2307\/1967494"},{"key":"880_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-5591-3","volume-title":"Markov processes: theorems and problems","author":"EB Dynkin","year":"1969","unstructured":"Dynkin EB, Yushkevich AA (1969) Markov processes: theorems and problems. Plenum Press, New York"},{"key":"880_CR23","unstructured":"Ferguson TS (2008) Optimal stopping and applications. UCLA. https:\/\/www.math.ucla.edu\/~tom\/Stopping\/Contents.html"},{"key":"880_CR24","series-title":"Wiley Series in Probability and Mathematical Statistics","volume-title":"An introduction to probability theory and its applications","author":"W Feller","year":"1968","unstructured":"Feller W (1968) An introduction to probability theory and its applications, vol 1. Wiley Series in Probability and Mathematical Statistics. Wiley, New York"},{"issue":"4","key":"880_CR25","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1080\/10652469408819056","volume":"2","author":"J Fr\u00f6hlich","year":"1994","unstructured":"Fr\u00f6hlich J (1994) Parameter derivatives of the Jacobi polynomials and the Gaussian hypergeometric function. Integral Transf Spec Funct 2(4):253\u2013266","journal-title":"Integral Transf Spec Funct"},{"issue":"3","key":"880_CR26","doi-asserted-by":"publisher","first-page":"538","DOI":"10.2307\/3212473","volume":"13","author":"DP Gaver","year":"1976","unstructured":"Gaver DP (1976) Random record models. J Appl Probab 13(3):538\u2013547","journal-title":"J Appl Probab"},{"issue":"3","key":"880_CR27","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1214\/aop\/1176996090","volume":"4","author":"J Gianini","year":"1976","unstructured":"Gianini J, Samuels SM (1976) The infinite secretary problem. Ann Probab 4(3):418\u2013432","journal-title":"Ann Probab"},{"issue":"313","key":"880_CR28","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/01621459.1966.10502008","volume":"61","author":"JP Gilbert","year":"1966","unstructured":"Gilbert JP, Mosteller F (1966) Recognising the maximum of a sequence. J Am Stat Assoc 61(313):35\u201373","journal-title":"J Am Stat Assoc"},{"key":"880_CR29","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.spa.2021.12.008","volume":"145","author":"A Gnedin","year":"2022","unstructured":"Gnedin A (2022) The best choice problem with random arrivals: how to beat the 1\/e-strategy. Stoch Proces Their Appl 145:226\u2013240","journal-title":"Stoch Proces Their Appl"},{"issue":"1","key":"880_CR30","doi-asserted-by":"publisher","first-page":"158","DOI":"10.3390\/math10010158","volume":"10","author":"A Gnedin","year":"2022","unstructured":"Gnedin A, Derbazi Z (2022) Trapping the ultimate success. Mathematics 10(1):158","journal-title":"Mathematics"},{"issue":"4","key":"880_CR31","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1051\/ro\/1992260403911","volume":"26","author":"Z Govindarajulu","year":"1992","unstructured":"Govindarajulu Z (1992) The secretary problem: optimal selection with batch-interviewing and cost. RAIRO Oper Res 26(4):391\u2013407","journal-title":"RAIRO Oper Res"},{"key":"880_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-3117-7","volume-title":"Mixed Poisson processes. Monographs on statistics and applied probability","author":"J Grandell","year":"1997","unstructured":"Grandell J (1997) Mixed Poisson processes. Monographs on statistics and applied probability, vol 77. Chapman & Hall, New York"},{"key":"880_CR33","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1090\/tpms\/1139","volume":"103","author":"J Grau Ribas","year":"2020","unstructured":"Grau Ribas J (2020) A note on last-success-problem. Theory Probab Math Stat 103:155\u2013165","journal-title":"Theory Probab Math Stat"},{"key":"880_CR34","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1090\/conm\/125\/1160621","volume":"125","author":"TP Hill","year":"1992","unstructured":"Hill TP, Krengel U (1992) A prophet inequality related to the secretary problem. Contemp Math 125:209\u2013215","journal-title":"Contemp Math"},{"key":"880_CR35","unstructured":"Hofmann G (1997) A family of general record models. PhD thesis, The Ohio State University"},{"key":"880_CR36","unstructured":"Hsiau S-R, Yang J-R (2000) A natural variation of the standard secretary problem. Statis Sin 639\u2013646"},{"key":"880_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41598-7","volume-title":"Random measures, theory and applications. Probability theory and stochastic modelling","author":"O Kallenberg","year":"2017","unstructured":"Kallenberg O (2017) Random measures, theory and applications. Probability theory and stochastic modelling, vol 77. Springer, Switzerland"},{"issue":"2","key":"880_CR38","first-page":"217","volume":"57","author":"A Kurushima","year":"2003","unstructured":"Kurushima A, Ano K (2003) A Poisson arrival selection problem for Gamma prior intensity with natural number parameter. Sci Math Jpn 57(2):217\u2013231","journal-title":"Sci Math Jpn"},{"key":"880_CR39","doi-asserted-by":"crossref","unstructured":"Nevzorov V (2000) Records: mathematical theory (lecture 25). Translation of Mathematical Monographs. American Mathematical Society, New York","DOI":"10.1090\/mmono\/194"},{"key":"880_CR40","first-page":"47","volume":"20","author":"E Orsingher","year":"1980","unstructured":"Orsingher E (1980) Extreme values of a sequence of random variables associated with linear birth and P\u00f3lya process. Biometrie-Praximetrie 20:47\u201358","journal-title":"Biometrie-Praximetrie"},{"issue":"3\u20134","key":"880_CR41","first-page":"69","volume":"24","author":"E Orsingher","year":"1979","unstructured":"Orsingher E, Battaglia F (1979) Record values in Poisson and randomised Poisson models. Ann de l\u2019ISUP 24(3\u20134):69\u201378","journal-title":"Ann de l\u2019ISUP"},{"issue":"4","key":"880_CR42","doi-asserted-by":"publisher","first-page":"722","DOI":"10.2307\/3214377","volume":"26","author":"D Pfeifer","year":"1989","unstructured":"Pfeifer D (1989) Extremal processes, secretary problems and the $$1\/e$$ law. J Appl Probab 26(4):722\u2013733","journal-title":"J Appl Probab"},{"key":"880_CR43","volume-title":"Encyclopedia of statistical sciences","author":"D Pfeifer","year":"2006","unstructured":"Pfeifer D (2006) P\u00f3lya-Lundberg process. In: Kotz S, Read CB, Balakrishnan N, Vidakovic B, Johnson NL (eds) Encyclopedia of statistical sciences, vol 1. Wiley, New York"},{"key":"880_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2022.102386","volume":"140","author":"GR Pinsky","year":"2022","unstructured":"Pinsky GR (2022) The secretary problem with biased arrival order via a mallows distribution. Adv Appl Math 140:102386","journal-title":"Adv Appl Math"},{"issue":"2","key":"880_CR45","doi-asserted-by":"publisher","first-page":"1631","DOI":"10.30757\/ALEA.v20-62","volume":"20","author":"GR Pinsky","year":"2023","unstructured":"Pinsky GR (2023) The secretary problem with non-uniform arrivals via a left-to-right minimum exponentially tilted distribution. ALEA 20(2):1631","journal-title":"ALEA"},{"key":"880_CR46","unstructured":"Pitman J, You Z (2021) The range of a self-similar additive Gamma process is a scale invariant Poisson point process. arXiv:2111.09409"},{"issue":"2","key":"880_CR47","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-4149(87)90020-2","volume":"24","author":"Z Porosi\u0144ski","year":"1987","unstructured":"Porosi\u0144ski Z (1987) The full-information best choice problem with a random number of observations. Stoch Process Appl 24(2):293\u2013307","journal-title":"Stoch Process Appl"},{"key":"880_CR48","first-page":"307","volume":"34","author":"M Sakaguchi","year":"1989","unstructured":"Sakaguchi M (1989) Some infinite problems in classical secretary problems. Math Japon 34:307\u2013318","journal-title":"Math Japon"},{"key":"880_CR49","series-title":"Statistical Textbooks Monographs","first-page":"381","volume-title":"Handbook of sequential analysis","author":"SM Samuels","year":"1991","unstructured":"Samuels SM (1991) Secretary problems. In: Ghosh BK, Sen PK (eds) Handbook of sequential analysis, vol 118. Statistical Textbooks Monographs. CRC Press, New York, pp 381\u2013402"},{"issue":"1","key":"880_CR50","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/opre.29.1.130","volume":"29","author":"TJ Stewart","year":"1981","unstructured":"Stewart TJ (1981) The secretary problem with an unknown number of options. Oper Res 29(1):130\u2013145","journal-title":"Oper Res"},{"key":"880_CR51","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-0-387-89496-6_24","volume-title":"Optimisation and optimal control: theory and applications","author":"M Tamaki","year":"2010","unstructured":"Tamaki M, Wang Q (2010) A random arrival time best-choice problem with uniform prior on the number of arrivals. In: Chinchuluun A, Pardalos PM, Enkhbat R, Tseveendorj I (eds) Optimisation and optimal control: theory and applications, vol 39. Springer Optimization and Its Applications. Springer, New York, pp 499\u2013510"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-024-00880-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-024-00880-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-024-00880-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T12:17:57Z","timestamp":1741263477000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-024-00880-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,19]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["880"],"URL":"https:\/\/doi.org\/10.1007\/s00186-024-00880-1","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2024,10,19]]},"assertion":[{"value":"20 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose. The authors have no Conflict of interest to declare that are relevant to the content of this article. All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript. The authors have no financial or proprietary interests in any material discussed in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Financial Interests"}}]}}