{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T22:58:41Z","timestamp":1752101921492,"version":"3.37.3"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T00:00:00Z","timestamp":1589587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T00:00:00Z","timestamp":1589587200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602304"],"award-info":[{"award-number":["61602304"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10586-020-03116-z","type":"journal-article","created":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T20:02:36Z","timestamp":1589659356000},"page":"475-488","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multi-matrix verifiable computation"],"prefix":"10.1007","volume":"24","author":[{"given":"Yan","family":"He","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3543-1524","authenticated-orcid":false,"given":"Liang Feng","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,16]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D.: Homomorphic MACs: MAC-based integrity for network coding. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 292\u2013305. Springer, Heidelberg (2009)","key":"3116_CR1","DOI":"10.1007\/978-3-642-01957-9_18"},{"doi-asserted-by":"crossref","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: From secrecy to soundness: efficient verification via secure computation. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 152\u2013163. Springer, Heidelberg (2010)","key":"3116_CR2","DOI":"10.1007\/978-3-642-14165-2_14"},{"issue":"1","key":"3116_CR3","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM 45(1), 70\u2013122 (1998)","journal-title":"J. ACM"},{"issue":"3","key":"3116_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10586-010-0131-x","volume":"13","author":"MD Assuncao","year":"2010","unstructured":"Assuncao, M.D., Costanzo, A., Buyya, R.: A cost-benefit analysis of using cloud computing to extend the capacity of clusters. Clust. Comput. 13(3), 335\u2013347 (2010)","journal-title":"Clust. Comput."},{"doi-asserted-by":"crossref","unstructured":"Babai, L.: Trading group theory for randomness. In: STOC, pp. 421\u2013429 (1985)","key":"3116_CR5","DOI":"10.1145\/22145.22192"},{"doi-asserted-by":"crossref","unstructured":"Backes, M., Barbosa, M., Fiore, D., Reischuk, R.M.: ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data. In: 2015 IEEE Symposium on Security and Privacy","key":"3116_CR6","DOI":"10.1109\/SP.2015.24"},{"doi-asserted-by":"crossref","unstructured":"Backes M., Fiore D., Reischuk R.M.: Verifiable delegation of computation on outsourced data. In: Sadeghi A.-R., Gligor V.D., Yung M. (eds.) ACM CCS 13, pp. 863\u2013874. ACM Press (2013)","key":"3116_CR7","DOI":"10.1145\/2508859.2516681"},{"doi-asserted-by":"crossref","unstructured":"Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable delegation of computation over large datasets. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 111\u2013131. Springer, Heidelberg (2011)","key":"3116_CR8","DOI":"10.1007\/978-3-642-22792-9_7"},{"doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D. Tromer, E.: \u2018SNARKs for C: Verifying program executions succinctly and in zero knowledge\u2019. In: Advances in Cryptology-CRYPTO 2013, Santa Barbara, pp. 90\u2013108 (2013)","key":"3116_CR9","DOI":"10.1007\/978-3-642-40084-1_6"},{"unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: \u2018Succinct non-interactive zero knowledge for a von Neumann architecture\u2019, In: 23rd USENIX Security Symposium, pp. 781\u2013796, San Diego (2014)","key":"3116_CR10"},{"doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: ITCS, pp. 326\u2013349 (2012)","key":"3116_CR11","DOI":"10.1145\/2090236.2090263"},{"doi-asserted-by":"crossref","unstructured":"Boneh, D., Freeman, D.M.: Homomorphic signatures for polynomial functions. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 149\u2013168. Springer, Heidelberg (2011)","key":"3116_CR12","DOI":"10.1007\/978-3-642-20465-4_10"},{"doi-asserted-by":"crossref","unstructured":"Boneh, D., Freeman, D.M., Katz, J., Waters, B.: Signing a linear subspace: signature schemes for network coding. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol. 5443, pp. 68\u201387. Springer, Heidelberg (2009)","key":"3116_CR13","DOI":"10.1007\/978-3-642-00468-1_5"},{"doi-asserted-by":"crossref","unstructured":"Braun, B., Feldman, A, J., Ren, Z., et al.: Verifying computations with state. In: 24th ACM Symposium on Operating Systems Principles. Farminton, pp. 341\u2013357 (2013)","key":"3116_CR14","DOI":"10.1145\/2517349.2522733"},{"doi-asserted-by":"crossref","unstructured":"Meyer, Carl: Matrix Analysis and Applied Linear Algebra Book and Solutions Manual, vol. 2, Society for Industrial and Applied Mathematics (2000)","key":"3116_CR15","DOI":"10.1137\/1.9780898719512"},{"doi-asserted-by":"crossref","unstructured":"Catalano, D., Fiore, D.: Practical homomorphic MACs for arithmetic circuits. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 336\u2013352. Springer, Heidelberg (2013)","key":"3116_CR16","DOI":"10.1007\/978-3-642-38348-9_21"},{"doi-asserted-by":"crossref","unstructured":"Catalano, D., Fiore, D., Gennaro, R., Vamvourellis, K.: Algebraic (Trapdoor) One-way functions and their applications. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 680\u2013699. Springer, Heidelberg (2013)","key":"3116_CR17","DOI":"10.1007\/978-3-642-36594-2_38"},{"issue":"2","key":"3116_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10586-011-0152-0","volume":"15","author":"C Chapman","year":"2012","unstructured":"Chapman, C., Emmerich, W., Marquez, F.G., Clayman, S., Galis, A.: Software architecture definition for on-demand cloud provisioning. Clust. Comput. 15(2), 79\u2013100 (2012)","journal-title":"Clust. Comput."},{"doi-asserted-by":"crossref","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89\u2013105. Springer, Heidelberg (1993)","key":"3116_CR19","DOI":"10.1007\/3-540-48071-4_7"},{"issue":"1","key":"3116_CR20","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/TIFS.2014.2363765","volume":"10","author":"X Chen","year":"2015","unstructured":"Chen, X., Huang, X., Li, J., Ma, J., Lou, W., Wong, D.S.: New algorithms for secure outsourcing of large-scale systems of linear equations. IEEE Trans. Inf. Forensics Secur. 10(1), 69\u201378 (2015)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"12","key":"3116_CR21","doi-asserted-by":"publisher","first-page":"2731","DOI":"10.1109\/JSAC.2018.2871311","volume":"36","author":"TY Cheng","year":"2018","unstructured":"Cheng, T.Y., Jia, X.: Compressive traffic monitoring in hybrid SDN. IEEE J. Selected Areas Commun. 36(12), 2731\u20132743 (2018)","journal-title":"IEEE J. Selected Areas Commun."},{"doi-asserted-by":"crossref","unstructured":"Chung, K.-M., Kalai, Y.T., Liu, F.-H., Raz, R.: Memory Delegation. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 151\u2013168. Springer, Heidelberg (2011)","key":"3116_CR22","DOI":"10.1007\/978-3-642-22792-9_9"},{"doi-asserted-by":"crossref","unstructured":"Chung, K.-M., Kalai, Y., Vadhan, S.P.: Improved delegation of computation using fully homomorphic encryption. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 483\u2013501. Springer, Heidelberg (2010)","key":"3116_CR23","DOI":"10.1007\/978-3-642-14623-7_26"},{"doi-asserted-by":"crossref","unstructured":"Cormode, G., Mitzenmacher, M., Thaler, J.: Practical verified computation with streaming interactive proofs. In: 3rd Innovations in Theoretical Computer Science Conference, Cambridge, pp. 90\u2013112 (2012)","key":"3116_CR24","DOI":"10.1145\/2090236.2090245"},{"doi-asserted-by":"crossref","unstructured":"Fiore, D., Gennaro, R.: Publicly verifiable delegation of large polynomials and matrix computations, with applications. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) ACM CCS 2012, pp. 501\u2013512. ACM Press (2012)","key":"3116_CR25","DOI":"10.1145\/2382196.2382250"},{"doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465\u2013482. Springer, Heidelberg (2010)","key":"3116_CR26","DOI":"10.1007\/978-3-642-14623-7_25"},{"doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 626\u2013645. Springer, Heidelberg (2013)","key":"3116_CR27","DOI":"10.1007\/978-3-642-38348-9_37"},{"doi-asserted-by":"crossref","unstructured":"Gennaro, R., Wichs, D.: Fully homomorphic message authenticators. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 301\u2013320. Springer, Heidelberg (2013)","key":"3116_CR28","DOI":"10.1007\/978-3-642-42045-0_16"},{"doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC 2009, pp. 169\u2013178. ACM, New York (2009)","key":"3116_CR29","DOI":"10.1145\/1536414.1536440"},{"key":"3116_CR30","volume-title":"Linear Regression Analysis","author":"George AF Seber","year":"2012","unstructured":"Seber, George A.F., Lee, Alan J.: Linear Regression Analysis, vol. 936. Wiley, Hoboken (2012)"},{"doi-asserted-by":"crossref","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd ACM STOC, pp. 99\u2013108. ACM Press (2011)","key":"3116_CR31","DOI":"10.1145\/1993636.1993651"},{"doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 113\u2013 122. ACM Press (2008)","key":"3116_CR32","DOI":"10.1145\/1374376.1374396"},{"doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: STOC, pp. 291\u2013304 (1985)","key":"3116_CR33","DOI":"10.1145\/22145.22178"},{"doi-asserted-by":"crossref","unstructured":"Golle, P., Mironov, I.: Uncheatable distributed computations. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 425\u2013440. Springer, Heidelberg (2001)","key":"3116_CR34","DOI":"10.1007\/3-540-45353-9_31"},{"doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wichs, D.: Leveled fully homomorphic signatures from standard lattices. In: STOC, pp. 469\u2013477 (2015)","key":"3116_CR35","DOI":"10.1145\/2746539.2746576"},{"doi-asserted-by":"crossref","unstructured":"Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Proceedings of the 13th ACM CCS, pp. 89\u201398 (2006)","key":"3116_CR36","DOI":"10.1145\/1180405.1180418"},{"doi-asserted-by":"crossref","unstructured":"Hohenberger, S., Lysyanskaya, A.: How to securely outsource cryptographic computations. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 264\u2013282. Springer, Heidelberg (2005)","key":"3116_CR37","DOI":"10.1007\/978-3-540-30576-7_15"},{"doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: STOC, pp. 723\u2013732 (1992)","key":"3116_CR38","DOI":"10.1145\/129712.129782"},{"doi-asserted-by":"crossref","unstructured":"Kilian, J.: Improved efficient arguments. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 311\u2013324. Springer, Heidelberg (1995)","key":"3116_CR39","DOI":"10.1007\/3-540-44750-4_25"},{"key":"3116_CR40","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.ins.2014.05.014","volume":"280","author":"X Lei","year":"2014","unstructured":"Lei, X., Liao, X., Huang, T., Heriniaina, F.: Achieving security, robust cheating resistance, and high-efficiency for outsourcing large matrix multiplication computation to a malicious cloud. Inf. Sci. 280, 205\u2013217 (2014)","journal-title":"Inf. Sci."},{"issue":"5","key":"3116_CR41","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1109\/TSC.2014.2331694","volume":"8","author":"X Lei","year":"2015","unstructured":"Lei, X., Liao, X., Huang, T., Li, H.: Cloud computing service: the case of large matrix determinant computation. IEEE Trans. Serv. Comput. 8(5), 688\u2013700 (2015)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"3116_CR42","first-page":"78","volume":"1","author":"X Lei","year":"2013","unstructured":"Lei, X., Liao, X., Huang, T., Li, H., Hu, C.: Outsourcing large matrix inversion computation to a public cloud. IEEE Trans. Cloud Comput. 1, 78\u201387 (2013)","journal-title":"IEEE Trans. Cloud Comput."},{"key":"3116_CR43","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.ins.2011.11.032","volume":"189","author":"Mehdi Mohammadi","year":"2012","unstructured":"Mohammadi, Mehdi, Raahemi, Bijan, Akbari, Ahmad, Nassersharif, Babak, Moeinzadeh, Hossein: Improving linear discriminant analysis with artificial immune system-based evolutionary algorithms. Inform. Sci. 189, 219\u2013232 (2012)","journal-title":"Inform. Sci."},{"key":"3116_CR44","first-page":"145","volume-title":"The NIST Definition of Cloud Computing","author":"P Mell","year":"2011","unstructured":"Mell, P., Grance, T.: The NIST Definition of Cloud Computing, pp. 145\u2013800. NIST, Special Publication, Gaithersburg (2011)"},{"unstructured":"Micali, S.: CS proofs. In: FOCS, pp. 436\u2013453 (1994)","key":"3116_CR45"},{"issue":"5","key":"3116_CR46","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1137\/S0097539704383633","volume":"35","author":"M Naor","year":"2006","unstructured":"Naor, M., Pinkas, B.: Oblivious polynomial evaluation. SIAM J. Comput. 35(5), 1254\u20131281 (2006)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 222\u2013242. Springer, Heidelberg (2013)","key":"3116_CR47","DOI":"10.1007\/978-3-642-36594-2_13"},{"doi-asserted-by":"crossref","unstructured":"Parno, B., Howell, J., Gentry, C., et al.: Pinocchio: nearly practical verifiable computation, security and privacy. pp. 238\u2013252. Berkeley (2013)","key":"3116_CR48","DOI":"10.1109\/SP.2013.47"},{"doi-asserted-by":"crossref","unstructured":"Parno, B., Raykova, M., Vaikuntanathan, V.: How to delegate and verify in public: verifiable computation from attribute-based encryption. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 422\u2013439. Springer, Heidelberg (2012)","key":"3116_CR49","DOI":"10.1007\/978-3-642-28914-9_24"},{"key":"3116_CR50","volume-title":"Digital Image Processing","author":"RC Gonzalez","year":"2006","unstructured":"Gonzalez, R.C., Woods, R.E.: Digital Image Processing, 3rd edn. Prentice-Hall, Inc., Upper Saddle River (2006)","edition":"3"},{"doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 457\u2013473. Springer, Heidelberg (2005)","key":"3116_CR51","DOI":"10.1007\/11426639_27"},{"unstructured":"Gibson, Sarah F.F., Mirtich, Brian: A survey of deformable modeling in computer graphics, Technical Report TR-97-19 (1997)","key":"3116_CR52"},{"doi-asserted-by":"crossref","unstructured":"Setty, S., Braun, B., Vu, V., et al.: Resolving the conflict between generality and plausibility in verified computation. In: 8th ACM European Conference on Computer Systems, pp. 71\u201384. Czech Republic, Prague (2013)","key":"3116_CR53","DOI":"10.1145\/2465351.2465359"},{"unstructured":"Setty, S., McPherson, R., Blumberg, A. J., Walfish, M.: Making argument systems for outsourced computation practical (sometimes). In: NDSS Symposium 2012, San Diego, pp. 17 (2012)","key":"3116_CR54"},{"unstructured":"Setty, S., Vu, V., Panpalia, N., et al.: Taking proof-based verified computation a few steps closer to practicality. In: 21st USENIX Security Symposium, pp. 253\u2013268. Bellevue (2012)","key":"3116_CR55"},{"issue":"4","key":"3116_CR56","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1109\/TIFS.2010.2068289","volume":"5","author":"R Tao","year":"2010","unstructured":"Tao, R., Meng, X.Y., Wang, Y.: Image encryption with multiorders of fractional Fourier transforms. IEEE Trans. Inf. Forensic. Secur. 5(4), 734\u2013738 (2010)","journal-title":"IEEE Trans. Inf. Forensic. Secur."},{"doi-asserted-by":"crossref","unstructured":"Thaler, J.: Time-optimal interactive proofs for circuit evaluation. In: Advances in Cryptology-CRYPTO 2013, Santa Barbara, pp. 71\u201389 (2013)","key":"3116_CR57","DOI":"10.1007\/978-3-642-40084-1_5"},{"unstructured":"Thaler, J., Roberts, M., Mitzenmacher, M., et al.: Verifiable computation with massively parallel interactive proofs. In: 4th USENIX Workshop on Hot Topics in Cloud Computing, pp. 22\u201328, Boston (2012)","key":"3116_CR58"},{"doi-asserted-by":"crossref","unstructured":"Vu, V., Setty, S., Blumberg, A.J., Walfish, M.: A hybrid architecture for interactive verifiable computation, Security and Privacy, pp. 223\u2013237. San Francisco (2013)","key":"3116_CR59","DOI":"10.1109\/SP.2013.48"},{"doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Setty, S., Ren, Z., Blumberg, A.J., Walfish, M.: Efficient RAM and control flow in verifiable outsourced computation. The 2015 Network and Distributed System Security. San Diego (2015)","key":"3116_CR60","DOI":"10.14722\/ndss.2015.23097"},{"key":"3116_CR61","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1016\/j.future.2017.02.030","volume":"78","author":"Y Wu","year":"2018","unstructured":"Wu, Y., Liu, M., Xue, R., Zhang, R.: Attribute-based multi-function verifiable computation. Future Gener. Comput. Syst. 78, 995\u20131004 (2018)","journal-title":"Future Gener. Comput. Syst."},{"issue":"6","key":"3116_CR62","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1016\/j.ins.2010.11.009","volume":"181","author":"ZL Zhu","year":"2011","unstructured":"Zhu, Z.L., Zhang, W., Wong, K.W., Yu, H.: A chaos-based symmetric image encryption scheme using a bit-level permutation. Inform. Sci. 181(6), 1171\u20131186 (2011)","journal-title":"Inform. Sci."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-020-03116-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-020-03116-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-020-03116-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T23:39:40Z","timestamp":1621121980000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-020-03116-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,16]]},"references-count":62,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["3116"],"URL":"https:\/\/doi.org\/10.1007\/s10586-020-03116-z","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2020,5,16]]},"assertion":[{"value":"27 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}