{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:30:00Z","timestamp":1725755400972},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319036793"},{"type":"electronic","value":"9783319036809"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03680-9_7","type":"book-chapter","created":{"date-parts":[[2013,11,6]],"date-time":"2013-11-06T03:06:30Z","timestamp":1383707190000},"page":"68-73","source":"Crossref","is-referenced-by-count":1,"title":["Provenance-Based Trust Estimation for Service Composition"],"prefix":"10.1007","author":[{"given":"Jing","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quan","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Bai, Q., Su, X., Liu, Q., Terhorst, A., Zhang, M., Mu, Y.: Case-based trust evaluation from provenance information. In: 2011 IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), pp. 336\u2013343. IEEE (2011)","DOI":"10.1109\/TrustCom.2011.44"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/S0167-8655(99)00143-9","volume":"21","author":"H. Bunke","year":"2000","unstructured":"Bunke, H., Kandel, A.: Mean and maximum common subgraph of two graphs. Pattern Recognition Letters\u00a021(2), 163\u2013168 (2000)","journal-title":"Pattern Recognition Letters"},{"key":"7_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of information theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of information theory. Wiley, New York (1991)"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/MCSE.2008.79","volume":"10","author":"J. Freire","year":"2008","unstructured":"Freire, J., Koop, D., Santos, E., Silva, C.T.: Provenance for computational tasks: A survey. Computing in Science & Engineering\u00a010(3), 11\u201321 (2008)","journal-title":"Computing in Science & Engineering"},{"issue":"6","key":"7_CR5","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1093\/comjnl\/45.6.631","volume":"45","author":"J.W. Raymond","year":"2002","unstructured":"Raymond, J.W., Gardiner, E.J., Willett, P.: Rascal: Calculation of graph similarity using maximum common edge subgraphs. The Computer Journal\u00a045(6), 631\u2013644 (2002)","journal-title":"The Computer Journal"},{"key":"7_CR6","unstructured":"Renner, R., Maurer, U.: About the mutual (conditional) information. In: Designs, Codes, and Cryptography (2000)"}],"container-title":["Lecture Notes in Computer Science","AI 2013: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03680-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:21:50Z","timestamp":1548724910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03680-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319036793","9783319036809"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03680-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}