{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T15:28:33Z","timestamp":1768318113288,"version":"3.49.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:00:00Z","timestamp":1648684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:00:00Z","timestamp":1648684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902073"],"award-info":[{"award-number":["61902073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2021J01623"],"award-info":[{"award-number":["2021J01623"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072207"],"award-info":[{"award-number":["62072207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072445"],"award-info":[{"award-number":["62072445"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s11128-022-03477-x","type":"journal-article","created":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T03:33:21Z","timestamp":1648697601000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Some efficient quantum circuit implementations of Camellia"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0864-0905","authenticated-orcid":false,"given":"Jian","family":"Zou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zihao","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siwei","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiyuan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenling","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,31]]},"reference":[{"key":"3477_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Gottesman, D.: Improved simulation of stabilizer circuits. CoRR, quant-ph\/0406196, (2004)","DOI":"10.1103\/PhysRevA.70.052328"},{"key":"3477_CR2","doi-asserted-by":"crossref","unstructured":"Aoki, K., Ichikawa, T., Kanda, M., Matsui, M., Moriai, S., Nakajima, J., Tokita, T.: Camellia: A 128-bit block cipher suitable for multiple platforms - design and analysis. In Stinson, D\u00a0R., Stafford\u00a0E. Tavares, (eds.), Selected Areas in Cryptography, 7th Annual International Workshop, SAC 2000, Waterloo, Ontario, Canada, August 14-15, 2000, Proceedings, vol. 2012 of Lecture Notes in Computer Science, pp. 39\u201356. Springer, (2000)","DOI":"10.1007\/3-540-44983-3_4"},{"key":"3477_CR3","doi-asserted-by":"crossref","unstructured":"Amy, M., Matteo, O\u00a0Di., Gheorghiu, V., Mosca, M., Parent, A., Schanck, J\u00a0M.: Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3. In: Avanzi,R., Howard\u00a0M. Heys, (eds.), Selected Areas in Cryptography - SAC 2016 - 23rd International Conference, St. John\u2019s, NL, Canada, August 10-12, 2016, Revised Selected Papers, vol. 10532 of Lecture Notes in Computer Science, pp. 317\u2013337. Springer, (2016)","DOI":"10.1007\/978-3-319-69453-5_18"},{"issue":"6","key":"3477_CR4","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TCAD.2013.2244643","volume":"32","author":"M Amy","year":"2013","unstructured":"Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. Comput. Aided. Des. Integr. Circuits Syst. 32(6), 818\u2013830 (2013)","journal-title":"IEEE Trans. Comput. Aided. Des. Integr. Circuits Syst."},{"issue":"5","key":"3477_CR5","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/s11128-018-1864-3","volume":"17","author":"M Almazrooie","year":"2018","unstructured":"Almazrooie, M., Samsudin, A., Abdullah, R., Mutter, K.N.: Quantum reversible circuit of AES-128. Quantum Inf. Process. 17(5), 112 (2018)","journal-title":"Quantum Inf. Process."},{"issue":"1","key":"3477_CR6","first-page":"451","volume":"2021","author":"G Banegas","year":"2021","unstructured":"Banegas, G., Bernstein, D.J., van Hoof, I., Lange, T.: Concrete quantum cryptanalysis of binary elliptic curves. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2021(1), 451\u2013472 (2021)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"3477_CR7","doi-asserted-by":"crossref","unstructured":"Bonnetain, X., Hosoyamada, A., Naya-Plasencia, M., Sasaki, Y., Schrottenloher, A.: Quantum attacks without superposition queries: The offline simon\u2019s algorithm. In: Galbraith, Steven\u00a0D., Moriai, S., (eds.), Advances in Cryptology - ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8-12, 2019, Proceedings, Part I, vol. 11921 of Lecture Notes in Computer Science, pp. 552\u2013583. Springer, (2019)","DOI":"10.1007\/978-3-030-34578-5_20"},{"issue":"2","key":"3477_CR8","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-012-9124-7","volume":"26","author":"J Boyar","year":"2013","unstructured":"Boyar, J., Matthews, P., Peralta, R.: Logic minimization techniques with applications to cryptology. J. Cryptol. 26(2), 280\u2013312 (2013)","journal-title":"J. Cryptol."},{"issue":"2","key":"3477_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.46586\/tosc.v2019.i2.55-93","volume":"2019","author":"X Bonnetain","year":"2019","unstructured":"Bonnetain, X., Naya-Plasencia, M., Schrottenloher, A.: Quantum security analysis of AES. IACR Trans. Symmetric Cryptol. 2019(2), 55\u201393 (2019)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"3477_CR10","unstructured":"Boyar, J., Peralta, R.: A new combinational logic minimization technique with applications to cryptology. In: Festa, Paola., (eds.), Experimental Algorithms, 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings, vol. 6049 of Lecture Notes in Computer Science, pages 178\u2013189. Springer, (2010)"},{"key":"3477_CR11","doi-asserted-by":"crossref","unstructured":"Boyar, J., Peralta, R\u00e9.: A small depth-16 circuit for the AES s-box. In: Gritzalis, D., Furnell, S., Theoharidou, M., (eds.). Information Security and Privacy Research - 27th IFIP TC 11 Information Security and Privacy Conference, SEC 2012, Heraklion, Crete, Greece, June 4-6, 2012. Proceedings, vol. 376 of IFIP Advances in Information and Communication Technology, pp. 287\u2013298. Springer, (2012)","DOI":"10.1007\/978-3-642-30436-1_24"},{"key":"3477_CR12","doi-asserted-by":"crossref","unstructured":"Canright, David.: A very compact s-box for AES. In Rao, Josyula\u00a0R., Sunar, Berk., editors, Cryptographic Hardware and Embedded Systems - CHES 2005, 7th International Workshop, Edinburgh, UK, August 29 - September 1, 2005, Proceedings, vol. 3659 of Lecture Notes in Computer Science, pp. 441\u2013455. Springer, (2005)","DOI":"10.1007\/11545262_32"},{"key":"3477_CR13","doi-asserted-by":"crossref","unstructured":"Chailloux, A., Naya-Plasencia, M., Schrottenloher, A.: An efficient quantum collision search algorithm and implications on symmetric cryptography. In Takagi, T., Peyrin, T., (eds.), Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part II, vol. 10625 of Lecture Notes in Computer Science, pages 211\u2013240. Springer, (2017)","DOI":"10.1007\/978-3-319-70697-9_8"},{"key":"3477_CR14","first-page":"1030","volume":"2020","author":"X Dong","year":"2020","unstructured":"Dong, X., Sun, S., Shi, D., Gao, F., Wang, X., Lei, H.: Quantum collision attacks on aes-like hashing with low quantum random access memories. IACR Cryptol. ePrint Arch. 2020, 1030 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"3477_CR15","doi-asserted-by":"crossref","unstructured":"Grassl, M., Langenberg, B., Roetteler, M., Steinwandt, R.: Applying grover\u2019s algorithm to AES: quantum resource estimates. In Takagi, T., (eds.), Post-Quantum Cryptography - 7th International Workshop, PQCrypto 2016, Fukuoka, Japan, February 24-26, 2016, Proceedings, vol. 9606 of Lecture Notes in Computer Science, pp. 29\u201343. Springer, (2016)","DOI":"10.1007\/978-3-319-29360-8_3"},{"key":"3477_CR16","doi-asserted-by":"crossref","unstructured":"Grassi, L., Naya-Plasencia, M., Schrottenloher, A.: Quantum algorithms for the k -xor problem. In: Peyrin, T., Galbraith, S\u00a0D., (eds.), Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part I, vol. 11272 of Lecture Notes in Computer Science, pp. 527\u2013559. Springer, (2018)","DOI":"10.1007\/978-3-030-03326-2_18"},{"key":"3477_CR17","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Gary\u00a0L. Miller, (ed), In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996, pp. 212\u2013219. ACM, (1996)","DOI":"10.1145\/237814.237866"},{"key":"3477_CR18","doi-asserted-by":"crossref","unstructured":"Hosoyamada, A.,\u00a0Sasaki, Y.: Cryptanalysis against symmetric-key schemes with online classical queries and offline quantum computations. In: Smart, Nigel\u00a0P., (ed.), Topics in Cryptology - CT-RSA 2018 - The Cryptographers\u2019 Track at the RSA Conference 2018, San Francisco, CA, USA, April 16-20, 2018, Proceedings, volume 10808 of Lecture Notes in Computer Science, pp. 198\u2013218. Springer, (2018)","DOI":"10.1007\/978-3-319-76953-0_11"},{"key":"3477_CR19","doi-asserted-by":"crossref","unstructured":"Hosoyamada, A.,\u00a0Sasaki, Y.: Quantum demiric-sel\u00e7uk meet-in-the-middle attacks: Applications to 6-round generic feistel constructions. In: Catalano, D., Prisco, R., editors, Security and Cryptography for Networks - 11th International Conference, SCN 2018, Amalfi, Italy, September 5-7, 2018, Proceedings, vol. 11035 of Lecture Notes in Computer Science, pp. 386\u2013403. Springer, (2018)","DOI":"10.1007\/978-3-319-98113-0_21"},{"key":"3477_CR20","doi-asserted-by":"crossref","unstructured":"Hosoyamada, A.,\u00a0Sasaki, Y.: Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound. In: Canteaut, A., Ishai, Y., (eds.), Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10-14, 2020, Proceedings, Part II, volume 12106 of Lecture Notes in Computer Science, pp. 249\u2013279. Springer, (2020)","DOI":"10.1007\/978-3-030-45724-2_9"},{"key":"3477_CR21","doi-asserted-by":"crossref","unstructured":"Ito, G., Hosoyamada, A., Matsumoto, R.,\u00a0Sasaki, Y., Iwata, T.: Quantum chosen-ciphertext attacks against feistel ciphers. In Matsui, M., (ed.), Topics in Cryptology - CT-RSA 2019 - The Cryptographers\u2019 Track at the RSA Conference 2019, San Francisco, CA, USA, March 4-8, 2019, Proceedings, volume 11405 of Lecture Notes in Computer Science, pp. 391\u2013411. Springer, (2019)","DOI":"10.1007\/978-3-030-12612-4_20"},{"issue":"3","key":"3477_CR22","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0890-5401(88)90024-7","volume":"78","author":"T Itoh","year":"1988","unstructured":"Itoh, T., Tsujii, S.: A fast algorithm for computing multiplicative inverses in gf(2m\u0302) using normal bases. Inf. Comput. 78(3), 171\u2013177 (1988)","journal-title":"Inf. Comput."},{"key":"3477_CR23","doi-asserted-by":"crossref","unstructured":"Jaques, S., Naehrig, M., Roetteler, M., Virdia, F.: Implementing grover oracles for quantum key search on AES and lowmc. In: Canteaut, A., Ishai, Y., (eds.), Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10-14, 2020, Proceedings, Part II, volume 12106 of Lecture Notes in Computer Science, pp. 280\u2013310. Springer, (2020)","DOI":"10.1007\/978-3-030-45724-2_10"},{"issue":"4","key":"3477_CR24","doi-asserted-by":"publisher","first-page":"130","DOI":"10.46586\/tosc.v2017.i4.130-168","volume":"2017","author":"J Jean","year":"2017","unstructured":"Jean, J., Peyrin, T., Sim, S.M., Tourteaux, J.: Optimizing implementations of lightweight building blocks. IACR Trans. Symmetric Cryptol. 2017(4), 130\u2013168 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"12","key":"3477_CR25","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s11128-018-2107-3","volume":"17","author":"P Kim","year":"2018","unstructured":"Kim, P., Han, D., Jeong, K.C.: Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2. Quantum Inf. Process. 17(12), 339 (2018)","journal-title":"Quantum Inf. Process."},{"key":"3477_CR26","first-page":"854","volume":"2019","author":"B Langenberg","year":"2019","unstructured":"Langenberg, B., Pham, H., Steinwandt, R.: Reducing the cost of implementing AES as a quantum circuit. IACR Cryptol. ePrint Arch. 2019, 854 (2019)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"4","key":"3477_CR27","doi-asserted-by":"publisher","first-page":"91","DOI":"10.46586\/tches.v2019.i4.91-125","volume":"2019","author":"A Maximov","year":"2019","unstructured":"Maximov, A., Ekdahl, P.: New circuit minimization techniques for smaller and faster AES sboxes. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(4), 91\u2013125 (2019)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"3477_CR28","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez-Herrera, A.F., Mex-Perera, J.\u00a0Carlos., Nolazco-Flores, JA.: Some representations of the s-box of camellia in GF(((2$${}^{2}$$)$${}^{2}$$)$${}^{2}$$). In Pieprzyk, Josef., Sadeghi, Ahmad-Reza., Manulis, Mark., editors, Cryptology and Network Security, 11th International Conference, CANS 2012, Darmstadt, Germany, December 12-14, 2012. Proceedings, volume 7712, pp. 296\u2013309. Springer, (2012)","DOI":"10.1007\/978-3-642-35404-5_22"},{"key":"3477_CR29","volume-title":"Quantum Computation and Quantum Information (10th Anniversary edition)","author":"MA Nielsen","year":"2016","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information (10th Anniversary edition). Cambridge University Press, Cambridge (2016)"},{"key":"3477_CR30","doi-asserted-by":"crossref","unstructured":"Ni, B., Ito, G., Dong, X., Iwata, T.: Quantum attacks against type-1 generalized feistel ciphers and applications to CAST-256. In: Hao, F., Ruj, S., Gupta, S.S., (eds.), Progress in Cryptology - INDOCRYPT 2019 - 20th International Conference on Cryptology in India, Hyderabad, India, December 15-18, 2019, Proceedings, volume 11898 of Lecture Notes in Computer Science, pp. 433\u2013455. Springer, (2019)","DOI":"10.1007\/978-3-030-35423-7_22"},{"key":"3477_CR31","unstructured":"NIST. Submission requirements and evaluation criteria for the Post-Quantum Cryptography standardization process, (2016)"},{"key":"3477_CR32","unstructured":"NIST. Advanced Encryption Standard (AES), FIPS PUB 197 (2001)"},{"key":"3477_CR33","unstructured":"NIST. Secure Hash Standard (SHS), FIPS PUB 180-4 (2015)"},{"issue":"1","key":"3477_CR34","first-page":"84","volume":"3","author":"Y Shi","year":"2003","unstructured":"Shi, Y.: Both toffoli and controlled-not need little help to do universal quantum computing. Quantum Inf. Comput. 3(1), 84\u201392 (2003)","journal-title":"Quantum Inf. Comput."},{"issue":"5","key":"3477_CR35","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"DR Simon","year":"1997","unstructured":"Simon, D.R.: On the power of quantum computation. SIAM J. Comput. 26(5), 1474\u20131483 (1997)","journal-title":"SIAM J. Comput."},{"key":"3477_CR36","doi-asserted-by":"crossref","unstructured":"Toffoli, T.: Reversible computing. In:\u00a0Bakker, J.\u00a0W. de., Leeuwen, Jan van., editors, Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout, The Netherlands, July 14-18, 1980, Proceedings, volume\u00a085 of Lecture Notes in Computer Science, pp. 632\u2013644. Springer, (1980)","DOI":"10.21236\/ADA082021"},{"issue":"1","key":"3477_CR37","first-page":"203","volume":"2020","author":"QQ Tan","year":"2020","unstructured":"Tan, Q.Q., Peyrin, T.: Improved heuristics for short linear programs. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020(1), 203\u2013230 (2020)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"3477_CR38","first-page":"738","volume":"2019","author":"Z Wei","year":"2019","unstructured":"Wei, Z., Sun, S., Lei, H., Wei, M., Boyar, J., Peralta, R.: Scrutinizing the tower field implementation of the $$\\text{ f}_{2^8}$$ inverter - with applications to aes, camellia, and SM4. IACR Cryptol. ePrint Arch. 2019, 738 (2019)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"2","key":"3477_CR39","doi-asserted-by":"publisher","first-page":"120","DOI":"10.46586\/tosc.v2020.i2.120-145","volume":"2020","author":"Z Xiang","year":"2020","unstructured":"Xiang, Z., Zeng, X., Lin, D., Bao, Z., Zhang, S.: Optimizing implementations of linear layers. IACR Trans. Symmetric Cryptol. 2020(2), 120\u2013145 (2020)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"6","key":"3477_CR40","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1049\/iet-ifs.2017.0495","volume":"12","author":"J Zou","year":"2018","unstructured":"Zou, J., Dong, L., Wenling, W.: New algorithms for the unbalanced generalised birthday problem. IET Inf. Secur. 12(6), 527\u2013533 (2018)","journal-title":"IET Inf. Secur."},{"key":"3477_CR41","doi-asserted-by":"publisher","first-page":"181619","DOI":"10.1109\/ACCESS.2020.3028736","volume":"8","author":"J Zou","year":"2020","unstructured":"Zou, J., Liu, Y., Dong, L.: An efficient quantum multi-collision search algorithm. IEEE Access 8, 181619\u2013181628 (2020)","journal-title":"IEEE Access"},{"key":"3477_CR42","doi-asserted-by":"crossref","unstructured":"Zou, J., Wei, Z., Sun, S., Liu, X., Wu, W.: Quantum circuit implementations of aes with fewer qubits. In: Advances in Cryptology - ASIACRYPT 2020 - the 26th Annual International Conference on the Theory and Application of Cryptology and Information Security, Lecture Notes in Computer Science. Springer, (2020)","DOI":"10.1007\/978-3-030-64834-3_24"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03477-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-022-03477-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03477-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T08:26:54Z","timestamp":1650875214000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-022-03477-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,31]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["3477"],"URL":"https:\/\/doi.org\/10.1007\/s11128-022-03477-x","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,31]]},"assertion":[{"value":"14 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"131"}}