{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T19:32:32Z","timestamp":1769283152670,"version":"3.49.0"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319723075","type":"print"},{"value":"9783319723082","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72308-2_8","type":"book-chapter","created":{"date-parts":[[2017,12,14]],"date-time":"2017-12-14T18:25:15Z","timestamp":1513275915000},"page":"120-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Adaptive Restart and CEGAR-Based Solver for Inverting Cryptographic Hash Functions"],"prefix":"10.1007","author":[{"given":"Saeed","family":"Nejati","sequence":"first","affiliation":[]},{"given":"Jia Hui","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Catherine","family":"Gebotys","sequence":"additional","affiliation":[]},{"given":"Krzysztof","family":"Czarnecki","sequence":"additional","affiliation":[]},{"given":"Vijay","family":"Ganesh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,15]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-04159-4_7","volume-title":"Selected Areas in Cryptography","author":"K Aoki","year":"2009","unstructured":"Aoki, K., Sasaki, Y.: Preimage attacks on one-block MD4, 63-step MD5 and more. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol. 5381, pp. 103\u2013119. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04159-4_7"},{"key":"8_CR2","unstructured":"Audemard, G., Simon, L.: GLUCOSE: a solver that predicts learnt clauses quality. SAT Compet. 7\u20138 (2009)"},{"key":"8_CR3","first-page":"399","volume":"9","author":"G Audemard","year":"2009","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. IJCAI 9, 399\u2013404 (2009)","journal-title":"IJCAI"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-33558-7_11","volume-title":"Principles and Practice of Constraint Programming","author":"G Audemard","year":"2012","unstructured":"Audemard, G., Simon, L.: Refining restarts strategies for SAT and UNSAT. In: Milano, M. (ed.) CP 2012. LNCS, pp. 118\u2013126. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33558-7_11"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-79719-7_4","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"A Biere","year":"2008","unstructured":"Biere, A.: Adaptive restart strategies for conflict driven SAT solvers. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 28\u201333. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79719-7_4"},{"key":"8_CR6","first-page":"75","volume":"4","author":"A Biere","year":"2008","unstructured":"Biere, A.: PicoSAT essentials. J. Satisf. Boolean Model. Comput. 4, 75\u201397 (2008)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"8_CR7","unstructured":"Biere, A.: Lingeling, Plingeling, Picosat and Precosat at SAT Race 2010. FMV Report Series Technical report, 10\/1 (2010)"},{"key":"8_CR8","unstructured":"Biere, A.: Lingeling ayv (2015). http:\/\/fmv.jku.at\/lingeling\/"},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0065-2458(03)58003-2","volume":"58","author":"A Biere","year":"2003","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Strichman, O., Zhu, Y.: Bounded model checking. Adv. Comput. 58, 117\u2013148 (2003)","journal-title":"Adv. Comput."},{"key":"8_CR10","unstructured":"Biere, A., Fr\u00f6hlich, A.: Evaluating CDCL restart schemes. In: Pragmatics of SAT (2015)"},{"issue":"2","key":"8_CR11","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1455518.1455522","volume":"12","author":"C Cadar","year":"2008","unstructured":"Cadar, C., Ganesh, V., Pawlowski, P.M., Dill, D.L., Engler, D.R.: EXE: automatically generating inputs of death. ACM Trans. Inf. Syst. Secur. (TISSEC) 12(2), 10 (2008)","journal-title":"ACM Trans. Inf. Syst. Secur. (TISSEC)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-06089-7_11","volume-title":"Theory and Applications of Models of Computation","author":"J Chen","year":"2014","unstructured":"Chen, J.: A bit-encoding phase selection strategy for satisfiability solvers. In: Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (eds.) TAMC 2014. LNCS, vol. 8402, pp. 158\u2013167. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06089-7_11"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154\u2013169. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722167_15"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-540-72788-0_36","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"D De","year":"2007","unstructured":"De, D., Kumarasubramanian, A., Venkatesan, R.: Inversion attacks on secure hash functions using sat solvers. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 377\u2013382. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72788-0_36"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11935230_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"C Canni\u00e8re De","year":"2006","unstructured":"De Canni\u00e8re, C., Rechberger, C.: Finding SHA-1 characteristics: general results and applications. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 1\u201320. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11935230_1"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-85174-5_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C Canni\u00e8re De","year":"2008","unstructured":"De Canni\u00e8re, C., Rechberger, C.: Preimages for reduced SHA-0 and SHA-1. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 179\u2013202. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_11"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-60865-6_43","volume-title":"Fast Software Encryption","author":"H Dobbertin","year":"1996","unstructured":"Dobbertin, H.: Cryptanalysis of MD4. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 53\u201369. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60865-6_43"},{"key":"8_CR18","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Minisat 2.2. http:\/\/minisat.se\/"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Eichlseder, M., Mendel, F., Schl\u00e4ffer, M.: Branching heuristics in differential collision search with applications to SHA-512. IACR Cryptology ePrint Archive 2014:302 (2014)","DOI":"10.1007\/978-3-662-46706-0_24"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/978-3-662-47989-6_33","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"T Espitau","year":"2015","unstructured":"Espitau, T., Fouque, P.-A., Karpman, P.: Higher-order differential meet-in-the-middle preimage attacks on SHA-1 and BLAKE. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 683\u2013701. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_33"},{"issue":"2","key":"8_CR21","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0166-218X(02)00400-6","volume":"130","author":"C Fiorini","year":"2003","unstructured":"Fiorini, C., Martinelli, E., Massacci, F.: How to fake an RSA signature by encoding modular root finding as a SAT problem. Discrete Appl. Math. 130(2), 101\u2013127 (2003)","journal-title":"Discrete Appl. Math."},{"key":"8_CR22","unstructured":"PUB FIPS: 180\u20134. Federal Information Processing Standards Publication, Secure Hash (2011)"},{"key":"8_CR23","unstructured":"Gagliolo, M., Schmidhuber, J.: Learning restart strategies. In: IJCAI, pp. 792\u2013797 (2007)"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-24412-4_16","volume-title":"Algorithmic Learning Theory","author":"A Garivier","year":"2011","unstructured":"Garivier, A., Moulines, E.: On upper-confidence bound policies for switching bandit problems. In: Kivinen, J., Szepesv\u00e1ri, C., Ukkonen, E., Zeugmann, T. (eds.) ALT 2011. LNCS (LNAI), vol. 6925, pp. 174\u2013188. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24412-4_16"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-02777-2_30","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"S Haim","year":"2009","unstructured":"Haim, S., Walsh, T.: Restart strategy selection using machine learning techniques. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 312\u2013325. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_30"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/11559306_11","volume-title":"Frontiers of Combining Systems","author":"D Jovanovi\u0107","year":"2005","unstructured":"Jovanovi\u0107, D., Jani\u010di\u0107, P.: Logical analysis of hash functions. In: Gramlich, B. (ed.) FroCoS 2005. LNCS (LNAI), vol. 3717, pp. 200\u2013215. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11559306_11"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-34047-5_15","volume-title":"Fast Software Encryption","author":"D Khovratovich","year":"2012","unstructured":"Khovratovich, D., Rechberger, C., Savelieva, A.: Bicliques for preimages: attacks on Skein-512 and the SHA-2 family. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol. 7549, pp. 244\u2013263. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34047-5_15"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-642-32009-5_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"S Knellwolf","year":"2012","unstructured":"Knellwolf, S., Khovratovich, D.: New preimage attacks against reduced SHA-1. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 367\u2013383. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_22"},{"key":"8_CR29","first-page":"1","volume":"9","author":"F Lafitte","year":"2014","unstructured":"Lafitte, F., Nakahara Jr., J., Van Heule, D.: Applications of SAT solvers in cryptanalysis: finding weak keys and preimages. J. Satisf. Boolean Model. Comput. 9, 1\u201325 (2014)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-47555-9_5","volume-title":"Advances in Cryptology\u2014EUROCRYPT \u201992","author":"X Lai","year":"1993","unstructured":"Lai, X., Massey, J.L.: Hash functions based on block ciphers. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 55\u201370. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-47555-9_5"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Legendre, F., Dequen, G., Krajecki, M.: Encoding hash functions as a SAT problem. In: 2012 IEEE 24th International Conference on Tools with Artificial Intelligence (ICTAI), vol. 1, pp. 916\u2013921. IEEE (2012)","DOI":"10.1109\/ICTAI.2012.128"},{"key":"8_CR32","unstructured":"Legendre, F., Dequen, G., Krajecki, M.: Logical reasoning to detect weaknesses about SHA-1 and MD4\/5. IACR Cryptology ePrint Archive 2014:239 (2014)"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-40970-2_9","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"JH Liang","year":"2016","unstructured":"Liang, J.H., Ganesh, V., Poupart, P., Czarnecki, K.: Learning rate based branching heuristic for SAT solvers. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 123\u2013140. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40970-2_9"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. In: Proceedings of the 2nd Israel Symposium on the Theory and Computing Systems, pp. 128\u2013133. IEEE (1993)","DOI":"10.1109\/ISTCS.1993.253477"},{"issue":"5","key":"8_CR35","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"JP Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506\u2013521 (1999)","journal-title":"IEEE Trans. Comput."},{"key":"8_CR36","unstructured":"Massacci, F.: Using walk-SAT and Rel-SAT for cryptographic key search. In: IJCAI 1999, pp. 290\u2013295 (1999)"},{"issue":"1\u20132","key":"8_CR37","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1006326723002","volume":"24","author":"F Massacci","year":"2000","unstructured":"Massacci, F., Marraro, L.: Logical cryptanalysis as a SAT problem. J. Autom. Reasoning 24(1\u20132), 165\u2013203 (2000)","journal-title":"J. Autom. Reasoning"},{"key":"8_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-25385-0_16","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"F Mendel","year":"2011","unstructured":"Mendel, F., Nad, T., Schl\u00e4ffer, M.: Finding SHA-2 characteristics: searching through a minefield of contradictions. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 288\u2013307. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_16"},{"key":"8_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-38348-9_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"F Mendel","year":"2013","unstructured":"Mendel, F., Nad, T., Schl\u00e4ffer, M.: Improving local collisions: new attacks on reduced SHA-256. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 262\u2013278. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_16"},{"key":"8_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/0-387-34805-0_40","volume-title":"Advances in Cryptology\u2014CRYPTO \u201989 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: One way hash functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 428\u2013446. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_40"},{"key":"8_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/11814948_13","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"I Mironov","year":"2006","unstructured":"Mironov, I., Zhang, L.: Applications of SAT solvers to cryptanalysis of hash functions. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 102\u2013115. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814948_13"},{"issue":"10","key":"8_CR42","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/j.ipl.2013.03.004","volume":"113","author":"P Morawiecki","year":"2013","unstructured":"Morawiecki, P., Srebrny, M.: A SAT-based preimage analysis of reduced KECCAK hash functions. Inf. Process. Lett. 113(10), 392\u2013397 (2013)","journal-title":"Inf. Process. Lett."},{"key":"8_CR43","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Annual Design Automation Conference, pp. 530\u2013535. ACM (2001)","DOI":"10.1145\/378239.379017"},{"key":"8_CR44","unstructured":"Nossum, V.: SAT-based preimage attacks on SHA-1 (2012)"},{"key":"8_CR45","unstructured":"Nossum, V.: Instance generator for encoding preimage, second-preimage, and collision attacks on SHA-1. In: Proceedings of the SAT Competition, pp. 119\u2013120 (2013)"},{"key":"8_CR46","doi-asserted-by":"crossref","unstructured":"Rintanen, J.: Planning and SAT. Handbook of Satisfiability, vol. 185, pp. 483\u2013504 (2009)","DOI":"10.3233\/978-1-58603-929-5-483"},{"key":"8_CR47","unstructured":"Soos, M.: CryptoMiniSat 4.5.3 (2015). http:\/\/www.msoos.org\/cryptominisat4\/"},{"key":"8_CR48","unstructured":"Srebrny, M., Srebrny, M., Stepien, L.: SAT as a programming environment for linear algebra and cryptanalysis. In: ISAIM (2008)"},{"key":"8_CR49","unstructured":"Stevens, M., Karpman, P., Peyrin, T.: Freestart collision for full SHA-1. Cryptology ePrint Archive (2015\/967):1\u201321 (2015)"},{"key":"8_CR50","volume-title":"Introduction to Reinforcement Learning","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Introduction to Reinforcement Learning, vol. 135. MIT Press, Cambridge (1998)"},{"key":"8_CR51","unstructured":"Tomb, A.: Applying satisfiability to the analysis of cryptography (2015). https:\/\/github.com\/GaloisInc\/sat2015-crypto\/blob\/master\/slides\/talk.pdf"},{"key":"8_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/11426639_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"X Wang","year":"2005","unstructured":"Wang, X., Yu, H.: How to break MD5 and other hash functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 19\u201335. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_2"},{"key":"8_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11535218_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X Wang","year":"2005","unstructured":"Wang, X., Yu, H., Yin, Y.L.: Efficient collision search attacks on SHA-0. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 1\u201316. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_1"}],"container-title":["Lecture Notes in Computer Science","Verified Software. Theories, Tools, and Experiments"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72308-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T20:19:22Z","timestamp":1751141962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72308-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319723075","9783319723082"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72308-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}