{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T01:10:06Z","timestamp":1743988206524,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":54,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642326448"},{"type":"electronic","value":"9783642326455"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32645-5_79","type":"book-chapter","created":{"date-parts":[[2012,8,21]],"date-time":"2012-08-21T08:05:43Z","timestamp":1345536343000},"page":"633-644","source":"Crossref","is-referenced-by-count":0,"title":["Interpreting Shared Information Content in Software Engineering: What Does It Mean to Say Two Artefacts Are Similar and Why?"],"prefix":"10.1007","author":[{"given":"Tom","family":"Arbuckle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"79_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s12130-010-9097-5","volume":"23","author":"P. Adriaans","year":"2010","unstructured":"Adriaans, P.: A critical analysis of Floridi\u2019s theory of semantic information. Knowledge, Technology & Policy\u00a023, 41\u201356 (2010), http:\/\/dx.doi.org\/10.1007\/s12130-010-9097-5","journal-title":"Knowledge, Technology & Policy"},{"issue":"2","key":"79_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s11219-006-9010-3","volume":"15","author":"E.B. Allen","year":"2007","unstructured":"Allen, E.B., Gottipati, S., Govindarajan, R.: Measuring size, complexity, and coupling of hypergraph abstractions of software: An information-theory approach. Software Quality Journal\u00a015(2), 179\u2013212 (2007)","journal-title":"Software Quality Journal"},{"key":"79_CR3","doi-asserted-by":"crossref","unstructured":"Arbuckle, T.: Visually summarising software change. In: IV 2008: Proc. 12th Int. Conf. on Information Visualisation, pp. 559\u2013568 (2008)","DOI":"10.1109\/IV.2008.58"},{"key":"79_CR4","doi-asserted-by":"crossref","unstructured":"Arbuckle, T.: Measure software \u2013 and its evolution \u2013 using information content. In: IWPSE-Evol 2009: Proceedings of the Joint International and Annual ERCIM Workshops on Principles of Software Evolution (IWPSE) and Software Evolution (Evol) Workshops, pp. 129\u2013134 (2009)","DOI":"10.1145\/1595808.1595831"},{"key":"79_CR5","doi-asserted-by":"crossref","unstructured":"Arbuckle, T.: Measuring multi-language software evolution: A case study. In: IWPSE-EVOL 2011: Proceedings of the Joint International and Annual ERCIM Workshops on Principles of Software Evolution (IWPSE) and Software Evolution (Evol) Workshops, pp. 91\u201395 (September 2011)","DOI":"10.1145\/2024445.2024461"},{"issue":"12","key":"79_CR6","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1016\/j.scico.2010.11.005","volume":"76","author":"T. Arbuckle","year":"2011","unstructured":"Arbuckle, T.: Studying software evolution using artefacts\u2019 shared information content. Science of Computer Programming\u00a076(12), 1078\u20131097 (2011), http:\/\/dx.doi.org\/10.1016\/j.scico.2010.11.005","journal-title":"Science of Computer Programming"},{"key":"79_CR7","unstructured":"Arbuckle, T., Balaban, A., Peters, D.K., Lawford, M.: Software documents: Comparison and measurement. In: SEKE 2007: Proc. 18th Int. Conf. on Software Engineering & Knowledge Engineering, pp. 740\u2013745 (July 2007)"},{"issue":"12","key":"79_CR8","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1103\/PhysRevLett.53.1202","volume":"53","author":"C.H. Bennett","year":"1984","unstructured":"Bennett, C.H.: Thermodynamically reversible computation. Phys. Rev. Lett.\u00a053(12), 1202 (1984)","journal-title":"Phys. Rev. Lett."},{"issue":"4","key":"79_CR9","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.1109\/18.681318","volume":"44","author":"C.H. Bennett","year":"1998","unstructured":"Bennett, C.H., G\u00e1cs, P., Li, M., Vit\u00e1nyi, P., Zurek, W.H.: Information distance. IEEE Trans. Information Theory\u00a044(4), 1407\u20131423 (1998)","journal-title":"IEEE Trans. Information Theory"},{"key":"79_CR10","doi-asserted-by":"crossref","unstructured":"Bennett, C.H., G\u00e1cs, P., Li, M., Vit\u00e1nyi, P.M.B., Zurek, W.H.: Thermodynamics of computation and information distance. In: STOC 1993: Proc. 25th Annual ACM Symposium on Theory of Computing, pp. 21\u201330. ACM Press (1993)","DOI":"10.1145\/167088.167098"},{"issue":"4","key":"79_CR11","doi-asserted-by":"crossref","first-page":"367","DOI":"10.4310\/CIS.2005.v5.n4.a1","volume":"5","author":"M. Cebri\u00e1n","year":"2005","unstructured":"Cebri\u00e1n, M., Alfonseca, M., Ortega, A.: Common pitfalls using the normalized compression distance: What to watch out for in a compressor. Comms. Info. Sys.\u00a05(4), 367\u2013384 (2005)","journal-title":"Comms. Info. Sys."},{"key":"79_CR12","doi-asserted-by":"publisher","first-page":"902","DOI":"10.3390\/e13040902","volume":"13","author":"D. Cerra","year":"2011","unstructured":"Cerra, D., Datcu, M.: Algorithmic relative complexity. Entropy\u00a013, 902\u2013914 (2011)","journal-title":"Entropy"},{"issue":"1","key":"79_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/321495.321506","volume":"16","author":"G.J. Chaitin","year":"1969","unstructured":"Chaitin, G.J.: On the length of programs for computing finite binary sequences: statistical considerations. J. ACM\u00a016(1), 145\u2013159 (1969)","journal-title":"J. ACM"},{"issue":"1","key":"79_CR14","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/TIT.1974.1055172","volume":"20","author":"G.J. Chaitin","year":"1974","unstructured":"Chaitin, G.J.: Information-theoretic computational complexity. IEEE Trans. Information Theory\u00a020(1), 10\u201315 (1974)","journal-title":"IEEE Trans. Information Theory"},{"key":"79_CR15","unstructured":"Chen, X., Kwong, S., Li, M.: A compression algorithm for dna sequences and its applications in genome comparison. In: Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, RECOMB 2000, p. 107 (2000), http:\/\/doi.acm.org\/10.1145\/332306.332352"},{"key":"79_CR16","unstructured":"Cilibrasi, R.: The CompLearn Toolkit (2003), http:\/\/complearn.sourceforge.net\/"},{"issue":"4","key":"79_CR17","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R. Cilibrasi","year":"2005","unstructured":"Cilibrasi, R., Vit\u00e1nyi, P.: Clustering by compression. IEEE Trans. Information Theory\u00a051(4), 1523\u20131545 (2005)","journal-title":"IEEE Trans. Information Theory"},{"key":"79_CR18","doi-asserted-by":"crossref","unstructured":"Copeland, B.J.: The Church-Turing thesis. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy (2008), http:\/\/plato.stanford.edu\/archives\/fall2008\/entries\/church-turing\/","DOI":"10.14704\/nq.2004.2.2.40"},{"issue":"3","key":"79_CR19","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1214\/aop\/1176991250","volume":"17","author":"T.M. Cover","year":"1989","unstructured":"Cover, T.M., G\u00e1cs, P., Gray, R.M.: Kolmogorov\u2019s contributions to information theory and algorithmic complexity. The Annals of Probability\u00a017(3), 840\u2013865 (1989)","journal-title":"The Annals of Probability"},{"key":"79_CR20","doi-asserted-by":"crossref","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley (2006)","DOI":"10.1002\/047174882X"},{"key":"79_CR21","unstructured":"Fano, R.M.: The transmission of information. Tech. Rep. 65 and 149, Research Laboratory of Electronics. MIT (1949-1950)"},{"key":"79_CR22","volume-title":"Software Metrics: A Rigorous and Practical Approach","author":"N.E. Fenton","year":"1998","unstructured":"Fenton, N.E., Pfleeger, S.L.: Software Metrics: A Rigorous and Practical Approach. PWS Publishing Co., Boston (1998)"},{"key":"79_CR23","first-page":"149","volume":"2","author":"P. G\u00e1cs","year":"1973","unstructured":"G\u00e1cs, P., K\u00f6rner, J.: Common information is far less than mutual information. Prob. Control Info. Theory\u00a02, 149\u2013162 (1973)","journal-title":"Prob. Control Info. Theory"},{"key":"79_CR24","first-page":"173","volume":"38","author":"K. G\u00f6del","year":"1931","unstructured":"G\u00f6del, K.: \u00dcber formal unentscheidbare S\u00e4tze der. Principia Mathematica und verwandter Systeme, I. Monatshefte f\u00fcr Mathematik und Physik\u00a038, 173\u2013198 (1931)","journal-title":"Principia Mathematica und verwandter Systeme, I. Monatshefte f\u00fcr Mathematik und Physik"},{"key":"79_CR25","unstructured":"G\u00f6del, K.: On undecidable propositions of formal mathematical systems (1934)"},{"issue":"4","key":"79_CR26","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1023\/A:1025011119492","volume":"12","author":"P.D. Gr\u00fcnwald","year":"2003","unstructured":"Gr\u00fcnwald, P.D., Vit\u00e1nyi, P.M.B.: Kolmogorov complexity and information theory with an interpretation in terms of questions and answers. J. of Logic, Lang. and Inf.\u00a012(4), 497\u2013529 (2003)","journal-title":"J. of Logic, Lang. and Inf."},{"key":"79_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1515\/crll.1932.166.1","volume":"166","author":"J. Herbrand","year":"1932","unstructured":"Herbrand, J.: Sur la non-contradiction de l\u2019arithmetique. Journal f\u00fcr die Reine und Angewandte Mathematik\u00a0166, 1\u20138 (1932)","journal-title":"Journal f\u00fcr die Reine und Angewandte Mathematik"},{"key":"79_CR28","unstructured":"Kolivas, C.: lrzip \u2013 long range zip, based on rzip by Andrew Tridgell (2006), http:\/\/ck.kolivas.org\/apps\/lrzip\/"},{"issue":"1","key":"79_CR29","first-page":"1","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Probl. Inform. Trans.\u00a01(1), 1\u20137 (1965)","journal-title":"Probl. Inform. Trans."},{"issue":"4","key":"79_CR30","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1070\/RM1983v038n04ABEH004203","volume":"38","author":"A.N. Kolmogorov","year":"1983","unstructured":"Kolmogorov, A.N.: Combinatorial foundations of information theory and the calculus of probabilities. Russian Mathematical Surveys\u00a038(4), 29\u201340 (1983)","journal-title":"Russian Mathematical Surveys"},{"issue":"5","key":"79_CR31","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/TIT.1968.1054210","volume":"IT-14","author":"A.N. Kolmogorov","year":"1968","unstructured":"Kolmogorov, A.N.: Logical basis for information theory and probability theory. IEEE Transactions on Information Theory\u00a0IT-14(5), 662\u2013664 (1968)","journal-title":"IEEE Transactions on Information Theory"},{"key":"79_CR32","unstructured":"Koschke, R.: Survey of research on software clones. In: Duplication, Redundancy, and Similarity in Software Dagstuhl Seminar Proceedings, vol. 06301 (2006)"},{"issue":"2","key":"79_CR33","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/bioinformatics\/17.2.149","volume":"17","author":"M. Li","year":"2001","unstructured":"Li, M., Badger, J.H., Chen, X., Kwong, S., Kearney, P., Zhang, H.: An information-based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics\u00a017(2), 149\u2013154 (2001)","journal-title":"Bioinformatics"},{"issue":"4","key":"79_CR34","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1142\/S0129054107004905","volume":"18","author":"M. Li","year":"2007","unstructured":"Li, M.: Information distance and its applications. International Journal of Foundations of Computer Science\u00a018(4), 669\u2013681 (2007)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"79_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-24477-3_3","volume-title":"Discovery Science","author":"M. Li","year":"2011","unstructured":"Li, M.: Information Distance and Its Extensions. In: Elomaa, T., Hollm\u00e9n, J., Mannila, H. (eds.) DS 2011. LNCS, vol.\u00a06926, pp. 18\u201328. Springer, Heidelberg (2011)"},{"issue":"12","key":"79_CR36","doi-asserted-by":"publisher","first-page":"3250","DOI":"10.1109\/TIT.2004.838101","volume":"50","author":"M. Li","year":"2004","unstructured":"Li, M., Chen, X., Li, X., Ma, B., Vit\u00e1nyi, P.: The similarity metric. IEEE Trans. Information Theory\u00a050(12), 3250\u20133264 (2004)","journal-title":"IEEE Trans. Information Theory"},{"issue":"1","key":"79_CR37","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0890-5401(03)00187-1","volume":"187","author":"J.H. Lutz","year":"2003","unstructured":"Lutz, J.H.: The dimensions of individual strings and sequences. Information and Computation\u00a0187(1), 49\u201379 (2003)","journal-title":"Information and Computation"},{"issue":"6","key":"79_CR38","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"9","author":"P. Martin-L\u00f6f","year":"1966","unstructured":"Martin-L\u00f6f, P.: The definition of random sequences. Information and Control\u00a09(6), 602\u2013619 (1966)","journal-title":"Information and Control"},{"key":"79_CR39","doi-asserted-by":"crossref","unstructured":"Mens, T., Demeyer, S. (eds.): Software Evolution. Springer (2008)","DOI":"10.1007\/978-3-540-76440-3"},{"key":"79_CR40","doi-asserted-by":"crossref","unstructured":"Muchnik, A., Vereshchagin, N.: Logical operations and Kolmogorov complexity. II. In: 16th Annual IEEE Conference on Computational Complexity, pp. 256\u2013265 (2001)","DOI":"10.1109\/CCC.2001.933892"},{"key":"79_CR41","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0304-3975(98)00070-X","volume":"207","author":"A. Muchnik","year":"1998","unstructured":"Muchnik, A.: On common information. Theoretical Computer Science\u00a0207, 319\u2013328 (1998)","journal-title":"Theoretical Computer Science"},{"key":"79_CR42","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1134\/S0081543811060125","volume":"274","author":"A.A. Muchnik","year":"2011","unstructured":"Muchnik, A.A.: Kolmogorov complexity and cryptography. Proc. Steklov Institute of Mathematics\u00a0274, 193\u2013203 (2011)","journal-title":"Proc. Steklov Institute of Mathematics"},{"issue":"5","key":"79_CR43","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/TSE.2003.1199071","volume":"29","author":"S.J. Prowell","year":"2003","unstructured":"Prowell, S.J., Poore, J.H.: Foundations of sequence-based software specification. IEEE Trans. Softw. Eng.\u00a029(5), 417\u2013429 (2003)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"7","key":"79_CR44","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.scico.2009.02.007","volume":"74","author":"C.K. Roy","year":"2009","unstructured":"Roy, C.K., Cordy, J.R., Koschke, R.: Comparison and evaluation of code clone detection techniques and tools: A qualitative approach. Science of Computer Programming\u00a074(7), 470\u2013495 (2009)","journal-title":"Science of Computer Programming"},{"key":"79_CR45","doi-asserted-by":"crossref","unstructured":"Shannon, C.E.: A mathematical theory of communication. The Bell System Technical Journal 27, 379\u2013423, 623\u2013656 (1948)","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"79_CR46","doi-asserted-by":"crossref","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference. part I and part II. Information and Control 7(1, 2), 1\u201322, 224\u2013254 (1964)","DOI":"10.1016\/S0019-9958(64)90131-7"},{"issue":"4","key":"79_CR47","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1016\/j.jcss.2010.06.018","volume":"77","author":"S. Terwijn","year":"2011","unstructured":"Terwijn, S., Torenvliet, L., Vit\u00e1nyi, P.: Nonapproximability of the normalized information distance. Journal of Computer and System Sciences\u00a077(4), 738\u2013742 (2011)","journal-title":"Journal of Computer and System Sciences"},{"key":"79_CR48","unstructured":"Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42, 230\u2013265 (1936), correction in 43, 544-546 (1937)"},{"key":"79_CR49","first-page":"2837","volume":"11","author":"N.X. Vinh","year":"2010","unstructured":"Vinh, N.X., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance. Journal of Machine Learning Research\u00a011, 2837\u20132854 (2010)","journal-title":"Journal of Machine Learning Research"},{"key":"79_CR50","unstructured":"Vit\u00e1nyi, P.M.B.: Similarity and denoising. Philosophical Transactions of the Royal Society, A (to appear), http:\/\/homepages.cwi.nl\/~paulv\/selection.html , (accessed May 7, 2012)"},{"issue":"6","key":"79_CR51","doi-asserted-by":"publisher","first-page":"2464","DOI":"10.1109\/18.945258","volume":"47","author":"P.M. Vit\u00e1nyi","year":"2001","unstructured":"Vit\u00e1nyi, P.M.: Quantum Kolmogorov complexity based on classical descriptions. IEEE Transactions on Information Theory\u00a047(6), 2464\u20132479 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"key":"79_CR52","doi-asserted-by":"crossref","unstructured":"Vit\u00e1nyi, P.M., Balbach, F.J., Cilibrasi, R.L., Li, M.: Normalised information distance. In: Emmert-Streib, F., Dehmer, M. (eds.) Information Theory and Statistical Learning, pp. 45\u201382. Springer (2009)","DOI":"10.1007\/978-0-387-84816-7_3"},{"key":"79_CR53","doi-asserted-by":"crossref","unstructured":"Vit\u00e1nyi, P.: Compression-based similarity. In: First Int. Conf. on Data Compression, Communications and Processing (CCP), pp. 111\u2013118 (June 2011)","DOI":"10.1109\/CCP.2011.50"},{"issue":"4","key":"79_CR54","doi-asserted-by":"publisher","first-page":"2451","DOI":"10.1109\/TIT.2011.2110130","volume":"57","author":"P. Vit\u00e1nyi","year":"2011","unstructured":"Vit\u00e1nyi, P.: Information distance in multiples. IEEE Transactions on Information Theory\u00a057(4), 2451\u20132456 (2011)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Convergence and Hybrid Information Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32645-5_79","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T00:53:35Z","timestamp":1743987215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32645-5_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642326448","9783642326455"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32645-5_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}