{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:21:53Z","timestamp":1777890113006,"version":"3.51.4"},"reference-count":29,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T00:00:00Z","timestamp":1702425600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SW"],"published-print":{"date-parts":[[2023,12,13]]},"abstract":"<jats:p>We present an approach to publish Linked Data on the Web with quantifiable integrity using Web technologies, and in which rational agents are incentivised to contribute to the integrity of the link network. To this end, we introduce self-verifying resource representations, that include Linked Data Signatures whose signature value is used as a suffix in the resource\u2019s URI. Links among such representations, typically managed as web documents, contribute therefore to preserving the integrity of the resulting document graphs. To quantify how well a document\u2019s integrity can be relied on, we introduce the notion of trust scores and present an interpretation based on hubs and authorities. In addition, we present how specific agent behaviour may be induced by the choice of trust score regarding their optimisation, e.g., in general but also using a heuristic strategy called Additional Reach Strategy (ARS). We discuss our approach in a three-fold evaluation: First, we evaluate the effect of different graph metrics as trust scores on induced agent behaviour and resulting evolution of the document graph. We show that trust scores based on hubs and authorities induce agent behaviour that contributes to integrity preservation in the document graph. Next, we evaluate different heuristics for agents to optimise trust scores when general optimisation strategies are not applicable. We show that ARS outperforms other potential optimisation strategies. Last, we evaluate the whole approach by examining the resilience of integrity preservation in a document graph when resources are deleted. To this end, we propose a simulation system based on the Watts\u2013Strogatz model for simulating a social network. We show that our approach produces a document graph that can recover from such attacks or failures in the document graph.<\/jats:p>","DOI":"10.3233\/sw-233409","type":"journal-article","created":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T12:19:48Z","timestamp":1689682788000},"page":"1167-1207","source":"Crossref","is-referenced-by-count":0,"title":["Quantifiable integrity for Linked Data on the web"],"prefix":"10.1177","volume":"14","author":[{"given":"Christoph\u00a0H.-J.","family":"Braun","sequence":"first","affiliation":[{"name":"Institute AIFB, Karlsruhe Institute of Technology (KIT), Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"K\u00e4fer","sequence":"additional","affiliation":[{"name":"Institute AIFB, Karlsruhe Institute of Technology (KIT), Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/SW-233409_ref1","unstructured":"I.\u00a0Amed, A.\u00a0Balchandani, M.\u00a0Beltram, A.\u00a0Berg, S.\u00a0Hedrich and F.\u00a0R\u00f6lkens, What radical transparency could mean for the fashion industry, McKinsey & Company (2019), https:\/\/www.mckinsey.com\/industries\/retail\/our-insights\/what-radical-transparency-could-mean-for-the-fashion-industry."},{"key":"10.3233\/SW-233409_ref2","unstructured":"American National Standards Institute, Inc., Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), X9.62, ANSI, 2005."},{"key":"10.3233\/SW-233409_ref4","unstructured":"A.\u00a0Arasu, J.\u00a0Novak, A.\u00a0Tomkins and J.\u00a0Tomlin, PageRank computation and the structure of the web: Experiments and algorithms, in: Proceedings of the Poster Track at the 11th International World Wide Web Conference (WWW), 2002, pp.\u00a0107\u2013117."},{"issue":"7","key":"10.3233\/SW-233409_ref5","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1016\/j.jcss.2010.01.003","article-title":"Hashing and canonicalizing Notation\u00a03 graphs","volume":"76","author":"Arias-Fisteus","year":"2010","journal-title":"Journal of Computer and System Sciences"},{"key":"10.3233\/SW-233409_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-33220-4_28"},{"key":"10.3233\/SW-233409_ref9","unstructured":"C.\u00a0Braun and T.\u00a0K\u00e4fer, Verifying the integrity of information along a supply chain using linked data and smart contracts, in: Proceedings of the Posters and Demo Track at the 15th International Conference on Semantic Systems (SEMANTiCS), M.\u00a0Alam, R.\u00a0Usbeck, T.\u00a0Pellegrini, H.\u00a0Sack and Y.\u00a0Sure-Vetter, eds, CEUR Workshop Proceedings, Vol.\u00a02451, CEUR-WS.org, 2019, http:\/\/ceur-ws.org\/Vol-2451\/paper-07.pdf."},{"key":"10.3233\/SW-233409_ref10","doi-asserted-by":"crossref","unstructured":"C.H.-J.\u00a0Braun and T.\u00a0K\u00e4fer, Self-verifying web resource representations using Solid, RDF-star and signed URIs, in: Proceedings of Posters & Demos at the 19th European Semantic Web Conference (ESWC), 2022.","DOI":"10.1007\/978-3-031-11609-4_26"},{"key":"10.3233\/SW-233409_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39718-2_24"},{"issue":"4","key":"10.3233\/SW-233409_ref15","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.websem.2005.09.001","article-title":"Named graphs","volume":"3","author":"Carroll","year":"2005","journal-title":"J.\u00a0Web Semant."},{"key":"10.3233\/SW-233409_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67262-5_1"},{"key":"10.3233\/SW-233409_ref22","unstructured":"V.\u00a0Gaur and A.\u00a0Gaiha, Building a transparent supply chain, Harvard Business Review (2020), https:\/\/hbr.org\/2020\/05\/building-a-transparent-supply-chain."},{"key":"10.3233\/SW-233409_ref23","doi-asserted-by":"publisher","DOI":"10.3390\/ijerph18094678"},{"key":"10.3233\/SW-233409_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17746-0_19"},{"key":"10.3233\/SW-233409_ref25","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988727"},{"key":"10.3233\/SW-233409_ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17705-8_16"},{"key":"10.3233\/SW-233409_ref27","unstructured":"A.\u00a0Harth and S.\u00a0Speiser, On completeness classes for query evaluation on linked data, in: Proceedings of the 26th Conference on Artificial Intelligence (AAAI), J.\u00a0Hoffmann and B.\u00a0Selman, eds, AAAI Press, 2012, http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI12\/paper\/view\/5114."},{"issue":"4","key":"10.3233\/SW-233409_ref29","doi-asserted-by":"publisher","first-page":"22:1","DOI":"10.1145\/3068333","article-title":"Canonical forms for isomorphic and equivalent RDF graphs: Algorithms for leaning and labelling blank nodes","volume":"11","author":"Hogan","year":"2017","journal-title":"ACM Trans. Web"},{"key":"10.3233\/SW-233409_ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2993318.2993342"},{"issue":"5","key":"10.3233\/SW-233409_ref32","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","article-title":"Authoritative sources in a hyperlinked environment","volume":"46","author":"Kleinberg","year":"1999","journal-title":"Journal of the ACM"},{"key":"10.3233\/SW-233409_ref33","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.78"},{"key":"10.3233\/SW-233409_ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07443-6_27"},{"issue":"9","key":"10.3233\/SW-233409_ref35","doi-asserted-by":"publisher","first-page":"2390","DOI":"10.1109\/TKDE.2015.2419657","article-title":"Making digital artifacts on the web verifiable and reliable","volume":"27","author":"Kuhn","year":"2015","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.3233\/SW-233409_ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2872518.2890529"},{"key":"10.3233\/SW-233409_ref40","doi-asserted-by":"crossref","unstructured":"J.X.\u00a0Parreira, D.\u00a0Donato, C.\u00a0Castillo and G.\u00a0Weikum, Computing trusted authority scores in peer-to-peer web search networks, in: Proceedings of the 3rd International Workshop on Adversarial Information Retrieval, ACM International Conference Proceeding Series, Vol.\u00a0215, 2007, on the Web (AIRWeb) at the World Wide Web conference (WWW), http:\/\/airweb.cse.lehigh.edu\/2007\/papers\/paper_108.pdf.","DOI":"10.1145\/1244408.1244422"},{"key":"10.3233\/SW-233409_ref41","unstructured":"J.X.\u00a0Parreira, D.\u00a0Donato, S.\u00a0Michel and G.\u00a0Weikum, Efficient and decentralized PageRank approximation in a peer-to-peer web search network, in: Proceedings of the 32nd International Conference on Very Large Data Bases, U.\u00a0Dayal, K.\u00a0Whang, D.B.\u00a0Lomet, G.\u00a0Alonso, G.M.\u00a0Lohman, M.L.\u00a0Kersten, S.K.\u00a0Cha and Y.\u00a0Kim, eds, ACM, 2006, pp.\u00a0415\u2013426, http:\/\/dl.acm.org\/citation.cfm?id=1164164."},{"key":"10.3233\/SW-233409_ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46950-7"},{"issue":"1","key":"10.3233\/SW-233409_ref48","first-page":"1","article-title":"Integrity proofs for RDF graphs","volume":"6","author":"Sutton","year":"2019","journal-title":"Open Journal of Semantic Web (OJSW)"},{"key":"10.3233\/SW-233409_ref49","unstructured":"A.\u00a0Third and J.\u00a0Domingue, LinkChains: Exploring the space of decentralised trustworthy linked data, in: Proceedings of the Workshop on Decentralizing the Semantic Web 2017 at the 16th International Semantic Web Conference (ISWC), CEUR Workshop Proceedings, 1934, CEUR-WS.org, 2017, http:\/\/ceur-ws.org\/Vol-1934\/contribution-06.pdf."},{"issue":"6684","key":"10.3233\/SW-233409_ref50","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u2018small-world\u2019 networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"}],"container-title":["Semantic Web"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/SW-233409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:27:04Z","timestamp":1777613224000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/SW-233409"}},"subtitle":[],"editor":[{"given":"Elena","family":"Demidova","sequence":"additional","affiliation":[{"name":"University of Bonn, Germany"}],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2023,12,13]]},"references-count":29,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.3233\/sw-233409","relation":{},"ISSN":["2210-4968","1570-0844"],"issn-type":[{"value":"2210-4968","type":"electronic"},{"value":"1570-0844","type":"print"}],"subject":[],"published":{"date-parts":[[2023,12,13]]}}}