{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T03:43:46Z","timestamp":1783568626122,"version":"3.55.0"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,5,14]],"date-time":"2018-05-14T00:00:00Z","timestamp":1526256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s00037-018-0167-5","type":"journal-article","created":{"date-parts":[[2018,5,14]],"date-time":"2018-05-14T08:33:31Z","timestamp":1526286811000},"page":"617-670","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits"],"prefix":"10.1007","volume":"27","author":[{"given":"Anurag","family":"Pandey","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nitin","family":"Saxena","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amit","family":"Sinhababu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,5,14]]},"reference":[{"key":"167_CR1","unstructured":"L. M. Adleman & H. W. Lenstra (1986). Finding irreducible polynomials over finite fields. In STOC, 350\u2013355"},{"key":"167_CR2","doi-asserted-by":"crossref","unstructured":"Manindra Agrawal, Sumanta Ghosh & Nitin Saxena (2017). Bootstrapping variables in algebraic circuits. Technical report, https:\/\/www.cse.iitk.ac.in\/users\/nitin\/research.html . (To appear in 50th ACM Symposium on Theory of Computing (STOC), 2018)","DOI":"10.1145\/3188745.3188762"},{"key":"#cr-split#-167_CR3.1","doi-asserted-by":"crossref","unstructured":"Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi & Nitin Saxena (2016). Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits. SIAM J. Comput.","DOI":"10.1137\/130910725"},{"key":"#cr-split#-167_CR3.2","unstructured":"45(4), 1533-1562. (Special issue for STOC 2011)"},{"key":"167_CR4","doi-asserted-by":"crossref","unstructured":"Manindra Agrawal, Chandan Saha & Nitin Saxena (2013). Quasi-polynomial hitting-set for set-depth- $$\\Delta $$ \u0394 formulas. In Proceedings of the forty-fifth annual ACM symposium on Theory of computing, 321\u2013330. ACM","DOI":"10.1145\/2488608.2488649"},{"key":"167_CR5","unstructured":"Manindra Agrawal & V. Vinay (2008). Arithmetic Circuits: A Chasm at Depth Four. In 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS, 67\u201375"},{"issue":"3","key":"167_CR6","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0304-3975(83)90110-X","volume":"22","author":"W Bauer","year":"1983","unstructured":"Bauer, W., Strassen, V.: The complexity of partial derivatives. Theoretical Computer Science 22(3), 317\u2013330 (1983)","journal-title":"Theoretical Computer Science"},{"key":"167_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.ic.2012.10.004","volume":"222","author":"M. Beecken","year":"2013","unstructured":"M. Beecken, J. Mittmann & N. Saxena (2013). Algebraic Independence and Blackbox Identity Testing. Inf. Comput. 222, 2\u201319. (Special issue for ICALP 2011)","journal-title":"Information and Computation"},{"key":"167_CR8","unstructured":"Dario A Bini & Victor Pan (2012). Polynomial and matrix computations: fundamental algorithms. Springer Science & Business Media"},{"key":"167_CR9","unstructured":"Nicolas Bourbaki (2013). Algebra II: Chapters 4-7. Springer Science & Business Media"},{"key":"167_CR10","unstructured":"Peter B\u00fcrgisser, Michael Clausen & Amin Shokrollahi (2013). Algebraic complexity theory, volume 315. Springer Science & Business Media"},{"key":"167_CR11","unstructured":"David A Cox, John Little & Donal O\u2019Shea (2007). Ideals, varieties, and algorithms. Undergraduate Texts in Mathematics"},{"issue":"4","key":"167_CR12","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1137\/0205040","volume":"5","author":"L. Csanky","year":"1976","unstructured":"Laszlo Csanky (1976). Fast parallel matrix inversion algorithms. SIAM Journal on Computing 5(4), 618\u2013623. (Conference version in FOCS 1975)","journal-title":"SIAM Journal on Computing"},{"key":"167_CR13","doi-asserted-by":"crossref","unstructured":"Radu Curticapean (2013). Counting Matchings of Size k Is #W[1]-Hard. In Automata, Languages, and Programming, 352\u2013363. Springer","DOI":"10.1007\/978-3-642-39206-1_30"},{"issue":"4","key":"167_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0020-0190(78)90067-4","volume":"7","author":"Richard A DeMillo","year":"1978","unstructured":"DeMillo, Richard A., Lipton, Richard J.: A probabilistic remark on algebraic program testing. Information Processing Letters 7(4), 193\u2013195 (1978)","journal-title":"Information Processing Letters"},{"key":"167_CR15","unstructured":"Pranjal Dutta, Nitin Saxena & Amit Sinhababu (2017). Discovering the roots: Uniform closure results for algebraic classes under factoring. Technical report, https:\/\/www.cse.iitk.ac.in\/users\/nitin\/research.html . (To appear in 50th ACM Symposium on Theory of Computing (STOC), 2018)"},{"issue":"1","key":"167_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-009-0258-4","volume":"18","author":"Zeev Dvir","year":"2009","unstructured":"Z. Dvir, A. Gabizon & A. Wigderson (2009a). Extractors and rank extractors for polynomial sources. Comput. Complex. 18(1), 1\u201358. (Conference version in FOCS 2007)","journal-title":"computational complexity"},{"key":"167_CR17","unstructured":"Z. Dvir, D. Gutfreund, G.N. Rothblum & S.P. Vadhan (2011). On Approximating the Entropy of Polynomial Mappings. In Innovations in Computer Science (ICS), 460\u2013475"},{"key":"167_CR18","doi-asserted-by":"crossref","unstructured":"Zeev Dvir (2009). Extractors for Varieties. In Proceedings of the 24th IEEE Conference on Computational Complexity (CCC), 102\u2013113","DOI":"10.1109\/CCC.2009.7"},{"issue":"6","key":"167_CR19","doi-asserted-by":"publisher","first-page":"2305","DOI":"10.1137\/100783704","volume":"42","author":"Zeev Dvir","year":"2013","unstructured":"Zeev Dvir, Swastik Kopparty, Shubhangi Saraf & Madhu Sudan (2013). Extensions to the method of multiplicities, with applications to Kakeya sets and mergers. SIAM Journal on Computing 42(6), 2305\u20132328. (Conference version in FOCS 2009)","journal-title":"SIAM Journal on Computing"},{"key":"167_CR20","doi-asserted-by":"crossref","unstructured":"Zeev Dvir, Amir Shpilka & Amir Yehudayoff (2009b). Hardness-randomness tradeoffs for bounded depth arithmetic circuits. SIAM Journal on Computing 39(4), 1279\u20131293. (Conference version in STOC 2008)","DOI":"10.1137\/080735850"},{"issue":"3","key":"167_CR21","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1006\/eujc.1993.1022","volume":"14","author":"Richard Ehrenborg & Gian-Carlo Rota","year":"1993","unstructured":"Richard Ehrenborg & Gian-Carlo Rota: Apolarity and canonical forms for homogeneous polynomials. European Journal of Combinatorics 14(3), 157\u2013181 (1993)","journal-title":"European Journal of Combinatorics"},{"key":"167_CR22","unstructured":"Michael A Forbes (2014). Polynomial identity testing of read-once oblivious algebraic branching programs. Ph.D. thesis, Massachusetts Institute of Technology"},{"key":"167_CR23","doi-asserted-by":"crossref","unstructured":"Michael A Forbes (2015). Deterministic divisibility testing via shifted partial derivatives. In Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on, 451\u2013465. IEEE","DOI":"10.1109\/FOCS.2015.35"},{"key":"167_CR24","unstructured":"Krister Forsman (1992). Two Themes in Commutative Algebra: Algebraic Dependence and K\u00e4hler Differentials"},{"key":"167_CR25","doi-asserted-by":"crossref","unstructured":"Keith O Geddes, Stephen R Czapor & George Labahn (1992). Algorithms for computer algebra. Springer Science & Business Media","DOI":"10.1007\/b102438"},{"key":"167_CR26","first-page":"19","volume":"25","author":"Zeyu Guo","year":"2018","unstructured":"Guo, Zeyu, Saxena, Nitin, Sinhababu, Amit: Algebraic dependencies and PSPACE algorithms in approximative complexity. Electronic Colloquium on Computational Complexity (ECCC) 25, 19 (2018). (To appear in Computational Complexity Conference (CCC), 2018).","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"167_CR27","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1109\/FOCS.2013.68","volume-title":"54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26\u201329 October, 2013","author":"Ankit Gupta","year":"2013","unstructured":"Gupta, Ankit, Kamath, Pritish, Kayal, Neeraj, Saptharishi, Ramprasad: Arithmetic Circuits: A Chasm at Depth Three. 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26\u201329 October, 2013, pp. 578\u2013587. CA, USA, Berkeley (2013)"},{"key":"167_CR28","first-page":"215","volume":"177","author":"Helmut Hasse","year":"1937","unstructured":"Hasse, Helmut, Schmidt, Friedrich K.: Noch eine Begr\u00fcndung der Theorie der h\u00f6heren Differentialquotienten in einem algebraischen Funktionenk\u00f6rper einer Unbestimmten. (Nach einer brieflichen Mitteilung von F.K.Schmidt in Jena). Journal f\u00fcr die reine und angewandte Mathematik 177, 215\u2013223 (1937)","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"167_CR29","doi-asserted-by":"crossref","unstructured":"L. Illusie (1994). Crystalline cohomology. In Proc. Sympos. Pure Math., volume 55, 43\u201370. Motives (Seattle, WA, 1991)","DOI":"10.1090\/pspum\/055.1\/1265522"},{"key":"167_CR30","unstructured":"I Martin Isaacs (1994). Algebra: a graduate course, volume 100. American Mathematical Soc"},{"issue":"4","key":"167_CR31","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1515\/crll.1841.22.319","volume":"22","author":"CGJ Jacobi","year":"1841","unstructured":"Jacobi, C.G.J.: De determinantibus functionalibus. J. Reine Angew. Math. 22(4), 319\u2013359 (1841)","journal-title":"J. Reine Angew. Math."},{"key":"167_CR32","unstructured":"Nathan Jacobson (2012). Lectures in Abstract Algebra: III. Theory of Fields and Galois Theory, volume 32. Springer Science & Business Media"},{"issue":"3","key":"167_CR33","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1137\/0214050","volume":"14","author":"K. A. Kalorkoti","year":"1985","unstructured":"K. A. Kalorkoti (1985). A Lower Bound for the Formula Size of Rational Functions. SIAM J. Comp. 14(3), 678\u2013687. (Conference version in ICALP 1982)","journal-title":"SIAM Journal on Computing"},{"key":"167_CR34","doi-asserted-by":"crossref","unstructured":"Erich Kaltofen (1987). Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials. In Proceedings of the nineteenth annual ACM symposium on Theory of computing, 443\u2013452. ACM","DOI":"10.1145\/28395.28443"},{"key":"167_CR35","first-page":"375","volume":"5","author":"Erich Kaltofen","year":"1989","unstructured":"Kaltofen, Erich: Factorization of polynomials given by straight-line programs. Randomness and Computation 5, 375\u2013412 (1989)","journal-title":"Randomness and Computation"},{"key":"167_CR36","doi-asserted-by":"crossref","unstructured":"Erich Kaltofen (2003). Polynomial factorization: a success story. In Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation (ISSAC\u201903), 3\u20134. ACM","DOI":"10.1145\/860854.860857"},{"issue":"3","key":"167_CR37","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0747-7171(08)80015-6","volume":"9","author":"Erich Kaltofen","year":"1990","unstructured":"Kaltofen, Erich, Trager, Barry M.: Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators. Journal of Symbolic Computation 9(3), 301\u2013320 (1990)","journal-title":"Journal of Symbolic Computation"},{"key":"167_CR38","doi-asserted-by":"crossref","unstructured":"N. Kayal (2009). The Complexity of the Annihilating Polynomial. In Proceedings of the 24th Annual IEEE Conference on Computational Complexity (CCC), 184\u2013193","DOI":"10.1109\/CCC.2009.37"},{"key":"167_CR39","doi-asserted-by":"crossref","unstructured":"Neeraj Kayal, Nutan Limaye, Chandan Saha & Srikanth Srinivasan (2014a). An exponential lower bound for homogeneous depth four arithmetic formulas. In Foundations of Computer Science (FOCS), IEEE 55th Annual Symposium on, 61\u201370. IEEE","DOI":"10.1109\/FOCS.2014.15"},{"key":"167_CR40","doi-asserted-by":"crossref","unstructured":"Neeraj Kayal, Chandan Saha & Ramprasad Saptharishi (2014b). A super-polynomial lower bound for regular arithmetic formulas. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing, 146\u2013153. ACM","DOI":"10.1145\/2591796.2591847"},{"key":"167_CR41","doi-asserted-by":"crossref","unstructured":"Gregor Kemper (2010). A course in Commutative Algebra, volume 256. Springer Science & Business Media","DOI":"10.1007\/978-3-642-03545-6"},{"key":"167_CR42","unstructured":"Anthony W Knapp (2007). Advanced algebra. Springer Science & Business Media"},{"key":"167_CR43","doi-asserted-by":"crossref","unstructured":"N. Koblitz (1984). P-adic Numbers, P-adic Analysis, and Zeta-Functions. Springer-Verlag, 2nd edition","DOI":"10.1007\/978-1-4612-1112-9"},{"key":"167_CR44","doi-asserted-by":"crossref","unstructured":"Steven G Krantz & Harold R Parks (2012). The implicit function theorem: history, theory, and applications. Springer Science & Business Media","DOI":"10.1007\/978-1-4614-5981-1_2"},{"key":"167_CR45","unstructured":"Martin Kreuzer & Lorenzo Robbiano (2005). Computational commutative algebra 2. Springer Science & Business Media"},{"key":"167_CR46","unstructured":"Mrinal Kumar & Shubhangi Saraf (2016). Arithmetic Circuits with Locally Low Algebraic Rank. In 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, 34:1\u201334:27"},{"key":"#cr-split#-167_CR47.1","unstructured":"Mrinal Kumar & Shubhangi Saraf (2017). On the Power of Homogeneous Depth 4 Arithmetic Circuits. SIAM J. Comput."},{"key":"#cr-split#-167_CR47.2","unstructured":"46(1), 336-387. (Conference version in FOCS 2014)"},{"issue":"1","key":"167_CR48","doi-asserted-by":"publisher","first-page":"147","DOI":"10.2307\/2045591","volume":"95","author":"Bernt Lindstr\u00f6m","year":"1985","unstructured":"Lindstr\u00f6m, Bernt: On the algebraic characteristic set for a class of matroids. Proceedings of the American Mathematical Society 95(1), 147\u2013151 (1985)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"167_CR49","first-page":"492","volume":"20","author":"M.S. L\u2019vov","year":"1984","unstructured":"M.S. L\u2019vov, : Calculation of invariants of programs interpreted over an integrality domain. Cybernetics and Systems Analysis 20, 492\u2013499 (1984)","journal-title":"Cybernetics and Systems Analysis"},{"key":"167_CR50","unstructured":"Johannes Mittmann (2013). Independence in Algebraic Complexity Theory. Ph.D. thesis, Universit\u00e4ts-und Landesbibliothek Bonn"},{"issue":"7","key":"167_CR51","doi-asserted-by":"publisher","first-page":"3425","DOI":"10.1090\/S0002-9947-2014-06268-5","volume":"366","author":"Johannes Mittmann","year":"2014","unstructured":"Mittmann, Johannes, Saxena, Nitin, Scheiblechner, Peter: Algebraic independence in positive characteristic: A $$p$$ p -adic calculus. Transactions of the American Mathematical Society 366(7), 3425\u20133450 (2014)","journal-title":"Transactions of the American Mathematical Society"},{"issue":"2","key":"167_CR52","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00037-016-0130-2","volume":"25","author":"Rafael Oliveira","year":"2016","unstructured":"Rafael Oliveira (2016). Factors of low individual degree polynomials. Computational Complexity 25(2), 507\u2013561. (Special issue for CCC 2015)","journal-title":"computational complexity"},{"key":"167_CR53","unstructured":"James G Oxley (2006). Matroid theory, volume 3. Oxford university press"},{"issue":"1\u201374","key":"167_CR54","first-page":"15","volume":"74","author":"Anurag Pandey, Nitin Saxena & Amit Sinhababu (2016). Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits. In 41st International Symposium on Mathematical Foundations of Computer Science, MFCS","year":"2016","unstructured":"Anurag Pandey, Nitin Saxena & Amit Sinhababu (2016). Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits. In 41st International Symposium on Mathematical Foundations of Computer Science, MFCS: August 22\u201326, 2016 - Krak\u00f3w. Poland 74(1\u201374), 15 (2016)","journal-title":"Poland"},{"key":"167_CR55","volume-title":"Algebra I (Die Grundlagen)","author":"O Perron","year":"1927","unstructured":"Perron, O.: Algebra I (Die Grundlagen). W. de Gruyter, Berlin (1927)"},{"key":"167_CR56","unstructured":"A. P\u0142oski (2005). Algebraic Dependence of Polynomials After O. Perron and Some Applications. In Computational Commutative and Non-Commutative Algebraic Geometry, 167\u2013173. IOS press"},{"key":"167_CR57","doi-asserted-by":"crossref","unstructured":"Ran Raz (2008). Elusive functions and lower bounds for arithmetic circuits. In Proceedings of the fortieth annual ACM symposium on Theory of computing, 711\u2013720. ACM","DOI":"10.1145\/1374376.1374479"},{"key":"167_CR58","unstructured":"Ramprasad Saptharishi (2016). A survey of lower bounds in arithmetic circuit complexity. https:\/\/github.com\/dasarpmar\/lowerbounds-survey\/"},{"key":"167_CR59","doi-asserted-by":"crossref","unstructured":"Nitin Saxena (2014). Progress on polynomial identity testing-II. In Perspectives in Computational Complexity, 131\u2013146. Springer","DOI":"10.1007\/978-3-319-05446-9_7"},{"issue":"4","key":"167_CR60","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"},{"issue":"2\u20133","key":"167_CR61","first-page":"267","volume":"6","author":"David Shannon & Moss Sweedler","year":"1988","unstructured":"David Shannon & Moss Sweedler: Using Gr\u00f6bner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence. Journal of Symbolic Computation 6(2\u20133), 267\u2013273 (1988)","journal-title":"Journal of Symbolic Computation"},{"issue":"3\u20134","key":"167_CR62","first-page":"207","volume":"5","author":"A Shpilka","year":"2010","unstructured":"Shpilka, A., Yehudayoff, A.: Arithmetic Circuits: A survey of recent results and open questions. Foundations and Trends in Theoretical Computer Science 5(3\u20134), 207\u2013388 (2010)","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"167_CR63","unstructured":"Volker Strassen (1973). Vermeidung von Divisionen. Journal f\u00fcr die reine und angewandte Mathematik 264, 184\u2013202. URL http:\/\/eudml.org\/doc\/151394"},{"key":"167_CR64","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1515\/crll.1936.175.89","volume":"175","author":"Oswald Teichm\u00fcller","year":"1936","unstructured":"Teichm\u00fcller, Oswald: Differentialrechnung bei Charakteristik p. Journal f\u00fcr die reine und angewandte Mathematik 175, 89\u201399 (1936)","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"167_CR65","unstructured":"William Nathaniel Traves (1998). Differential operators and Nakai\u2019s conjecture. Ph.D. thesis, National Library of Canada= Biblioth\u00e8que nationale du Canada"},{"key":"167_CR66","doi-asserted-by":"crossref","unstructured":"Joachim Von Zur Gathen & J\u00fcrgen Gerhard (2013). Modern computer algebra. Cambridge university press","DOI":"10.1017\/CBO9781139856065"},{"key":"167_CR67","doi-asserted-by":"crossref","unstructured":"Richard Zippel (1979). Probabilistic algorithms for sparse polynomials. Springer","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-018-0167-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-018-0167-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-018-0167-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T16:39:14Z","timestamp":1661272754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-018-0167-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,14]]},"references-count":69,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["167"],"URL":"https:\/\/doi.org\/10.1007\/s00037-018-0167-5","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,14]]},"assertion":[{"value":"9 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}