<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Open Challenges for the Management and Preservation of Evolving Data on the Web</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Lars Gleim</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Chair of Information Systems, RWTH Aachen University</institution>
          ,
          <addr-line>Aachen</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>and Stefan Decker</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>As the volume, variety, and velocity of data published on the Web continue to increase, the management, governance and preservation of these data play an increasingly important role. Data-driven decision making and algorithmic control systems rely on the persistent availability of critical information. However, to date, the free sharing, reuse and interoperability of data are hindered by a number of fundamental open challenges for the management and preservation of evolving data on the Web. In this work, we provide an overview of open challenges and recent efforts to address them. We then propose a data persistence layer for data management and preservation, paving the way for increased interoperability and compatibility.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Data sharing, reuse and integration are increasingly important for industry, research and
government, as more and more data are being produced and collected, e.g. due to the
influence of Internet of Things technologies. The continuous integration of data from
a multitude of sources serves as foundation and enabler of significant productivity
improvements, digital business models, and novel applications, e.g. in artificial intelligence
(AI) [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. As data-driven control and AI systems take increasingly autonomous decisions,
the assurance of reliability, accountability and trust in the underlying evolving data base
gains significant importance. As such, one of the emerging and fundamental problems
of the Internet is the management and preservation of evolving data on the Web and in
knowledge graphs.
      </p>
      <p>In the following, we provide a concrete breakdown of the associated open challenges
as identified from extensive analysis and literature review, as well as giving a concise
overview of existing approaches addressing these challenges and references to in-depth
surveys on the respective issues, where possible. We then propose the idea of a logical
preservation and persistence layer, integrable into the classical OSI reference model to
address these challenges in a uniform way.</p>
    </sec>
    <sec id="sec-2">
      <title>Challenges for Data Management and Preservation</title>
      <p>
        According to Moore [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ], digital preservation fundamentally revolves around the
principal assurance of infrastructure-independent data persistence, verifiability of authenticity
and integrity of the preserved data, as well as that of the preservation environment and
resource metadata. Based on this foundation and the analysis of relevant related work,
we further decompose data management and preservation to describe the following eight
principal corresponding challenges:
      </p>
      <sec id="sec-2-1">
        <title>C1 Archiving – How to archive a particular version of a resource immutably?</title>
        <p>
          Since resources on the Web typically change over time and frequently become entirely
unavailable [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ], saving corresponding archive copies is essential for their
preservation. Following Moore’s principle of infrastructure independence [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ], an archiving
mechanism should be externally transparent. As such, it should at least logically allow
for later access to independent copies [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] of preserved states, even if more efficient
storage representations, such as change-based or timestamp-based are used internally.
The compression and indexing of such archives (cf. e.g., [
          <xref ref-type="bibr" rid="ref10 ref31">10,31</xref>
          ]), as well as structured
query mechanisms for the temporal data in such archives (cf. e.g., [
          <xref ref-type="bibr" rid="ref2 ref37 ref38 ref8">2,8,37,38</xref>
          ], including
continuous query evaluation, as e.g. in [
          <xref ref-type="bibr" rid="ref39">39</xref>
          ]) are further relevant subchallenges of
archiving. A recent survey of current Web archiving initiatives can be found in [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], as well as a
survey of RDF Archiving approaches in [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>C2 Citation – How to reference a particular resource variant persistently?</title>
        <p>
          As resources may change or disappear over time, being able to persistently reference a
certain version or variant is essential to enable reliable data reuse, especially for data
not controlled by the consumer. To address this challenge, it is common practice to
employ persistent identifiers (PIDs). Hilse and Kothe [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ] provide a good overview of
the available systems and their respective strengths and weaknesses. As postulated by
Kunze [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ], persistence is however purely a matter of service of the resource provider,
not a property of any specific naming syntax, and lastly depends on the commitment
of any given repository to provide it. Whenever a PID exists, the identified resource
should ideally also specify, i.e., wear this PID as its data identifier. Since data on the
Web is however typically only identified using a non-persistent URL, relating resources
and PIDs is another subchallenge of citation, as discussed in [
          <xref ref-type="bibr" rid="ref35">35</xref>
          ]. To avoid this issue,
Gleim and Decker [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] recently proposed to reuse generic timestamped URLs as PIDs
in combination with the time-based HTTP Memento retrieval mechanism [
          <xref ref-type="bibr" rid="ref34">34</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>C3 Retrieval – How to retrieve a particular resource variant from an archive?</title>
        <p>
          Given a PID, it should be possible to resolve and retrieve the underlying resource version
or variant using a standardized and open access mechanism to enable practical data
inspection and reuse. While a wide variety of data retrieval and access mechanisms
exist in theory, resolution of resources on the Web effectively converged towards HTTP
as a common, best practice resolution and retrieval protocol. Nevertheless, to date, no
explicit HTTP PID retrieval mechanism has emerged as a standard. Instead, a variety of
approaches, typically based on the semantic of Cool URIs [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ], are employed. Details
on advanced HTTP resource resolution and retrieval can be found in [
          <xref ref-type="bibr" rid="ref24 ref35 ref40 ref42">24,35,40,42</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>C4 Discovery – How to discover archives, data and available variants?</title>
        <p>
          Data discovery is a multi-dimensional challenge, incorporating (i) the discovery of
resources available on the web (i.e., in need of archiving) and within a given archive,
addressable e.g., using the Linked Data Platform [
          <xref ref-type="bibr" rid="ref36">36</xref>
          ], Web of Things Description [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ] or
classical XML Sitemaps [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], as well as (ii) the discovery of digital archives preserving
certain data, (cf. e.g., [
          <xref ref-type="bibr" rid="ref41">41</xref>
          ]) and (iii) the discovery of different available variants and
versions of individual resources, e.g. over time, both of which are addressable e.g.
through features of the HTTP Memento protocol, as described in [
          <xref ref-type="bibr" rid="ref42">42</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-5">
        <title>C5 Synchronization – How to monitor resource changes and synchronize state?</title>
        <p>
          Especially for applications with continuous data exchange and backup, the ability to
rapidly and efficiently detect resource changes, all well as subsequent state
synchronization, is of critical importance. While depending on the type of data, efficient delta
formats (such as Diff [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] for RDF or JSON Patch [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] for JSON data) are available, a
simple and generic state synchronization mechanism for any type of data is needed. Due
to the already mentioned dominance of the HTTP transfer protocol in the Web,
corresponding synchronization mechanisms should similarly build upon HTTP if possible.
Employing content-negotiation and other HTTP facilities, such as already done by the
HTTP Memento protocol [
          <xref ref-type="bibr" rid="ref34">34</xref>
          ], would further enable the efficient discovery of historic
resource versions though the usage of TimeMaps.
        </p>
      </sec>
      <sec id="sec-2-6">
        <title>C6 Provenance – How to track data origins and influences?</title>
        <p>
          Data provenance is, simply put, metadata information about data origins, influences and
revisions. As data evolves, e.g., through modification, exchange and reuse, provenance
information enables the tracking and tracing of responsible entities for specific changes,
original authors and relevant modifications, as well as the assessment of data
believability [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ] and data quality [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ]. The storage of data’s provenance all the way down
to the atomic level (insertions and deletions) can be very useful to backtrack the data
transformation process and spotlight possible errors on different levels during the data
life-cycle [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ], as well as in the data itself. A summary of requirements for provenance
on the Web is provided by Groth et al. [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], while the W3C PROV standard [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] serves
a solid basis for its practical implementation and usage. Nevertheless, data provenance
information is rarely collected to date. Therefore, a tighter integration of its collection
with core business processes [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] and its semi-automatic collection [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] have been
explored recently. Finally, a standardized connection between data and its provenance is
frequently missing, e.g. for typical binary files shared on the Web.
        </p>
      </sec>
      <sec id="sec-2-7">
        <title>C7 Verifiability – How to assert data authenticity and integrity?</title>
        <p>
          To enable trust in the data management and preservation process, the verifiability of
authenticity and integrity of the preserved data, as well as its provenance and other
metadata, is another open challenge. While proposals to ensure authenticity and integrity
do exist, e.g., through HTTP content signing [
          <xref ref-type="bibr" rid="ref3 ref43">3,43</xref>
          ], no technical mechanism for it is
well established to date. Instead, current best practices typically rely on manual and
labor-intensive data repository audits [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ], a process not sufficiently well integrated into
the digital infrastructure of the Web to enable automatic verification.
        </p>
      </sec>
      <sec id="sec-2-8">
        <title>C8 Sustainability – How to enable long-term data preservation at scale?</title>
        <p>
          Finally, all presented challenges are subject to the additional challenge of sustainability,
to facilitate long-term data preservation at scale. Notably, this incorporates subchallenges
such as achieving data redundancy through efficient data duplication, discovery,
synchronization, archiving, etc. with minimal management overhead and cost. In general terms,
the data management and preservation mechanism should maximize data persistence
while introducing the minimal amount of associated overhead and cost possible. Recent
work addressing this issue includes a large variety of approaches, ranging from
decentralized, usage-based data caching [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], via abstract interoperability models [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], to full
architecture proposals for sustainable publishing and querying of distributed Linked
Data archives on the Web [
          <xref ref-type="bibr" rid="ref42">42</xref>
          ]. Relating back to Moore’s theory of digital
preservation [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ], the principal assurance of infrastructure-independence finally mandates the
establishment of an open ecosystem, capable of adapting to change, e.g., of the data
models, metadata structure and employed protocols.
        </p>
        <p>
          Even though we focus on these eight principal challenges for data management
and preservation, there are a number of additional related issues worth mentioning,
pertinent to the usage of evolving data: Appraisal (How to assess the quality of a dataset?
Cf. [
          <xref ref-type="bibr" rid="ref44 ref45">44,45</xref>
          ]), Curation (How to integrate data, repair imperfections and ensure data
quality? Cf. [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]), Reasoning and Prediction (How to extract and predict knowledge
from evolving knowledge graphs? Cf. [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ]), and Visualization (How to visualize data
and knowledge evolution? Cf. [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]). In the following, we propose to uniformly address
these challenges using an interoperability layer for data preservation.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>The Need for Interoperable Data Preservation</title>
      <p>
        While a wide range of data management and preservation systems have been proposed
in the past, their practical adoption and impact have been limited. It is our understanding,
that even though viable solutions for several of the mentioned challenges are readily
available in principle, such as PID systems or the PROV standard [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] for data provenance,
the associated effort and overhead of adoption currently render active implementation
of infrastructure for data management and preservation infeasible for all but the few
stakeholders, for which it is core to their business or mission. However, we believe that
the success of version control and metadata management systems such as GIT [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ] in the
software development domain have shown, that the availability of easy to use and readily
available tooling and standards leads to the adoption of corresponding systems, even
by casual users. Notably, GIT serves as an underlying, interoperable data management
and persistence layer, independent of the tooling employed for software development.
It is our firm conviction, that a similar interoperable and easily adoptable data
management and interoperability layer is needed for data on the Web, to simplify and drive the
adoption of corresponding solutions.
      </p>
      <p>
        Inspired by an early layered model for interoperability on the Web by Melnik and
Decker [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ], the layered architecture of Linked Data Applications by Heitmann et
al. [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] and the FactDAG interoperability model [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], we propose the introduction of
the Preservation and Persistence Layer, as illustrated in Figure 1. We position it in
between Transport Layer and Application Layer of the TCP/IP stack, respectively in
between Transport Layer and Session Layer of the classical OSI reference model [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ],
which characterizes and standardizes the communication functions of computing systems
using abstract layers. As such, this new layer would enable uniform data persistence
and preservation support for data on the Web, easily incorporable into the existing Web
infrastructure and providing promising opportunities for the automation of many aspects
of the preservation challenges, such as the archiving of novel resource variants, the
discovery and retrieval of persistently identified archived data revisions, the collection
of basic provenance information and the verification of a resource’s authenticity and
integrity, lastly also contributing to Web sustainability, by establishing a more uniform
data management and preservation ecosystem.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Conclusion and Outlook</title>
      <p>In this work, we have analyzed open challenges for the management and preservation
of evolving data on the Web, identifying eight fundamental challenges. We have given
an overview of important corresponding research addressing each of these challenges,
as well as potential solution candidates. Based on these findings, we have identified
the need for interoperability and deeper integration of corresponding approaches and
proposed the development of a uniform Preservation and Persistence Layer, providing
data management and preservation facilities for all types of data on the Web.</p>
      <p>Future work should devise and evaluate means for the practical implementation and
adoption of such a layer, possibly based on existing technologies such as the HTTP
Memento protocol, the PROV standard for data provenance or HTTP content signing
mechanisms. Implementing such a layer has the potential to uniformly and interoperably
address all principal challenges of data management and preservation, furthering open
data sharing, reuse and integration for applications in industry, research and government.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Ambacher</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ashley</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berry</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brooks</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dale</surname>
            ,
            <given-names>R.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Flecker</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giaretta</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hamidzadeh</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Johnson</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jones</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McHugh</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sawyer</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Steenbakkers</surname>
          </string-name>
          , J.:
          <source>Trustworthy Repositories Audit &amp; Certification : Criteria and Checklist. Tech. rep., Center for Research Libraries</source>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Anderson</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bendiken</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Transaction-time queries in Dydra</article-title>
          .
          <source>In: Joint Proceedings of MEPDaW and LDQ @ ESWC</source>
          . pp.
          <fpage>11</fpage>
          -
          <lpage>19</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Backman</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Richer</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sporny</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          : Signing HTTP Messages.
          <article-title>Internet-Draft draft-ietfhttpbis-</article-title>
          <string-name>
            <surname>message-</surname>
          </string-name>
          signatures-
          <volume>00</volume>
          , Internet Engineering Task Force (
          <year>2020</year>
          ), work in Progress
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Berners-Lee</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Connolly</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Delta: an ontology for the distribution of differences between RDF graphs (</article-title>
          <year>2004</year>
          ), http://www.w3.org/DesignIssues/Diff
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Bikakis</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sellis</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Exploration and Visualization in the Web of Big Linked Data: A Survey of the State of the Art</article-title>
          .
          <source>In: Proceedings of the Workshops of the EDBT/ICDT</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6. KI in der
          <issue>Industrie 4</issue>
          .0: Orientierung, Anwendungsbeispiele, Handlungsempfehlungen.
          <source>Tech. rep., Bundesministerium fu¨r Wirtschaft und Energie (BMWi)</source>
          , Berlin (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Bryan</surname>
            ,
            <given-names>P.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nottingham</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>JavaScript Object Notation (JSON) Patch</article-title>
          . RFC
          <volume>6902</volume>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Chekol</surname>
            ,
            <given-names>M.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fionda</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          , Pirro`, G.:
          <article-title>Time Travel Queries in RDF Archives</article-title>
          .
          <source>In: Joint Proceedings of MEPDaW and LDQ @ ESWC</source>
          . pp.
          <fpage>28</fpage>
          -
          <lpage>42</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Costa</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gomes</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Silva</surname>
            ,
            <given-names>M.J.:</given-names>
          </string-name>
          <article-title>The evolution of web archiving</article-title>
          .
          <source>International Journal on Digital Libraries</source>
          <volume>18</volume>
          (
          <issue>3</issue>
          ),
          <fpage>191</fpage>
          -
          <lpage>205</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. Ferna´ndez, J.D.,
          <string-name>
            <surname>Polleres</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Umbrich</surname>
          </string-name>
          , J.:
          <article-title>Towards Efficient Archiving of Dynamic LinkedOpen Data</article-title>
          .
          <source>In: Proceedings of DIACHRON @ ESWC</source>
          . pp.
          <fpage>34</fpage>
          -
          <lpage>49</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Folz</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skaf-Molli</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Molli</surname>
            ,
            <given-names>P.:</given-names>
          </string-name>
          <article-title>CyCLaDEs: A Decentralized Cache for Triple Pattern Fragments</article-title>
          .
          <source>In: ESWC</source>
          <year>2016</year>
          :
          <article-title>The Semantic Web</article-title>
          .
          <source>Latest Advances and New Domains</source>
          , pp.
          <fpage>455</fpage>
          -
          <lpage>469</lpage>
          . Springer International Publishing (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Freitas</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Curry</surname>
          </string-name>
          , E.:
          <article-title>Big Data Curation</article-title>
          . In:
          <article-title>New Horizons for a Data-Driven Economy</article-title>
          , pp.
          <fpage>87</fpage>
          -
          <lpage>118</lpage>
          . Springer International Publishing (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Gleim</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Decker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Timestamped URLs as Persistent Identifiers</article-title>
          . In: MEPDaW @ ISWC (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Gleim</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pennekamp</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liebenberg</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Buchsbaum</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Niemietz</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Knape</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Epple</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Storms</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trauth</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bergs</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brecher</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Decker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lakemeyer</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wehrle</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>FactDAG: Formalizing Data Interoperability in an Internet of Production</article-title>
          .
          <source>IEEE Internet of Things Journal</source>
          <volume>7</volume>
          (
          <issue>4</issue>
          ),
          <fpage>3243</fpage>
          -
          <lpage>3253</lpage>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Gleim</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tirpitz</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pennekamp</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Decker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Expressing FactDAG Provenance with PROV-O</article-title>
          . In: MEPDaW @ ISWC (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>Google</given-names>
            <surname>Inc</surname>
          </string-name>
          ., Yahoo Inc., Microsoft Corporation:
          <article-title>Sitemaps XML format (</article-title>
          <year>2008</year>
          ), https://www. sitemaps.org/protocol.html
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Groth</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gil</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cheney</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Miles</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Requirements for Provenance on the Web</article-title>
          .
          <source>International Journal of Digital Curation</source>
          <volume>7</volume>
          (
          <issue>1</issue>
          ),
          <fpage>39</fpage>
          -
          <lpage>56</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Groth</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moreau</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>PROV-Overview</article-title>
          . W3C Working Group Note (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Hartig</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Using Web Data Provenance for Quality Assessment</article-title>
          .
          <source>In: Proceedings of SWPM @ ISWC</source>
          . vol.
          <volume>526</volume>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Heitmann</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cyganiak</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hayes</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Decker</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Architecture of Linked Data Applications</article-title>
          . In: Harth,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Hose</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Schenkel</surname>
          </string-name>
          ,
          <string-name>
            <surname>R</surname>
          </string-name>
          . (eds.)
          <article-title>Linked Data Manag</article-title>
          . Princ. Tech., pp.
          <fpage>69</fpage>
          -
          <lpage>91</lpage>
          . Chapman and Hall/CRC, 1st edn. (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Hilse</surname>
            ,
            <given-names>H.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kothe</surname>
            ,
            <given-names>J.: Implementing</given-names>
          </string-name>
          <string-name>
            <surname>Persistent Identifiers</surname>
          </string-name>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22. OSI/IEC 7498-1:1994:
          <article-title>Information technology - Open Systems Interconnection - Basic Reference Model: The Basic Model</article-title>
          .
          <source>ISO</source>
          (
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23. Ka¨fer, T.,
          <string-name>
            <surname>Abdelrahman</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Umbrich</surname>
            , J.,
            <given-names>O</given-names>
          </string-name>
          <string-name>
            <surname>'Byrne</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hogan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Observing Linked Data Dynamics</article-title>
          .
          <source>In: ESWC 2013</source>
          . vol.
          <source>LNCS 7882</source>
          , pp.
          <fpage>213</fpage>
          -
          <lpage>227</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Kunze</surname>
            ,
            <given-names>J.A.: Towards</given-names>
          </string-name>
          <string-name>
            <surname>Electronic Persistence Using ARK Identifiers</surname>
          </string-name>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Loeliger</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McCullough</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Version Control with Git: Powerful tools and techniques for collaborative software development.</article-title>
          <string-name>
            <surname>O'Reilly Media</surname>
          </string-name>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Margara</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Urbani</surname>
          </string-name>
          , J., van
          <string-name>
            <surname>Harmelen</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bal</surname>
          </string-name>
          , H.:
          <article-title>Streaming the Web: Reasoning over dynamic data</article-title>
          .
          <source>Journal of Web Semantics</source>
          <volume>25</volume>
          (
          <issue>March</issue>
          ),
          <fpage>24</fpage>
          -
          <lpage>44</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Mathew</surname>
            ,
            <given-names>S.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Atif</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sheng</surname>
            ,
            <given-names>Q.Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maamar</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Web of things: Description, discovery and integration</article-title>
          .
          <source>In: ICIOT and CPSCom</source>
          . pp.
          <fpage>9</fpage>
          -
          <lpage>15</lpage>
          . IEEE (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Melnik</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Decker</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>A Layered Approach to Information Modeling and Interoperability on the Web</article-title>
          .
          <source>Proceedings of Workshop on the Semantic Web @ ECDL</source>
          (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Moore</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Towards a Theory of Digital Preservation</article-title>
          .
          <source>International Journal of Digital Curation</source>
          <volume>3</volume>
          (
          <issue>1</issue>
          ),
          <fpage>63</fpage>
          -
          <lpage>75</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Ngomo</surname>
            ,
            <given-names>A.C.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Auer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zaveri</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Introduction to Linked Data and Its Lifecycle on the Web</article-title>
          .
          <source>In: Reasoning Web. Reasoning on the Web in the Big Data Era</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>99</lpage>
          . Springer International Publishing (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Pelgrin</surname>
            <given-names>Olivier</given-names>
          </string-name>
          , Gala´rraga Luis, Hose Katja:
          <article-title>Towards Fully-fledged Archiving for RDF Datasets</article-title>
          .
          <source>Semantic Web Journal</source>
          <volume>1</volume>
          (
          <issue>0</issue>
          ),
          <fpage>1</fpage>
          -
          <lpage>20</lpage>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Prat</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Madnick</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Measuring Data Believability: A Provenance Approach</article-title>
          . In: HICSS. pp.
          <fpage>393</fpage>
          -
          <lpage>393</lpage>
          . IEEE (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>Sauermann</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cyganiak</surname>
            ,
            <given-names>R.,</given-names>
          </string-name>
          <article-title>V o¨lkel, M.: Cool URIs for the Semantic Web (</article-title>
          <year>2007</year>
          ), http: //www.w3.org/TR/cooluris/
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34. Van de Sompel, H.,
          <string-name>
            <surname>Nelson</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sanderson</surname>
          </string-name>
          , R.:
          <article-title>HTTP Framework for Time-Based Access to Resource States - Memento</article-title>
          . RFC
          <volume>7089</volume>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35. Van de Sompel, H.,
          <string-name>
            <surname>Sanderson</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shankar</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Klein</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Persistent Identifiers for Scholarly Assets and the Web: The Need for an Unambiguous Mapping</article-title>
          .
          <source>International Journal of Digital Curation</source>
          <volume>9</volume>
          (
          <issue>1</issue>
          ),
          <fpage>331</fpage>
          -
          <lpage>342</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.
          <string-name>
            <surname>Speicher</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Arwe</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malhotra</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <source>Linked Data Platform 1.0. W3C Recommendation, February</source>
          <volume>26</volume>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          37.
          <string-name>
            <surname>Taelman</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sande</surname>
            ,
            <given-names>M.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verborgh</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mannens</surname>
          </string-name>
          , E.:
          <article-title>Versioned Triple Pattern Fragments: A Low-cost Linked Data Interface Feature for Web Archives</article-title>
          .
          <source>Joint Proceedings of MEPDaW and LDQ @ ESWC</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          38.
          <string-name>
            <surname>Taelman</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Takeda</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sande</surname>
            ,
            <given-names>M.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verborgh</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>The Fundamentals of Semantic Versioned Querying</article-title>
          .
          <source>In: Proceedings of SSWS @ ISWC</source>
          . pp.
          <fpage>1</fpage>
          -
          <lpage>14</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          39.
          <string-name>
            <surname>Taelman</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verborgh</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Colpaert</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mannens</surname>
          </string-name>
          , E.:
          <article-title>Continuous Client-Side Query Evaluation over Dynamic Linked Data</article-title>
          .
          <source>In: The Semantic Web</source>
          , pp.
          <fpage>273</fpage>
          -
          <lpage>289</lpage>
          . Springer International Publishing (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          40.
          <string-name>
            <surname>Thompson</surname>
            ,
            <given-names>H.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Orchard</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          : URNs, Namespaces and Registries (
          <year>2006</year>
          ), https://www.w3. org/2001/tag/doc/URNsAndRegistries-50
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          41.
          <string-name>
            <given-names>Vander</given-names>
            <surname>Sande</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Verborgh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Dimou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Colpaert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Mannens</surname>
          </string-name>
          , E.:
          <article-title>Hypermedia-Based Discovery for Source Selection Using Low-Cost Linked Data Interfaces</article-title>
          .
          <source>International Journal on Semantic Web and Information Systems</source>
          <volume>12</volume>
          (
          <issue>3</issue>
          ),
          <fpage>79</fpage>
          -
          <lpage>110</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          42.
          <string-name>
            <given-names>Vander</given-names>
            <surname>Sande</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Verborgh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Hochstenbach</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          , Van de Sompel, H.:
          <article-title>Toward sustainable publishing and querying of distributed Linked Data archives</article-title>
          .
          <source>Journal of Documentation</source>
          <volume>74</volume>
          (
          <issue>1</issue>
          ),
          <fpage>195</fpage>
          -
          <lpage>222</lpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          43.
          <string-name>
            <surname>Yasskin</surname>
          </string-name>
          , J.:
          <source>Signed HTTP Exchanges</source>
          .
          <article-title>Internet-Draft draft-yasskin-http-</article-title>
          <string-name>
            <surname>origin-</surname>
          </string-name>
          signedresponses-
          <volume>09</volume>
          , Internet Engineering Task Force (
          <year>Jul 2020</year>
          ), work in Progress
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          44.
          <string-name>
            <surname>Zaveri</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rula</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maurino</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pietrobon</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lehmann</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Auer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Quality assessment for Linked Data: A Survey</article-title>
          .
          <source>Semantic Web Journal</source>
          <volume>7</volume>
          (
          <issue>1</issue>
          ),
          <fpage>63</fpage>
          -
          <lpage>93</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          45.
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Madnick</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <source>Data and Information Quality Research: Its Evolution and Future</source>
          . In: Computing Handbook, 3rd ed. (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>