{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T06:15:32Z","timestamp":1772777732914,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,3,30]],"date-time":"2017-03-30T00:00:00Z","timestamp":1490832000000},"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":["J Cryptogr Eng"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s13389-017-0159-4","type":"journal-article","created":{"date-parts":[[2017,3,31]],"date-time":"2017-03-31T01:09:21Z","timestamp":1490922561000},"page":"113-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Having no mathematical model may not secure PUFs"],"prefix":"10.1007","volume":"7","author":[{"given":"Fatemeh","family":"Ganji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahin","family":"Tajik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"F\u00e4\u00dfler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Pierre","family":"Seifert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,30]]},"reference":[{"key":"159_CR1","unstructured":"Matlab\u2013The Language of Technical Computing. http:\/\/www.mathworks.com\/products\/matlab\/\/"},{"key":"159_CR2","unstructured":"Almuallim, H., Dietterich, T.G.: Learning with many irrelevant features. In: Proceedings of the Ninth National Conference on Artificial Intelligence (1991)"},{"key":"159_CR3","volume-title":"Cyclone IV Device Handbook","author":"Altera","year":"2014","unstructured":"Altera: Cyclone IV Device Handbook. Altera Corporation, San Jose (2014)"},{"issue":"4","key":"159_CR4","first-page":"319","volume":"2","author":"D Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319\u2013342 (1988)","journal-title":"Mach. Learn."},{"key":"159_CR5","doi-asserted-by":"crossref","unstructured":"Armknecht, F., Maes, R., Sadeghi, A., Standaert, O.X., Wachsmann, C.: A formalization of the security features of physical functions. In: 2011 IEEE Symposium on Security and Privacy (SP), pp 397\u2013412 (2011)","DOI":"10.1109\/SP.2011.10"},{"key":"159_CR6","doi-asserted-by":"crossref","unstructured":"Armknecht, F., Moriyama, D., Sadeghi, A.R., Yung, M.: Towards a unified security model for physically unclonable functions. In: Topics in Cryptology-CT-RSA 2016: The Cryptographers\u2019 Track at the RSA Conference, vol. 9610, p. 271. Springer (2016)","DOI":"10.1007\/978-3-319-29485-8_16"},{"key":"159_CR7","doi-asserted-by":"crossref","unstructured":"Arvind, V., K\u00f6bler, J., Lindner, W.: Parameterized learnability of K-juntas and related problems. In: Algorithmic Learning Theory, pp. 120\u2013134. Springer (2007)","DOI":"10.1007\/978-3-540-75225-7_13"},{"issue":"1","key":"159_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0004-3702(97)00063-5","volume":"97","author":"AL Blum","year":"1997","unstructured":"Blum, A.L., Langley, P.: Selection of relevant features and examples in machine learning. Artif. Intell. 97(1), 245\u2013271 (1997)","journal-title":"Artif. Intell."},{"issue":"4","key":"159_CR9","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.K.: Learnability and the Vapnik\u2013Chervonenkis dimension. J. ACM 36(4), 929\u2013965 (1989)","journal-title":"J. ACM"},{"issue":"2","key":"159_CR10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0890-5401(03)00135-4","volume":"187","author":"NH Bshouty","year":"2003","unstructured":"Bshouty, N.H., Jackson, J.C., Tamon, C.: Uniform-distribution attribute noise learnability. Inf. Comput. 187(2), 277\u2013290 (2003)","journal-title":"Inf. Comput."},{"key":"159_CR11","doi-asserted-by":"crossref","unstructured":"Chen, Q., Csaba, G., Lugli, P., Schlichtmann, U., R\u00fchrmair, U.: The Bistable Ring PUF: a new architecture for strong physical unclonable functions. In: 2011 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST), pp. 134\u2013141. IEEE (2011)","DOI":"10.1109\/HST.2011.5955011"},{"issue":"3","key":"159_CR12","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0890-5401(89)90002-3","volume":"82","author":"A Ehrenfeucht","year":"1989","unstructured":"Ehrenfeucht, A., Haussler, D., Kearns, M., Valiant, L.: A general lower bound on the number of examples needed for learning. Inf. Comput. 82(3), 247\u2013261 (1989)","journal-title":"Inf. Comput."},{"issue":"1","key":"159_CR13","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0221014","volume":"21","author":"P Fischer","year":"1992","unstructured":"Fischer, P., Simon, H.U.: On learning ring-sum-expansions. SIAM J. Comput. 21(1), 181\u2013192 (1992)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"159_CR14","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y Freund","year":"1995","unstructured":"Freund, Y.: Boosting a weak learning algorithm by majority. Inf. Comput. 121(2), 256\u2013285 (1995)","journal-title":"Inf. Comput."},{"issue":"1","key":"159_CR15","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55(1), 119\u2013139 (1997)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"159_CR16","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/PL00009809","volume":"18","author":"E Friedgut","year":"1998","unstructured":"Friedgut, E.: Boolean functions with low average sensitivity depend on few coordinates. Combinatorica 18(1), 27\u201335 (1998)","journal-title":"Combinatorica"},{"key":"159_CR17","doi-asserted-by":"crossref","unstructured":"Ganji, F., Tajik, S., F\u00e4\u00dfler, F., Seifert, J.P.: Strong machine learning attack against PUFs with no mathematical model. In: International Conference on Cryptographic Hardware and Embedded Systems\u2014CHES 2016, pp. 391\u2013411. Springer (2016)","DOI":"10.1007\/978-3-662-53140-2_19"},{"key":"159_CR18","doi-asserted-by":"crossref","unstructured":"Ganji, F., Tajik, S., Seifert, J.P.: Let me prove it to you: RO PUFs are provably learnable. In: The 18th Annual International Conference on Information Security and Cryptology (2015)","DOI":"10.1007\/978-3-319-30840-1_22"},{"key":"159_CR19","doi-asserted-by":"crossref","unstructured":"Ganji, F., Tajik, S., Seifert, J.P.: Why attackers win: on the learnability of XOR arbiter PUFs. In: Trust and Trustworthy Computing, pp. 22\u201339. Springer (2015)","DOI":"10.1007\/978-3-319-22846-4_2"},{"issue":"3","key":"159_CR20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s13389-016-0119-4","volume":"6","author":"F Ganji","year":"2016","unstructured":"Ganji, F., Tajik, S., Seifert, J.P.: PAC learning of arbiter PUFs. J. Cryptogr. Eng. 6(3), 249\u2013258 (2016)","journal-title":"J. Cryptogr. Eng."},{"key":"159_CR21","doi-asserted-by":"crossref","unstructured":"Gassend, B., Clarke, D., Van\u00a0Dijk, M., Devadas, S.: Silicon physical random functions. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 148\u2013160 (2002)","DOI":"10.1145\/586110.586132"},{"key":"159_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16367-8","volume-title":"Property Testing: Current Research and Surveys","author":"O Goldreich","year":"2010","unstructured":"Goldreich, O.: Property Testing: Current Research and Surveys, vol. 6390. Springer, Berlin (2010)"},{"key":"159_CR23","doi-asserted-by":"crossref","unstructured":"Guajardo, J., Kumar, S.S., Schrijen, G.J., Tuyls, P.: FPGA intrinsic PUFs and their use for IP protection. In: Cryptographic Hardware and Embedded Systems\u2014CHES 2007, pp. 63\u201380. Springer (2007)","DOI":"10.1007\/978-3-540-74735-2_5"},{"key":"159_CR24","doi-asserted-by":"crossref","unstructured":"Guijarro, D., Tarui, J., Tsukiji, T.: Finding relevant variables in PAC model with membership queries. In: International Conference on Algorithmic Learning Theory, pp. 313\u2013322. Springer (1999)","DOI":"10.1007\/3-540-46769-6_26"},{"issue":"1","key":"159_CR25","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M Hall","year":"2009","unstructured":"Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The WEKA data mining software: an update. ACM SIGKDD Explor. Newsl. 11(1), 10\u201318 (2009)","journal-title":"ACM SIGKDD Explor. Newsl."},{"key":"159_CR26","doi-asserted-by":"crossref","unstructured":"Helfmeier, C., Boit, C., Nedospasov, D., Seifert, J.P.: Cloning physically unclonable functions. In: 2013 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST), pp. 1\u20136 (2013)","DOI":"10.1109\/HST.2013.6581556"},{"key":"159_CR27","doi-asserted-by":"crossref","unstructured":"Helfmeier, C., Nedospasov, D., Tarnovsky, C., Krissler, J.S., Boit, C., Seifert, J.P.: Breaking and entering through the silicon. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 733\u2013744. ACM (2013)","DOI":"10.1145\/2508859.2516717"},{"issue":"2","key":"159_CR28","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1137\/0221019","volume":"21","author":"D Helmbold","year":"1992","unstructured":"Helmbold, D., Sloan, R., Warmuth, M.K.: Learning integer lattices. SIAM J. Comput. 21(2), 240\u2013266 (1992)","journal-title":"SIAM J. Comput."},{"key":"159_CR29","unstructured":"Holcomb, D.E., Burleson, W.P., Fu, K.: Initial SRAM state as a fingerprint and source of true random numbers for RFID tags. In: Proceedings of the Conference on RFID Security, vol.\u00a07 (2007)"},{"key":"159_CR30","doi-asserted-by":"crossref","unstructured":"Kahn, J., Kalai, G., Linial, N.: The influence of variables on Boolean functions. In: 29th Annual Symposium on Foundations of Computer Science, pp. 68\u201380. IEEE (1988)","DOI":"10.1109\/SFCS.1988.21923"},{"key":"159_CR31","doi-asserted-by":"crossref","unstructured":"Kalai, A., Servedio, R.A.: Boosting in the presence of noise. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 195\u2013205. ACM (2003)","DOI":"10.1145\/780542.780573"},{"key":"159_CR32","doi-asserted-by":"crossref","unstructured":"Kalai, G., Safra, S.: Threshold phenomena and influence: perspectives from mathematics, computer science, and economics. In: Computational Complexity and Statistical Physics, Santa Fe Institute Studies in the Science of Complexity, pp. 25\u201360 (2006)","DOI":"10.1093\/oso\/9780195177374.003.0008"},{"key":"159_CR33","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"MJ Kearns","year":"1994","unstructured":"Kearns, M.J., Vazirani, U.V.: An Introduction to Computational Learning Theory. MIT Press, Cambridge (1994)"},{"key":"159_CR34","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/978-1-4419-8080-9_5","volume-title":"Introduction to Hardware Security and Trust","author":"F Koushanfar","year":"2012","unstructured":"Koushanfar, F.: Hardware metering: a survey. In: Tehranipoor, M., Wang, C. (eds.) Introduction to Hardware Security and Trust, pp. 103\u2013122. Springer, New York (2012)"},{"key":"159_CR35","doi-asserted-by":"crossref","unstructured":"Lee, J.W., Lim, D., Gassend, B., Suh, G.E., Van\u00a0Dijk, M., Devadas, S.: A technique to build a secret key in integrated circuits for identification and authentication applications. In: 2004 Symposium on VLSI Circuits, 2004. Digest of Technical Papers, pp. 176\u2013179 (2004)","DOI":"10.1109\/VLSIC.2004.1346548"},{"issue":"1","key":"159_CR36","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0890-5401(91)90058-A","volume":"90","author":"N Linial","year":"1991","unstructured":"Linial, N., Mansour, Y., Rivest, R.L.: Results on learnability and the Vapnik\u2013Chervonenkis dimension. Inf. Comput. 90(1), 33\u201349 (1991)","journal-title":"Inf. Comput."},{"key":"159_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-41395-7","volume-title":"Physically Unclonable Functions: Constructions, Properties and Applications","author":"R Maes","year":"2013","unstructured":"Maes, R.: Physically Unclonable Functions: Constructions, Properties and Applications. Springer, Berlin (2013)"},{"key":"159_CR38","doi-asserted-by":"crossref","unstructured":"Maes, R., van\u00a0der Leest, V., van\u00a0der Sluis, E., Willems, F.: Secure key generation from biased PUFs. In: Cryptographic Hardware and Embedded Systems\u2014CHES 2015, pp. 517\u2013534. Springer (2015)","DOI":"10.1007\/978-3-662-48324-4_26"},{"issue":"3","key":"159_CR39","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.jcss.2004.04.002","volume":"69","author":"E Mossel","year":"2004","unstructured":"Mossel, E., O\u2019Donnell, R., Servedio, R.A.: Learning functions of k relevant variables. J. Comput. Syst. Sci. 69(3), 421\u2013434 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"159_CR40","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139814782","volume-title":"Analysis of Boolean Functions","author":"R O\u2019Donnell","year":"2014","unstructured":"O\u2019Donnell, R.: Analysis of Boolean Functions. Cambridge University Press, Cambridge (2014)"},{"issue":"5589","key":"159_CR41","doi-asserted-by":"crossref","first-page":"2026","DOI":"10.1126\/science.1074376","volume":"297","author":"R Pappu","year":"2002","unstructured":"Pappu, R., Recht, B., Taylor, J., Gershenfeld, N.: Physical one-way functions. Science 297(5589), 2026\u20132030 (2002)","journal-title":"Science"},{"key":"159_CR42","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/3-540-44666-4_30","volume-title":"Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques","author":"M Parnas","year":"2001","unstructured":"Parnas, M., Ron, D., Samorodnitsky, A.: Proclaiming dictators and juntas or testing Boolean formulae. In: Goemans, M., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, pp. 273\u2013285. Springer, Berlin (2001)"},{"issue":"3","key":"159_CR43","first-page":"229","volume":"2","author":"RL Rivest","year":"1987","unstructured":"Rivest, R.L.: Learning decision lists. Mach. Learn. 2(3), 229\u2013246 (1987)","journal-title":"Mach. Learn."},{"issue":"4","key":"159_CR44","first-page":"11","volume":"4","author":"D Ron","year":"2012","unstructured":"Ron, D., Rubinfeld, R., Safra, M., Samorodnitsky, A., Weinstein, O.: Approximating the influence of monotone Boolean functions in $$O(\\sqrt{n})$$ O ( n ) query complexity. ACM Trans. Comput. Theory (TOCT) 4(4), 11 (2012)","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"key":"159_CR45","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-642-14452-3_4","volume-title":"Towards Hardware-Intrinsic Security","author":"U R\u00fchrmair","year":"2010","unstructured":"R\u00fchrmair, U., Busch, H., Katzenbeisser, S.: Strong PUFs: models, constructions, and security proofs. In: Sadeghi, A.R., Naccache, D. (eds.) Towards Hardware-Intrinsic Security, pp. 79\u201396. Springer, Berlin (2010)"},{"key":"159_CR46","doi-asserted-by":"crossref","unstructured":"R\u00fchrmair, U., Sehnke, F., S\u00f6lter, J., Dror, G., Devadas, S., Schmidhuber, J.: Modeling attacks on physical unclonable functions. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, pp. 237\u2013249 (2010)","DOI":"10.1145\/1866307.1866335"},{"key":"159_CR47","doi-asserted-by":"crossref","unstructured":"Saha, I., Jeldi, R.R., Chakraborty, R.S.: Model building attacks on physically unclonable functions using genetic programming. In: 2013 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST), pp. 41\u201344. IEEE (2013)","DOI":"10.1109\/HST.2013.6581563"},{"issue":"2","key":"159_CR48","first-page":"197","volume":"5","author":"RE Schapire","year":"1990","unstructured":"Schapire, R.E.: The strength of weak learnability. Mach. Learn. 5(2), 197\u2013227 (1990)","journal-title":"Mach. Learn."},{"key":"159_CR49","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/8291.001.0001","volume-title":"Boosting: Foundations and Algorithms","author":"RE Schapire","year":"2012","unstructured":"Schapire, R.E., Freund, Y.: Boosting: Foundations and Algorithms. MIT Press, Cambridge (2012)"},{"key":"159_CR50","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-3-319-08593-7_7","volume-title":"Trust and Trustworthy Computing","author":"D Schuster","year":"2014","unstructured":"Schuster, D., Hesselbarth, R.: Evaluation of Bistable Ring PUFs using single layer neural networks. In: Holz, T., Ioannidis, S. (eds.) Trust and Trustworthy Computing, pp. 101\u2013109. Springer, Switzerland (2014)"},{"key":"159_CR51","unstructured":"Servedio, R.A., Tan, L.Y., Wright, J.: Adaptivity helps for testing juntas. In: Proceedings of the 30th Conference on Computational Complexity, pp. 264\u2013279 (2015)"},{"issue":"5","key":"159_CR52","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1109\/TIT.1984.1056949","volume":"30","author":"T Siegenthaler","year":"1984","unstructured":"Siegenthaler, T.: Correlation-immunity of nonlinear combining functions for cryptographic applications (corresp.). IEEE Trans. Inf. Theory 30(5), 776\u2013780 (1984)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"159_CR53","doi-asserted-by":"crossref","unstructured":"Tajik, S., Dietz, E., Frohmann, S., Seifert, J.P., Nedospasov, D., Helfmeier, C., Boit, C., Dittrich, H.: Physical characterization of arbiter PUFs. In: Cryptographic Hardware and Embedded Systems\u2014CHES 2014, pp. 493\u2013509. Springer (2014)","DOI":"10.1007\/978-3-662-44709-3_27"},{"key":"159_CR54","volume-title":"Estimation of Dependences Based on Empirical Data: Springer Series in Statistics","author":"V Vapnik","year":"1982","unstructured":"Vapnik, V.: Estimation of Dependences Based on Empirical Data: Springer Series in Statistics. Springer, New York (1982)"},{"issue":"2","key":"159_CR55","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V Vapnik","year":"1971","unstructured":"Vapnik, V., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16(2), 264 (1971)","journal-title":"Theory Probab. Appl."},{"key":"159_CR56","volume-title":"CMOS VLSI Design: A Circuits and Systems Perspective","author":"NHE Weste","year":"2010","unstructured":"Weste, N.H.E., Harris, D.: CMOS VLSI Design: A Circuits and Systems Perspective, 4th edn. Addison Wesley, Reading (2010)","edition":"4"},{"key":"159_CR57","doi-asserted-by":"crossref","unstructured":"Xu, X., R\u00fchrmair, U., Holcomb, D.E., Burleson, W.P.: Security evaluation and enhancement of Bistable Ring PUFs. In: Radio Frequency Identification, pp. 3\u201316. Springer (2015)","DOI":"10.1007\/978-3-319-24837-0_1"},{"key":"159_CR58","doi-asserted-by":"crossref","unstructured":"Yamamoto, D., Takenaka, M., Sakiyama, K., Torii, N.: Security evaluation of Bistable Ring PUFs on FPGAs using differential and linear analysis. In: 2014 Federated Conference on Computer Science and Information Systems (FedCSIS), pp. 911\u2013918 (2014)","DOI":"10.15439\/2014F122"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-017-0159-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-017-0159-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-017-0159-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:51:34Z","timestamp":1750189894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-017-0159-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,30]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["159"],"URL":"https:\/\/doi.org\/10.1007\/s13389-017-0159-4","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,30]]}}}