https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0#Head https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0 http://www.nanopub.org/nschema#hasAssertion https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0#assertion https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0 http://www.nanopub.org/nschema#hasProvenance https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0#provenance https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0 http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0#pubinfo https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0 http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0#assertion https://doi.org/10.1162/dint_a_00031 http://www.w3.org/2000/01/rdf-schema#label Thompson et al. 2019 https://w3id.org/fair/icc/terms/F3-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/F3-Explanation http://www.w3.org/2000/01/rdf-schema#comment Principle F3 states that any description of a digital resource must contain the identifier of that resource being described. For instance, the description of a computational workflow, should explicitly contain the identifier for that workflow in a manner that is unambiguous. This is especially important where the resource and its metadata are stored independently, but persistently linked, which is generally considered good practice in FAIR. The purpose of this principle is twofold. First, it is perhaps trivial to say that a descriptor should explicitly say what object it is describing; however, there is a second, less-obvious reason for this principle. Many digital objects (such as workflows, as mentioned above) have well-defined structures that may disallow the addition of new fields, including fields that could point to the metadata about that digital object. Therefore, if you have one of these digital objects in-hand, the only way to discover its metadata is through a search using the identifier of that digital object. Thus, by requiring that a metadata descriptor contains the identifier of the thing being described, that identifier may then successfully be used as the search term to discover its metadata record. https://w3id.org/fair/icc/terms/F3-Explanation http://www.w3.org/2000/01/rdf-schema#isDefinedBy https://w3id.org/fair/icc/latest/F3-Explanation https://w3id.org/fair/icc/terms/F3-Explanation http://www.w3.org/2000/01/rdf-schema#label Explanation of FAIR principle F3 https://w3id.org/fair/icc/terms/F3-Explanation http://www.w3.org/2000/01/rdf-schema#seeAlso https://doi.org/10.1162/dint_a_00031 https://w3id.org/fair/icc/terms/F3-Explanation http://www.w3.org/2000/01/rdf-schema#seeAlso https://www.w3.org/TR/vocab-dcat/ https://w3id.org/fair/icc/terms/F3-Explanation https://w3id.org/fair/icc/terms/explains-principle https://w3id.org/fair/principles/terms/F3 https://w3id.org/fair/icc/terms/F3-Explanation https://w3id.org/fair/icc/terms/implementation-considerations It is a challenge to each community to choose a machine-actionable metadata model that explicitly links a resource and its metadata. https://w3id.org/fair/icc/terms/F3-Explanation https://w3id.org/fair/icc/terms/implementation-examples An example of a technology that provides this link is FAIR Data Point (doi:10.1162/dint_a_00031), which is based on the Data Catalogue model (DCAT, https://www.w3.org/TR/vocab-dcat/) that provides not only unique identifiers for potentially multiple layers of metadata, but also provides a single, predictable, and searchable path through these layers of descriptors, down to the data object itself. https://w3id.org/fair/principles/terms/F3 http://www.w3.org/2000/01/rdf-schema#label F3 https://www.w3.org/TR/vocab-dcat/ http://www.w3.org/2000/01/rdf-schema#label Data Catalogue model (DCAT) https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0#provenance https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0#assertion http://purl.org/pav/authoredBy https://w3id.org/fair/icc/terms/FAIR-Principles-Explained-Working-Group https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0#pubinfo https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0 http://purl.org/dc/terms/created 2019-11-22T18:41:24.945+01:00 https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0 http://purl.org/dc/terms/creator https://orcid.org/0000-0001-8888-635X https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0 http://purl.org/dc/terms/creator https://orcid.org/0000-0002-1267-0234 https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0 http://purl.org/dc/terms/creator https://orcid.org/0000-0003-4818-2360 https://w3id.org/fair/icc/np/F3-Explanation/RAIIlDCGrUvI6nbPP4gZ6I6QacqqXsiCd5gM90HWDb3D0 http://purl.org/dc/terms/license https://creativecommons.org/publicdomain/zero/1.0/