{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T07:23:37Z","timestamp":1763018617519},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s00145-023-09464-4","type":"journal-article","created":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T20:37:42Z","timestamp":1689107862000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic"],"prefix":"10.1007","volume":"36","author":[{"given":"Mariya Georgieva","family":"Belorgey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergiu","family":"Carpov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Deforth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitar","family":"Jetchev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abson","family":"Sae-Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marius","family":"Vuille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Gama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Katz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iraklis","family":"Leontiadis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohsen","family":"Mohammadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,11]]},"reference":[{"key":"9464_CR1","doi-asserted-by":"crossref","unstructured":"M. Al-Rubaie, P.Y. Wu, J.M. Chang, S.Y. Kung, Privacy-preserving PCA on horizontally-partitioned data, in 2017 IEEE Conference on Dependable and Secure Computing (2017), pp. 280\u2013287","DOI":"10.1109\/DESEC.2017.8073817"},{"key":"9464_CR2","unstructured":"M. Aliasgari, M. Blanton, Y. Zhang, A. Steele, Secure computation on floating point numbers, in NDSS (2013)"},{"key":"9464_CR3","doi-asserted-by":"crossref","unstructured":"A. Aly, N.P. Smart, Benchmarking privacy preserving scientific operations, in International Conference on Applied Cryptography and Network Security (2019), pp 509\u2013529","DOI":"10.1007\/978-3-030-21568-2_25"},{"key":"9464_CR4","doi-asserted-by":"crossref","unstructured":"T. Araki, J. Furukawa, Y. Lindell, A. Nof, K. Ohara, High-throughput semi-honest secure three-party computation with an honest majority, in Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201916 (2016), pp. 805\u2013817","DOI":"10.1145\/2976749.2978331"},{"issue":"1","key":"9464_CR5","first-page":"1","volume":"13","author":"M Aum\u00fcller","year":"2016","unstructured":"Aum\u00fcller, M., Dietzfelbinger, M., Klaue, P.: How good is multi-pivot quicksort? ACM Transactions on Algorithms (TALG) 13(1), 1\u201347 (2016)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"9464_CR6","doi-asserted-by":"crossref","unstructured":"D. Beaver, Efficient multiparty protocols using circuit randomization, in CRYPTO \u201991. Lecture Notes in Computer Science, vol.\u00a0576 (1992), pp. 420\u2013432","DOI":"10.1007\/3-540-46766-1_34"},{"key":"9464_CR7","unstructured":"D. Beaver, S. Micali, P. Rogaway, The round complexity of secure protocols (extended abstract), in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 13\u201317, 1990, Baltimore, Maryland, USA (1990), pp. 503\u2013513"},{"key":"9464_CR8","doi-asserted-by":"crossref","unstructured":"D. Bogdanov, S. Laur, J. Willemson, Sharemind: A framework for fast privacy-preserving computations, in European Symposium on Research in Computer Security (2008), pp. 192\u2013206","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"9464_CR9","doi-asserted-by":"crossref","unstructured":"D. Bogdanov, P. Laud, J. Randmets, Domain-polymorphic language for privacy-preserving applications, in Proceedings of the First ACM Workshop on Language Support for Privacy-Enhancing Technologies (2013), pp. 23\u201326","DOI":"10.1145\/2517872.2517875"},{"key":"9464_CR10","doi-asserted-by":"crossref","unstructured":"D. Bogdanov, R. Talviste, J. Willemson, Deploying secure multi-party computation for financial data analysis, in International Conference on Financial Cryptography and Data Security (2012), pp. 57\u201364","DOI":"10.1007\/978-3-642-32946-3_5"},{"key":"9464_CR11","doi-asserted-by":"crossref","unstructured":"C. Boura, I. Chillotti, N. Gama, D. Jetchev, S. Peceny, A. Petric, High-precision privacy-preserving real-valued function evaluation, in International Conference on Financial Cryptography and Data Security (2018), pp. 183\u2013202","DOI":"10.1007\/978-3-662-58387-6_10"},{"key":"9464_CR12","doi-asserted-by":"crossref","unstructured":"E. Boyle, N. Gilboa, Y. Ishai, A. Nof, Sublinear GMW-style compiler for MPC with preprocessing, in Annual International Cryptology Conference (2021), pp. 457\u2013485","DOI":"10.1007\/978-3-030-84245-1_16"},{"key":"9464_CR13","doi-asserted-by":"crossref","unstructured":"O. Catrina, A. Saxena, Secure computation with fixed-point numbers, in International Conference on Financial Cryptography and Data Security (2010), pp. 35\u201350","DOI":"10.1007\/978-3-642-14577-3_6"},{"issue":"05","key":"9464_CR14","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1142\/S0129626497000292","volume":"07","author":"C Chang","year":"1997","unstructured":"Chang, C., Melhem, R.: Arbitrary size benes networks. Parallel Processing Letters 07 (05), 279\u2013284 (1997)","journal-title":"Parallel Process. Lett."},{"key":"9464_CR15","unstructured":"K. Cheng, T. Fan, Y. Jin, Y. Liu, T. Chen, Q. Yang, Secureboost: A lossless federated learning framework. arXiv:1901.08755 (2019)"},{"key":"9464_CR16","first-page":"695","volume":"2019","author":"K Chida","year":"2019","unstructured":"Chida, K., Hamada, K., Ikarashi, D., Kikuchi, R., Kiribuchi, N., Pinkas, B.: An efficient secure three-party sorting protocol with an honest majority. IACR Cryptol. ePrint Arch. 2019, \u00a0695 (2019)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"6","key":"9464_CR17","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1038\/nbt.4108","volume":"36","author":"H Cho","year":"2018","unstructured":"Cho, H., Wu, D.J., Berger, B.: Secure genome-wide association analysis using multiparty computation. Nature biotechnology 36(6), 547\u2013551 (2018)","journal-title":"Nat. Biotechnol."},{"key":"9464_CR18","unstructured":"H. Corrigan-Gibbs, D. Boneh, Prio: Private, robust, and scalable computation of aggregate statistics, in A. Akella, J. Howell (eds.) 14th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2017, Boston, MA, USA, March 27\u201329, 2017 (2017), pp. 259\u2013282"},{"key":"9464_CR19","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damg\u00e5rd, D. Escudero, P. Scholl, C. Xing, SPD$$\\mathbb{Z} _{2^k}$$: Efficient mpc mod $$2^k$$ for dishonest majority, in Advances in Cryptology \u2013 CRYPTO 2018, pp. 769\u2013798","DOI":"10.1007\/978-3-319-96881-0_26"},{"key":"9464_CR20","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, V. Pastro, N. Smart, S. Zakarias, Multiparty computation from somewhat homomorphic encryption, in Annual Cryptology Conference (2012), pp. 643\u2013662","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"9464_CR21","doi-asserted-by":"crossref","unstructured":"D. Demmler, T. Schneider, M. Zohner, ABY - A framework for efficient mixed-protocol secure two-party computation, in 22nd Annual Network and Distributed System Security Symposium (NDSS, 2015)","DOI":"10.14722\/ndss.2015.23113"},{"key":"9464_CR22","doi-asserted-by":"crossref","unstructured":"D. Escudero, S. Ghosh, M. Keller, R. Rachuri, P. Scholl, Improved primitives for MPC over mixed arithmetic-binary circuits, in 40th Annual International Cryptology Conference, CRYPTO. Lecture Notes in Computer Science, vol. 12171 (2020), pp. 823\u2013852","DOI":"10.1007\/978-3-030-56880-1_29"},{"key":"9464_CR23","doi-asserted-by":"crossref","unstructured":"Z. Feng, H. Xiong, C. Song, S. Yang, B. Zhao, L. Wang, Z. Chen, S. Yang, L. Liu, J. Huan, Securegbm: Secure multi-party gradient boosting, in 2019 IEEE International Conference on Big Data (Big Data) (2019), pp. 1312\u20131321","DOI":"10.1109\/BigData47090.2019.9006000"},{"key":"9464_CR24","doi-asserted-by":"crossref","unstructured":"J. Furukawa, Y. Lindell, A. Nof, O. Weinstein, High-throughput secure three-party computation for malicious adversaries and an honest majority, in J.S. Coron, J.B. Nielsen (eds.) Advances in Cryptology \u2013 EUROCRYPT 2017 (Cham, 2017), pp. 225\u2013255","DOI":"10.1007\/978-3-319-56614-6_8"},{"key":"9464_CR25","unstructured":"I. Giacomelli, J. Madsen, C. Orlandi, ZKBoo: Faster Zero-Knowledge for Boolean Circuits, in USENIX Security Symposium, vol.\u00a016 (2016)"},{"key":"9464_CR26","unstructured":"R. Gilad-Bachrach, N. Dowlin, K. Laine, K. Lauter, M. Naehrig, J. Wernsing, Cryptonets: Applying neural networks to encrypted data with high throughput and accuracy, in International Conference on Machine Learning (2016), pp. 201\u2013210"},{"key":"9464_CR27","unstructured":"R.E. Goldschmidt, Applications of division by convergence. Ph.D. thesis, Massachusetts Institute of Technology (1964)"},{"key":"9464_CR28","doi-asserted-by":"crossref","unstructured":"K. Hamada, R. Kikuchi, D. Ikarashi, K. Chida, K. Takahashi, Practically efficient multi-party sorting protocols from comparison sort algorithms, in International Conference on Information Security and Cryptology (2012), pp. 202\u2013216","DOI":"10.1007\/978-3-642-37682-5_15"},{"key":"9464_CR29","unstructured":"D. Harris, A taxonomy of parallel prefix networks, in The Thirty-Seventh Asilomar Conference on Signals, Systems & Computers, 2003, vol.\u00a02 (2003), pp. 2213\u20132217"},{"key":"9464_CR30","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, R. Ostrovsky, A. Sahai, Zero-knowledge from secure multiparty computation, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007 (2007), pp. 21\u201330","DOI":"10.1145\/1250790.1250794"},{"key":"9464_CR31","doi-asserted-by":"crossref","unstructured":"M. Jawurek, F. Kerschbaum, C. Orlandi, Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently, in Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security (2013), pp. 955\u2013966","DOI":"10.1145\/2508859.2516662"},{"key":"9464_CR32","first-page":"122","volume":"2011","author":"KV J\u00f3nsson","year":"2011","unstructured":"J\u00f3nsson, K.V., Kreitz, G., Uddin, M.: Secure multi-party sorting and applications. IACR Cryptol. ePrint Arch. 2011, \u00a0122 (2011)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9464_CR33","unstructured":"C. Juvekar, V. Vaikuntanathan, A. Chandrakasan, GAZELLE: A low latency framework for secure neural network inference, in 27th USENIX Security Symposium (USENIX Security 18) (2018), pp. 1651\u20131669"},{"key":"9464_CR34","doi-asserted-by":"crossref","unstructured":"M. Keller, MP-SPDZ: A versatile framework for multi-party computation, in CCS \u201920: 2020 ACM SIGSAC Conference on Computer and Communications Security (2020), pp. 1575\u20131590","DOI":"10.1145\/3372297.3417872"},{"key":"9464_CR35","doi-asserted-by":"crossref","unstructured":"M. Keller, E. Orsini, P. Scholl, Actively secure OT extension with optimal overhead, in Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part I. Lecture Notes in Computer Science, vol.\u00a09215 (2015), pp. 724\u2013741","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"9464_CR36","doi-asserted-by":"crossref","unstructured":"M. Keller, E. Orsini, P. Scholl, MASCOT: faster malicious arithmetic secure computation with oblivious transfer, in Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (2016), pp. 830\u2013842","DOI":"10.1145\/2976749.2978357"},{"key":"9464_CR37","doi-asserted-by":"crossref","unstructured":"M. Keller, V. Pastro, D. Rotaru, Overdrive: Making SPDZ great again, in EUROCRYPT 2018. Lecture Notes in Computer Science, vol. 10822 (2018), pp. 158\u2013189","DOI":"10.1007\/978-3-319-78372-7_6"},{"key":"9464_CR38","doi-asserted-by":"crossref","unstructured":"M. Keller, P. Scholl, N.P. Smart, .: An architecture for practical actively secure mpc with dishonest majority, in Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security (2013), pp. 549\u2013560","DOI":"10.1145\/2508859.2516744"},{"key":"9464_CR39","doi-asserted-by":"crossref","unstructured":"V. Kolesnikov, T. Schneider, T., Improved garbled circuit: Free XOR gates and applications, in International Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science, vol.\u00a05126 (2008), pp. 486\u2013498","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"9464_CR40","doi-asserted-by":"crossref","unstructured":"J. Liu, M. Juuti, Y. Lu, N. Asokan, Oblivious neural network predictions via minionn transformations, in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (2017), pp. 619\u2013631","DOI":"10.1145\/3133956.3134056"},{"key":"9464_CR41","doi-asserted-by":"crossref","unstructured":"E. Makri, D. Rotaru, F. Vercauteren, S. Wagh, Rabbit: Efficient comparison for secure multi-party computation, in Financial Cryptography and Data Security: 25th International Conference, FC 2021, Virtual Event, March 1\u20135, 2021, Revised Selected Papers, Part I (2021), pp. 249\u2013270","DOI":"10.1007\/978-3-662-64322-8_12"},{"key":"9464_CR42","unstructured":"P. Mohassel, P. Rindal, ABY3: A mixed protocol framework for machine learning, in Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (2018), pp. 35\u201352"},{"issue":"4","key":"9464_CR43","doi-asserted-by":"publisher","first-page":"414","DOI":"10.2478\/popets-2020-0080","volume":"2020","author":"P Mohassel","year":"2020","unstructured":"Mohassel, P., Rosulek, M., Trieu, N.: Practical privacy-preserving k-means clustering. Proceedings on Privacy Enhancing Technologies 2020(4), 414\u2013433 (2020)","journal-title":"Proc. Privacy Enhancing Technol."},{"key":"9464_CR44","doi-asserted-by":"crossref","unstructured":"P. Mohassel, Y. Zhang, SecureML: A system for scalable privacy-preserving machine learning, in 2017 IEEE Symposium on Security and Privacy (SP) (2017), pp. 19\u201338","DOI":"10.1109\/SP.2017.12"},{"key":"9464_CR45","unstructured":"M. Naor, B. Pinkas, R. Sumner, Privacy preserving auctions and mechanism design, in S.I. Feldman, M.P. Wellman (eds.) Proceedings of the First ACM Conference on Electronic Commerce (EC-99), Denver, CO, USA, November 3\u20135, 1999 (1999), pp. 129\u2013139"},{"key":"9464_CR46","doi-asserted-by":"crossref","unstructured":"A. Patra, A. Suresh, BLAZE: blazing fast privacy-preserving machine learning, in 27th Annual Network and Distributed System Security Symposium (NDSS, 2020)","DOI":"10.14722\/ndss.2020.24202"},{"key":"9464_CR47","unstructured":"A. Patra, T. Schneider, A. Suresh, H. Yalame, ABY2. 0: Improved mixed-protocol secure two-party computation, in 30th USENIX Security Symposium (2021)"},{"key":"9464_CR48","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: Machine learning in Python. Journal of Machine Learning Research 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"9464_CR49","doi-asserted-by":"crossref","unstructured":"P. Pullonen, S. Siim, Combining secret sharing and garbled circuits for efficient private IEEE 754 floating-point computations, in International Conference on Financial Cryptography and Data Security (2015), pp. 172\u2013183","DOI":"10.1007\/978-3-662-48051-9_13"},{"key":"9464_CR50","doi-asserted-by":"crossref","unstructured":"D. Rathee, A. Bhattacharya, R. Sharma, D. Gupta, N. Chandran, A. Rastogi, Secfloat: Accurate floating-point meets secure 2-party computation, in 2022 IEEE Symposium on Security and Privacy (SP) (2022), pp. 576\u2013595","DOI":"10.1109\/SP46214.2022.9833697"},{"key":"9464_CR51","doi-asserted-by":"crossref","unstructured":"D. Rathee, M. Rathee, R.K.K. Goli, D. Gupta, R. Sharma, N. Chandran, A. Rastogi, Sirnn: A math library for secure RNN inference, in 2021 IEEE Symposium on Security and Privacy (SP) (2021), pp. 1003\u20131020","DOI":"10.1109\/SP40001.2021.00086"},{"key":"9464_CR52","doi-asserted-by":"crossref","unstructured":"M.S. Riazi, C. Weinert, O. Tkachenko, E.M. Songhori, T. Schneider, F. Koushanfar, Chameleon: A hybrid secure computation framework for machine learning applications, in Proceedings of the 2018 on Asia Conference on Computer and Communications Security (2018), pp. 707\u2013721","DOI":"10.1145\/3196494.3196522"},{"key":"9464_CR53","doi-asserted-by":"crossref","unstructured":"D. Rotaru, T. Wood, Marbled circuits: Mixing arithmetic and Boolean circuits with active security, in Progress in Cryptology\u2013INDOCRYPT 2019: 20th International Conference on Cryptology in India, Hyderabad, India, December 15\u201318, 2019, Proceedings (2019), pp. 227\u2013249","DOI":"10.1007\/978-3-030-35423-7_12"},{"issue":"3","key":"9464_CR54","doi-asserted-by":"publisher","first-page":"26","DOI":"10.2478\/popets-2019-0035","volume":"2019","author":"S Wagh","year":"2019","unstructured":"Wagh, S., Gupta, D., Chandran, N.: SecureNN: 3-party secure computation for neural network training. Proceedings on Privacy Enhancing Technologies 2019(3), 26\u201349 (2019)","journal-title":"Proc. Privacy Enhancing Technol."},{"key":"9464_CR55","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/321439.321449","volume":"15","author":"A Waksman","year":"1968","unstructured":"Waksman, A.: A permutation network. Journal of the ACM 15:159\u2013163 (1968)","journal-title":"J. ACM"},{"key":"9464_CR56","doi-asserted-by":"crossref","unstructured":"A. Yao, How to generate and exchange secrets (extended abstract), in 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27\u201329 October 1986 (1986), pp. 162\u2013167","DOI":"10.1109\/SFCS.1986.25"},{"key":"9464_CR57","doi-asserted-by":"crossref","unstructured":"S. Zahur, M. Rosulek, D. Evans, Two halves make a whole, in Annual International Conference on the Theory and Applications of Cryptographic Techniques (2015), pp. 220\u2013250","DOI":"10.1007\/978-3-662-46803-6_8"},{"key":"9464_CR58","unstructured":"W. Zheng, R. Deng, W. Chen, R.A. Popa, A, Panda, I. Stoica, Cerebro: A platform for multi-party cryptographic collaborative learning, in 30th USENIX Security Symposium (2021)"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09464-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-023-09464-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09464-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T16:13:23Z","timestamp":1691597603000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-023-09464-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7]]},"references-count":58,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["9464"],"URL":"https:\/\/doi.org\/10.1007\/s00145-023-09464-4","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7]]},"assertion":[{"value":"4 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"31"}}