{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T14:00:27Z","timestamp":1768917627837,"version":"3.49.0"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,4,11]],"date-time":"2016-04-11T00:00:00Z","timestamp":1460332800000},"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":[[2016,6]]},"DOI":"10.1007\/s00037-016-0128-9","type":"journal-article","created":{"date-parts":[[2016,4,14]],"date-time":"2016-04-14T10:13:06Z","timestamp":1460628786000},"page":"349-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterministic Reductions"],"prefix":"10.1007","volume":"25","author":[{"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[]},{"given":"Sergei","family":"Artemenko","sequence":"additional","affiliation":[]},{"given":"Ronen","family":"Shaltiel","sequence":"additional","affiliation":[]},{"given":"Guang","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,11]]},"reference":[{"issue":"1","key":"128_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","volume":"24","author":"Mikl\u00f3s Ajtai","year":"1983","unstructured":"Ajtai Mikl\u00f3s (1983) $${\\Sigma_{1}^{1}}$$ \u03a3 1 1 -Formulae on finite structures. Annals of Pure and Applied Logic 24(1): 1\u201348","journal-title":"Annals of Pure and Applied Logic"},{"key":"128_CR2","doi-asserted-by":"crossref","unstructured":"Benny Applebaum, Yuval Ishai, Eyal Kushilevitz (2010). From Secrecy to Soundness: Efficient Verification via Secure Computation. In ICALP (1), volume 6198 of Lecture Notes in Computer Science, 152\u2013163. Springer.","DOI":"10.1007\/978-3-642-14165-2_14"},{"issue":"2","key":"128_CR3","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/130929643","volume":"44","author":"Benny Applebaum","year":"2015","unstructured":"Applebaum Benny, Ishai Yuval, Kushilevitz Eyal, Waters Brent (2015) Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys. SIAM J. Comput. 44(2): 433\u2013466","journal-title":"SIAM J. Comput."},{"key":"128_CR4","unstructured":"Sergei Artemenko, Russell Impagliazzo, Valentine Kabanets & Ronen Shaltiel (2016). Pseudorandomness when the odds are against you. In Conference on Computational Complexity."},{"key":"128_CR5","doi-asserted-by":"crossref","unstructured":"Sergei Artemenko & Ronen Shaltiel (2014a). Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification. Computational Complexity 23(1), 43\u201383.","DOI":"10.1007\/s00037-012-0056-2"},{"key":"128_CR6","doi-asserted-by":"crossref","unstructured":"Sergei Artemenko & Ronen Shaltiel (2014b). Pseudorandom generators with optimal seed length for non-boolean poly-size circuits. In STOC, 99\u2013108. ACM.","DOI":"10.1145\/2591796.2591846"},{"key":"128_CR7","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF01275486","volume":"3","author":"L\u00e1szl\u00f3 Babai","year":"1993","unstructured":"Babai L\u00e1szl\u00f3, Fortnow Lance, Nisan Noam, Wigderson Avi (1993) BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs. Computational Complexity 3: 307\u2013318","journal-title":"Computational Complexity"},{"issue":"2","key":"128_CR8","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","volume":"36","author":"L\u00e1szl\u00f3 Babai","year":"1988","unstructured":"Babai L\u00e1szl\u00f3, Moran Shlomo (1988) Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes. J. Comput. Syst. Sci. 36(2): 254\u2013276","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"128_CR9","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1137\/050641958","volume":"37","author":"Barak Boaz","year":"2007","unstructured":"Boaz Barak, Shien Jin Ong, Vadhan Salil P. (2007) Derandomization in Cryptography. SIAM J. Comput. 37(2): 380\u2013400","journal-title":"SIAM J. Comput."},{"issue":"2","key":"128_CR10","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1006\/inco.2000.2885","volume":"163","author":"Mihir Bellare","year":"2000","unstructured":"Bellare Mihir, Goldreich Oded, Petrank Erez (2000) Uniform Generation of NP-Witnesses Using an NP-Oracle. Inf. Comput. 163(2): 510\u2013526","journal-title":"Inf. Comput."},{"key":"128_CR11","doi-asserted-by":"crossref","unstructured":"Mihir Bellare & John Rompel (1994). Randomness-Efficient Oblivious Sampling. In FOCS, 276\u2013287. IEEE Computer Society.","DOI":"10.1109\/SFCS.1994.365687"},{"issue":"8","key":"128_CR12","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"Hans L. Bodlaender","year":"2009","unstructured":"Bodlaender Hans L., Downey Rodney G., Fellows Michael R., Danny Hermelin (2009) On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8): 423\u2013434","journal-title":"J. Comput. Syst. Sci."},{"key":"128_CR13","doi-asserted-by":"crossref","unstructured":"Arkadev Chattopadhyay & Rahul Santhanam (2012). Lower Bounds on Interactive Compressibility by Constant-Depth Circuits. In FOCS, 619\u2013628. IEEE Computer Society.","DOI":"10.1109\/FOCS.2012.74"},{"issue":"2","key":"128_CR14","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/0217015","volume":"17","author":"Benny Chor","year":"1988","unstructured":"Chor Benny, Goldreich Oded (1988) Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity. SIAM J. Comput. 17(2): 230\u2013261","journal-title":"SIAM J. Comput."},{"key":"128_CR15","doi-asserted-by":"crossref","unstructured":"Kai-Min Chung, Yael Tauman Kalai & Salil P. Vadhan (2010). Improved Delegation of Computation Using Fully Homomorphic Encryption. In CRYPTO, volume 6223 of Lecture Notes in Computer Science, 483\u2013501. Springer.","DOI":"10.1007\/978-3-642-14623-7_26"},{"key":"128_CR16","doi-asserted-by":"crossref","unstructured":"Francesco Dav\u00ec, Stefan Dziembowski & Daniele Venturi (2010). Leakage-Resilient Storage. In SCN, volume 6280 of Lecture Notes in Computer Science, 121\u2013137. Springer.","DOI":"10.1007\/978-3-642-15317-4_9"},{"issue":"4","key":"128_CR17","first-page":"23","volume":"61","author":"Dell Holger","year":"2014","unstructured":"Holger Dell, Dieter van Melkebeek (2014) Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses. J. ACM 61(4): 23\u201312327","journal-title":"J. ACM"},{"key":"128_CR18","doi-asserted-by":"crossref","unstructured":"Yevgeniy Dodis, Ariel Elbaz, Roberto Oliveira & Ran Raz (2004). Improved Randomness Extraction from Two Independent Sources. In APPROX-RANDOM, volume 3122 of Lecture Notes in Computer Science, 334\u2013344. Springer.","DOI":"10.1007\/978-3-540-27821-4_30"},{"key":"128_CR19","doi-asserted-by":"crossref","unstructured":"Andrew Drucker (2013). Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers. In FOCS, 736\u2013745. IEEE Computer Society.","DOI":"10.1109\/FOCS.2013.84"},{"key":"128_CR20","doi-asserted-by":"crossref","unstructured":"Bella Dubrov & Yuval Ishai (2006). On the randomness complexity of efficient sampling. In STOC, 711\u2013720. ACM.","DOI":"10.1145\/1132516.1132615"},{"key":"128_CR21","doi-asserted-by":"crossref","unstructured":"Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tromer, Vinod Vaikuntanathan (2014). Protecting Circuits from Computationally Bounded and Noisy Leakage. SIAM J. Comput. 43(5): 1564\u20131614","DOI":"10.1137\/120880343"},{"issue":"2","key":"128_CR22","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01262928","volume":"6","author":"Uriel Feige","year":"1997","unstructured":"Feige Uriel, Lund Carsten (1997) On the Hardness of Computing the Permanent of Random Matrices. Computational Complexity 6(2): 101\u2013132","journal-title":"Computational Complexity"},{"issue":"1","key":"128_CR23","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.jcss.2010.06.007","volume":"77","author":"Lance Fortnow","year":"2011","unstructured":"Fortnow Lance, Santhanam Rahul (2011) Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77(1): 91\u2013106","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"128_CR24","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"Merrick L. Furst","year":"1984","unstructured":"Furst Merrick L., Saxe James B., Sipser Michael (1984) Parity, Circuits, and the Polynomial-Time Hierarchy. Mathematical Systems Theory 17(1): 13\u201327","journal-title":"Mathematical Systems Theory"},{"key":"128_CR25","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro, Craig Gentry & Bryan Parno (2010). Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers. In CRYPTO, volume 6223 of Lecture Notes in Computer Science, 465\u2013482. Springer.","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"128_CR26","doi-asserted-by":"crossref","unstructured":"Oded Goldreich & Leonid A. Levin (1989). A Hard-Core Predicate for all One-Way Functions. In STOC, 25\u201332. ACM.","DOI":"10.1145\/73007.73010"},{"issue":"3","key":"128_CR27","first-page":"691","volume":"38","author":"Oded Goldreich","year":"1991","unstructured":"Goldreich Oded, Micali Silvio, Wigderson Avi (1991) Proofs that Yield Nothing But Their Validity for All Languages in NP Have Zero-Knowledge Proof Systems. J. ACM 38(3): 691\u2013729","journal-title":"J. ACM"},{"key":"128_CR28","doi-asserted-by":"crossref","unstructured":"Oded Goldreich & Avi Wigderson (2002). Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good. In RANDOM, volume 2483 of Lecture Notes in Computer Science, 209\u2013223. Springer.","DOI":"10.1007\/3-540-45726-7_17"},{"key":"128_CR29","doi-asserted-by":"crossref","unstructured":"Shafi Goldwasser & Michael Sipser (1986). Private Coins versus Public Coins in Interactive Proof Systems. In STOC, 59\u201368. ACM.","DOI":"10.1145\/12130.12137"},{"key":"128_CR30","doi-asserted-by":"crossref","unstructured":"Dan Gutfreund & Guy N. Rothblum (2008). The Complexity of Local List Decoding. In APPROX-RANDOM, volume 5171 of Lecture Notes in Computer Science, 455\u2013468. Springer.","DOI":"10.1007\/978-3-540-85363-3_36"},{"issue":"3-4","key":"128_CR31","first-page":"85","volume":"12","author":"Dan Gutfreund","year":"2003","unstructured":"Gutfreund Dan, Shaltiel Ronen, Ta-Shma Amnon (2003) Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Computational Complexity 12(3-4): 85\u2013130","journal-title":"Computational Complexity"},{"issue":"4","key":"128_CR32","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1007\/s00037-007-0235-8","volume":"16","author":"Dan Gutfreund","year":"2007","unstructured":"Gutfreund Dan, Shaltiel Ronen, Ta-Shma Amnon (2007) If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. Computational Complexity 16(4): 412\u2013441","journal-title":"Computational Complexity"},{"key":"128_CR33","doi-asserted-by":"crossref","unstructured":"Dan Gutfreund & Amnon Ta-Shma (2007). Worst-Case to Average-Case Reductions Revisited. In APPROX-RANDOM, volume 4627 of Lecture Notes in Computer Science, 569\u2013583. Springer.","DOI":"10.1007\/978-3-540-74208-1_41"},{"issue":"5","key":"128_CR34","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1137\/060668092","volume":"39","author":"Danny Harnik","year":"2010","unstructured":"Harnik Danny, Naor Moni (2010) On the Compressibility of NP Instances and Cryptographic Applications. SIAM J. Comput. 39(5): 1667\u20131713","journal-title":"SIAM J. Comput."},{"key":"128_CR35","doi-asserted-by":"crossref","unstructured":"Russell Impagliazzo & Avi Wigderson (1997). P = BPP if E Requires Exponential Circuits: Derandomizing the XOR Lemma. In STOC, 220\u2013229. ACM.","DOI":"10.1145\/258533.258590"},{"issue":"4","key":"128_CR36","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1006\/jcss.2001.1780","volume":"63","author":"Russell Impagliazzo","year":"2001","unstructured":"Impagliazzo Russell, Wigderson Avi (2001) Randomness vs Time: Derandomization under a Uniform Assumption. J. Comput. Syst. Sci. 63(4): 672\u2013688","journal-title":"J. Comput. Syst. Sci."},{"key":"128_CR37","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"Mark Jerrum","year":"1986","unstructured":"Jerrum Mark, Valiant Leslie G., Vazirani Vijay V. (1986) Random Generation of Combinatorial Structures from a Uniform Distribution. Theor. Comput. Sci. 43: 169\u2013188","journal-title":"Theor. Comput. Sci."},{"key":"128_CR38","doi-asserted-by":"crossref","unstructured":"Yael Tauman Kalai, Ran Raz & Ron D. Rothblum (2014). How to delegate computations: the power of no-signaling proofs. In STOC, 485\u2013494. ACM.","DOI":"10.1145\/2591796.2591809"},{"issue":"5","key":"128_CR39","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1137\/S0097539700389652","volume":"31","author":"Adam Klivans","year":"2002","unstructured":"Klivans Adam, van Melkebeek Dieter (2002) Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. SIAM J. Comput. 31(5): 1501\u20131526","journal-title":"SIAM J. Comput."},{"key":"128_CR40","unstructured":"Richard J. Lipton (1989). New Directions In Testing. In Distributed Computing And Cryptography, volume 2 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 191\u2013202. DIMACS\/AMS."},{"key":"128_CR41","doi-asserted-by":"crossref","unstructured":"Chi-Jen Lu, Shi-Chun Tsai & Hsin-Lung Wu (2007). Impossibility Results on Weakly Black-Box Hardness Amplification. In FCT, volume 4639 of Lecture Notes in Computer Science, 400\u2013411. Springer.","DOI":"10.1007\/978-3-540-74240-1_35"},{"issue":"10","key":"128_CR42","doi-asserted-by":"crossref","first-page":"4575","DOI":"10.1109\/TIT.2008.928988","volume":"54","author":"Chi-Jen Lu","year":"2008","unstructured":"Lu Chi-Jen, Tsai Shi-Chun, Wu Hsin-Lung (2008) On the Complexity of Hardness Amplification. IEEE Transactions on Information Theory 54(10): 4575\u20134586","journal-title":"IEEE Transactions on Information Theory"},{"key":"128_CR43","doi-asserted-by":"crossref","unstructured":"Peter Bro Miltersen & N. V. Vinodchandran (2005) Derandomizing Arthur-Merlin Games using Hitting Sets. Computational Complexity 14(3): 256\u2013279.","DOI":"10.1007\/s00037-005-0197-7"},{"issue":"2","key":"128_CR44","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"Nisan Noam","year":"1994","unstructured":"Noam Nisan, Avi Wigderson (1994) Hardness vs Randomness. J. Comput. Syst. Sci. 49(2): 149\u2013167","journal-title":"J. Comput. Syst. Sci."},{"key":"128_CR45","unstructured":"Igor Carboni Oliveira & Rahul Santhanam (2015). Majority is Incompressible by AC^0[p] Circuits. In Conference on Computational Complexity, volume 33 of LIPIcs, 124\u2013157. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik."},{"key":"128_CR46","first-page":"67","volume":"77","author":"Ronen Shaltiel","year":"2002","unstructured":"Shaltiel Ronen (2002). Recent Developments in Explicit Constructions of Extractors. Bulletin of the EATCS 77: 67\u201395","journal-title":"Bulletin of the EATCS"},{"key":"128_CR47","doi-asserted-by":"crossref","unstructured":"Ronen Shaltiel (2011a). An Introduction to Randomness Extractors. In ICALP (2), volume 6756 of Lecture Notes in Computer Science, 21\u201341. Springer.","DOI":"10.1007\/978-3-642-22012-8_2"},{"key":"128_CR48","doi-asserted-by":"crossref","unstructured":"Ronen Shaltiel (2011b). Weak Derandomization of Weak Algorithms: Explicit Versions of Yao\u2019s Lemma. Computational Complexity 20(1), 87\u2013143.","DOI":"10.1007\/s00037-011-0006-4"},{"issue":"2","key":"128_CR49","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/1059513.1059516","volume":"52","author":"Ronen Shaltiel","year":"2005","unstructured":"Shaltiel Ronen, Umans Christopher (2005) Simple extractors for all min-entropies and a new pseudorandom generator. J. ACM 52(2): 172\u2013216","journal-title":"J. ACM"},{"issue":"4","key":"128_CR50","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/s00037-007-0218-9","volume":"15","author":"Ronen Shaltiel","year":"2006","unstructured":"Shaltiel Ronen, Umans Christopher (2006) Pseudorandomness for Approximate Counting and Sampling. Computational Complexity 15(4): 298\u2013341","journal-title":"Computational Complexity"},{"issue":"3","key":"128_CR51","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1137\/070698348","volume":"39","author":"Ronen Shaltiel","year":"2009","unstructured":"Shaltiel Ronen, Umans Christopher (2009) Low-End Uniform Hardness versus Randomness Tradeoffs for AM. SIAM J. Comput. 39(3): 1006\u20131037","journal-title":"SIAM J. Comput."},{"issue":"7","key":"128_CR52","first-page":"3122","volume":"39","author":"Ronen Shaltiel","year":"2010","unstructured":"Shaltiel Ronen, Viola Emanuele (2010) Hardness Amplification Proofs Require Majority. SIAM J. Comput. 39(7): 3122\u20133154","journal-title":"Comput."},{"key":"128_CR53","doi-asserted-by":"crossref","unstructured":"Michael Sipser (1983). A Complexity Theoretic Approach to Randomness. In STOC, 330\u2013335. ACM.","DOI":"10.1145\/800061.808762"},{"key":"128_CR54","unstructured":"Larry J. Stockmeyer (1983). The Complexity of Approximate Counting (Preliminary Version). In STOC, 118\u2013126. ACM."},{"issue":"2","key":"128_CR55","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1006\/jcss.2000.1730","volume":"62","author":"Madhu Sudan","year":"2001","unstructured":"Sudan Madhu, Trevisan Luca, Vadhan Salil P. (2001) Pseudorandom Generators without the XOR Lemma. J. Comput. Syst. Sci. 62(2): 236\u2013266","journal-title":"J. Comput. Syst. Sci."},{"issue":"12","key":"128_CR56","doi-asserted-by":"crossref","first-page":"3015","DOI":"10.1109\/TIT.2004.838377","volume":"50","author":"Amnon Ta-Shma","year":"2004","unstructured":"Ta-Shma Amnon, Zuckerman David (2004) Extractor codes. IEEE Transactions on Information Theory 50(12): 3015\u20133025","journal-title":"IEEE Transactions on Information Theory"},{"key":"128_CR57","doi-asserted-by":"crossref","unstructured":"Luca Trevisan & Salil P. Vadhan (2000). Extracting Randomness from Samplable Distributions. In FOCS, 32\u201342. IEEE Computer Society.","DOI":"10.1109\/SFCS.2000.892063"},{"issue":"4","key":"128_CR58","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s00037-007-0233-x","volume":"16","author":"Luca Trevisan","year":"2007","unstructured":"Trevisan Luca, Vadhan Salil P. (2007) Pseudorandomness and Average-Case Complexity Via Uniform Reductions. Computational Complexity 16(4): 331\u2013364","journal-title":"Computational Complexity"},{"issue":"4","key":"128_CR59","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF02579325","volume":"7","author":"Umesh V. Vazirani","year":"1987","unstructured":"Vazirani Umesh V. (1987) Strong communication complexity or generating quasirandom sequences form two communicating semi-random sources. Combinatorica 7(4): 375\u2013392","journal-title":"Combinatorica"},{"issue":"3-4","key":"128_CR60","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s00037-004-0187-1","volume":"13","author":"Emanuele Viola","year":"2005","unstructured":"Viola Emanuele (2005) The complexity of constructing pseudorandom generators from hard functions. Computational Complexity 13(3-4): 147\u2013188","journal-title":"Computational Complexity"},{"key":"128_CR61","unstructured":"Emanuele Viola (2006). The Complexity of Hardness Amplification and Derandomization. Ph.D. thesis, Harvard University."}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-016-0128-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-016-0128-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-016-0128-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T17:31:15Z","timestamp":1567791075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-016-0128-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,11]]},"references-count":61,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["128"],"URL":"https:\/\/doi.org\/10.1007\/s00037-016-0128-9","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,11]]}}}