{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:39Z","timestamp":1740122559857,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T00:00:00Z","timestamp":1727913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T00:00:00Z","timestamp":1727913600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP200100731","DP200100731"],"award-info":[{"award-number":["DP200100731","DP200100731"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001779","name":"Monash University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001779","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,12]]},"abstract":"Abstract<\/jats:title>In this paper, we focus on the design of binary constant weight codes that admit low-complexity encoding and decoding algorithms, and that have size $$M=2^k$$<\/jats:tex-math>\n \n M<\/mml:mi>\n =<\/mml:mo>\n \n 2<\/mml:mn>\n k<\/mml:mi>\n <\/mml:msup>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> so that codewords can conveniently be labeled with binary vectors of length k<\/jats:italic>. For every integer $$\\ell \\ge 3$$<\/jats:tex-math>\n \n \u2113<\/mml:mi>\n \u2265<\/mml:mo>\n 3<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, we construct a $$(n=2^\\ell , M=2^{k_{\\ell }}, d=2)$$<\/jats:tex-math>\n \n (<\/mml:mo>\n n<\/mml:mi>\n =<\/mml:mo>\n \n 2<\/mml:mn>\n \u2113<\/mml:mi>\n <\/mml:msup>\n ,<\/mml:mo>\n M<\/mml:mi>\n =<\/mml:mo>\n \n 2<\/mml:mn>\n \n k<\/mml:mi>\n \u2113<\/mml:mi>\n <\/mml:msub>\n <\/mml:msup>\n ,<\/mml:mo>\n d<\/mml:mi>\n =<\/mml:mo>\n 2<\/mml:mn>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> constant weight code $${{{\\mathcal {C}}}}[\\ell ]$$<\/jats:tex-math>\n \n C<\/mml:mi>\n [<\/mml:mo>\n \u2113<\/mml:mi>\n ]<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> of weight $$\\ell $$<\/jats:tex-math>\n \u2113<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> by encoding information in the gaps between successive 1\u2019s of a vector, and call them as cyclic-gap constant weight codes. The code is associated with a finite integer sequence of length $$\\ell $$<\/jats:tex-math>\n \u2113<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> satisfying a constraint defined as anchor-decodability<\/jats:italic> that is pivotal to ensure low complexity for encoding and decoding. The time complexity of the encoding algorithm is linear in the input size k<\/jats:italic>, and that of the decoding algorithm is poly-logarithmic in the input size n<\/jats:italic>, discounting the linear time spent on parsing the input. Both the algorithms do not require expensive computation of binomial coefficients, unlike the case in many existing schemes. Among codes generated by all anchor-decodable sequences, we show that $${{{\\mathcal {C}}}}[\\ell ]$$<\/jats:tex-math>\n \n C<\/mml:mi>\n [<\/mml:mo>\n \u2113<\/mml:mi>\n ]<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> has the maximum size with $$k_{\\ell } \\ge \\ell ^2-\\ell \\log _2\\ell + \\log _2\\ell - 0.279\\ell - 0.721$$<\/jats:tex-math>\n \n \n k<\/mml:mi>\n \u2113<\/mml:mi>\n <\/mml:msub>\n \u2265<\/mml:mo>\n \n \u2113<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msup>\n -<\/mml:mo>\n \u2113<\/mml:mi>\n \n log<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:msub>\n \u2113<\/mml:mi>\n +<\/mml:mo>\n \n log<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:msub>\n \u2113<\/mml:mi>\n -<\/mml:mo>\n 0.279<\/mml:mn>\n \u2113<\/mml:mi>\n -<\/mml:mo>\n 0.721<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. As k<\/jats:italic> is upper bounded by $$\\ell ^2-\\ell \\log _2\\ell +O(\\ell )$$<\/jats:tex-math>\n \n \n \u2113<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msup>\n -<\/mml:mo>\n \u2113<\/mml:mi>\n \n log<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:msub>\n \u2113<\/mml:mi>\n +<\/mml:mo>\n O<\/mml:mi>\n \n (<\/mml:mo>\n \u2113<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> information-theoretically, the code $${{{\\mathcal {C}}}}[\\ell ]$$<\/jats:tex-math>\n \n C<\/mml:mi>\n [<\/mml:mo>\n \u2113<\/mml:mi>\n ]<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is optimal in its size with respect to two higher order terms of $$\\ell $$<\/jats:tex-math>\n \u2113<\/mml:mi>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. In particular, $$k_\\ell $$<\/jats:tex-math>\n \n k<\/mml:mi>\n \u2113<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> meets the upper bound for $$\\ell =3$$<\/jats:tex-math>\n \n \u2113<\/mml:mi>\n =<\/mml:mo>\n 3<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and one-bit away for $$\\ell =4$$<\/jats:tex-math>\n \n \u2113<\/mml:mi>\n =<\/mml:mo>\n 4<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. On the other hand, we show that $${{{\\mathcal {C}}}}[\\ell ]$$<\/jats:tex-math>\n \n C<\/mml:mi>\n [<\/mml:mo>\n \u2113<\/mml:mi>\n ]<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is not unique in attaining $$k_{\\ell }$$<\/jats:tex-math>\n \n k<\/mml:mi>\n \u2113<\/mml:mi>\n <\/mml:msub>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> by constructing an alternate code $$\\mathcal{{\\hat{C}}}[\\ell ]$$<\/jats:tex-math>\n \n \n C<\/mml:mi>\n ^<\/mml:mo>\n <\/mml:mover>\n \n [<\/mml:mo>\n \u2113<\/mml:mi>\n ]<\/mml:mo>\n <\/mml:mrow>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> again parameterized by an integer $$\\ell \\ge 3$$<\/jats:tex-math>\n \n \u2113<\/mml:mi>\n \u2265<\/mml:mo>\n 3<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> with a different low-complexity decoder, yet having the same size $$2^{k_{\\ell }}$$<\/jats:tex-math>\n \n 2<\/mml:mn>\n \n k<\/mml:mi>\n \u2113<\/mml:mi>\n <\/mml:msub>\n <\/mml:msup>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> when $$3 \\le \\ell \\le 7$$<\/jats:tex-math>\n \n 3<\/mml:mn>\n \u2264<\/mml:mo>\n \u2113<\/mml:mi>\n \u2264<\/mml:mo>\n 7<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Finally, we also derive new codes by modifying $${{{\\mathcal {C}}}}[\\ell ]$$<\/jats:tex-math>\n \n C<\/mml:mi>\n [<\/mml:mo>\n \u2113<\/mml:mi>\n ]<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math><\/jats:alternatives><\/jats:inline-formula> that offer a wider range on blocklength and weight while retaining low complexity for encoding and decoding. For certain selected values of parameters, these modified codes too have an optimal k<\/jats:italic>.<\/jats:p>","DOI":"10.1007\/s10623-024-01494-8","type":"journal-article","created":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T11:02:27Z","timestamp":1727953347000},"page":"4247-4277","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Binary cyclic-gap constant weight codes with low-complexity encoding and decoding"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7444-7161","authenticated-orcid":false,"given":"Birenjith","family":"Sasidharan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuele","family":"Viterbo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Son Hoang","family":"Dau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,3]]},"reference":[{"issue":"7","key":"1494_CR1","doi-asserted-by":"publisher","first-page":"2373","DOI":"10.1109\/18.887851","volume":"46","author":"E Agrell","year":"2000","unstructured":"Agrell E., Vardy A., Zeger K.: Upper bounds for constant-weight codes. IEEE Trans. Inf. Theory 46(7), 2373\u20132395 (2000). https:\/\/doi.org\/10.1109\/18.887851.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1494_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/18.370117","volume":"41","author":"S Bitan","year":"1995","unstructured":"Bitan S., Etzion T.: Constructions for optimal constant weight cyclically permutable codes and difference families. IEEE Trans. Inf. Theory 41(1), 77\u201387 (1995). https:\/\/doi.org\/10.1109\/18.370117.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1494_CR3","unstructured":"Brouwer A.: Bounds for binary constant weight codes. https:\/\/www.win.tue.nl\/ (Online; Accessed 23 Oct 2023) (2023)."},{"issue":"6","key":"1494_CR4","doi-asserted-by":"publisher","first-page":"1334","DOI":"10.1109\/18.59932","volume":"36","author":"AE Brouwer","year":"1990","unstructured":"Brouwer A.E., Shearer J.B., Sloane N.J.A., Smith W.D.: A new table of constant weight codes. IEEE Trans. Inf. Theory 36(6), 1334\u20131380 (1990). https:\/\/doi.org\/10.1109\/18.59932.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1494_CR5","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/18.53748","volume":"36","author":"H Chung","year":"1990","unstructured":"Chung H., Kumar P.V.: Optical orthogonal codes\u2014new bounds and an optimal construction. IEEE Trans. Inf. Theory 36(4), 866\u2013873 (1990). https:\/\/doi.org\/10.1109\/18.53748.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1494_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/TIT.1973.1054929","volume":"19","author":"T Cover","year":"1973","unstructured":"Cover T.: Enumerative source encoding. IEEE Trans. Inf. Theory 19(1), 73\u201377 (1973).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1494_CR7","doi-asserted-by":"publisher","unstructured":"Dai V., Zakhor A.: Binary combinatorial coding. In: Data Compression Conference, 2003. Proceedings. DCC 2003, p. 420 (2003). https:\/\/doi.org\/10.1109\/DCC.2003.1194039.","DOI":"10.1109\/DCC.2003.1194039"},{"issue":"7","key":"1494_CR8","doi-asserted-by":"publisher","first-page":"3297","DOI":"10.1109\/TIT.2009.2021366","volume":"55","author":"C Ding","year":"2009","unstructured":"Ding C., Fuji-Hara R., Fujiwara Y., Jimbo M., Mishima M.: Sets of frequency hopping sequences: bounds and optimal constructions. IEEE Trans. Inf. Theory 55(7), 3297\u20133304 (2009). https:\/\/doi.org\/10.1109\/TIT.2009.2021366.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1494_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1080\/00207168508803468","volume":"17","author":"MC Er","year":"1985","unstructured":"Er M.C.: Lexicographic ordering, ranking and unranking of combinations. Int. J. Comput. Math. 17(1), 277\u2013283 (1985).","journal-title":"Int. J. Comput. Math."},{"key":"1494_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0924-6509(01)80051-9","volume-title":"Codes on Euclidean Spheres. North-Holland Mathematical Library","author":"T Ericson","year":"2001","unstructured":"Ericson T., Zinoviev V.: Chapter 6\u2013non-symmetric alphabets. In: Ericson T., Zinoviev V. (eds.) Codes on Euclidean Spheres. North-Holland Mathematical Library, vol. 63, pp. 179\u2013194. Elsevier, New York (2001). https:\/\/doi.org\/10.1016\/S0924-6509(01)80051-9."},{"key":"1494_CR11","unstructured":"Finiasz M., Gaborit P., Sendrier N.: Improved fast syndrome based cryptographic hash functions. In: ECRYPT Hash Workshop 2007, Proceedings, p. 155 (2011)."},{"key":"1494_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813498","volume-title":"Principles of Digital Communication","author":"RG Gallager","year":"2008","unstructured":"Gallager R.G.: Principles of Digital Communication. Cambridge University Press, New York (2008)."},{"issue":"3","key":"1494_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.3390\/a14030097","volume":"14","author":"A Genitrini","year":"2021","unstructured":"Genitrini A., P\u00e9pin M.: Lexicographic unranking of combinations revisited. Algorithms 14(3), 97 (2021).","journal-title":"Algorithms"},{"issue":"1","key":"1494_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/TIT.1980.1056141","volume":"26","author":"R Graham","year":"1980","unstructured":"Graham R., Sloane N.: Lower bounds for constant weight codes. IEEE Trans. Inf. Theory 26(1), 37\u201343 (1980). https:\/\/doi.org\/10.1109\/TIT.1980.1056141.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1494_CR15","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1962.1057714","volume":"8","author":"SM Johnson","year":"1962","unstructured":"Johnson S.M.: A new upper bound for error-correcting codes. IRE Trans. Inf. Theory 8(3), 203\u2013207 (1962).","journal-title":"IRE Trans. Inf. Theory"},{"issue":"1","key":"1494_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/360767.360811","volume":"17","author":"GD Knott","year":"1974","unstructured":"Knott G.D.: A numbering systems for combinations. Commun. ACM 17(1), 45\u201346 (1974).","journal-title":"Commun. ACM"},{"key":"1494_CR17","unstructured":"Kokosinski Z.: Algorithms for unranking combinations and their applications. In: Hamza M.H. (ed.) Proceedings of the Seventh IASTED\/ISMM International Conference on Parallel and Distributed Computing and Systems, Washington, D.C., USA, October 19-21, 1995, pp. 216\u2013224 (1995)."},{"issue":"2","key":"1494_CR18","doi-asserted-by":"publisher","first-page":"36","DOI":"10.3390\/a15020036","volume":"15","author":"VV Kruchinin","year":"2022","unstructured":"Kruchinin V.V., Shablya Y.V., Kruchinin D.V., Rulevskiy V.: Unranking small combinations of a large set in co-lexicographic order. Algorithms 15(2), 36 (2022).","journal-title":"Algorithms"},{"issue":"7","key":"1494_CR19","doi-asserted-by":"publisher","first-page":"4497","DOI":"10.1109\/TIT.2011.2145490","volume":"57","author":"OF Kurmaev","year":"2011","unstructured":"Kurmaev O.F.: Constant-weight and constant-charge binary run-length limited codes. IEEE Trans. Inf. Theory 57(7), 4497\u20134515 (2011). https:\/\/doi.org\/10.1109\/TIT.2011.2145490.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1494_CR20","doi-asserted-by":"crossref","unstructured":"Lehmer D.H.: Teaching combinatorial tricks to a computer. In: Proceedings of Symposium in Applied Mathematics, vol. 10, pp. 179\u2013193. American Mathematical Society, Providence, RI\/New York (1960).","DOI":"10.1090\/psapm\/010\/0113289"},{"key":"1494_CR21","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. Mathematical Library. North-Holland Publishing Company, New York (1977)."},{"issue":"2","key":"1494_CR22","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1109\/18.370146","volume":"41","author":"O Moreno","year":"1995","unstructured":"Moreno O., Zhang Z., Kumar P.V., Zinoviev V.A.: New constructions of optimal cyclically permutable constant weight codes. IEEE Trans. Inf. Theory 41(2), 448\u2013455 (1995). https:\/\/doi.org\/10.1109\/18.370146.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1494_CR23","doi-asserted-by":"publisher","unstructured":"Nordio A., Viterbo E.: Permutation modulation for fading channels. In: 10th International Conference on Telecommunications, 2003. ICT 2003, vol. 2, pp. 1177\u201311832 (2003). https:\/\/doi.org\/10.1109\/ICTEL.2003.1191603.","DOI":"10.1109\/ICTEL.2003.1191603"},{"key":"1494_CR24","first-page":"45","volume":"25","author":"E Pascal","year":"1887","unstructured":"Pascal E.: Sopra una formula numerica. G. Di Mat. 25, 45\u201349 (1887).","journal-title":"G. Di Mat."},{"key":"1494_CR25","volume-title":"An Introduction to Combinatorial Analysis","author":"J Riordan","year":"1978","unstructured":"Riordan J.: An Introduction to Combinatorial Analysis. Princeton Legacy Library. Princeton University Press, Princeton (1978)."},{"issue":"17","key":"1494_CR26","doi-asserted-by":"publisher","first-page":"5305","DOI":"10.1016\/j.disc.2007.11.048","volume":"309","author":"F Ruskey","year":"2009","unstructured":"Ruskey F., Williams A.: The coolest way to generate combinations. Discret. Math. 309(17), 5305\u20135320 (2009).","journal-title":"Discret. Math."},{"issue":"3","key":"1494_CR27","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1109\/TIT.1972.1054832","volume":"18","author":"J Schalkwijk","year":"1972","unstructured":"Schalkwijk J.: An algorithm for source coding. IEEE Trans. Inf. Theory 18(3), 395\u2013399 (1972).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1494_CR28","doi-asserted-by":"crossref","unstructured":"Sendrier N.: Encoding information into constant weight words. In: Proceedings. International Symposium on Information Theory, 2005. ISIT 2005, pp. 435\u2013438 (2005).","DOI":"10.1109\/ISIT.2005.1523371"},{"issue":"3","key":"1494_CR29","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1109\/PROC.1965.3680","volume":"53","author":"D Slepian","year":"1965","unstructured":"Slepian D.: Permutation modulation. Proc. IEEE 53(3), 228\u2013236 (1965). https:\/\/doi.org\/10.1109\/PROC.1965.3680.","journal-title":"Proc. IEEE"},{"key":"1494_CR30","unstructured":"Tabor J.: Noise reduction using low weight and constant weight coding techniques. Masters Thesis, MIT, Cambridge, MA, USA. https:\/\/dspace.mit.edu\/handle\/1721.1\/14030 (1990)."},{"key":"1494_CR31","unstructured":"Tallini L.: Design of some new efficient balanced codes. Masters Thesis, Oregon State University, Corvallis, OR, USA. https:\/\/ir.library.oregonstate.edu\/downloads\/qb98mh689 (1994)"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01494-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01494-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01494-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T21:25:07Z","timestamp":1732310707000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01494-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,3]]},"references-count":31,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1494"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01494-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,10,3]]},"assertion":[{"value":"25 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 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 conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}