<!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>Wikidated 1.0: An Evolving Knowledge Graph Dataset of Wikidata's Revision History</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Lukas Schmelzeisen</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Corina Dima</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ste en Staab</string-name>
          <email>Steffen.Staabg@ipvs.uni-stuttgart.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Southampton</institution>
          ,
          <country country="UK">United Kingdom</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University of Stuttgart</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Wikidata is the largest general-interest knowledge base that is openly available. It is collaboratively edited by thousands of volunteer editors and has thus evolved considerably since its inception in 2012. In this paper, we present Wikidated 1.01, a dataset of Wikidata's full revision history, which encodes changes between Wikidata revisions as sets of deletions and additions of RDF triples. To the best of our knowledge, it constitutes the rst large dataset of an evolving knowledge graph, a recently emerging research subject in the Semantic Web community. We introduce the methodology for generating Wikidated 1.0 from dumps of Wikidata, discuss its implementation and limitations, and present statistical characteristics of the dataset.</p>
      </abstract>
      <kwd-group>
        <kwd>Semantic Web</kwd>
        <kwd>Wikidata</kwd>
        <kwd>Edit History</kwd>
        <kwd>Knowledge Graph Change</kwd>
        <kwd>Knowledge Graph Evolution</kwd>
        <kwd>Stream of RDF Triple Changes</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        A knowledge graph is \a graph of data intended to accumulate and convey
knowledge of the real world, whose nodes represent entities of interest and
whose edges represent potentially di erent relations between these entities" [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
Recently, knowledge graphs have received much attention in research and powered
many diverse applications, such as web search [
        <xref ref-type="bibr" rid="ref30">30</xref>
        ], recommendations [
        <xref ref-type="bibr" rid="ref24 ref9">9,24</xref>
        ],
question answering [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], and more [
        <xref ref-type="bibr" rid="ref15 ref17">15,17</xref>
        ].
      </p>
      <p>
        Most research so far treats knowledge graphs as static in the sense that
change over time is not modeled explicitly. However, in practice, knowledge
graphs change over time: new knowledge may be added to the graph (in the form
of new edges being added to existing entities, new entities emerging over time,
etc.), and existing knowledge may be revised (in the form of imprecise labels being
updated, duplicate entities merged, existing contents declared out-of-scope, etc.).
This more general setting is only starting to be considered recently [
        <xref ref-type="bibr" rid="ref14 ref21 ref25">14,21,25</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>1 Dataset and code base available at https://w3id.org/wikidated.</title>
      <p>
        For example, while there are a plethora of di erent approaches for knowledge
graph embedding [
        <xref ref-type="bibr" rid="ref2 ref31 ref36 ref7">36,7,31,2</xref>
        ]|the task of representing entities and relations in
a low-dimensional vector space|only a handful of these consider the situation
where the representation needs to be updated due to a change in the underlying
knowledge graph [
        <xref ref-type="bibr" rid="ref37 ref4 ref6">4,37,6</xref>
        ]. To highlight this distinction, we use the term evolving
knowledge graph to refer to knowledge graphs that change over time, and the
term static knowledge graph to refer to those that do not.
      </p>
      <p>
        Currently, there are practically no published datasets recording a knowledge
graph's organic evolution over time that would enable such research and facilitate
reproducible evaluation environments. Instead, existing research either simulates
knowledge graph evolution on top of datasets of static knowledge graphs using
simple heuristics such as statement ordering (e. g., Daruna et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] split static
knowledge graph datasets into chunks based on the order of triples in the dataset)
or are based on the computed changes between major releases of knowledge graphs
(e. g., Wu et al. [
        <xref ref-type="bibr" rid="ref37">37</xref>
        ] calculate the change sets between YAGO2.5, YAGO3, and
YAGO3.1 [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]). While the former approaches can hardly be argued to constitute
evolving knowledge graphs|in particular statement updates or deletion are not
modeled|the latter ones fail to capture the inherent dynamics of how changes
occur on the individual level, for example that popular entities receive frequent
updates or that some updates might be (partially) reversed after a few days.
      </p>
      <p>
        Wikidata [
        <xref ref-type="bibr" rid="ref35">35</xref>
        ] is \a collaboratively edited knowledge-base [. . .] whose aim is to
curate and represent the factual information of Wikipedia (across all languages)
in an interoperable, machine-readable format" [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. With 90 million entities and
1.4 billion revision made by 20 thousand active users2, Wikidata is the prime
example of an evolving knowledge graph. In this paper, we present Wikidated 1.0,
an evolving knowledge graph dataset covering the full revision history of Wikidata.
To the best of our knowledge, Wikidated 1.0 is the rst large dataset of an evolving
knowledge graph. It records the ne-grained, organic evolution of Wikidata since
its inception in 2012 until June 2021. It is suited for research into how knowledge
graphs and their communities change over time|speci cally for Wikidata, such
as done in Sarasua et al. [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]|and enables reproducible evaluation environments
for indexing and representation approaches of evolving knowledge graphs, such
as incremental knowledge graph embedding [
        <xref ref-type="bibr" rid="ref37 ref6">37,6</xref>
        ].
      </p>
      <p>In particular, our contributions are:
{ We present our methodology for transforming a dump of Wikidata's
revision history into streams of RDF triple deletions and additions which form
Wikidated 1.0, a dataset recording Wikidata's evolution over time (Sect. 3).
{ We present statistics over the dataset and visualize its characteristics (Sect. 4).
{ We publicly release Wikidated 1.0 in two variants, the code base used to
built it, and a Python API to access it1.</p>
      <p>In addition to the above, Sects. 2 and 5 discuss background and related work,
respectively, and Sect. 6 concludes.</p>
    </sec>
    <sec id="sec-3">
      <title>2 Statistics from https://www.wikidata.org/wiki/Wikidata:Statistics (23 July 2021).</title>
      <sec id="sec-3-1">
        <title>Background</title>
        <p>In this section, we review the data model of Wikidata (Sect. 2.1) and its
serialization as RDF (Sect. 2.2).
2.1</p>
        <sec id="sec-3-1-1">
          <title>Data Model</title>
          <p>Formally, the data model of Wikidata3 can be de ned as a set of entities
e1; : : : ; eN , where N is the number of entities in Wikidata. Let id(ei) denote the
entity ID of entity ei. Each entity is either an item or a property 4. Items are things
or concepts in the real world about which facts should be stored; their IDs are
numbers pre xed with \Q"|for example, the English writer Douglas Adams (Q42)
or the concept of a human (Q5). Properties are abstract types of statements
which are used to store facts about entities; their IDs are numbers pre xed
with \P"|for example, the properties instance-of (P31) or date-of-birth (P569).</p>
          <p>A revision de nes an entity's state at a speci c point in time. Each revision
is comprised of: (1) a ngerprint, which consists of multilingual sets of labels,
descriptions, and aliases of the entity, (2) a set of site links, which are usually
links to Wikipedia articles about the entity, and (3) a set of statements, which
are records of facts about the entity. There is one exception: if an entity is found
to be a duplicate of another one, a revision can also be a redirect. In the case of
redirects, no ngerprint, site links, or statements are present, and the revision
consists of just the entity ID that the redirect's entity is deemed to be a duplicate
of. Further, each revision (including redirects) carries metadata, such as the time
it was created at, the contributor that authored it, and a comment string about
the change.</p>
          <p>Every time an entity is modi ed, a new revision is created. We therefore
model entities as sequences of their revisions ei = (ri;1; : : : ; ri;ni ), where ni is the
number of revisions of entity ei. Let id(ri;j ) denote the revision ID of revision ri;j .
Revision IDs are assigned by incrementing a global counter. They are thereby
unique over all entities and induce a total ordering of all revisions in Wikidata5.</p>
          <p>Finally, statements record facts about entities and fundamentally consist of
a property and a value, which is either another entity or a literal. For example,
statements about Douglas Adams include instance-of human and date-of-birth
\11 March 1952". As is the case in the latter example, literals can be of various
data types, e. g., dates or geographical coordinates. An example of a statement
about a property is that the complementary-property of date-of-birth is
date-ofdeath. Note, that entities whose latest revision is a redirect and deleted entities
can still be targets of the statements of other entities, but that Wikidata aims to
replace instances of this with new revisions where this is not the case. There are</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>3 For more details, see https://www.mediawiki.org/wiki/Wikibase/DataModel.</title>
    </sec>
    <sec id="sec-5">
      <title>4 As discussed in Sect. 3.3, technically, entities can also be lexemes, forms, or senses.</title>
    </sec>
    <sec id="sec-6">
      <title>5 However, the special case, in which a revision has an earlier timestamp than one with</title>
      <p>a lower ID, can occur. We attribute this to slight miss-synchronizations of clocks on
parallel servers. The di erence is never larger than one second.
two special values of statements: none, which signi es that it is known that the
property of that entity has no value, and some, which indicates that it is known
that there is some value for the property of that entity, but it is unknown what
it is. Each statement can be annotated by (1) a set of quali ers, which re ne a
statement (e. g., to indicate that it has only been true for some period of time),
(2) a set of references, which provide sources to support the statement, and (3) a
rank, which can be used to assign preference to con icting statements (e. g., to
distinguish current from historical facts).</p>
      <p>Dumps of Wikidata's contents are available for download in various formats6.
Most dump formats only provide the most recent revision of each entity; only
the pages-meta-history XML dumps include the full revision history, but store
revision contents as JSON blobs7. Notably, each revisions stores its complete
state at its creation time and there is no trivial way to identify what changed
from one revision to the next.</p>
      <p>In cases of vandalism, or when entities do not meet Wikidata's notability
policy8, administrators may delete the a ected revisions or whole entities from
Wikidata9. Since such deleted contents may contain copyrighted materials or
sensible personal information, deleted entities and revisions are not accessible to
the general public and are not contained in the o cial dumps of Wikidata. IDs of
deleted entities and revisions are never reused for new ones, which leads to gaps
in the incremental numbering. In case an entity is detected that is a duplicate of
an existing one, Wikidata prefers not to delete the new entity, but to establish a
redirect from the new entity to the existing one instead.
2.2</p>
      <p>
        RDF
The Resource Description Framework (RDF) [
        <xref ref-type="bibr" rid="ref28 ref5">28,5</xref>
        ] is a metadata format and
the standard way of exchanging information on the Semantic Web. For the
Wikidated 1.0 dataset, we serialize Wikidata revisions as RDF graphs which
allows for a straightforward de nition of change between revisions.
      </p>
      <p>
        Let I, B, and L be disjoint countably in nite sets of IRIs, blank nodes, and
literals, respectively. A RDF triple is a triple (s; p; o) 2 (I [ B) I (I [ B [ L),
where s is called the subject, p the predicate, and o the object. A RDF graph is a
set of RDF triples. Let G1 n G2 denote the set di erence between two RDF graphs
G1 and G2. Computing it is non-trivial, because in order to decide whether two
RDF triples are equal, one needs to decide which triple components are equal
to one another. This is straightforward for IRIs and literals, but hard for blank
nodes, as they are only characterized through the RDF triples they participate
in and do not have identi ers across RDF graphs. In general, nding a mapping
between the blank nodes of two RDF graphs that minimizes the set di erence is
NP-hard [
        <xref ref-type="bibr" rid="ref1 ref13 ref18 ref34">34,18,1,13</xref>
        ]. For Wikidated 1.0, we circumvent this issue (see Sect. 3.2).
      </p>
    </sec>
    <sec id="sec-7">
      <title>6 See https://www.wikidata.org/wiki/Wikidata:Database download.</title>
    </sec>
    <sec id="sec-8">
      <title>7 See https://doc.wikimedia.org/Wikibase/master/php/md docs topics json.html.</title>
    </sec>
    <sec id="sec-9">
      <title>8 Available at https://www.wikidata.org/wiki/Wikidata:Notability.</title>
    </sec>
    <sec id="sec-10">
      <title>9 Requests for deletions and the decisions for each are recorded at https://www.</title>
      <p>wikidata.org/wiki/Wikidata:Requests for deletions.
1 wd:Q42 a wikibase:Item ;
2 rdfs:label "Douglas Adams"@en ;
3 schema:description "English writer and humorist"@en ;
4 skos:altLabel "Douglas Noel Adams"@en ;
5 wdt:P569 "1952-03-11T00:00:00Z"^^xsd:dateTime ;
6 p:P569 s:Q42-D8404CDA-25E4-4334-AF13-A3290BCD9C0F .
7
8 &lt;https://en.wikipedia.org/wiki/Douglas_Adams&gt; a schema:Article ;
9 schema:about wd:Q42 .
10
11 s:Q42-D8404CDA-25E4-4334-AF13-A3290BCD9C0F a wikibase:Statement ;
12 ps:P569 "1952-03-11T00:00:00Z"^^xsd:dateTime ;
13 prov:wasDerivedFrom ref:355b56329b78db22be549dec34f2570ca61ca056 .
14
15 ref:355b56329b78db22be549dec34f2570ca61ca056 a wikibase:Reference ;
16 pr:P248 wd:Q5375741 .</p>
      <p>Listing 1. RDF serialization of Wikidata entity Q42 in Turtle syntax (abridged).</p>
      <p>
        While Wikidata doesn't store revisions in RDF internally, RDF serializations
for them are available [
        <xref ref-type="bibr" rid="ref10 ref15 ref8">8,10,15</xref>
        ]. Listing 1 shows an example10. The shown revision
of entity Q42 (Douglas Adams) is described by its ngerprint (Lines 2 to 4), a
site link (Lines 8 to 9), a simple statement (Line 5), and a full statement (Line 6
and Lines 11 to 13). Both statements specify a date-of-birth (P569) of \11 March
1952". The di erence is that simple statements give a value \directly" while
discarding statement annotations (i. e., quali ers, references, and ranks), whereas
full statements use rei cation (the insertion of a special statement node) to
facilitate annotations. In this case, a reference to Encyclop dia Britannica Online
(Q5375741, Lines 15 to 16) is used to annotate the statement (Line 13).
3
      </p>
      <sec id="sec-10-1">
        <title>Constructing Wikidated 1.0 from Wikidata Dumps</title>
        <p>In this section, we discuss our methodology for creating Wikidated 1.0 (Sect. 3.1),
our implementation (Sect. 3.2), and limitations (Sect. 3.3).
3.1</p>
        <sec id="sec-10-1-1">
          <title>Methodology</title>
          <p>Fundamentally, Wikidated 1.0 is a transformation from a Wikidata dump's stream
of revisions into a stream of incremental revisions. We de ne an incremental
revision as a tuple of the (1) entity metadata (the entity ID and some Wikidata
internal elds), and the (2) revision metadata (the revision ID and when and by
whom it was authored) of the Wikidata revision it is based upon, as well as sets
of (3) RDF triple deletions and (4) RDF triple additions in comparison to the
previous revision of the respective entity. As hinted at in Sect. 2, we thus decide
10 Taken from https://www.wikidata.org/wiki/Special:EntityData/Q42.ttl.
Documentation at https://www.mediawiki.org/wiki/Wikibase/Indexing/RDF Dump Format.</p>
          <p>Global</p>
          <p>empty sequence
2 download pages-meta-history dump of Wikidata
3 foreach entity ei in dump do
4 Entity empty sequence
rRDF-prev fg
for j = 1 to ni do
rMeta take revision metadata of ri;j from dump
rJSON take JSON blob of ri;j from dump
rRDF
rDel
rAdd
rRDF-prev
serialize rJSON as RDF graph
rRDF-prev n rRDF
rRDF n rRDF-prev</p>
          <p>rRDF
append incremental revision (ei; rMeta; rDel; rAdd) to
Entity
output Entity as entity-stream variant of entity ei
append all elements of Entity to Global
16 sort Global after ascending revision IDs id(ri;j ) across entities
17 output Global as global-stream variant</p>
          <p>Algorithm 1. Construction of the Wikidated 1.0 dataset.
1
to de ne change between Wikidata revisions via the di erence in triples between
their RDF serializations. This allows for more straightforward dataset modeling
and consumption, as opposed to de ning change for each of the di erent aspects
of the Wikidata data model ( ngerprint, site links, and statements with quali ers,
references, and ranks).</p>
          <p>Wikidated 1.0 consists of two complementary variants of the same data:
1. The global-stream variant consists of all incremental revisions across all
entities sorted in chronological order.
2. The entity-streams variant contains a separate stream of incremental revisions
for each entity of Wikidata.</p>
          <p>The former can be used for global analysis, e. g., for analyzing the number or
style of revisions in a speci c time period, whereas the latter is useful for
entitycentered analysis, e. g., when one is only interested in a subset of all entities or
when the aim is to directly compare consecutive revisions of the same entity.</p>
          <p>Algorithm 1 outlines the steps of creating Wikidated 1.0. First, we
download a full Wikidata dump11 (Line 2). Next, we iterate over all entities in the
dump (Line 3). For each entity, we iterate over all of its revisions in the order
they were created in (Line 6). Because the dump les store entities and revisions
11 Speci cally, Wikidated 1.0 is based on the 20210601-pages-meta-history dump, the
history of Wikidata from its inception on 30 October 2012 until June 2021. The ID
of the last revision is 1433475551, which was authored on 2 June 2021 at 05:35:58.
in exactly this order, this amounts to linearly traversing the dump les. For
each revision, we rst extract revision metadata and the JSON blob of revision
contents from the dump les (Lines 7 and 8). We then serialize the revision
contents as an RDF graph (Line 9), and compute the sets of RDF triple deletions
and additions (Lines 10 and 11) compared to the RDF graph of the previous
revision, for which we maintain a helper variable (Lines 5 and 12). Having now
transformed the revision into its incremental counterpart, we append it to a
sequence of all incremental revisions of the entity Entity (Line 13, initialization in
Line 4). After all revisions of an entity have been iterated over, we output Entity
as the entity-stream variant of that entity (Line 14). Finally, we maintain a
sequence of all incremental revisions across all entities Global (Lines 1 and 15).
After sorting all revisions in it globally (Line 16), we also output Global as the
global-stream variant (Line 17).
3.2</p>
        </sec>
        <sec id="sec-10-1-2">
          <title>Implementation</title>
          <p>
            We provide a Python API for browsing and iterating the dataset without having
to know how the dataset is stored on disk. Internally, both variants are stored
as gzip-compressed text les in JSON Lines format, i. e., each line is a JSON
object encoding one incremental revision. For the entity-streams variant, the
les for all entities are packaged in a tar archive. While approaches for storing
di erences between RDF graphs in RDF itself exist [
            <xref ref-type="bibr" rid="ref20 ref3">3,20</xref>
            ], we hereby opt for a
less Semantic-Web-oriented distribution format, because we feel that it allows
for easier consumption by most users. We are open to releasing the dataset in
RDF later (based on community demand).
          </p>
          <p>The le size of the global-stream variant of Wikidated 1.0 is 239 GiB whereas
the tar archive for the entity-streams variant is 329 GiB (both gzip-compressed).
In contrast to this, the o cial Wikidata dump of non-incremental revisions that
Wikidated 1.0 is built from is available in the two compression formats bz2 and 7z
with a size of 1 040 GiB and 339 GiB, respectively. While Wikidated 1.0's smallest
variant is thus only 71% the size of the o cial dump's smallest format, one might
have expected an even larger reduction in size due to the usage of incremental
revisions that do not repeat all statements from earlier revisions. We suspect
that this bene t is o set by using the RDF serialization, which is more verbose
than the JSON blobs of the o cial dumps, that the non-incremental revisions
are more compressible through their repeated statements, and by the inferior
compression of gzip compared to 7z. We are therefore looking into publishing
our dataset in additional compression formats in the future, but have opted for
the universally-available and streamable gzip format for the rst release.</p>
          <p>
            For serializing Wikidata revisions as RDF graphs (Line 9), we use Wikidata
Toolkit12. Because it does not provide a way to serialize Wikidata revisions that
are redirects, we encode these via the owl:sameAs predicate, following the choice
of the Wikidata Query Service13 [
            <xref ref-type="bibr" rid="ref15">15</xref>
            ]. Additionally, we discard all RDF triples
12 Available at https://www.mediawiki.org/wiki/Wikidata Toolkit.
13 Available at https://query.wikidata.org/.
from Wikidata Toolkit's output that are not directly related to the entity at
hand. The triples discarded in this manner contain ontological information about
Wikidata concepts such as items and properties. If needed, these can always be
reconstructed from context and they never change between revisions.
          </p>
          <p>For computing set di erences between RDF graphs (Lines 10 and 11), we can
avoid the di cult task of nding an optimal mapping between blank nodes. In
the case of Wikidata's RDF serialization, blank nodes are only used to encode
the special some values, and each blank node never occurs in more than one RDF
triple. Because of this, there is an e cient way to determine the set di erence
between RDF serializations of two Wikidata revisions: two RDF triples can be
treated as equal if their non-blank-node components are equal.</p>
          <p>Last, assembling the incremental revision streams Global and Entity (Lines 15
and 16) is not as straightforward as presented, because both would quickly
exceed available main memory. Instead, we directly append any incremental
revisions (Line 13) to the target le without keeping them in memory. To merge
all Entity streams into a sorted Global, we use a hierarchical multiway merge.
3.3</p>
        </sec>
        <sec id="sec-10-1-3">
          <title>Limitations</title>
          <p>The main limitation of Wikidated 1.0 is that is does not contain any record
of deleted entities or revisions14 because these are not recorded in Wikidata's
revision history dumps, as explained in Sect. 2.1. However, entity deletions are
comparatively rare in Wikidata, since the common case of duplicate entities
is addressed through merges, i. e., redirects of one entity to another, which|
unlike deletions|are recorded in Wikidated 1.0. Additionally, statements of other
entities may still target deleted entities, so partial history of them is recorded.</p>
          <p>Multiple implementations of RDF serializations of Wikidata revisions exist.
The one in Wikidata Toolkit was used to construct Wikidated 1.0. Both the RDF
exports of individual Wikidata entities and the o cial Wikidata RDF dumps
use two other slightly di erent implementations. In practice, the di erences are
minimal and mostly amount to how certain metadata is encoded|the important
parts, i. e., facts about entities, are encoded identically in all implementations.</p>
          <p>By design, Wikidated 1.0 only contains the revision history of entities. As
a consequence the \meta level" of Wikidata is not part of the dataset. Among
other things, this includes the talk pages of all entities, where editors discuss
aspects such as how certain content should be modeled or what is in scope for
Wikidata, or the help pages, which document how to use Wikidata. While this
plain text data is part of the Wikidata dumps it is not RDF serializable.</p>
          <p>
            In May 2018, three new entity types have been added to the Wikidata data
model to model lexicographical data: lexemes, forms, and senses15 [
            <xref ref-type="bibr" rid="ref16">16</xref>
            ]. While
these are part of the Wikidata dumps and a RDF serialization for them has
been de ned [
            <xref ref-type="bibr" rid="ref16">16</xref>
            ], it has not yet been implemented in Wikidata Toolkit and
lexicographical data is thus not part of this rst release of our dataset.
14 In Sect. 5, we review the work of Shenoy et al. [
            <xref ref-type="bibr" rid="ref29">29</xref>
            ], which describes an approach that
is able to obtain some information about deleted entities (from monthly dumps).
15 Documentation at https://www.wikidata.org/wiki/Wikidata:Lexicographical data.
s 100
e
i
tn sn 80
t
i
fe lio 60
o il
re m40
bm in 20
u
N
0
          </p>
          <p>Entities</p>
          <p>Revisions
2012
2014
2016
2018</p>
          <p>2020
End of year
1.5
1.2</p>
        </sec>
      </sec>
      <sec id="sec-10-2">
        <title>Wikidated 1.0 Dataset Characteristics</title>
        <p>In this section, we present statistical characteristics of the Wikidated 1.0 dataset
in order to provide context for any research work building upon it. Much of the
analysis also applies to Wikidata given that Wikidated 1.0 is a direct
representation of it.</p>
        <p>
          We plot the number of entities and revisions over time in Fig. 1(a)16. For
both, we observe a mostly linear growth, with a slightly stronger incline since
2016, which follows the integration of Freebase into Wikidata in the latter half
of 2015 [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ]. Interestingly, this means that the ratio between both frequencies is
roughly constant at about 14 revisions per entity.
        </p>
        <p>Fig. 1(b) shows the number of revisions per entity in more detail. Roughly
half of all entities have fewer than 10 revisions, and the majority have more than
one. 99% of entities have less than 100 revisions, whereas some of the remaining
entities can have signi cantly more.</p>
        <p>The time between consecutive revisions of the same entity is visualized in
Fig. 2(a). 30% of revisions are being authored within less than a minute since the
previous revision. We suspect that this stems either from heavy activity on the
most popular entities, or from editors performing multiple related changes directly
after another, such as changing two related statements or reverting erroneous
edits. For 60% of revisions, the time since the previous revision is less than a
month. For less than 4% of revisions, that time is more than a year. Coupled with
the previous gure's data of only 2.5% of entities having exactly one revision, it
stands to reason that most entities in Wikidata are edited somewhat frequently.
16 In all gures of this section, we treat revisions that are redirects as regular revisions
(being represented by exactly one owl:sameAs RDF triple). As a consequence, we
also count entities whose latest revision is a redirect as regular entities.
46%</p>
        <p>39%
11%
1</p>
        <p>(b)
4%</p>
        <p>0</p>
        <p>35.3%
80%
First addition
First deletion</p>
        <p>25%
7% 7%
13%
8%
9%
16%</p>
        <p>40%
29%
However, this does not imply that most entities are checked by humans with
some frequency, as these changes could also have been made by automated bots.</p>
        <p>Getting closer to the contents of revisions, we look at the number of additions
and deletions of RDF triples per revision in Fig. 2(b). Note that there is no
one-to-one correspondence between the number of Wikidata statements and the
number of RDF triples. For example, a single site link is expressed in more than
one triple (compare Lines 8 to 9 of Listing 1). Additions are much more common
than deletions with 80% of revisions not featuring any triple deletions. Since 89%
of revisions contain less than 10 triple additions, we conclude that most revisions
constitute atomic changes and that the case in which multiple statements of a
single entity change is much rarer.</p>
        <p>In Fig. 2(c), we show the time until a RDF triple is rst added or deleted.
Approximately half of triples are added within less than a day since the the
creation of its entity. Deletions take far longer: more than half of all deleted
triple are deleted more than half a year after they had originally been added.
Besides changes to the Wikidata schema|like the deletion of properties|that
potentially entail (semi-) automated changes to otherwise unchanged entities,
we see two competing explanations for these late deletions: it might simply take
a while until facts in the real world change and Wikidata can only update its
record of them once they do, or alternatively, Wikidata might take a while to
detect incorrect knowledge for the less popular entities. A more detailed look
into classifying the types and causes of changes will therefore be necessary for
further investigation.</p>
        <p>Last, Fig. 2(d) visualizes repeated deletions of the same RDF triple.
Unsurprisingly, the vast majority of triples added to Wikidata are never deleted.
Slightly less than 10% of triples are deleted exactly one time; 4% of which are
added back into Wikidata again afterwards (not shown in gure). Even though
only less than 1% of triples are deleted from Wikidata more than once, a few of
these are deleted very many times. For example, around 52 thousand triples are
deleted and added to Wikidata more than 100 times (not shown in gure). We
suspect heavy edit wars|potentially between bots|as the main cause for this.</p>
        <p>To summarize, we have quanti ed how Wikidata changes over time on a
macro level through analyzing statistical characteristics of Wikidated 1.0, which
demonstrates its tness as a dataset for evolving knowledge graph research.
5</p>
      </sec>
      <sec id="sec-10-3">
        <title>Related Work</title>
        <p>Based on their naming, Wikidata's incremental dumps17 may seem to address
the exact same problem as Wikidated 1.0. These dumps are published every 24
hours and contain all revisions authored since the last dump. However, like the
full dumps discussed in Sect. 2.1, each revision is stored in its full state and
no obvious way exists to identify what changed from one revision to the next.
Additionally, incremental dumps older than a few months are routinely taken
o ine. Because of this, they do not o er a way to trace the full edit history since
Wikidata's inception like Wikidated 1.0 does. Their main use case is to keep live
services operating on Wikidata's contents up-to-date.</p>
        <p>
          Much closer to our setting is the history query service18 [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ]. It consists
of a SPARQL [
          <xref ref-type="bibr" rid="ref33">33</xref>
          ] endpoint that allows users to query for Wikidata revision
di erences|similarly to Wikidated 1.0. The paper's main contributions are on
how to express revision additions and deletions in a RDF data model and how to
index them for e cient query answering. On the other hand, the paper does not
discuss how revision additions and deletions are computed, does not discuss any
limitations, and does not provide a stable, downloadable dataset. It is therefore
not suitable as an environment for reproducible evaluations.
17 Available at https://dumps.wikimedia.org/other/incr/wikidatawiki/.
18 Available at https://wdhqs.wm abs.org/, however only displaying a \502 Bad
Gateway" error during the time of writing (June to October 2021). Documentation at
https://www.wikidata.org/wiki/Wikidata:History Query Service.
        </p>
        <p>
          In contemporary work, Shenoy et al. [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ] follow an alternative approach19 for
studying changes in Wikidata over time. In contrast to our approach of parsing
a single dump of Wikidata's full revision history, they utilize monthly dumps of
Wikidata's current state, i. e., dumps that only contain the most recent revision
of each entity for the respective month. They then analyze which statements were
deleted and added from one month to the next. In comparison to Wikidated 1.0,
which records statement changes at the revision level and thus includes revision
metadata such as the exact point in time when a statement was deleted/added,
their approach thus only aggregates all changes to an entity per month. This
aggregation implies the inability to record phenomena such as the frequency of
revisions to entities per month or changes that are reverted within the same
month. The upside of their approach is that records of deleted entities, which are
purged from the full revision history dump, are still available in those monthly
dumps that were created before the entity was deleted. Their data thus provides
a useful addition to Wikidated 1.0.
        </p>
        <p>
          The CorHist dataset [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] is another dataset build from Wikidata's edit
history. However, it limits itself to recording constraint-related data. Wikidata
constraints are similar to database integrity constraints and used to aid Wikidata
editors in nding erroneous data. Speci cally, the CorHist dataset records past
constraint violations and their corrections. Wikidated 1.0, in comparison, records
all statement changes (including constraint violations, albeit in a di erent format
than CorHist and only implicitly) including revision metadata, such as when and
by whom a revision was authored, which makes it a more complete resource.
        </p>
        <p>
          Other research that studies Wikidata's evolution includes Sarasua et al. [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ],
which studies the engagement of Wikidata's editors over time; Piscopo et al. [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ],
which evaluates the quality of provenance information in Wikidata; and Piscopo
and Simperl [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ], which investigates the relation been di erent types of editors
and their impact on the Wikidata ontology over time.
6
        </p>
      </sec>
      <sec id="sec-10-4">
        <title>Conclusion</title>
        <p>We have presented Wikidated 1.0, a dataset containing Wikidata's revision history
as incremental revisions, i. e., sets of deletions and additions of RDF triples. To
the best of our knowledge, it constitutes the rst large evolving knowledge graph
dataset of its kind. We foresee applications both from the Wikidata community for
studying how Wikidata changed over time, as well as from the wider knowledge
graph community for evaluating techniques over evolving knowledge graphs, such
as incremental knowledge graph embeddings or updatable indexing structures
for e cient query answering.</p>
        <p>Besides releasing the dataset and the accompanying codebase1, in this paper
we have documented our methodology for creating Wikidated 1.0, and discussed
its implementation and limitations, the biggest one being the omission of deleted
entities, which are not contained in the openly available revision history dumps
19 Data and analysis scripts available at https://w3id.org/wd quality.
of Wikidata. Additionally, we have presented statistical characteristics of our
dataset, and compared it to related work.
6.1</p>
        <sec id="sec-10-4-1">
          <title>Future Work</title>
          <p>In the future, we plan to release new versions and additional variants of our
dataset. In particular, we aim to establish a release cadence for publishing a new
Wikidated version on the most recent Wikidata dump in regular time intervals,
based on community uptake. Additionally, we are working on extracting subsets
of Wikidated 1.0 that only contain RDF serializations of simple statements,
i. e., statements with quali ers and references removed, or \thruthy" statements,
i. e., statements with the highest rank|similar to the existing equally-named
variant of the o cial Wikidata dumps. Last, we are thinking about additional
ways of reducing the large le size of Wikidated 1.0, such as switching to better
compression formats, subsampling the dataset, or aggregating deletions and
additions of all revisions in a xed time frame (e. g., an hour, day, or week).</p>
          <p>Further future work includes deeper analysis of the editing dynamics of
Wikidata recorded in Wikidated 1.0, such as detecting updates from sets of
triple deletions and additions, or classifying the type and source of changes; and
consideration of Wikidata's more recent lexicographic data, the rst step towards
this would be to implement a RDF serialization of it in Wikidata Toolkit. We invite
the Wikimedia Foundation speci cally to consider also releasing o cial Wikidata
dumps in an incremental format|such as the one used for Wikidated 1.0|in
order to save bandwidth and storage space for users. Additionally, we would
welcome any way to access and integrate revision data of deleted entities and
revisions into Wikidated. While the raw data itself contains sensible personal
information and copyrighted material that is unavailable to the general public
for good reason, the metadata of deleted entities and revisions, e. g., number
of deleted statements, is by itself interesting to us. For instance, it could be
published by replacing all literal values in deleted revisions with generated ones,
thus only preserving the data's graph structure.</p>
          <p>Acknowledgments Lukas Schmelzeisen was supported by the German
Research Foundation (DFG) via grant agreement number STA 572/18-1 (Open
Argument Mining). Corina Dima was supported by the German Federal
Ministry for Economic A airs and Energy (BMWi) via grant agreement number
01MK20008F (Service-Meister). Thanks to Raphael Menges for suggesting the
name \Wikidated".</p>
        </sec>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Ahn</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Im</surname>
            ,
            <given-names>D.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eom</surname>
            ,
            <given-names>J.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zong</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
          </string-name>
          , H.G.:
          <article-title>G-Di : A Grouping Algorithm for RDF Change Detection on MapReduce</article-title>
          .
          <source>In: JIST. Lecture Notes in Computer Science</source>
          , vol.
          <volume>8943</volume>
          , pp.
          <volume>230</volume>
          {
          <fpage>235</fpage>
          . Springer (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Balazevic</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Allen</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hospedales</surname>
            ,
            <given-names>T.M.:</given-names>
          </string-name>
          <article-title>TuckER: Tensor Factorization for Knowledge Graph Completion</article-title>
          .
          <source>In: EMNLP/IJCNLP (1)</source>
          . pp.
          <volume>5184</volume>
          {
          <fpage>5193</fpage>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <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 di erences between RDF graphs</article-title>
          .
          <source>Tech. rep., W3C</source>
          (
          <year>2004</year>
          ), https://www.w3.org/DesignIssues/ lncs04/Di .pdf
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Bhowmik</surname>
          </string-name>
          , R., de Melo, G.:
          <article-title>Explainable Link Prediction for Emerging Entities in Knowledge Graphs</article-title>
          .
          <source>In: ISWC (1). Lecture Notes in Computer Science</source>
          , vol.
          <volume>12506</volume>
          , pp.
          <volume>39</volume>
          {
          <fpage>55</fpage>
          . Springer (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Cyganiak</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wood</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lanthaler</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>RDF 1.1 Concepts and Abstract Syntax</article-title>
          .
          <source>W3C Recommendation</source>
          ,
          <source>W3C</source>
          (
          <year>2014</year>
          ), https://www.w3.org/TR/2014/ REC-rdf11
          <string-name>
            <surname>-</surname>
          </string-name>
          concepts-20140225/
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Daruna</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gupta</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sridharan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chernova</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Continual Learning of Knowledge Graph Embeddings</article-title>
          . IEEE Robot.
          <source>Autom Lett</source>
          <volume>6</volume>
          (
          <issue>2</issue>
          ),
          <volume>1128</volume>
          {
          <fpage>1135</fpage>
          (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Dettmers</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Minervini</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stenetorp</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Riedel</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Convolutional 2D Knowledge Graph Embeddings</article-title>
          . In: AAAI. pp.
          <year>1811</year>
          {
          <year>1818</year>
          . AAAI Press (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Erxleben</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          , Gunther,
          <string-name>
            <surname>M.</surname>
          </string-name>
          , Krotzsch,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Mendez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Vrandecic</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          :
          <article-title>Introducing Wikidata to the Linked Data Web</article-title>
          .
          <source>In: International Semantic Web Conference (1). Lecture Notes in Computer Science</source>
          , vol.
          <volume>8796</volume>
          , pp.
          <volume>50</volume>
          {
          <fpage>65</fpage>
          . Springer (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Hee</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>B.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Agarwal</surname>
            ,
            <given-names>D.: Building</given-names>
          </string-name>
          <string-name>
            <surname>The LinkedIn Knowledge Graph</surname>
          </string-name>
          (
          <year>2016</year>
          ), https://engineering.linkedin.com/blog/2016/10/
          <article-title>building-the-linkedin-knowledge-graph</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Hernandez</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hogan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , Krotzsch, M.:
          <string-name>
            <surname>Reifying</surname>
            <given-names>RDF</given-names>
          </string-name>
          :
          <article-title>What Works Well With Wikidata? In: SSWS@ISWC</article-title>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <volume>1457</volume>
          , pp.
          <volume>32</volume>
          {
          <fpage>47</fpage>
          .
          <string-name>
            <surname>CEUR-WS.org</surname>
          </string-name>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Hogan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blomqvist</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cochez</surname>
          </string-name>
          , M.,
          <string-name>
            <surname>d'Amato</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>de Melo</surname>
          </string-name>
          , G.,
          <string-name>
            <surname>Gutierrez</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kirrane</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Labra</surname>
            <given-names>Gayo</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>J.E.</given-names>
            ,
            <surname>Navigli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Neumaier</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Polleres</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Ngonga</surname>
          </string-name>
          <string-name>
            <surname>Ngomo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.C.</given-names>
            ,
            <surname>Rashid</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.M.</given-names>
            ,
            <surname>Rula</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Schmelzeisen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Sequeda</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.F.</given-names>
            ,
            <surname>Staab</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Zimmermann</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>Knowledge Graphs</article-title>
          .
          <source>ACM Comput. Surv</source>
          .
          <volume>54</volume>
          (
          <issue>4</issue>
          ),
          <volume>71</volume>
          :1{
          <fpage>71</fpage>
          :
          <fpage>37</fpage>
          (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Knowledge Graph Embedding Based Question Answering</article-title>
          . In: WSDM. pp.
          <volume>105</volume>
          {
          <fpage>113</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Lantzaki</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Papadakos</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Analyti</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tzitzikas</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Radius-aware approximate blank node matching using signatures</article-title>
          .
          <source>Knowl. Inf. Syst</source>
          .
          <volume>50</volume>
          (
          <issue>2</issue>
          ),
          <volume>505</volume>
          {
          <fpage>542</fpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Zhang,
          <string-name>
            <given-names>Q.</given-names>
            ,
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            ,
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          :
          <article-title>Evolving Knowledge Graphs</article-title>
          . In: INFOCOM. pp.
          <volume>2260</volume>
          {
          <fpage>2268</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Malyshev</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Krotzsch,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Gonzalez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Gonsior</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Bielefeldt</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>Getting the Most Out of Wikidata: Semantic Technology Usage in Wikipedia's Knowledge Graph</article-title>
          .
          <source>In: International Semantic Web Conference (2). Lecture Notes in Computer Science</source>
          , vol.
          <volume>11137</volume>
          , pp.
          <volume>376</volume>
          {
          <fpage>394</fpage>
          . Springer (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Nielsen</surname>
            ,
            <given-names>F.A.</given-names>
          </string-name>
          :
          <article-title>Lexemes in Wikidata: 2020 status</article-title>
          . In: LDL@LREC. pp.
          <volume>82</volume>
          {
          <fpage>86</fpage>
          .
          <string-name>
            <surname>European Language Resources Association</surname>
          </string-name>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Noy</surname>
            ,
            <given-names>N.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gao</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jain</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Narayanan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Patterson</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Taylor</surname>
          </string-name>
          , J.:
          <article-title>Industryscale Knowledge Graphs: Lessons and Challenges</article-title>
          .
          <source>ACM Queue Tomorrows Comput. Today</source>
          <volume>17</volume>
          (
          <issue>2</issue>
          ),
          <volume>20</volume>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Papavasileiou</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Flouris</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fundulaki</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kotzinos</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Christophides</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Highlevel change detection in RDF(S) KBs</article-title>
          .
          <source>ACM Trans. Database Syst</source>
          .
          <volume>38</volume>
          (
          <issue>1</issue>
          ), 1:
          <issue>1</issue>
          {1:
          <issue>42</issue>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <given-names>Pellissier</given-names>
            <surname>Tanon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Bourgaux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Suchanek</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.M.</surname>
          </string-name>
          :
          <article-title>Learning How to Correct a Knowledge Base from the Edit History</article-title>
          . In: WWW. pp.
          <volume>1465</volume>
          {
          <fpage>1475</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <given-names>Pellissier</given-names>
            <surname>Tanon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Suchanek</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.M.</surname>
          </string-name>
          :
          <article-title>Querying the Edit History of Wikidata. In: ESWC (Satellite Events)</article-title>
          .
          <source>Lecture Notes in Computer Science</source>
          , vol.
          <volume>11762</volume>
          , pp.
          <volume>161</volume>
          {
          <fpage>166</fpage>
          . Springer (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Pernischova</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dell'Aglio</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horridge</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Baumgartner</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bernstein</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Toward Predicting Impact of Changes in Evolving Knowledge Graphs</article-title>
          .
          <source>In: ISWC Satellites. CEUR Workshop Proceedings</source>
          , vol.
          <volume>2456</volume>
          , pp.
          <volume>137</volume>
          {
          <fpage>140</fpage>
          .
          <string-name>
            <surname>CEUR-WS.org</surname>
          </string-name>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Piscopo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ka</surname>
            <given-names>ee</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>L.A.</given-names>
            ,
            <surname>Phethean</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Simperl</surname>
          </string-name>
          , E.:
          <article-title>Provenance Information in a Collaborative Knowledge Graph: An Evaluation of Wikidata External References</article-title>
          .
          <source>In: ISWC (1). Lecture Notes in Computer Science</source>
          , vol.
          <volume>10587</volume>
          , pp.
          <volume>542</volume>
          {
          <fpage>558</fpage>
          . Springer (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Piscopo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Simperl</surname>
          </string-name>
          , E.: Who Models the World?
          <article-title>: Collaborative Ontology Creation and User Roles in Wikidata</article-title>
          .
          <source>Proc ACM Hum Comput Interact 2(CSCW)</source>
          ,
          <volume>141</volume>
          :1{
          <fpage>141</fpage>
          :
          <fpage>18</fpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Pittman</surname>
          </string-name>
          , R.J.:
          <source>Cracking the Code on Conversational Commerce</source>
          (
          <year>2017</year>
          ), https:// www.ebayinc.com/stories/news/cracking
          <article-title>-the-code-on-conversational-commerce/</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Pomp</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kraus</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Poth</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meisen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Semantic Concept Recommendation for Continuously Evolving Knowledge Graphs</article-title>
          .
          <source>In: ICEIS (Revised Selected Papers). Lecture Notes in Business Information Processing</source>
          , vol.
          <volume>378</volume>
          , pp.
          <volume>361</volume>
          {
          <fpage>385</fpage>
          . Springer (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Rebele</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Suchanek</surname>
            ,
            <given-names>F.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ho</surname>
            <given-names>art</given-names>
          </string-name>
          , J.,
          <string-name>
            <surname>Biega</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuzey</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weikum</surname>
          </string-name>
          , G.:
          <article-title>YAGO: A Multilingual Knowledge Base from Wikipedia, Wordnet, and Geonames</article-title>
          .
          <source>In: International Semantic Web Conference (2). Lecture Notes in Computer Science</source>
          , vol.
          <volume>9982</volume>
          , pp.
          <volume>177</volume>
          {
          <issue>185</issue>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Sarasua</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Checco</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Demartini</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Difallah</surname>
            ,
            <given-names>D.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Feldman</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pintscher</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>The Evolution of Power and Standard Wikidata Editors: Comparing Editing Behavior over Time to Predict Lifespan</article-title>
          and Volume of Edits.
          <source>Comput Support Coop. Work</source>
          <volume>28</volume>
          (
          <issue>5</issue>
          ),
          <volume>843</volume>
          {
          <fpage>882</fpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Schreiber</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Raimond</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <source>: RDF 1.1 Primer. W3C Note</source>
          , W3C (
          <year>2014</year>
          ), https: //www.w3.org/TR/2014/NOTE-rdf11
          <string-name>
            <surname>-</surname>
          </string-name>
          primer-20140624/
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Shenoy</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ilievski</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garijo</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schwabe</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Szekely</surname>
            ,
            <given-names>P.A.</given-names>
          </string-name>
          :
          <article-title>A Study of the Quality of Wikidata</article-title>
          .
          <source>CoRR abs/2107</source>
          .00156 (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Singhal</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Introducing the Knowledge Graph: things, not strings (</article-title>
          <year>2012</year>
          ), https: //www.blog.google/products/search/introducing
          <article-title>-knowledge-graph-things-not/</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Deng</surname>
            ,
            <given-names>Z.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nie</surname>
            ,
            <given-names>J.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tang</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space</article-title>
          . In: ICLR (Poster).
          <source>OpenReview.net</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>Tanon</surname>
            ,
            <given-names>T.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vrandecic</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , Scha ert, S.,
          <string-name>
            <surname>Steiner</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pintscher</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>From Freebase to Wikidata: The Great Migration</article-title>
          . In: WWW. pp.
          <volume>1419</volume>
          {
          <fpage>1428</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <surname>The W3C SPARQL Working</surname>
          </string-name>
          <article-title>Group: SPARQL 1.1 Overview. W3C Recommendation, W3C (</article-title>
          <year>2013</year>
          ), https://www.w3.org/TR/2013/REC-sparql11
          <string-name>
            <surname>-</surname>
          </string-name>
          overview-20130321/
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          34.
          <string-name>
            <surname>Tummarello</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morbidoni</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bachmann-Gmu</surname>
          </string-name>
          r, R.,
          <string-name>
            <surname>Erling</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>RDFSync: E - cient Remote Synchronization of RDF Models</article-title>
          .
          <source>In: ISWC/ASWC. Lecture Notes in Computer Science</source>
          , vol.
          <volume>4825</volume>
          , pp.
          <volume>537</volume>
          {
          <fpage>551</fpage>
          . Springer (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          35.
          <string-name>
            <surname>Vrandecic</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , Krotzsch, M.:
          <string-name>
            <surname>Wikidata</surname>
            :
            <given-names>A Free</given-names>
          </string-name>
          <string-name>
            <surname>Collaborative</surname>
          </string-name>
          <article-title>Knowledgebase</article-title>
          .
          <source>Commun. ACM</source>
          <volume>57</volume>
          (
          <issue>10</issue>
          ),
          <volume>78</volume>
          {
          <fpage>85</fpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          36.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mao</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Knowledge Graph Embedding: A Survey of Approaches and Applications</article-title>
          .
          <source>IEEE Trans. Knowl. Data Eng</source>
          .
          <volume>29</volume>
          (
          <issue>12</issue>
          ),
          <volume>2724</volume>
          {
          <fpage>2743</fpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          37.
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gao</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>E ciently Embedding Dynamic Knowledge Graphs</article-title>
          . CoRR abs/
          <year>1910</year>
          .06708 (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>