https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc#Head
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc
http://www.nanopub.org/nschema#hasAssertion
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc#assertion
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc
http://www.nanopub.org/nschema#hasProvenance
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc#provenance
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc
http://www.nanopub.org/nschema#hasPublicationInfo
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc#pubinfo
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc
http://www.w3.org/1999/02/22-rdf-syntax-ns#type
http://www.nanopub.org/nschema#Nanopublication
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc#assertion
http://dbpedia.org/resource/Hypertext_Transfer_Protocol
http://www.w3.org/2000/01/rdf-schema#label
Hypertext Transfer Protocol
https://dash.harvard.edu/handle/1/4322580
http://www.w3.org/2000/01/rdf-schema#label
Suber 2008
https://w3id.org/fair/icc/terms/A1.1-Explanation
http://www.w3.org/1999/02/22-rdf-syntax-ns#type
https://w3id.org/fair/icc/terms/Explanation
https://w3id.org/fair/icc/terms/A1.1-Explanation
http://www.w3.org/2000/01/rdf-schema#comment
The protocol (mechanism) by which a digital resource is accessed (e.g. queried) should not pose any bottleneck. It describes an access process, hence does not directly pertain to restrictions that apply to using the resource. The protocols underlying the World-Wide Web, such as HTTP, are an archetype for an open, free, and universally implementable protocol. Such protocols reduce the cost of gaining access to digital resources, because they are well defined and open and allow any individual to create their own standards-compliant implementation. That the use of the protocols is free ensures that those lacking monetary means can equitably access the resource. That it is universally implementable ensures that the technology is available to all (and not restricted, for instance, by country or a sub-community), thus encompassing both the "gratis" and "libre" meaning of "free" (https://dash.harvard.edu/handle/1/4322580).
https://w3id.org/fair/icc/terms/A1.1-Explanation
http://www.w3.org/2000/01/rdf-schema#isDefinedBy
https://w3id.org/fair/icc/latest/A1.1-Explanation
https://w3id.org/fair/icc/terms/A1.1-Explanation
http://www.w3.org/2000/01/rdf-schema#label
A1.1 Explanation
https://w3id.org/fair/icc/terms/A1.1-Explanation
http://www.w3.org/2000/01/rdf-schema#seeAlso
http://dbpedia.org/resource/Hypertext_Transfer_Protocol
https://w3id.org/fair/icc/terms/A1.1-Explanation
http://www.w3.org/2000/01/rdf-schema#seeAlso
https://dash.harvard.edu/handle/1/4322580
https://w3id.org/fair/icc/terms/A1.1-Explanation
https://w3id.org/fair/icc/terms/explains-principle
https://w3id.org/fair/principles/terms/A1.1
https://w3id.org/fair/icc/terms/A1.1-Explanation
https://w3id.org/fair/icc/terms/implementation-considerations
Current challenges are to explicitly and fully document access protocols that are not open/free (for example, access only after personal contact) and make those protocols available as a clearly identified facet of the machine-readable metadata. Current choices are for communities to choose standardized communication protocols that are open, free and universally implementable.
https://w3id.org/fair/icc/terms/A1.1-Explanation
https://w3id.org/fair/icc/terms/implementation-examples
The most common example of a compliant protocol is the HTTP protocol that underlies the majority of Web traffic. It has additional useful features, including the ability to request metadata in a preferred format, and/or to inquire as to the formats that are available. It is also widely supported by software and common programming languages.
https://w3id.org/fair/principles/terms/A1.1
http://www.w3.org/2000/01/rdf-schema#label
A1.1
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc#provenance
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc#assertion
http://purl.org/pav/authoredBy
https://w3id.org/fair/icc/terms/FAIR-Principles-Explained-Working-Group
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc#pubinfo
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc
http://purl.org/dc/terms/created
2019-11-22T18:41:24.945+01:00
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc
http://purl.org/dc/terms/creator
https://orcid.org/0000-0001-8888-635X
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc
http://purl.org/dc/terms/creator
https://orcid.org/0000-0002-1267-0234
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc
http://purl.org/dc/terms/creator
https://orcid.org/0000-0003-4818-2360
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc
http://purl.org/dc/terms/license
https://creativecommons.org/publicdomain/zero/1.0/
https://w3id.org/fair/icc/np/A1.1-Explanation/RAcOJlgyqXWCXlyUdNT0ahIIyqTxUFaXTE8gSKX7rkkwc
http://purl.org/nanopub/x/supersedes
https://w3id.org/fair/icc/np/A1.1-Explanation/RAybuBqRnSoPsqGuxmbFiI3y6_evmgIagjaacBet0dhZI