<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">A Research Agenda for Linked Closed Data</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Marcus</forename><surname>Cobden</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">University of Southampton</orgName>
								<address>
									<country key="GB">UK</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Jennifer</forename><surname>Black</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">University of Southampton</orgName>
								<address>
									<country key="GB">UK</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Nicholas</forename><surname>Gibbins</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">University of Southampton</orgName>
								<address>
									<country key="GB">UK</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Les</forename><surname>Carr</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">University of Southampton</orgName>
								<address>
									<country key="GB">UK</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Nigel</forename><surname>Shadbolt</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">University of Southampton</orgName>
								<address>
									<country key="GB">UK</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">A Research Agenda for Linked Closed Data</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">44C513C1F75B23AC2A39E55947540D25</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T11:48+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>While it is preferable that Linked Data is published without access or licence restrictions, there will always remain certain datasets which, perhaps due to financial considerations, cannot be published as Linked Open Data. If these valuable datasets do join the Web of Linked Data, it will be as Linked Closed Data -Linked Data with access and license restrictions. In this paper, we outline a research agenda for Linked Closed Data that considers the effects that access and license restrictions may have on the Web of Linked Data. If implemented poorly, access restrictions have the potential to break URI resolvability, but even when implemented well, we can expect them to affect dataset selection processes and inter-dataset link creation rates. Additionally, there remains the technical challenge of developing and standardising access restriction and automated payment techniques for the Web of Linked Data.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1">Introduction</head><p>To date, most research from the Linked Data community has focussed on Linked Open Data and failed to consider its logical counterpart Linked Closed Data. By Linked Closed Data, we refer to datasets which adhere to the principles of Linked Data publishing, but for which access to and use of the data is subject to legal or technical restrictions which go beyond attribution and share-alike obligations.</p><p>Linked Closed Data may seem at odds with the aims of the Linked Data community, however, this is not necessarily the case. Undoubtedly it would be a shame if existing 'open' datasets changed to a 'closed' publishing model, but it would still be preferable to the datasets becoming completely unavailable due to financial pressures on their publishers.</p><p>High quality data has value. If we wish to see more high quality datasets published as Linked Data, we must provide incentives for publishers to do so. Profit is arguably the most significant publishing incentive, and so, revenue models, and how they interact with Linked Data publishing patterns, are of great importance to the future of the Web of Linked Data.</p><p>While publishing 'open' datasets is to be commended, we anticipate that few companies will be prepared, or able, to make their data available without some access or licence restrictions. Ordnance Survey, Great Britain's national mapping agency, is in this position; they are required to operate as a self-funded organisation through the commercial sale of mapping data. Offering all their data for free would undermine their primary source of income.</p><p>The Times and The New York Times newspapers both used to offer free access to articles on their Web site, recently, however, they both adopted a subscription-based access model for their Web content. Crucially, unlike The Times, The New York Times allows non-subscribers free access to view up to 20 articles per calendar month. Despite the difference in markets, the introduction of paid access may be comparable to the addition of restrictions to Linked Data publishing.</p><p>It is imperative that we fully understand the implications of Linked Closed Data so that we can be sure that desirable properties of the Web of Data will not be lost in the face of access and license restrictions. Against this background, in this paper we identify the key research challenges posed by Linked Closed Data.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2">Access and Licensing</head><p>While we describe datasets as 'open' and 'closed', reality is less clear-cut; in practice we observe a spectrum of 'openness', which varies with the access restrictions a dataset is published with (who is permitted to 'see' the data), and the licence under which access is granted (what they are permitted to do with the data).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.1">Access restrictions</head><p>Access to a dataset may be: completely open, restricted only by the resources of the dataset host; restricted, open to users who meet specific access criteria; or private, open only to its owner. If badly realised, access restrictions have the potential to undermine the resolvability of Linked Data URIs and to dis-incentivise the creation of inter-dataset links. The resolvability of a URI would be undermined if, due to access restrictions, it is no longer possible to resolve that URI to a description document. Access restrictions might also remove any useful information from a URI description document. Creating links to a restricted dataset is less worthwhile if URIs within it cannot be resolved to a useful description.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.2">Dataset licences</head><p>Dataset licences range from public domain dedications (where all intellectual property rights are waived) <ref type="bibr" target="#b8">[9]</ref>, to permissive licences (which may impose anything from attribution, to more weighty obligations such as copyleft) to restrictive licences (which specify permitted uses of a dataset). Currently, 85% of the datasets in the Linked Data Cloud do not declare any license <ref type="bibr" target="#b1">[2]</ref>.</p><p>We are unlikely to see a restrictive license on a dataset without also encountering access restrictions; if access is open and practically anonymous, license breaches would be difficult to detect and punish. Since it is only worthwhile imposing license restrictions on valuable data, we expect that the publisher would also take the step of imposing access restrictions to protect its investments.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3">Business models</head><p>The 'openness' of a dataset is generally determined by the business model of the publisher. A range of business models have been proposed for Linked Data publishers, including subsidised publishing, subscription or micropayment-based access, sponsorship/advertising funded publishing, and loss-leader models (to drive interest or sales in other products, or to shape markets) <ref type="bibr" target="#b2">[3]</ref>.</p><p>Broadly, we can classify these business models into those which offer only free access products, only paid access products, or some combination of both. The revenue models of the individual products these business models are build from can also be split between free and paid access. We can then further categorise them by how their costs are recovered:</p><p>Advertising supported Costs are covered by revenue from advertising within the content. We consider this to cover both per-view advertising payments, and per-sale commission through affiliate links. Loss-leader Costs are written off as an investment. Loss-leader models may attempt to drive interest in other products, or perhaps to shape markets in the hope of future sales. Subsidised Costs are covered by some form of sponsorship or subsidy. Common in public sector undertakings.</p><p>Free access models should, in theory, employ at least one of these strategies, though our list is not exhaustive. Equally, paid access models might employ any combination of these to complement revenue from access payments. Currently, all Linked Data publishers operate under loss-leader or subsidy-based revenue models -none have adopted paid access or advertising supported revenue models.</p><p>In the last year, Ordnance Survey have begun to offer free access to some of their data. These free datasets include postcode location data, electoral and administrative boundaries, and gazetteer (at 1:50000 scale), though only some of these are published as Linked Data. Currently, as they offer no paid access Linked Data, this is likely to be a loss-leader exercise, perhaps to demonstrate what is possible with their premium subscriptions, or to shape the market in anticipation of a paid offering. Coupling a premium Linked Data product with a free version may be an effective way of mitigating the effects of access restrictions on phenomena such as link creation, providing they use the same URIs, and URI resolvability is maintained.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4">Research Challenges</head><p>The addition of access restrictions to Linked Data publishing systems and the emergence of datasets published under proprietary licenses will be an inevitable fact of commercial Linked Data. These changes will alter our expectations of URI resolvability and change the ways in which we use Linked Data.</p><p>We have identified six key challenges which are important in a Linked Data ecosystem where not all data is free -they are: i) building dataset reputation, ii) developing access, authentication and payment protocols, iii) fostering links between datasets, iv) managing confidential data, v) respecting license terms, and vi) validating business models. We elaborate further on these in the remainder of this section.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1">Building reputation</head><p>Access restrictions make it all the more important for a dataset to have a good reputation. Without access, prospective users will be unable to evaluate whether the dataset meets their needs before they commit to a purchase. Reputation and word of mouth are a common means through which users judge whether a product meets their requirements when considering a purchase.</p><p>Unfortunately there are few incentives to risk purchasing access to a dataset of unknown quality, so new and untried datasets are unlikely to create a reputation for themselves. To combat this bootstrapping problem, publishers will need to improve their reputation through other means; perhaps by (temporarily) removing access restrictions, or by seeking endorsements from trusted authorities. Freemium revenue models <ref type="bibr" target="#b0">[1]</ref> and free time-or extent-limited licences are a common means of providing access to prospective customers. Future research is needed to explore this area in more detail, and to identify other dataset reputation bootstrapping techniques.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2">Access, authentication and payment</head><p>The issue of restricting access to closed datasets poses clear technical challenges. HTTP content negotiation and redirection allows different documents to be served in response to a URI resolution attempt. Similar methods are needed for restricted-access datasets in order to field requests between free and paid content. Additionally, a new vocabulary is needed with which one can declare the presence of related documents which require payment to access, otherwise premium content may not be discoverable.</p><p>Authentication is a requirement of any access restriction techniques. The foundations for authentication are already being laid; the W3C WebID incubator group is standardising TLS client certificate based authentication <ref type="bibr" target="#b3">[4]</ref>.</p><p>Finally, in order for automated access to premium content to succeed beyond isolated individual publishers, we must standardise the means by which we indicate that payment is needed, and the methods by which payment can be made. The HTTP '402 Payment Required' response code has long been reserved, but no standards have yet specified how it should be used <ref type="bibr" target="#b5">[6]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.3">Fostering links</head><p>Restricting access to a dataset may also negatively impact how likely external sources are to create links to that dataset. Inter-dataset links are said to add value to datasets, and incoming links provide a form of advertisement and endorsement for the target dataset.</p><p>Publishers of Linked Closed Data will need to take into account the effect that their particular access and licensing schemes may have on incoming link creation rates. Datasets with schemes which permit some degree of free access may maintain a higher rate of link creation than those under more restrictive schemes. The different paid access models adopted by The Times and The New York Times may allow us to examine how access restriction affects link creation on the Web, although whether this translates to a Semantic Web context remains an open research question. Further research is needed to examine this behaviour in detail, and to explore other means of encouraging link creation.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.4">Managing confidentiality</head><p>It is not inconceivable that linked datasets might contain sensitive information. While authentication and authorisation schemes can be used to limit access to restricted information, the challenges posed by confidential data go beyond access, particularly in systems containing mixed confidentiality-level data.</p><p>Care must be taken that sensitive information cannot be inferred from nonsensitive data. For example, unique identification number ranges with unexplained gaps may suggest hidden information. Further, a Linked Data system, which adheres to current best practices, might inadvertently admit the existence of a sensitive URI by responding with an 'HTTP 403: Forbidden' response code instead of an 'HTTP 404: Not Found'. While this alone means little, if the URI contains embedded information, or can be correlated with other available data, it may constitute a breach of confidentiality.</p><p>Examining the issues in detail, and publishing amended best practices for publishing Linked Data in the presence of confidential information, remains an opportunity for future research.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.5">Respecting licenses</head><p>As we mentioned in Section 2.2, there are a wide range of common licences which datasets might be licensed under. Standardised licences, such as the GNU Public Licences (GPL), Creative Commons (CC) and Open Database Licences (ODBL), often offer variants with additional restrictions such as attribution, non-commercial use, and copyleft sharing requirements. Some of these licences, such as the GPL and CC, may eventually fall out of favour for Linked Data as they were not designed to be used in this context <ref type="bibr" target="#b8">[9]</ref>. Governments often have their own licenses for data, for example the United Kingdom's Open Government Licence (OGL).</p><p>Dataset licenses present two main challenges: tracking the licences under which data was received, and respecting the license conditions. In order to be able to honour license restrictions, Linked Data systems need to maintain appropriate provenance records of license conditions. Provenance is an active area of research for Linked Data <ref type="bibr" target="#b7">[8]</ref>, and we expect that once provenance-aware systems reach maturity much of this will be automated.</p><p>Ensuring adherence to dataset licenses is a more difficult research challenge. Interpreting licenses confidently and accurately requires legal training. Ideally standard licenses would include an approved machine-understandable description of the license, describing how a dataset might be used. Existing work has explored the potential of this approach <ref type="bibr" target="#b6">[7]</ref>; however, further work is needed to apply this to common license conditions.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.6">Validating business models</head><p>While many business models have been proposed for the Semantic Web and Linked Data publishers <ref type="bibr" target="#b2">[3]</ref>, it remains to be seen how many of them will prove viable. Some, such as advertising-supported Linked Data publishing, have been called into question somewhat <ref type="bibr" target="#b4">[5]</ref>; however, ultimately, the success of any business model will depend upon the market conditions in which is employed. Nonetheless, until there exist successful businesses built around these models, we must consider them unsolved research challenges.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5">Conclusions</head><p>In this paper, we introduced the notion of Linked Closed Data: Semantic Web datasets which are published in accordance with Linked Data principles, but which include access and licence restrictions. While we described Linked Closed Data as the logical counterpart to Linked Open Data, license restrictions are already common among 'Open' datasets (although they usually only require attribution as the source of the data); the addition of access restrictions is of greater significance. We argued that Linked Closed Data is likely to be the form of Linked Data publishing ultimately adopted by commercial Linked Data publishers when offering premium, paid access products, as they are likely to require some form of access restriction.</p><p>Finally, we identified six research challenges which are of new, or increased, significance when considering the effect of access and license restrictions on the Web of Data. These are: building dataset reputation despite access restrictions; developing and standardising access, authentication and payment protocols; fostering the creation of links to access restricted datasets; managing confidential data; tracking data licenses and ensuring license adherence; and the validation of Linked Data business models.</p></div>		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<author>
			<persName><forename type="first">C</forename><surname>Anderson</surname></persName>
		</author>
		<title level="m">Free: The Future of a Radical Price: The Economics of Abundance and Why Zero Pricing Is Changing the Face of Business</title>
				<imprint>
			<publisher>Random House Books</publisher>
			<date type="published" when="2009-08">Aug 2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<monogr>
		<author>
			<persName><forename type="first">C</forename><surname>Bizer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Jentzsch</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Cyganiak</surname></persName>
		</author>
		<ptr target="http://www4.wiwiss.fu-berlin.de/lodcloud/state/" />
		<title level="m">State of the LOD Cloud</title>
				<imprint>
			<date type="published" when="2011-08">Aug 2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<title level="m" type="main">Business models for linked data and web 3</title>
		<author>
			<persName><forename type="first">S</forename><surname>Brinker</surname></persName>
		</author>
		<ptr target="http://www.chiefmartec.com/2010/03/business-models-for-linked-data-and-web-30.html" />
		<imprint>
			<date type="published" when="2010-03">Mar 2010</date>
			<biblScope unit="page">0</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<monogr>
		<author>
			<persName><forename type="first">S</forename><surname>Corlosquet</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Sporny</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Inkster</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Story</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Harbulot</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Bachmann-Gmür</surname></persName>
		</author>
		<ptr target="http://www.w3.org/2005/Incubator/webid/spec/" />
		<title level="m">WebID 1.0 -Web Identification and Discovery (Draft)</title>
				<imprint>
			<date type="published" when="2011-02">Feb 2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<monogr>
		<author>
			<persName><forename type="first">L</forename><surname>Dodds</surname></persName>
		</author>
		<ptr target="http://www.ldodds.com/blog/2010/01/thoughts-on-linked-data-business-models/" />
		<title level="m">Thoughts on Linked Data Business Models</title>
				<imprint>
			<date type="published" when="2010-01">Jan 2010</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<author>
			<persName><forename type="first">R</forename><surname>Fielding</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Gettys</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Mogul</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Frystyk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Masinter</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Leach</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Berners-Lee</surname></persName>
		</author>
		<idno>RFC 2616</idno>
		<title level="m">Hypertext Transfer Protocol -HTTP/1.1</title>
				<imprint>
			<date type="published" when="1999-06">Jun 1999</date>
		</imprint>
	</monogr>
	<note>Draft Standard). updated by RFC 2817</note>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Data-purpose algebra: Modeling data usage policies</title>
		<author>
			<persName><forename type="first">C</forename><surname>Hanson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Kagal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Berners-Lee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Sussman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Weitzner</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">POLICY &apos;</title>
		<imprint>
			<biblScope unit="volume">07</biblScope>
			<biblScope unit="page" from="173" to="177" />
			<date type="published" when="2007-06">Jun 2007</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Provenance information in the web of data</title>
		<author>
			<persName><forename type="first">O</forename><surname>Hartig</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2nd Workshop on Linked Data on the Web (LDOW2009)</title>
				<meeting>the 2nd Workshop on Linked Data on the Web (LDOW2009)</meeting>
		<imprint>
			<date type="published" when="2009-01">Jan 2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Open data commons, a license for open data</title>
		<author>
			<persName><forename type="first">P</forename><surname>Miller</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Styles</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Heath</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the WWW2008 Workshop on Linked Data on the Web (LDOW)</title>
				<meeting>the WWW2008 Workshop on Linked Data on the Web (LDOW)</meeting>
		<imprint>
			<date type="published" when="2008">2008</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
