Nanopublications LDF server

Matches in Nanopublications for { ?s <https://w3id.org/fair/maturity_indicator/terms/Gen2/procedure> ?o ?g. }

• Gen2_MI_A1.1 procedure "The GUID (either data or metadata) is mapped to a resolution protocol. This resolution protocol is queried in FAIRSharing to determine if it meets the requirements of FAIRness." assertion.
• Gen2_MI_F2A procedure "Metadata is harvested by: 1) resolving the GUID (following all redirects) with a Content-Type header specifically searching for some form of structured data. e.g. 'Accept: text/turtle, application/n3, application/rdf+n3, application/turtle, application/x-turtle,text/n3,text/turtle, text/rdf+n3, text/rdf+turtle,application/json+ld, text/xhtml+xml,application/rdf+xml,application/n-triples' 2) resolving any Link 'meta' HTTP Headers (processed independently according to this same process, but not iteratively) 3) parsing the response body either as a hash (for non-linked data) or as a Graph for linked data, or both. 4) All other data is passed to the 'extruct' tool (https://github.com/scrapinghub/extruct) or to the Apache Tika tool (https://tika.apache.org/) for deep exploration 5) Any linked or hash-type data found by those tools are merged with the existing Hash or Graph data 6) The Hash and Graph are interrogated v.v. if they contain any data" assertion.
• Gen2_MI_A2 procedure "The GUID is resolved. Any hash-style metadata (e.g. JSON or microformat) is queried for a 'persistencePolicy' key. If that key exists, the test passes. Any Linked Data is queried for the http://www.w3.org/2000/10/swap/pim/doc" assertion.
• Gen2_MI_F1B procedure "Identifier scheme of the GUID is determined by pattern-match for Handle, DOI, InChI. For URLs we do further pattern-matches to determine if it matches the pattern for: * purl * oclc * fdlp * purlz * w3id * ark" assertion.
• Gen2_MI_F2B procedure "Metadata is harvested by: 1) resolving the GUID (following all redirects) with a Content-Type header specifically searching for some form of structured data. e.g. 'Accept: text/turtle, application/n3, application/rdf+n3, application/turtle, application/x-turtle,text/n3,text/turtle, text/rdf+n3, text/rdf+turtle,application/json+ld, text/xhtml+xml,application/rdf+xml,application/n-triples' 2) resolving any Link 'meta' HTTP Headers (processed independently according to this same process, but not iteratively) 3) parsing the response body either as a hash (for non-linked data) or as a Graph for linked data, or both. 4) All other data is passed to the 'extruct' tool (https://github.com/scrapinghub/extruct) or to the Apache Tika tool (https://tika.apache.org/) for deep exploration 5) Any linked or hash-type data found by those tools are merged with the existing Hash or Graph data 6) The Graph is interrogated v.v. if it contains any data" assertion.
• Gen2_MI_F4 procedure "The provided GUID is resolved to its metadata (i.e. a document) and the address of that document is captured (which may be distinct from the GUID itself) The GUID is then used in a search. The top 50 results of that search are compared to the address of the metadata document. Hash metadata is parsed for the keys "title", and "keywords", and those values are captured and used in a search. The top 50 results of that search are compared to the address of the metadata document. Graph metadata is queried for predicates containing "title" or "keyword", and those values are captured and used in a search. The top 50 results of that search are compared to the address of the metadata document." assertion.
• Gen2_MI_I1A procedure "The GUID is resolved. Any hash-style metadata (e.g. JSON or microformat) or Linked Data that can be found is considered a success." assertion.
• Gen2_MI_I1B procedure "The GUID is resolved. Any Linked Data that can be found is considered a success." assertion.
• Gen2_MI_I2A procedure "Any Linked Data that can be found is tested for the resolution of a subset of properties (predicates) present in it. Some proportion of these should resolve (the creator of the associated Maturity Test will decide what that proportion should be)" assertion.
• Gen2_MI_I2B procedure "Any Linked Data that can be found after resolution of the GUID is tested for the resolution of a subset of properties (predicates) present in it. Some proportion of these should resolve to Linked Data via content-negotiation (the creator of the associated Maturity Test will decide what that proportion should be)" assertion.
• Gen2_MI_I3 procedure "The URI-representation of the priovided GUID is examined for its domain name. Any Linked Data that can be found after resolution of the GUID is parsed to determine the hostname of the object-resources. A count is made of the number of objects that have a different domain from that of the originating host. This Maturity Indicator could be made quantitative if a test wanted to be very strict." assertion.
• Gen2_MI_A1.2 procedure "The GUID (either data or metadata) is mapped to a resolution protocol. The FAIRSharing registry is asked if that protocol supports authentication/authorization. In addition, if a link using the Dublin Core "accessRights" property is found in the metadata, this is acceptable." assertion.
• Gen2_MI_F1A procedure "An identifier scheme is valid if and only if it * can be recognized by a machine (regular expression) * follows a GUID pattern registered in FAIRSharing * The FAIRSharing registration acknowledges that the scheme guarantees global uniqueness" assertion.
• Gen2_MI_F3 procedure "Metadata is harvested by: 1) resolving the GUID (following all redirects) with a Content-Type header specifically searching for some form of structured data. e.g. 'Accept: text/turtle, application/n3, application/rdf+n3, application/turtle, application/x-turtle,text/n3,text/turtle, text/rdf+n3, text/rdf+turtle,application/json+ld, text/xhtml+xml,application/rdf+xml,application/n-triples' 2) resolving any Link 'meta' HTTP Headers (processed independently according to this same process, but not iteratively) 3) parsing the response body either as a hash (for non-linked data) or as a Graph for linked data, or both. 4) All other data is passed to the 'extruct' tool (https://github.com/scrapinghub/extruct) or to the Apache Tika tool (https://tika.apache.org/) for deep exploration 5) Any linked or hash-type data found by those tools are merged with the existing Hash or Graph data To locate the data identifier, hash data is tested for the keys: * codeRepository * mainEntity * primaryTopic * IAO:0000136 (is about) * IAO_0000136 * SIO:000332 (is about) * SIO_000332 * distribution * contains Graph data is tested for the properties: * schema:codeRepository * schema:mainEntity * foaf:primaryTopic * IAO:0000136 (information artifact ontology 'is about') * SIO:000332 (SemanticScience Integrated Ontology 'is about') * schema:distribution * DCAT:distribution (Data Catalogue vocabulary) * ldp:contains (Linked Data Platform) To locate the Metadata's GUID: 1) The values of all Hash keys are compared to the GUID provided to the test (this is not a rigorous test, but the key name cannot be predicted) 2) The Graph metadata is explored for the "objects" of each triple pattern-matching or exact-matching the provided GUID." assertion.
• Gen2_MI_R1.1 procedure "In hash-style (key/value) metadata, search for a "license" key. The value may be a link or a string In Linked-data style metadata, search for one of the following predicates: http://www.w3.org/1999/xhtml/vocab" assertion.