@prefix this: <https://w3id.org/fair/icc/np/F4-Explanation/RALCFoxnyBIpxN7gjLeQDHaXF9K4v_gFvudEE_kfryYlM> .
@prefix sub: <https://w3id.org/fair/icc/np/F4-Explanation/RALCFoxnyBIpxN7gjLeQDHaXF9K4v_gFvudEE_kfryYlM#> .
@prefix latest: <https://w3id.org/fair/icc/latest/F4-Explanation> .
@prefix icc: <https://w3id.org/fair/icc/terms/> .
@prefix fair: <https://w3id.org/fair/principles/terms/> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix pav: <http://purl.org/pav/> .
@prefix np: <http://www.nanopub.org/nschema#> .
@prefix orcid: <https://orcid.org/> .
sub:Head {
  this: np:hasAssertion sub:assertion ;
    np:hasProvenance sub:provenance ;
    np:hasPublicationInfo sub:pubinfo ;
    a np:Nanopublication .
sub:assertion {
  <https://doi.org/10.1162/dint_a_00026> rdfs:label "Weigel et al. 2019" .
  <https://toolbox.google.com/datasetsearch> rdfs:label "Google Dataset Search" .
  icc:F4-Explanation a icc:Explanation ;
    rdfs:comment "Principle F4 states that digital resources must be registered or indexed in a searchable resource. The searchable resource provides the infrastructure by which a metadata record (F1) can be discovered, using either the attributes in that metadata (F2) or the identifier of the data object itself (F3) (doi:10.1162/dint_a_00026)." ;
    rdfs:isDefinedBy latest: ;
    rdfs:label "Explanation of FAIR principle F4" ;
    rdfs:seeAlso <https://doi.org/10.1162/dint_a_00026> , <https://toolbox.google.com/datasetsearch> ;
    icc:explains-principle fair:F4 ;
    icc:implementation-considerations "Current challenges are numerous, significantly limiting, and largely outside of the control of the average data provider. First, there is no single-source for search that currently indexes all possible metadata fields in all domains. Second, there is no uniform way to execute a search, and thus every search tool must be accessed with tool-specific software. Finally, many search engines forbid automated searches, precluding their use by FAIR-enabled software. Various initiatives are emerging that attempt to address this, at least in part, by providing a well-defined, machine-accessible search interface over indexed metadata. Nevertheless, to our knowledge, none of these currently index all possible metadata properties, nor do they span all possible domains/communities; rather, they focus on specific metadata schemas such as schema.org, at the expense of other well-established metadata formats such as DCAT, and/or are limited to specific communities such as biotechnology, astronomy, law, or government/administration. Current choices are for each community to choose, and publicly declare, what search engine to use for their own purposes, general or field-specific, and should at a minimum provide metadata following the standard that is indexed by the search engine of choice. They should also provide a machine-readable interface definition that would allow an automated search without human intervention." ;
    icc:implementation-examples "An example of a generic searchable resource that supports manual exploration is Google Dataset Search (https://toolbox.google.com/datasetsearch); however, this suffers from several of the problems mentioned above, in particular, that it indexes only certain types of metadata (schema.org) and the search cannot be automated under the Google Terms of Service, and therefore cannot be implemented within FAIR software." .
  fair:F4 rdfs:label "F4" .
sub:provenance {
  sub:assertion pav:authoredBy icc:FAIR-Principles-Explained-Working-Group .
sub:pubinfo {
  this: dct:created "2019-11-22T18:41:24.945+01:00"^^xsd:dateTime ;
    dct:creator orcid:0000-0001-8888-635X , orcid:0000-0002-1267-0234 , orcid:0000-0003-4818-2360 ;
    dct:license <https://creativecommons.org/publicdomain/zero/1.0/> .