<!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>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>with Trustflows</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ben De Meester</string-name>
          <email>ben.demeester@ugent.be</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Julian Andrés Rojas</string-name>
          <email>julianandres.rojasmelendez@ugent.be</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Femke Ongenae</string-name>
          <email>femke.ongenae@ugent.be</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pieter Colpaert</string-name>
          <email>pieter.colpaert@ugent.be</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ruben Verborgh</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>IDLab, Ghent University - imec</institution>
          ,
          <addr-line>Technologiepark-Zwijnaarde 122, 9052 Ghent</addr-line>
          ,
          <country country="BE">Belgium</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>read-write Linked Data Web</institution>
          ,
          <addr-line>CRUD, CQRS, Event Sourcing</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <fpage>2</fpage>
      <lpage>6</lpage>
      <abstract>
        <p>The need for the read-write Linked Data Web is currently implemented as a Create, Read, Update or Delete (CRUD) strategy on resources, which implies that agents will read exactly what has once been written. In practice, however, deploying writeable Linked Data nodes in an ecosystem reveals the following problems. Data reuse is hindered as later data usage requirements diverge from how the data was originally written, as well as by evolving data models. Moreover, the absence of an authoritative source to guarantee auditability forces individual data point verification at the read side. We present key characteristics of writeable Linked Data nodes (cope with longevity for written data, combine read data using diferent models, and provide an explicit trust context) as arguments justifying the need for a more complex operational model. We apply a Command Query Responsibility Segregation pattern to decouple write and read interfaces, introduce semantic mappings within the writeable Linked Data node to support evolving data read requirements, and apply Event Sourcing aligned with PROV-O's Actor-Entity-Activity model to provide an explicit trust context. We term this operational model “Trustflows”. Applied to the PACSOI use case, Trustflows showcases the additional afordances of handling data coming in diferent granularities, from diferent sources, adhering to diferent reading requirements.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The need for the read–write Linked Data Web [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] is evidenced by the recommendation of W3C’s Linked
Data Platform [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], and its uptake in, e.g., the Solid protocol [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and the Fedora project [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], currently
being standardized in the W3C Linked Web Storage Working Group1. In the context of this paper, we
define the concept of a
      </p>
      <p>writeable Linked Data node: an online storage service that publishes Linked Data,
where that Linked Data can be created and edited by multiple (authorized) actors in an ecosystem.</p>
      <p>
        However, these current initiatives apply writeable Linked Data nodes through (authenticated and
authorized) PUT, POST, and DELETE requests on the same RDF-based HTTP resources available for
GET today. This follows the Create-Read-Update-Delete (CRUD) operational model, deemed simple
and efective for the majority of applications [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. In practice, such a symmetric read-write approach
conflicts with the reality of a writeable Linked Data node .
      </p>
      <p>Whilst applying writeable Linked Data nodes in various R&amp;D projects in domains such as Circular
Economy (in the Horizon Europe Onto-DESIDE project), HR (in the imec.icon SHARCS project), and
health (in the imec.icon PACSOI project)2, we encountered the following exemplary problems.
• In the Onto-DESIDE project, a product’s material composition is shared in a diferent
granularity than how it is stored: only whether certain chemical substances exceed defined thresholds
must be shared, not the exact quantitative concentrations3. This currently requires a parallel
process to continuously keep the derived data summary up to date with the product details.
//www.imec-int.com/en/research-portfolio/pacsoi.
LGOBE
CEUR</p>
      <p>ceur-ws.org
• In the SHARCS project, reading diploma credentials written using the European Learning
Model (ELM) v3.2 requires a substantial processing step by every new client application
that uses ELM v3.34, which severely limited the reusability of the published Linked Data, even
though Semantic standards were meticulously followed.
• In the PACSOI project, the source of a data write such as a weight measurement – whether
obtained from a calibrated sensor or entered manually – influences its suitability when being
read for diagnostic purposes.</p>
      <p>In this paper, we examine how certain characteristics of writeable Linked Data nodes give rise to
specific requirements (Section 2), which conflict with the symmetric read-write approach. We further
propose an alternative operational model (Section 3) named Trustflows , by applying Command Query
Responsibility Segregation (CQRS) and Event Sourcing to Linked Data, thus enabling a write-to-read
Web of Data: a transparent pipeline from data writes with an explicit trust context mapped to evolvable
data reads. We validate this approach by applying it to the PACSOI project’s use cases.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Requirements</title>
      <sec id="sec-2-1">
        <title>R1: Linked Data publishing stems from the need for standardizing data interpretation, which</title>
        <p>
          implies the requirements of coping with longevity and decentralization. The assumption is
that adding the complexity of Linked Data publishing (compared to regular data publishing, e.g., via
JSON:API [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]) is justified because the published data is deemed of a suficient value (i) to a larger
ecosystem of actors, (ii) for a longer period of time, or (iii) both. However, as the ecosystem evolves, data
reuse is hindered: the data models needed to read data diverge from the data model used to originally
write the data. Applications, that might not have been envisioned when the data was originally
published, require diferent data models, e.g., at diferent granularities (cfr. Onto-DESIDE’s examplar).
A writable Linked Data node thus adds the challenge that during a data write, it is impossible to know
how the data will be used by all the possible actors and across time and domains, meanwhile, CRUD’s
read-write symmetry implies that how the data is written directly afects how the data can be read.
R2: Linked Data allows to more easily integrate data from diferent domains, which implies
the requirement of handling data using diferent models. Data reuse is hindered when data
models evolve. Applications’ data interpretation requirements evolve, which afects the needed data
models (cfr. SHARCS’s exemplar). CRUD requires each client to individually (re-)interpret (old or
diferently modelled) data into its own context, which introduces overhead, redundant processing, and
diverging interpretations of the same data. Alternatively, a more flexible writeable Linked Data node
could perform commonly needed data processing tasks, increasing eficiency and providing common
alternative data interpretations. If we take the SHARCS exemplar, a mapping from ELM v3.2 to ELM v3.3
could be provided by the writeable Linked Data node, reusable by all new client applications without
impeding the functionalities of the existing client applications.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>R3: Using writable Linked Data nodes invalidates the authoritative source assumption, which</title>
        <p>implies the requirement of an explicit trust context. Typical Linked Data nodes act as an
authoritative source, i.e., the actor governing the node is assumed to reassure the published data is
accurate. Once multiple actors are allowed to write data – even with security measures such as a
trusted registry in place – the implicit trust context of a single authority is no longer valid. Each
read’s individual data point must be verified separately, which introduces a large processing overhead.
Alternatively, an explicit trust context allows clients to determine which data came from which writing
actor. This allows moving the verification from individual data points to writers, which improves
eficiency. CRUD provides no guidance for providing such an explicit trust context. If we take the
4Changes, among others, included the change of the ontology base uri: https://op.europa.eu/en/web/eu-vocabularies/dataset/
-/resource?uri=http://publications.europa.eu/resource/dataset/snb-model.</p>
        <p>PACSOI exemplar, not only the data values (i.e., the weight measurements) are important, but also the
type of event they originated from (e.g., were they measured via a scale, manually entered, or calculated),
and from which actor they originated (e.g., from a calibrated scale, from a healthcare provider, or via
self-assessment).</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Approach</title>
      <p>Foremost, we argue that fit-for-purpose authentication and authorization must be put in place: a
complementary task that is required for any data exchange use case.</p>
      <p>
        To cover R1 and R2, we decouple the write interface from the read interface, at the cost of
increased complexity. A mature operational model is Command Query Responsibility Segregation
(CQRS) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]: write operations, or commands to update data, are separated from read operations, or
queries to retrieve data. Within the context of Linked Data publishing, we can take advantage of mature
semantic mapping methods to make the mappings between written data and read data explicit. On the
one hand, alternative mappings and queries can cater to diferent data granularities which increases
eficiency and privacy, e.g., by providing both all product details and REACH compliance statements in
the Onto-DESIDE use case. On the other hand, alternative mappings and queries can cater to diferent
data models and diferent data model versions which increases the longevity of the once written data,
e.g., by providing an alternative ELM v3.3 mapping in parallel in the SHARCS use case.
      </p>
      <p>
        To cover R3, we make the trust context explicit for every data write. For this, we can apply the
Event Sourcing design pattern [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In typical Event Sourcing Systems (ESS), one of the main challenges
is that implicit event schema complicates handling event schema evolution [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. This challenge is partially
tackled in our Linked Data publishing context; on the one hand this means that the schema is always
explicit (which aligns with the advice to create a versioned event schema [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]), on the other hand this
means that extending an existing schema is supported by design (which aligns with the advice to create
a weak event schema [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]). Mature models such as PROV-O’s Actor-Entity-Activity data model [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] can
be used to cover the data values, originating event type, and writing actor.
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Use Case: PACSOI</title>
      <p>The imec.icon PACSOI project (2024–2026)5 aims to leverage Solid‑based decentralized “pod” (i.e., an
implementation of a writeable Linked Data node) and Linked Data technology to give patients control
over their health data while enabling scalable, privacy-preserving federated analytics, initially
demonstrated in a proof‑of‑concept (PoC) focused on follow-up of patients that underwent bariatric surgery
(Figure 1). The following use case is investigated.</p>
      <p>As a patient, I write all my weight measurements (done by healthcare providers, through a
ByteFlies smart scale, and via a questionnaire in the MoveUP application) to my personal
data storage, governed by the FAQIR Foundation. My healthcare providers can use these
measurements to check my progress, and simultaneously, my measurements are aggregated
into cohorts to be used in research, e.g., by pharmaceutical players.</p>
      <p>Our PoC for this use case uses data from 12 sources (i.e., smart scales, questionnaires, and physiological
measurements), provided by medical sensors, for 200 patients.</p>
      <p>
        The authentication and authorization information during a write operation captures the Actor part
of the Actor-Entity-Activity model. Mature authentication specifications (e.g., OpenID Connect [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ])
and mature authorization specifications (e.g. OAuth 2.0 [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]) provide some initial metadata as part of
the write operation, however, specific metadata requirements still need to be further analysed.
      </p>
      <p>The write operation’s body data – adhering to the Event Sourcing design pattern – captures the
Entity-Activity part of the model. We explicitly store the trust context linked with the data events (i.e.,
5https://www.imec-int.com/en/research-portfolio/pacsoi</p>
      <p>Smart Scale</p>
      <p>App</p>
      <p>Event Sourcing
(Actor: , Entity: ,Activity: )
HCP manually measured weight</p>
      <p>93.46kg on 4/5/25
Smart Scale measured weight
92.9kg on 7/5/25 at 8:03
93.0kg on 8/5/25 at 7:59
92.7kg on 9/5/25 at 9:49
Patient entered weight
200lbs on 11/5/25 at 23:12:04</p>
      <p>CQRS
(Commands: , Queries: ,
Explicit mappings: )</p>
      <p>KG + mappings</p>
      <p>
        Patient lost 2.7kg at 11/5
Patient lost 0.8kg at 9/5 (calibrated)
Average cohort evolution
the entire Actor-Entity-Activity model) in an event log. For storing such enriched data events, we can
apply approaches such as Linked Data Event Streams [
        <xref ref-type="bibr" rid="ref13 ref14">13, 14</xref>
        ]. Managing these enrichments in an event
log thus adheres to the interpretation of a pod as a “hybrid, contextualized knowledge graph” [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
      </p>
      <p>Mappings (e.g., through SPARQL CONSTRUCT queries, potentially enhanced with ontology
alignment mappings, entailment reasoning, or other established Linked Data mapping techniques) allow
customizing the reads based on performance requirements (e.g., provide a “last thirty days” overview
per patient), data model requirements (e.g., provide a long-term trend across patients), and trust
requirements (e.g., only include measurements taken by a calibrated smart scale).</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>This paper argues that the demands of real-world read-write data processes have diferent underlying
assumptions and requirements than those currently provided by read-write Linked Data systems. From
an analysis of concrete demands from use cases, we propose a more fitting operational model that
leverages CQRS with explicit semantic mappings and Event Sourcing. We performed an initial validation
of our Trustflows operational model within the PACSOI project, showing how the Trustflows operational
model can handle data coming in diferent granularities, from diferent sources, and adhering to diferent
reading requirements. This work is an initial presentation, and will benefit from discussion and feedback
from the broader community. By further investigating common pitfalls of deploying writeable Linked
Data nodes, we will research a more concrete specification and accompanying implementation that
aligns with the current state of the art, brings support for our aforementioned requirements, and avoids
the broader set of pitfalls.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>The described research activities were supported by SolidLab Vlaanderen (Flemish Government, EWI
and RRF project VV023/10), and by the imec.icon project PACSOI (HBC.2023.0752), which is co-financed
by imec and VLAIO and brings together the following partners: FAQIR Foundation, FAQIR Institute,
MoveUP, Byteflies, AContrario, and Ghent University – IDLab. We thank all partners in the following
projects, as their contributions helped to shape the requirements: imec.icon SHARCS and Horizon
Europe Onto-DESIDE.</p>
    </sec>
    <sec id="sec-7">
      <title>Declaration on Generative AI</title>
      <p>During the preparation of this work, the author(s) used GPT-4o to: Grammar and spelling check. After
using these tool(s)/service(s), the author(s) reviewed and edited the content as needed and take(s) full
responsibility for the publication’s content.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>T.</given-names>
            <surname>Berners-Lee</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          <article-title>O'Hara, The read-write Linked Data Web</article-title>
          ,
          <source>Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences</source>
          <volume>371</volume>
          (
          <year>2013</year>
          )
          <article-title>20120513</article-title>
          . doi:
          <volume>10</volume>
          . 1098/rsta.
          <year>2012</year>
          .
          <volume>0513</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Speicher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Malhotra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Arwe</surname>
          </string-name>
          ,
          <source>Linked Data Platform</source>
          <volume>1</volume>
          .0,
          <string-name>
            <surname>Recommendation</surname>
          </string-name>
          ,
          <source>World Wide Web Consortium (W3C)</source>
          ,
          <year>2015</year>
          . URL: http://www.w3.org/TR/ldp/.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Capadisli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Berners-Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kjernsmo</surname>
          </string-name>
          , Solid Protocol, Draft Community Group Report, Solid Community Group,
          <year>2024</year>
          . URL: https://solidproject.org/TR/protocol.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>B.</given-names>
            <surname>Armintor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Cowles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lamb</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Warner</surname>
          </string-name>
          , W. Andrew,
          <source>Fedora API Specification 1.0</source>
          ,
          <string-name>
            <surname>Technical</surname>
            <given-names>Report</given-names>
          </string-name>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Fowler</surname>
          </string-name>
          , Patterns of Enterprise Application Architecture,
          <source>The Addison-Wesley Signature Series</source>
          , 1st ed.,
          <string-name>
            <surname>Addison-Wesley</surname>
          </string-name>
          , Boston,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Katz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Gebhardt</surname>
          </string-name>
          , G. Sullice, J. Hanschke,
          <source>JSON:API v1.1</source>
          ,
          <string-name>
            <surname>Technical</surname>
            <given-names>Report</given-names>
          </string-name>
          ,
          <year>2022</year>
          . URL: https: //jsonapi.org/format/.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>G.</given-names>
            <surname>Young</surname>
          </string-name>
          , CQRS Documents,
          <source>Technical Report</source>
          ,
          <year>2010</year>
          . URL: https://cqrs.wordpress.com/wp-content/ uploads/2010/11/cqrs_documents.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>M.</given-names>
            <surname>Fowler</surname>
          </string-name>
          , Event Sourcing,
          <source>Technical Report</source>
          ,
          <year>2005</year>
          . URL: https://martinfowler.com/eaaDev/ EventSourcing.html.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Overeem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Spoor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Jansen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Brinkkemper</surname>
          </string-name>
          ,
          <article-title>An empirical characterization of event sourced systems and their schema evolution - lessons from industry</article-title>
          ,
          <source>Journal of Systems and Software</source>
          <volume>178</volume>
          (
          <year>2021</year>
          )
          <article-title>110970</article-title>
          . doi:
          <volume>10</volume>
          .1016/j.jss.
          <year>2021</year>
          .
          <volume>110970</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>P.</given-names>
            <surname>Missier</surname>
          </string-name>
          , L. Moreau,
          <article-title>PROV-DM: The PROV Data Model, W3C Recommendation</article-title>
          , Provenance Working Group,
          <year>2013</year>
          . URL: https://www.w3.org/TR/prov-dm/.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>N.</given-names>
            <surname>Sakimura</surname>
          </string-name>
          , et al.,
          <source>OpenID Connect Core 1.0 incorporating errata set 1</source>
          ,
          <string-name>
            <surname>Technical</surname>
            <given-names>Report</given-names>
          </string-name>
          , The OpenID Foundation,
          <year>2014</year>
          . URL: https://openid.net/specs/openid-connect
          <article-title>-core-1_0</article-title>
          .html.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>D.</given-names>
            <surname>Hardt</surname>
          </string-name>
          ,
          <source>The OAuth 2</source>
          .0 Authorization Framework,
          <source>Technical Report, Internet Engineering Task Force (IETF)</source>
          ,
          <year>2012</year>
          . URL: https://datatracker.ietf.org/doc/rfc6749/.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>W.</given-names>
            <surname>Slabbinck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Dedecker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Vasireddy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Verborgh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Colpaert</surname>
          </string-name>
          ,
          <article-title>Linked Data Event Streams in Solid LDP containers</article-title>
          ,
          <source>in: Proceedings of the 8th Workshop on Managing the Evolution</source>
          and
          <article-title>Preservation of the Data Web (MEPDaW) co-located with the 21st International Semantic Web Conference (ISWC</article-title>
          <year>2022</year>
          ), volume
          <volume>3339</volume>
          ,
          <year>2022</year>
          , pp.
          <fpage>28</fpage>
          -
          <lpage>35</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>D. Van Lancker</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Colpaert</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Delva</surname>
            , B. Van de Vyvere,
            <given-names>J. Rojas</given-names>
          </string-name>
          <string-name>
            <surname>Meléndez</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Dedecker</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Michiels</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Buyle</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. De Craene</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Verborgh</surname>
          </string-name>
          ,
          <article-title>Publishing Base Registries as Linked Data Event Streams</article-title>
          ,
          <source>in: Proceedings of the 21th International Conference on Web Engineering</source>
          , volume
          <volume>12840</volume>
          of Lecture Notes in Computer Science, Springer, Cham,
          <year>2021</year>
          , pp.
          <fpage>28</fpage>
          -
          <lpage>36</lpage>
          . doi:
          <volume>10</volume>
          .1007/978- 3-
          <fpage>030</fpage>
          - 74296-
          <issue>6</issue>
          _
          <fpage>3</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>R.</given-names>
            <surname>Dedecker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Slabbinck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wright</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hochstenbach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Colpaert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Verborgh</surname>
          </string-name>
          ,
          <article-title>What's in a Pod? A Knowledge Graph Interpretation For The Solid Ecosystem</article-title>
          ,
          <source>in: QuWeDa</source>
          <year>2022</year>
          : 6th Workshop on Storing,
          <source>Querying and Benchmarking Knowledge Graphs</source>
          , volume
          <volume>3279</volume>
          ,
          <year>2022</year>
          , pp.
          <fpage>81</fpage>
          -
          <lpage>96</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>