使网络上的数字文物可验证和可靠
Making Digital Artifacts on the Web Verifiable and Reliable
摘要：
当前的Web没有通用的机制来使数字工件-如数据集、代码、文本和图像-可验证和永久。对于被认为是不可变的数字工件，此外还没有普遍接受的方法来实施这种不可变性。这些缺点对再现依赖于Web资源的过程的结果的能力产生了严重的负面影响，这反过来又严重影响了诸如科学等再现性很重要的领域。为了解决这个问题，我们提出了包含加密哈希值的可信URI。我们展示了如何可信赖的URI可以用于数字文物的验证，在结构化的数据文件，如nanopublications的情况下，以独立的序列化格式的方式。我们演示了这些文件的内容是如何变得不可变的，包括对外部数字工件的依赖关系，从而将可验证性的范围扩展到整个引用树。我们的方法坚持Web的核心原则，即开放性和去中心化架构，并与现有标准和协议完全兼容。对我们的参考实现的评估表明，这些设计目标确实是通过我们的方法实现的，并且即使对于非常大的文件也是实用的。
英文摘要：
The current Web has no general mechanisms to make digital artifacts --- such as datasets, code, texts, and images --- verifiable and permanent. For digital artifacts that are supposed to be immutable, there is moreover no commonly accepted method to enforce this immutability. These shortcomings have a serious negative impact on the ability to reproduce the results of processes that rely on Web resources, which in turn heavily impacts areas such as science where reproducibility is important. To solve this problem, we propose trusty URIs containing cryptographic hash values. We show how trusty URIs can be used for the verification of digital artifacts, in a manner that is independent of the serialization format in the case of structured data files such as nanopublications. We demonstrate how the contents of these files become immutable, including dependencies to external digital artifacts and thereby extending the range of verifiability to the entire reference tree. Our approach sticks to the core principles of the Web, namely openness and decentralized architecture, and is fully compatible with existing standards and protocols. Evaluation of our reference implementations shows that these design goals are indeed accomplished by our approach, and that it remains practical even for very large files.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
