{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T23:12:43Z","timestamp":1775085163289,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T00:00:00Z","timestamp":1613001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T00:00:00Z","timestamp":1613001600000},"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":["J Cryptol"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s00145-021-09376-1","type":"journal-article","created":{"date-parts":[[2021,2,12]],"date-time":"2021-02-12T05:05:35Z","timestamp":1613106335000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Placing Conditional Disclosure of Secrets in the Communication Complexity Universe"],"prefix":"10.1007","volume":"34","author":[{"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[]},{"given":"Prashant Nalini","family":"Vasudevan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,11]]},"reference":[{"key":"9376_CR1","doi-asserted-by":"crossref","unstructured":"B. Applebaum, B. Arkis, On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate. in A. Beimel, S. Dziembowski (eds.), Theory of Cryptography\u201416th International Conference, TCC 2018, Panaji, India, November 11\u201314, 2018, Proceedings, Part I, Lecture Notes in Computer Science, vol. 11239 (Springer, 2018), pp. 317\u2013344","DOI":"10.1007\/978-3-030-03807-6_12"},{"key":"9376_CR2","doi-asserted-by":"crossref","unstructured":"B. Applebaum, B. Arkis, P. Raykov, P.N. Vasudevan, Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations. in Katz and Shacham [KS17], pp. 727\u2013757","DOI":"10.1007\/978-3-319-63688-7_24"},{"issue":"2","key":"9376_CR3","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00037-016-0128-9","volume":"25","author":"Benny Applebaum","year":"2016","unstructured":"Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, and Guang Yang. Incompressible functions, relative-error extractors, and the power of nondeterministic reductions. Comput. Complex., 25(2):349\u2013418, 2016.","journal-title":"Comput. Complex."},{"issue":"3","key":"9376_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"Noga Alon","year":"1992","unstructured":"Noga Alon, Oded Goldreich, Johan H\u00e5stad, and Ren\u00e9 Peralta. Simple construction of almost k-wise independent random variables. Random Struct. Algorithms, 3(3):289\u2013304, 1992.","journal-title":"Random Struct. Algorithms"},{"key":"9376_CR5","doi-asserted-by":"crossref","unstructured":"B. Applebaum, T. Holenstein, M. Mishra, O. Shayevitz, The communication complexity of private simultaneous messages, revisited. in J. Buus Nielsen, V. Rijmen (eds.), Advances in Cryptology\u2014EUROCRYPT 2018\u201437th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29\u2013May 3, 2018 Proceedings, Part II, Lecture Notes in Computer Science, vol. 10821 (Springer, 2018), pp. 261\u2013286","DOI":"10.1007\/978-3-319-78375-8_9"},{"key":"9376_CR6","doi-asserted-by":"crossref","unstructured":"W. Aiello, Y. Ishai, O. Reingold, Priced oblivious transfer: how to sell digital goods. in B. Pfitzmann, (ed.), Advances in Cryptology\u2014EUROCRYPT 2001, International Conference on the Theory and Application of Cryptographic Techniques, Innsbruck, Austria, May 6\u201310, 2001, Proceeding, Lecture Notes in Computer Science, vol. 2045 (Springer, 2001) pp. 119\u2013135","DOI":"10.1007\/3-540-44987-6_8"},{"key":"9376_CR7","unstructured":"B. Applebaum, P. Raykov, From private simultaneous messages to zero-information Arthur\u2013Merlin protocols and back. in Theory of Cryptography\u201413th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10\u201313, 2016, Proceedings, Part II (2016) pp. 65\u201382"},{"issue":"2","key":"9376_CR8","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1145\/3018057","volume":"9","author":"Sergei Artemenko","year":"2017","unstructured":"Sergei Artemenko and Ronen Shaltiel. Pseudorandom generators with optimal seed length for non-boolean poly-size circuits. TOCT, 9(2):6:1\u2013626, 2017.","journal-title":"TOCT"},{"key":"9376_CR9","doi-asserted-by":"crossref","unstructured":"N. Attrapadung, Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more. in Q. Phong Nguyen, E. Oswald (eds.), Advances in Cryptology\u2014EUROCRYPT 2014\u201433rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11\u201315, 2014. Proceedings, Lecture Notes in Computer Science, vol. 8441 (Springer, 2014) pp. 557\u2013577","DOI":"10.1007\/978-3-642-55220-5_31"},{"key":"9376_CR10","doi-asserted-by":"crossref","unstructured":"L. Babai, Trading group theory for randomness. in Sedgewick [Sed85], pp. 421\u2013429","DOI":"10.1145\/22145.22192"},{"key":"9376_CR11","unstructured":"A. Bouland, L. Chen, D. Holden, J. Thaler, P.N. Vasudevan, On the power of statistical zero knowledge. in C. Umans, (ed.), 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15\u201317, 2017, IEEE Computer Society (2017) pp. 708\u2013719"},{"issue":"2","key":"9376_CR12","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"Ernest F Brickell","year":"1991","unstructured":"Ernest\u00a0F. Brickell and Daniel\u00a0M. Davenport. On the classification of ideal secret sharing schemes. J. Cryptology, 4(2):123\u2013134, 1991.","journal-title":"J. Cryptol."},{"key":"9376_CR13","first-page":"548","volume":"2018","author":"I Berman","year":"2018","unstructured":"I. Berman, A. Degwekar, R.D. Rothblum, P.N. Vasudevan, From laconic zero-knowledge to public-key cryptography. IACR Cryptology EPrint Archive, 2018:548, 2018.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9376_CR14","doi-asserted-by":"crossref","unstructured":"A. Beimel, O. Farr\u00e0s, Y. Mintz, N. Peter, Linear secret-sharing schemes for forbidden graph access structures. To appear in TCC 2017, 2017.","DOI":"10.1007\/978-3-319-70503-3_13"},{"key":"9376_CR15","unstructured":"L. Babai, P. Frankl, J. Simon, Complexity classes in communication complexity theory (preliminary version). In 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27\u201329 October 1986, IEEE Computer Society (1986) pp. 337\u2013347"},{"key":"9376_CR16","doi-asserted-by":"crossref","unstructured":"A. Beimel, Y. Ishai, R. Kumaresan, E. Kushilevitz, On the cryptographic complexity of the worst functions. In Lindell [Lin14], pp. 317\u2013342","DOI":"10.1007\/978-3-642-54242-8_14"},{"key":"9376_CR17","doi-asserted-by":"crossref","unstructured":"A. Beimel, E. Kushilevitz, P. Nissim, The complexity of multiparty PSM protocols and related models. To appear in Eurocrypt 2018, 2018. https:\/\/eprint.iacr.org\/2018\/148","DOI":"10.1007\/978-3-319-78375-8_10"},{"issue":"2","key":"9376_CR18","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","volume":"36","author":"L\u00e1szl\u00f3 Babai","year":"1988","unstructured":"L\u00e1szl\u00f3 Babai and Shlomo Moran. Arthur-merlin games: A randomized proof system, and a hierarchy of complexity classes. J. Comput. Syst. Sci., 36(2):254\u2013276, 1988.","journal-title":"J. Comput. Syst. Sci."},{"key":"9376_CR19","unstructured":"A. Beimel, N. Peter, Optimal linear multiparty conditional disclosure of secrets protocols. Cryptology ePrint Archive, Report 2018\/441, 2018. https:\/\/eprint.iacr.org\/2018\/441."},{"key":"9376_CR20","unstructured":"C. Calabro, The Exponential Complexity of Satisfiability Problems. Ph.D. Thesis, CS, UC San Diego (2009)"},{"issue":"3","key":"9376_CR21","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"Renato M Capocelli","year":"1993","unstructured":"Renato\u00a0M. Capocelli, Alfredo\u00a0De Santis, Luisa Gargano, and Ugo Vaccaro. On the size of shares for secret sharing schemes. J. Cryptology, 6(3):157\u2013167, 1993.","journal-title":"J. Cryptol."},{"key":"9376_CR22","unstructured":"B. Dubrov Y. Ishai, On the randomness complexity of efficient sampling. in M. Jon Kleinberg (ed.), Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, ACM (2006) pp. 711\u2013720"},{"key":"9376_CR23","doi-asserted-by":"crossref","unstructured":"Y. Dodis, Shannon impossibility, revisited. in A.D. Smith (ed.), Information Theoretic Security - 6th International Conference, ICITS 2012, Montreal, QC, Canada, August 15-17, 2012. Proceedings, Lecture Notes in Computer Science, vol. 7412 (Springer, 2012) pp. 100\u2013110","DOI":"10.1007\/978-3-642-32284-6_6"},{"key":"9376_CR24","unstructured":"U. Feige, J. Kilian, M. Naor. A minimal model for secure computation (extended abstract). in F.T. Leighton, M.T. Goodrich, (eds.), Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23\u201325 May 1994, Montr\u00e9al, Qu\u00e9bec, Canada, ACM, (1994) pp. 554\u2013563"},{"key":"9376_CR25","doi-asserted-by":"crossref","unstructured":"A. Fiat M. Naor, Broadcast encryption. in D.R. Stinson (ed.), Advances in Cryptology\u2014CRYPTO \u201993, 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22\u201326, 1993, Proceedings, Lecture Notes in Computer Science, vol. 773 (Springer, 1993) pp. 480\u2013491","DOI":"10.1007\/3-540-48329-2_40"},{"issue":"3","key":"9376_CR26","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1006\/jcss.1999.1689","volume":"60","author":"Yael Gertner","year":"2000","unstructured":"Yael Gertner, Yuval Ishai, Eyal Kushilevitz, and Tal Malkin. Protecting data privacy in private information retrieval schemes. J. Comput. Syst. Sci., 60(3):592\u2013629, 2000.","journal-title":"J. Comput. Syst. Sci."},{"key":"9376_CR27","doi-asserted-by":"crossref","unstructured":"R. Gay, I. Kerenidis, H. Wee, Communication complexity of conditional disclosure of secrets and attribute-based encryption. in R. Gennaro M. Robshaw (eds.), Advances in Cryptology\u2014CRYPTO 2015\u201435th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16\u201320, 2015, Proceedings, Part II, Lecture Notes in Computer Science, vol. 9216 (Springer, 2015) pp 485\u2013502","DOI":"10.1007\/978-3-662-48000-7_24"},{"key":"9376_CR28","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof-systems (extended abstract). in Sedgewick [Sed85], pp. 291\u2013304","DOI":"10.1145\/22145.22178"},{"issue":"3","key":"9376_CR29","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"Oded Goldreich","year":"1991","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that yield nothing but their validity for all languages in NP have zero-knowledge proof systems. J. ACM, 38(3):691\u2013729, 1991.","journal-title":"J. ACM"},{"key":"9376_CR30","doi-asserted-by":"crossref","unstructured":"O. Goldreich, Three xor-lemmas\u2014an exposition. in O. Goldreich (ed.), Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation\u2014In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman, Lecture Notes in Computer Science, vol. 6650 (Springer, 2011) pp 248\u2013272","DOI":"10.1007\/978-3-642-22670-0_22"},{"key":"9376_CR31","unstructured":"M. G\u00f6\u00f6s, T. Pitassi, T. Watson, Zero-information protocols and unambiguity in Arthur\u2013Merlin communication. in T. Roughgarden (ed.), Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS 2015, Rehovot, Israel, January 11\u201313, 2015, ACM (2015) pp. 113\u2013122"},{"issue":"2","key":"9376_CR32","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00037-018-0166-6","volume":"27","author":"Mika G\u00f6\u00f6s","year":"2018","unstructured":"Mika G\u00f6\u00f6s, Toniann Pitassi, and Thomas Watson. The landscape of communication complexity classes. Computational Complexity, 27(2):245\u2013304, 2018.","journal-title":"Comput. Complex."},{"key":"9376_CR33","first-page":"73","volume":"5","author":"Shafi Goldwasser","year":"1989","unstructured":"Shafi Goldwasser and Michael Sipser. Private coins versus public coins in interactive proof systems. Advances in Computing Research, 5:73\u201390, 1989.","journal-title":"Adv. Comput. Res."},{"issue":"4","key":"9376_CR34","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.1109\/TIT.2011.2110230","volume":"57","author":"Thomas Holenstein","year":"2011","unstructured":"Thomas Holenstein and Renato Renner. On the randomness of independent experiments. IEEE Transactions on Information Theory, 57(4):1865\u20131871, 2011.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9376_CR35","doi-asserted-by":"crossref","unstructured":"Y. Ishai E. Kushilevitz, On the hardness of information-theoretic multiparty computation. in C. Cachin, J. Camenisch (eds.), Advances in Cryptology - EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2\u20136, 2004, Proceedings, Lecture Notes in Computer Science, vol. 3027 (Springer, 2004) pp. 439\u2013455","DOI":"10.1007\/978-3-540-24676-3_26"},{"key":"9376_CR36","doi-asserted-by":"crossref","unstructured":"Y. Ishai, E. Kushilevitz, A. Paskin, Secure multiparty computation with minimal interaction. in T. Rabin (ed.), Advances in Cryptology\u2014CRYPTO 2010, 30th Annual Cryptology Conference, Santa Barbara, CA, USA, August 15\u201319, 2010. Proceedings, Lecture Notes in Computer Science, vol. 6223 (Springer, 2010) pp. 577\u2013594","DOI":"10.1007\/978-3-642-14623-7_31"},{"key":"9376_CR37","unstructured":"Y. Ishai, H. Wee, Partial garbling schemes and their applications. in J. Esparza, P. Fraigniaud, T. Husfeldt, E. Koutsoupias (eds.), Automata, Languages, and Programming\u201441st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8\u201311, 2014, Proceedings, Part I, Lecture Notes in Computer Science, vol. 8572 (Springer, 2014) pp. 650\u2013662"},{"key":"9376_CR38","unstructured":"H. Klauck, On Arthur Merlin games in communication complexity. In Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, June 8-10, 2011, IEEE Computer Society (2011) pp. 189\u2013199"},{"key":"9376_CR39","volume-title":"Communication Complexity","author":"Eyal Kushilevitz","year":"1997","unstructured":"Eyal Kushilevitz and Noam Nisan. Communication complexity. Cambridge University Press, 1997."},{"issue":"1","key":"9376_CR40","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s000370050018","volume":"8","author":"Ilan Kremer","year":"1999","unstructured":"Ilan Kremer, Noam Nisan, and Dana Ron. On randomized one-round communication complexity. Computational Complexity, 8(1):21\u201349, 1999.","journal-title":"Comput. Complex."},{"key":"9376_CR41","doi-asserted-by":"crossref","unstructured":"J. Katz, H. Shacham (eds.), Advances in Cryptology\u2014CRYPTO 2017\u201437th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part I, Lecture Notes in Computer Science vol. 10401 (Springer, 2017)","DOI":"10.1007\/978-3-319-63697-9"},{"key":"9376_CR42","doi-asserted-by":"crossref","unstructured":"Y. Lindell (ed.), Theory of Cryptography\u201411th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24\u201326, 2014. Proceedings, Lecture Notes in Computer Science vol. 8349 (Springer, 2014)","DOI":"10.1007\/978-3-642-54242-8"},{"issue":"3","key":"9376_CR43","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1006\/jcss.2001.1786","volume":"63","author":"Satyanarayana V Lokam","year":"2001","unstructured":"Satyanarayana\u00a0V. Lokam. Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity. J. Comput. Syst. Sci., 63(3):449\u2013473, 2001.","journal-title":"J. Comput. Syst. Sci."},{"key":"9376_CR44","doi-asserted-by":"crossref","unstructured":"T. Liu, V. Vaikuntanathan, Breaking the circuit-size barrier in secret sharing. To appear in STOC2018, 2018. https:\/\/eprint.iacr.org\/2018\/333","DOI":"10.1145\/3188745.3188936"},{"key":"9376_CR45","doi-asserted-by":"crossref","unstructured":"T. Liu, V. Vaikuntanathan, H. Wee, Conditional disclosure of secrets via non-linear reconstruction. in Katz and Shacham [KS17], pp. 758\u2013790","DOI":"10.1007\/978-3-319-63688-7_25"},{"key":"9376_CR46","unstructured":"T. Liu, V. Vaikuntanathan, H. Wee, Towards breaking the exponential barrier for general secret sharing. To appear in Eurocrypt 2018 (2017). https:\/\/eprint.iacr.org\/2017\/1062."},{"issue":"1","key":"9376_CR47","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1006\/jcss.1998.1577","volume":"57","author":"Peter\u00a0Bro Miltersen","year":"1998","unstructured":"Bro Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson. On data structures and asymmetric communication complexity. J. Comput. Syst. Sci., 57(1):37\u201349, 1998.","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9376_CR48","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(91)90157-D","volume":"39","author":"I Newman","year":"1991","unstructured":"Newman I (1991) Private vs. common random bits in communication complexity. Inf. Process. Lett., 39(2):67\u201371","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9376_CR49","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"Joseph Naor","year":"1993","unstructured":"Joseph Naor and Moni Naor. Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput., 22(4):838\u2013856, 1993.","journal-title":"SIAM J. Comput."},{"key":"9376_CR50","doi-asserted-by":"crossref","unstructured":"R. Renner, S. Wolf, Simple and tight bounds for information reconciliation and privacy amplification. in B.K. Roy (ed.), Advances in Cryptology\u2014ASIACRYPT 2005, 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4\u20138, 2005, Proceedings, Lecture Notes in Computer Science, vol. 3788 (Springer, 2005) pp. 199\u2013216","DOI":"10.1007\/11593447_11"},{"key":"9376_CR51","unstructured":"R. Sedgewick (ed.), Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6\u20138, 1985, Providence, Rhode Island, USA. ACM (1985)"},{"key":"9376_CR52","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"Claude E Shannon","year":"1949","unstructured":"Claude\u00a0E. Shannon. Communication theory of secrecy systems. Bell Systems Technical Journal, 28:656\u2013715, 1949.","journal-title":"Bell Syst. Tech. J."},{"key":"9376_CR53","unstructured":"H.-M. Sun, S.-P. Shieh, Secret sharing in graph-based prohibited structures. In Proceedings IEEE INFOCOM \u201997, The Conference on Computer Communications, Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Driving the Information Revolution, Kobe, Japan, April 7\u201312, 1997, IEEE (1997) pp. 718\u2013724"},{"issue":"2","key":"9376_CR54","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/636865.636868","volume":"50","author":"Amit Sahai","year":"2003","unstructured":"Amit Sahai and Salil\u00a0P. Vadhan. A complete problem for statistical zero knowledge. J. ACM, 50(2):196\u2013249, 2003.","journal-title":"J. ACM"},{"key":"9376_CR55","unstructured":"S.P. Vadhan, A study of statistical zero-knowledge proofs. Ph.D. Thesis, Massachusetts Institute of Technology (1999)"},{"key":"9376_CR56","unstructured":"U.V. Vazirani, Randomness, Adversaries and Computation. Ph.D. Thesis, EECS, UC Berkeley (1986)"},{"key":"9376_CR57","doi-asserted-by":"crossref","unstructured":"H. Wee, Dual system encryption via predicate encodings. in Lindell [Lin14], pp. 616\u2013637","DOI":"10.1007\/978-3-642-54242-8_26"},{"key":"9376_CR58","unstructured":"H. Wee, Personal Communication (2018)"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09376-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-021-09376-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09376-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T02:44:33Z","timestamp":1724467473000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-021-09376-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,11]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["9376"],"URL":"https:\/\/doi.org\/10.1007\/s00145-021-09376-1","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,11]]},"assertion":[{"value":"5 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"11"}}