1. 1. T. Kuhn and M. Dumontier, “Trusty URIs: Verifiable, immutable, and permanent digital artifacts for linked data,” in Proc. 11th Extended Semantic Web Conf., 2014, pp. 395–410
   2. P. Groth, A. Gibson, and J. Velterop, “The anatomy of a nano-publication,” Inf. Serv. Use, vol. 30, no. 1, pp. 51– 56, 2010.
   3. S. Farrell, D. Kutscher, C. Dannewitz, B. Ohlman, A. Keranen, and P. Hallam-Baker, “Naming things with hashes,” Internet Engineering Task Force (IETF), Standards Track RFC 6920, Apr. 2013.
   4. R. Hoekstra, “The MetaLex document server,” in Proc. 10th Int. Conf. The Semantic Web, 2011, pp. 128–143.
   5. M. Altman and G. King, “A proposed standard for the scholarly citation of quantitative data,” D-lib Mag., vol. 13, no. 3, p. 5, 2007.
   6. M. Bartel, J. Boyer, B. Fox, B. LaMacchia, and E. Simon, (2008, Jun.). XML signature syntax and processing. W3C, Recommenda-tion. [Online]. Available: http://www.w3.org/TR/xmldsig-core/
   7. J. Carroll, “Signing RDF graphs,” in Proc. 2nd Int. Semantic Web Conf., The Semantic Web, 2003, pp. 369– 384.
   8. E. Hofig€ and I. Schieferdecker, “Hashing of RDF graphs and a solution to the blank node problem,” in Proc. 10th Int. Workshop Uncertainty Reasoning Semantic Web, 2014, pp. 55.
   9. M. Bellare, O. Goldreich, and S. Goldwasser, “Incremental cryp-tography: The case of hashing and signing,” in Proc. 14th Annu. Int. Cryptol. Conf., Adv. Cryptol., 1994, pp. 216–233
   10. C. Sayers and A. Karp, “Computing the digest of an RDF graph,” Mobile and Media Systems Laboratory, HP Laboratories, Palo Alto, USA, Tech. Rep. HPL-2003- 235(R.1), 2004.
   11. R. Phan and D. Wagner, “Security considerations for incremental hash functions based on pair block chaining,” Comput. Security, vol. 25, no. 2, pp. 131–136, 2006