{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T03:22:24Z","timestamp":1752549744584,"version":"3.37.3"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T00:00:00Z","timestamp":1668297600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T00:00:00Z","timestamp":1668297600000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10623-022-01134-z","type":"journal-article","created":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T11:02:51Z","timestamp":1668337371000},"page":"1111-1151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4284-3319","authenticated-orcid":false,"given":"Daniel","family":"Augot","sequence":"first","affiliation":[]},{"given":"Sarah","family":"Bordage","sequence":"additional","affiliation":[]},{"given":"Jade","family":"Nardi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,13]]},"reference":[{"key":"1134_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-45198-3_17","volume-title":"Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques","author":"N Alon","year":"2003","unstructured":"Alon N., Kaufman T., Krivelevich M., Litsyn S., Ron D.: Testing low-degree polynomials over GF(2). In: Arora S., Jansen K., Rolim J.D.P., Sahai A. (eds.) Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, vol. 2764, pp. 188\u2013199. Lecture Notes in Computer Science. Springer, Berlin (2003)."},{"issue":"11","key":"1134_CR2","doi-asserted-by":"publisher","first-page":"4032","DOI":"10.1109\/TIT.2005.856958","volume":"51","author":"N Alon","year":"2005","unstructured":"Alon N., Kaufman T., Krivelevich M., Litsyn S., Ron D.: Testing Reed-Muller codes. IEEE Trans. Inf. Theory 51(11), 4032\u20134039 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1134_CR3","doi-asserted-by":"crossref","unstructured":"Ames S., Hazay C., Ishai Y., Venkitasubramaniam M.: Ligero: lightweight sublinear arguments without a trusted setup. In: Thuraisingham B.M., Evans D., Malkin T., Xu D. (eds.) Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30\u2013November 03, 2017, pp. 2087\u20132104. ACM (2017).","DOI":"10.1145\/3133956.3134104"},{"key":"1134_CR4","doi-asserted-by":"publisher","unstructured":"Arora S., Lund C., Motwani R., Sudan M., Szegedy M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501\u2013555 (1998). https:\/\/doi.org\/10.1145\/278298.278306. Extended version of FOCS\u201992.","DOI":"10.1145\/278298.278306."},{"issue":"3","key":"1134_CR5","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00493-003-0025-0","volume":"23","author":"S Arora","year":"2003","unstructured":"Arora S., Sudan M.: Improved low-degree testing and its applications. Combinatorica 23(3), 365\u2013426 (2003).","journal-title":"Combinatorica"},{"key":"1134_CR6","doi-asserted-by":"publisher","unstructured":"Babai L., Fortnow L., Levin L.A., Szegedy M.: Checking computations in polylogarithmic time. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5\u20138, 1991, New Orleans, Louisiana, USA, pp. 21\u201331 (1991). https:\/\/doi.org\/10.1145\/103418.103428.","DOI":"10.1145\/103418.103428"},{"key":"1134_CR7","unstructured":"Babai L., Fortnow L., Lund C.: Non-deterministic exponential time has two-prover interactive protocols. In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22\u201324, 1990, Volume I, pp. 16\u201325. IEEE Computer Society (1990)."},{"key":"1134_CR8","unstructured":"Ben-Sasson E., Bentov I., Horesh Y., Riabzev M.: Fast Reed-Solomon interactive oracle proofs of proximity. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9\u201313, 2018, Prague, Czech Republic, pp. 14:1\u201314:17 (2018)."},{"key":"1134_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E., Bentov I., Horesh Y., Riabzev M.: Scalable zero knowledge with no trusted setup. In: Boldyreva A., Micciancio D. (eds.) Advances in Cryptology\u2014CRYPTO 2019\u201439th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2019, Proceedings, Part III, Lecture Notes in Computer Science, vol. 11694, pp. 701\u2013732. Springer, Berlin (2019).","DOI":"10.1007\/978-3-030-26954-8_23"},{"key":"1134_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E., Carmon D., Ishai Y., Kopparty S., Saraf S.: Proximity gaps for Reed-Solomon codes. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16\u201319, 2020, pp. 900\u2013909. IEEE (2020).","DOI":"10.1109\/FOCS46700.2020.00088"},{"key":"1134_CR11","unstructured":"Ben-Sasson E., Chiesa A., Gabizon A., Riabzev M., Spooner N.: Interactive oracle proofs with constant rate and query complexity. In: 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10\u201314, 2017, Warsaw, Poland, pp. 40:1\u201340:15 (2017)."},{"key":"1134_CR12","doi-asserted-by":"publisher","unstructured":"Ben-Sasson E., Chiesa A., Genkin D., Tromer E.: On the concrete efficiency of probabilistically-checkable proofs. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC \u201913, p. 585\u2013594. Association for Computing Machinery, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2488608.2488681.","DOI":"10.1145\/2488608.2488681"},{"key":"1134_CR13","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E., Chiesa A., Riabzev M., Spooner N., Virza M., Ward N.P.: Aurora: transparent succinct arguments for R1CS. In: Ishai Y., Rijmen V. (eds.) Advances in Cryptology\u2014EUROCRYPT 2019\u201438th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19\u201323, 2019, Proceedings, Part I, Lecture Notes in Computer Science, vol. 11476, pp. 103\u2013128. Springer, Berlin (2019).","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"1134_CR14","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E., Chiesa A., Spooner N.: Interactive oracle proofs. In: Theory of Cryptography\u201414th International Conference, TCC 2016-B, Beijing, China, October 31\u2013November 3, 2016, Proceedings, Part II, pp. 31\u201360 (2016).","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"1134_CR15","unstructured":"Ben-Sasson E., Goldberg L., Kopparty S., Saraf S.: DEEP-FRI: sampling outside the box improves soundness. In: 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12\u201314, 2020, Seattle, Washington, USA, pp. 5:1\u20135:32 (2020)."},{"key":"1134_CR16","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E., Goldreich O., Harsha P., Sudan M., Vadhan S.P.: Robust PCPs of proximity, shorter PCPs and applications to coding. In: Babai L. (ed.) Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13\u201316, 2004, pp. 1\u201310. ACM (2004).","DOI":"10.1145\/1007352.1007361"},{"key":"1134_CR17","unstructured":"Ben-Sasson E., Kopparty S., Saraf S.: Worst-case to average case reductions for the distance to a code. In: 33rd Computational Complexity Conference, CCC 2018, June 22\u201324, 2018, San Diego, CA, USA, pp. 24:1\u201324:23 (2018)."},{"issue":"4","key":"1134_CR18","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1002\/rsa.20120","volume":"28","author":"E Ben-Sasson","year":"2006","unstructured":"Ben-Sasson E., Sudan M.: Robust locally testable codes and products of codes. Random Struct. Algorithms 28(4), 387\u2013402 (2006).","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"1134_CR19","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/050646445","volume":"38","author":"E Ben-Sasson","year":"2008","unstructured":"Ben-Sasson E., Sudan M.: Short PCPs with polylog query complexity. SIAM J. Comput. 38(2), 551\u2013607 (2008).","journal-title":"SIAM J. Comput."},{"key":"1134_CR20","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E., Sudan M., Vadhan S., Wigderson A.: Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC \u201903, pp. 612\u2013621. Association for Computing Machinery, New York, NY, USA (2003).","DOI":"10.1145\/780542.780631"},{"key":"1134_CR21","unstructured":"Bhangale A., Dinur I., Navon I.L.: Cube vs. cube low degree test. In: Papadimitriou C.H. (ed.) 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9\u201311, 2017, Berkeley, CA, USA, LIPIcs, vol.\u00a067, pp. 40:1\u201340:31. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)."},{"key":"1134_CR22","doi-asserted-by":"crossref","unstructured":"Bootle, J., Chiesa, A., Groth, J.: Linear-time arguments with sublinear verification from tensor codes. In: Pass R., Pietrzak K. (eds.) Theory of Cryptography\u201418th International Conference, TCC 2020, Durham, NC, USA, November 16\u201319, 2020, Proceedings, Part II, Lecture Notes in Computer Science, vol. 12551, pp. 19\u201346. Springer (2020).","DOI":"10.1007\/978-3-030-64378-2_2"},{"key":"1134_CR23","unstructured":"Bordage S., Nardi J.: Interactive Oracle proofs of proximity to algebraic geometry codes. Electron. Colloquium Comput. Complex. 27, 165 (2020). https:\/\/eccc.weizmann.ac.il\/report\/2020\/165"},{"key":"1134_CR24","unstructured":"Chiesa A., Manohar P., Shinkar I.: On axis-parallel tests for tensor product codes. In: Jansen K., Rolim J.D.P., Williamson D., Vempala S.S. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2017, August 16\u201318, 2017, Berkeley, CA, USA, LIPIcs, vol.\u00a081, pp. 39:1\u201339:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)."},{"key":"1134_CR25","unstructured":"Dinur I., Reingold O.: Assignment testers: towards a combinatorial proof of the PCP-theorem. In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17\u201319 October 2004, Rome, Italy, Proceedings, pp. 155\u2013164. IEEE Computer Society (2004)."},{"issue":"2","key":"1134_CR26","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/226643.226652","volume":"43","author":"U Feige","year":"1996","unstructured":"Feige U., Goldwasser S., Lov\u00e1sz L., Safra S., Szegedy M.: Interactive proofs and the hardness of approximating cliques. J. ACM 43(2), 268\u2013292 (1996).","journal-title":"J. ACM"},{"key":"1134_CR27","unstructured":"Friedl K., H\u00e1ts\u00e1gi Z., Shen A.: Low-degree tests. In: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201994, pp. 57\u201364. Society for Industrial and Applied Mathematics, USA (1994)."},{"key":"1134_CR28","unstructured":"Gemmell P., Lipton R.J., Rubinfeld R., Sudan M., Wigderson A.: Self-testing\/correcting for polynomials and for approximate functions. In: Koutsougeras C., Vitter J.S. (eds.) Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5\u20138, 1991, New Orleans, Louisiana, USA, pp. 32\u201342. ACM (1991)."},{"key":"1134_CR29","unstructured":"Goldreich O., Sudan M.: Locally testable codes and PCPs of almost-linear length. In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16\u201319 November 2002, Vancouver, BC, Canada, Proceedings, pp. 13\u201322. IEEE Computer Society (2002)."},{"issue":"4","key":"1134_CR30","doi-asserted-by":"publisher","first-page":"1610","DOI":"10.1109\/18.923745","volume":"47","author":"V Guruswami","year":"2001","unstructured":"Guruswami V., Sudan M.: On representations of algebraic-geometry codes. IEEE Trans. Inf. Theory 47(4), 1610\u20131613 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1134_CR31","unstructured":"Jutla C.S., Patthak A.C., Rudra A., Zuckerman D.: Testing low-degree polynomials over prime fields. In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17\u201319 October 2004, Rome, Italy, Proceedings, pp. 423\u2013432. IEEE Computer Society (2004)."},{"key":"1134_CR32","unstructured":"Kalai Y.T., Raz R.: Interactive PCP. In: Aceto L., Damg\u00e5rd I., Goldberg L.A., Halld\u00f3rsson M.M., Ing\u00f3lfsd\u00f3ttir A., Walukiewicz I. (eds.) Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II\u2014Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations, Lecture Notes in Computer Science, vol. 5126, pp. 536\u2013547. Springer (2008)."},{"key":"1134_CR33","unstructured":"Kattis A., Panarin K., Vlasov A.: RedShift: Transparent SNARKs from List Polynomial Commitment IOPs. Cryptology ePrint Archive, Report 2019\/1400 (2019). https:\/\/ia.cr\/2019\/1400."},{"key":"1134_CR34","unstructured":"Kaufman T., Ron D.: Testing polynomials over general fields. In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17\u201319 October 2004, Rome, Italy, Proceedings, pp. 413\u2013422. IEEE Computer Society (2004)."},{"key":"1134_CR35","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1997)."},{"issue":"3\u20134","key":"1134_CR36","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10472-009-9169-y","volume":"56","author":"T Mie","year":"2009","unstructured":"Mie T.: Short PCPPs verifiable in polylogarithmic time with O(1) queries. Ann. Math. Artif. Intell. 56(3\u20134), 313\u2013338 (2009).","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"1134_CR37","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1137\/060656838","volume":"38","author":"D Moshkovitz","year":"2008","unstructured":"Moshkovitz D., Raz R.: Sub-constant error low degree test of almost-linear size. SIAM J. Comput. 38(1), 140\u2013180 (2008).","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1134_CR38","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jsco.1994.1042","volume":"18","author":"VY Pan","year":"1994","unstructured":"Pan V.Y.: Simple multivariate polynomial multiplication. J. Symb. Comput. 18(3), 183\u2013186 (1994).","journal-title":"J. Symb. Comput."},{"key":"1134_CR39","doi-asserted-by":"crossref","unstructured":"Polishchuk A., Spielman D.A.: Nearly-linear size holographic proofs. In: Leighton F.T., Goodrich M.T. (eds.) Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23\u201325 May 1994, Montr\u00e9al, Qu\u00e9bec, Canada, pp. 194\u2013203. ACM (1994).","DOI":"10.1145\/195058.195132"},{"key":"1134_CR40","doi-asserted-by":"crossref","unstructured":"Raz R., Safra S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Leighton F.T., Shor P.W. (eds.) Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4\u20136, 1997, pp. 475\u2013484. ACM (1997).","DOI":"10.1145\/258533.258641"},{"key":"1134_CR41","doi-asserted-by":"crossref","unstructured":"Reingold O., Rothblum G.N., Rothblum R.D.: Constant-round interactive proofs for delegating computation. In: Wichs D., Mansour Y. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18\u201321, 2016, pp. 49\u201362. ACM (2016).","DOI":"10.1145\/2897518.2897652"},{"key":"1134_CR42","doi-asserted-by":"crossref","unstructured":"Ron-Zewi N., Rothblum R.D.: Local proofs approaching the witness length [extended abstract]. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16\u201319, 2020, pp. 846\u2013857. IEEE (2020).","DOI":"10.1109\/FOCS46700.2020.00083"},{"key":"1134_CR43","doi-asserted-by":"crossref","unstructured":"Rothblum G.N., Vadhan S.P., Wigderson A.: Interactive proofs of proximity: delegating computation in sublinear time. In: Boneh D., Roughgarden T., Feigenbaum J. (eds.) Symposium on Theory of Computing Conference, STOC\u201913, Palo Alto, CA, USA, June 1\u20134, 2013, pp. 793\u2013802. ACM (2013).","DOI":"10.1145\/2488608.2488709"},{"key":"1134_CR44","unstructured":"Rubinfeld R., Sudan M.: Self-testing polynomial functions efficiently and over rational domains. In: Frederickson G.N. (ed.) Proceedings of the Third Annual ACM\/SIGACT-SIAM Symposium on Discrete Algorithms, 27\u201329 January 1992, Orlando, Florida, USA, pp. 23\u201332. ACM\/SIAM (1992)."},{"issue":"2","key":"1134_CR45","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R Rubinfeld","year":"1996","unstructured":"Rubinfeld R., Sudan M.: Robust characterizations of polynomials with applications to program testing. SIAM J. Comput. 25(2), 252\u2013271 (1996).","journal-title":"SIAM J. Comput."},{"issue":"4","key":"1134_CR46","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701\u2013717 (1980).","journal-title":"J. ACM"},{"key":"1134_CR47","unstructured":"StarkWare: ethSTARK Documentation. Cryptology ePrint Archive, Report 2021\/582 (2021). https:\/\/ia.cr\/2021\/582."},{"issue":"3","key":"1134_CR48","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1002\/rsa.20498","volume":"46","author":"M Viderman","year":"2015","unstructured":"Viderman M.: A combination of testability and decodability by tensor products. Random Struct. Algorithms 46(3), 572\u2013598 (2015).","journal-title":"Random Struct. Algorithms"},{"key":"1134_CR49","doi-asserted-by":"crossref","unstructured":"Vu V., Setty S.T.V., Blumberg A.J., Walfish M.: A hybrid architecture for interactive verifiable computation. In: 2013 IEEE Symposium on Security and Privacy, SP 2013, Berkeley, CA, USA, May 19\u201322, 2013, pp. 223\u2013237. IEEE Computer Society (2013).","DOI":"10.1109\/SP.2013.48"},{"key":"1134_CR50","doi-asserted-by":"crossref","unstructured":"Zippel R.: Probabilistic algorithms for sparse polynomials. In: Ng E.W. (ed.) Symbolic and Algebraic Computation, EUROSAM \u201979, An International Symposiumon Symbolic and Algebraic Computation, Marseille, France, June 1979, Proceedings, Lecture Notes in Computer Science, vol.\u00a072, pp. 216\u2013226. Springer (1979).","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01134-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01134-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01134-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T18:21:28Z","timestamp":1678472488000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01134-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,13]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1134"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01134-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,11,13]]},"assertion":[{"value":"11 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}