{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T13:17:23Z","timestamp":1725974243509},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T00:00:00Z","timestamp":1665532800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T00:00:00Z","timestamp":1665532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s00037-022-00230-9","type":"journal-article","created":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T19:02:37Z","timestamp":1665601357000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Hitting Set for Orbit of ROABPs"],"prefix":"10.1007","volume":"31","author":[{"given":"Vishwas","family":"Bhargava","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sumanta","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"230_CR1","doi-asserted-by":"crossref","unstructured":"Manindra Agrawal, Rohit Gurjar, Arpita Korwar & Nitin\nSaxena (2015). Hitting-Sets for ROABP and Sum of Set-Multilinear\nCircuits. SIAM Journal on Computing 44(3), 669\u2013697.","DOI":"10.1137\/140975103"},{"key":"230_CR2","doi-asserted-by":"crossref","unstructured":"Manindra Agrawal, Neeraj Kayal & Nitin Saxena (2004).\nPRIMES is in P. Annals of mathematics 781\u2013793.","DOI":"10.4007\/annals.2004.160.781"},{"key":"230_CR3","doi-asserted-by":"crossref","unstructured":"Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi\n& Nitin Saxena (2012). Jacobian hits circuits: hitting-sets, lower\nbounds for depth-D occur-k formulas & depth-3 transcendence degreek\ncircuits. In STOC, 599\u2013614.","DOI":"10.1145\/2213977.2214033"},{"key":"230_CR4","doi-asserted-by":"crossref","unstructured":"Manindra Agrawal, Chandan Saha & Nitin Saxena (2013).\nQuasi-polynomial hitting-set for set-depth-\u0394 formulas. In Symposium\non Theory of Computing Conference, STOC\u201913, Palo Alto, CA, USA,\nJune 1-4, 2013, 321\u2013330.","DOI":"10.1145\/2488608.2488649"},{"key":"230_CR5","doi-asserted-by":"crossref","unstructured":"Malte Beecken, Johannes Mittmann & Nitin Saxena (2013).\nAlgebraic Independence and Blackbox Identity Testing. Inf. Comput.\n222, 2\u201319. (Conference version in ICALP 2011).","DOI":"10.1016\/j.ic.2012.10.004"},{"key":"230_CR6","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or & Prasoon Tiwari (1988). A Deterministic Algorithm\nfor Sparse Multivariate Polynominal Interpolation (Extended Abstract).\nIn Proceedings of the 20th Annual ACM Symposium on Theory\nof Computing, May 2-4, 1988, Chicago, Illinois, USA, 301\u2013309. URL https:\/\/doi.org\/10.1145\/62212.62241.","DOI":"10.1145\/62212.62241"},{"key":"230_CR7","unstructured":"Chi-Ning Chou, Mrinal Kumar & Noam Solomon (2018). Hardness\nvs Randomness for Bounded Depth Arithmetic Circuits. In 33rd\nComputational Complexity Conference, CCC 2018, June 22-24, 2018,\nSan Diego, CA, USA, 13:1\u201313:17. URL  https:\/\/doi.org\/10.4230\/LIPIcs.CCC.2018.13."},{"key":"230_CR8","unstructured":"David A. Cox, John Little & Donal O\u2019Shea (2015). Ideals, Varieties,\nand Algorithms: An Introduction to Computational Algebraic\nGeometry and Commutative Algebra. Springer Publishing Company,\nIncorporated, 4th edition. ISBN 3319167200, 9783319167206."},{"key":"230_CR9","doi-asserted-by":"crossref","unstructured":"Richard A. Demillo & Richard J. Lipton (1978). A probabilistic\nremark on algebraic program testing. Information Processing Letters\n7(4), 193 \u2013 195. ISSN 0020-0190.","DOI":"10.1016\/0020-0190(78)90067-4"},{"key":"230_CR10","doi-asserted-by":"crossref","unstructured":"Zeev Dvir, Rafael Mendes de Oliveira & Amir Shpilka (2014).\nTesting Equivalence of Polynomials under Shifts. In 41st International\nColloquium on Automata, Languages, and Programming, Part I, volume\n8572 of Lecture Notes in Computer Science, 417\u2013428.","DOI":"10.1007\/978-3-662-43948-7_35"},{"key":"230_CR11","doi-asserted-by":"crossref","unstructured":"Zeev Dvir & Amir Shpilka (2007). Locally Decodable Codes with\nTwo Queries and Polynomial Identity Testing for Depth 3 Circuits.\nSIAM J. Comput. 36(5), 1404\u20131434. URL https:\/\/doi.org\/10.1137\/05063605X.","DOI":"10.1137\/05063605X"},{"key":"230_CR12","doi-asserted-by":"crossref","unstructured":"Zeev Dvir, Amir Shpilka & Amir Yehudayoff (2009). Hardness-\nRandomness Tradeoffs for Bounded Depth Arithmetic Circuits. SIAM\nJ. Comput. 39(4), 1279\u20131293. URL https:\/\/doi.org\/10.1137\/080735850.","DOI":"10.1137\/080735850"},{"key":"230_CR13","doi-asserted-by":"crossref","unstructured":"Stephen A. Fenner, Rohit Gurjar & Thomas Thierauf (2016).\nBipartite perfect matching is in quasi-NC. In 48th Annual ACM Symposium\non Theory of Computing, 754\u2013763.","DOI":"10.1145\/2897518.2897564"},{"key":"230_CR14","doi-asserted-by":"crossref","unstructured":"Michael A Forbes (2015). Deterministic divisibility testing\nvia shifted partial derivatives. Available at: https:\/\/www.ias.edu\/sites\/default\/files\/math\/csdm\/14-15\/Forbes2015 pdf. The conference version is accepted in 56th Annual Symposium on\nFoundations of Computer Science (FOCS 2015).","DOI":"10.1109\/FOCS.2015.35"},{"key":"230_CR15","unstructured":"Michael A. Forbes, Sumanta Ghosh & Nitin Saxena (2018).\nTowards Blackbox Identity Testing of Log-Variate Circuits. In 45th International Colloquium on Automata, Languages, and Programming,\nICALP 2018, July 9-13, 2018, Prague, Czech Republic, 54:1\u201354:16."},{"key":"230_CR16","doi-asserted-by":"crossref","unstructured":"Michael A. Forbes, Ramprasad Saptharishi & Amir Shpilka\n(2013). Pseudorandomness for Multilinear Read-Once Algebraic\nBranching Programs, in any Order. Electron. Colloquium Comput.\nComplex. 20, 132. URL http:\/\/eccc.hpi-web.de\/report\/2013\/132.Conference version is accepted in STOC 2014.","DOI":"10.1145\/2591796.2591816"},{"key":"230_CR17","doi-asserted-by":"crossref","unstructured":"Michael A Forbes & Amir Shpilka (2013a). Explicit Noether normalization\nfor simultaneous conjugation via polynomial identity testing.\nIn Approximation, Randomization, and Combinatorial Optimization.\nAlgorithms and Techniques, 527\u2013542. Springer.","DOI":"10.1007\/978-3-642-40328-6_37"},{"key":"230_CR18","doi-asserted-by":"crossref","unstructured":"Michael A. Forbes & Amir Shpilka (2013b). Quasipolynomial-\nTime Identity Testing of Non-commutative and Read-Once Oblivious\nAlgebraic Branching Programs. In 54th Annual IEEE Symposium on\nFoundations of Computer Science, FOCS 2013, 26-29 October, 2013,\nBerkeley, CA, USA, 243\u2013252. IEEE Computer Society. URL https:\/\/doi.org\/10.1109\/FOCS.2013.34.","DOI":"10.1109\/FOCS.2013.34"},{"key":"230_CR19","unstructured":"Zeyu Guo & Rohit Gurjar (2020). Improved Explicit Hitting-Sets\nfor ROABPs. In Approximation, Randomization, and Combinatorial\nOptimization. Algorithms and Techniques, APPROX\/RANDOM 2020,\nAugust 17-19, 2020, Virtual Conference, Jaroslaw Byrka & Raghu\nMeka, editors, volume 176 of LIPIcs, 4:1\u20134:16. Schloss Dagstuhl -\nLeibniz-Zentrum f\u00fcr Informatik. URL https:\/\/doi.org\/10.4230\/LIPIcs.APPROX\/RANDOM.2020.4."},{"key":"230_CR20","doi-asserted-by":"crossref","unstructured":"Zeyu Guo, Mrinal Kumar, Ramprasad Saptharishi & Noam\nSolomon (2019). Derandomization from Algebraic Hardness. Electronic\nColloquium on Computational Complexity (ECCC) 26, 65. URL https:\/\/eccc.weizmann.ac.il\/report\/2019\/065\/.Preliminary versionin FOCS 2019.","DOI":"10.1109\/FOCS.2019.00018"},{"key":"230_CR21","doi-asserted-by":"crossref","unstructured":"Rohit Gurjar, Arpita Korwar & Nitin Saxena (2017). Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs. Theory of Computing 13(2), 1\u201321.","DOI":"10.4086\/toc.2017.v013a002"},{"key":"230_CR22","unstructured":"Rohit Gurjar, Arpita Korwar, Nitin Saxena & Thomas Thierauf (2015). Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs. In 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon,USA, 323\u2013346. URL https:\/\/doi.org\/10.4230\/LIPIcs.CCC.2015.323."},{"key":"230_CR23","doi-asserted-by":"crossref","unstructured":"Rohit Gurjar  & Thomas Thierauf (2017). Linear matroid intersection is in quasi-NC. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal,QC, Canada, June 19-23, 2017, 821\u2013830.","DOI":"10.1145\/3055399.3055440"},{"key":"230_CR24","unstructured":"Joos Heintz  & Claus-Peter Schnorr (1980). Testing Polynomials which Are Easy to Compute (Extended Abstract). In Proceedings of the 12th Annual ACM Symposium on Theory of Computing, April 28-30, 1980, Los Angeles, California, USA, 262\u2013272."},{"key":"230_CR25","doi-asserted-by":"crossref","unstructured":"Valentine Kabanets & Russell Impagliazzo (2004). Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. Computational Complexity 13(1-2), 1\u201346. URL https:\/\/doi.org\/10.1007\/s00037-004-0182-6.Preliminary version in the 35th Annual ACM Symposium on Theory of Computing (STOC), 2003.","DOI":"10.1007\/s00037-004-0182-6"},{"key":"230_CR26","doi-asserted-by":"crossref","unstructured":"Zohar Shay Karnin & Amir Shpilka (2011). Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in. Combinatorica 31(3), 333\u2013364. URL https:\/\/doi.org\/10.1007\/s00493-011-2537-3.","DOI":"10.1007\/s00493-011-2537-3"},{"key":"230_CR27","doi-asserted-by":"crossref","unstructured":"Neeraj Kayal & Shubhangi Saraf (2009). Blackbox Polynomial Identity Testing for Depth 3 Circuits. In 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009,Atlanta, Georgia, USA, 198\u2013207. URL https:\/\/doi.org\/10.1109\/FOCS.2009.67.","DOI":"10.1109\/FOCS.2009.67"},{"key":"230_CR28","doi-asserted-by":"crossref","unstructured":"Neeraj Kayal &  Nitin Saxena (2007). Polynomial Identity Testing for Depth 3 Circuits. Computational Complexity 16(2), 115\u2013138.","DOI":"10.1007\/s00037-007-0226-9"},{"key":"230_CR29","doi-asserted-by":"crossref","unstructured":"Adam R. Klivans  & Daniel A. Spielman (2001). Randomness efficient identity testing of multivariate polynomials. In Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001,Heraklion, Crete, Greece, 216\u2013223. URL https:\/\/doi.org\/10.1145\/380752.380801.","DOI":"10.1145\/380752.380801"},{"key":"230_CR30","doi-asserted-by":"crossref","unstructured":"Swastik Kopparty, Shubhangi Saraf  & Amir Shpilka (2014).Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. In IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13,2014, 169\u2013180.","DOI":"10.1109\/CCC.2014.25"},{"key":"230_CR31","doi-asserted-by":"crossref","unstructured":"Mrinal Kumar& Shubhangi Saraf (2017). Arithmetic Circuits with Locally Low Algebraic Rank. Theory of Computing 13(1), 1\u201333. URL https:\/\/doi.org\/10.4086\/toc.2017.v013a006.Preliminary version in the 31st Conference on Computational Complexity (CCC), 2016.","DOI":"10.4086\/toc.2017.v013a006"},{"key":"230_CR32","unstructured":"Mrinal Kumar & Ben Lee Volk (2021). A Polynomial Degree Bound on Equations for Non-Rigid Matrices and Small Linear Circuits.In 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6-8, 2021, Virtual Conference, James R. Lee, editor,volume 185 of LIPIcs, 9:1\u20139:9. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik. URLhttps:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2021.9."},{"key":"230_CR33","unstructured":"Richard J. Lipton & Nisheeth K. Vishnoi (2003). Deterministic identity testing for multivariate polynomials. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., 756\u2013760."},{"key":"230_CR34","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz (1979). On determinants, matchings, and random algorithms. In FCT, volume 79, 565\u2013574."},{"key":"230_CR35","unstructured":"Dori Medini & Amir Shpilka (2021). Hitting Sets and Reconstruction for Dense Orbits in VPe and \u03a3\u03a0\u03a3 Circuits. CoRR abs\/2102.05632.URLhttps:\/\/arxiv.org\/abs\/2102.05632."},{"key":"230_CR36","unstructured":"Daniel Minahan  &Ilya Volkovich (2017). Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas. In 32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia, Ryan O\u2019Donnell, editor, volume 79 of LIPIcs, 2017, Riga, Latvia, Ryan O\u2019Donnell, editor, volume 79 of LIPIcs, 32:1\u201332:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00a8ur Informatik. URL https:\/\/doi.org\/10.4230\/LIPIcs.CCC.2017.32."},{"key":"230_CR37","doi-asserted-by":"crossref","unstructured":"Ketan D. Mulmuley (2012). Geometric Complexity Theory V:Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether\u2019s Normalization Lemma.In FOCS, 629\u2013638.","DOI":"10.1109\/FOCS.2012.15"},{"key":"230_CR38","doi-asserted-by":"crossref","unstructured":"Noam Nisan (1991). Lower Bounds for Non-Commutative Computation (Extended Abstract). In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5-8, 1991, New Orleans,Louisiana, USA, 410\u2013418. URL https:\/\/doi.org\/10.1145\/103418.103462.","DOI":"10.1145\/103418.103462"},{"key":"230_CR39","unstructured":"Rafael Mendes de Oliveira, Amir Shpilka & Ben Lee Volk (2015). Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. In 30th Conference on Computational Complexity,CCC 2015, June 17-19, 2015, Portland, Oregon, USA, 304\u2013322. URLhttps:\/\/doi.org\/10.4230\/LIPIcs.CCC.2015.304."},{"key":"230_CR40","doi-asserted-by":"crossref","unstructured":"Anurag Pandey, Nitin Saxena & Amit Sinhababu (2018).Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits. Computational Complexity 27(4), 617\u2013670. URL https:\/\/doi.org\/10.1007\/s00037-018-0167-5.Preliminary version in the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS), 2016.","DOI":"10.1007\/s00037-018-0167-5"},{"key":"230_CR41","doi-asserted-by":"crossref","unstructured":"Ran Raz & Amir Shpilka (2005). Deterministic polynomial identity testing in non-commutative models. Computational Complexity 14(1),1\u201319. URL https:\/\/doi.org\/10.1007\/s00037-005-0188-8","DOI":"10.1007\/s00037-005-0188-8"},{"key":"230_CR42","doi-asserted-by":"crossref","unstructured":"Chandan Saha, Ramprasad Saptharishi & Nitin Saxena (2013).A Case of Depth-3 Identity Testing, Sparse Factorization and Duality.Computational Complexity 22(1), 39\u201369.","DOI":"10.1007\/s00037-012-0054-4"},{"key":"230_CR43","unstructured":"Chandan Saha & Bhargav Thankey (2021). Hitting Sets for Orbits of Circuit Classes and Polynomial Families. Electron. Colloquium Comput.Complex. 28, 15. URL https:\/\/eccc.weizmann.ac.il\/report\/2021\/015.Conference version is accepted in RANDOM 2021."},{"key":"230_CR44","doi-asserted-by":"crossref","unstructured":"Nitin Saxena (2008). Diagonal Circuit Identity Testing and Lower Bounds. In ICALP, volume 5125 of Lecture Notes in Computer Science,60\u201371. Springer.","DOI":"10.1007\/978-3-540-70575-8_6"},{"key":"230_CR45","unstructured":"Nitin Saxena (2009). Progress on Polynomial Identity Testing. Bulletinof the EATCS 99, 49\u201379."},{"key":"230_CR46","doi-asserted-by":"crossref","unstructured":"Nitin Saxena & C. Seshadhri (2011). An Almost Optimal Rank Bound for Depth-3 Identities. SIAM J. Comput. 40(1), 200\u2013224. URL https:\/\/doi.org\/10.1137\/090770679.","DOI":"10.1137\/090770679"},{"key":"230_CR47","doi-asserted-by":"crossref","unstructured":"Nitin Saxena & C. Seshadhri (2012). Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn\u2019t Matter.SIAM Journal on Computing 41(5), 1285\u20131298.","DOI":"10.1137\/10848232"},{"key":"230_CR48","doi-asserted-by":"crossref","unstructured":"Nitin Saxena &  Comandur Seshadhri (2013). From sylvester-gallai configurations to rank bounds: Improved blackbox identity test for depth-3 circuits. J. ACM 60(5), 33:1\u201333:33. URL https:\/\/doi.org\/10.1145\/2528403.","DOI":"10.1145\/2528403"},{"key":"230_CR49","doi-asserted-by":"crossref","unstructured":"Jacob T. Schwartz (1980). Fast Probabilistic Algorithms for Verification of Polynomial Identities. J. ACM 27(4), 701\u2013717. ISSN 0004-5411.","DOI":"10.1145\/322217.322225"},{"key":"230_CR50","doi-asserted-by":"crossref","unstructured":"Adi Shamir (1990). IP=PSPACE. In 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, 11\u201315. URL https:\/\/doi.org\/10.1109\/FSCS.1990.89519.","DOI":"10.1109\/FSCS.1990.89519"},{"key":"230_CR51","doi-asserted-by":"crossref","unstructured":"Amir Shpilka & Ilya Volkovich (2015). Read-once polynomial identity testing. Comput. Complex. 24(3), 477\u2013532. URL https:\/\/doi.org\/10.1007\/s00037-015-0105-8.","DOI":"10.1007\/s00037-015-0105-8"},{"key":"230_CR52","doi-asserted-by":"crossref","unstructured":"Amir Shpilka &  Amir Yehudayoff (2010). Arithmetic Circuits: A survey of recent results and open questions. Foundations and Trends in Theoretical Computer Science 5(3-4), 207\u2013388.","DOI":"10.1561\/0400000039"},{"key":"230_CR53","doi-asserted-by":"crossref","unstructured":"Ola Svensson & Jakub Tarnawski (2017). The Matching Problem in General Graphs Is in Quasi-NC. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA,October 15-17, 2017, 696\u2013707. URL https:\/\/doi.org\/10.1109\/FOCS.2017.70.","DOI":"10.1109\/FOCS.2017.70"},{"key":"230_CR54","doi-asserted-by":"crossref","unstructured":"William T. Tutte (1947). The Factorization of Linear Graphs. Journal of the London Mathematical Society s1-22(2), 107\u2013111.","DOI":"10.1112\/jlms\/s1-22.2.107"},{"key":"230_CR55","doi-asserted-by":"crossref","unstructured":"Jiang Zeng (1993). A bijective proof of Muir\u2019s identity and the Cauchy-Binet formula. Linear Algebra and its Applications 184, 79\u201382.","DOI":"10.1016\/0024-3795(93)90371-T"},{"key":"230_CR56","doi-asserted-by":"crossref","unstructured":"Richard Zippel (1979). Probabilistic Algorithms for Sparse Polynomials.In Proceedings of the International Symposium on Symbolic and Algebraic Computation, EUROSAM \u201979, 216\u2013226. ISBN 3-540-09519-5.","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-022-00230-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00037-022-00230-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-022-00230-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T15:28:45Z","timestamp":1669303725000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00037-022-00230-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,12]]},"references-count":56,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["230"],"URL":"https:\/\/doi.org\/10.1007\/s00037-022-00230-9","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,12]]},"assertion":[{"value":"17 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"15"}}