[ {
  "@graph" : [ {
    "@id" : "http://purl.org/np/RAIHVOMrZQ-YVIL89lAOHMHvyxxAaDbTlYLYNnvKPz1Eg",
    "@type" : [ "http://www.nanopub.org/nschema#Nanopublication" ],
    "http://www.nanopub.org/nschema#hasAssertion" : [ {
      "@id" : "http://purl.org/np/RAIHVOMrZQ-YVIL89lAOHMHvyxxAaDbTlYLYNnvKPz1Eg#assertion"
    } ],
    "http://www.nanopub.org/nschema#hasProvenance" : [ {
      "@id" : "http://purl.org/np/RAIHVOMrZQ-YVIL89lAOHMHvyxxAaDbTlYLYNnvKPz1Eg#provenance"
    } ],
    "http://www.nanopub.org/nschema#hasPublicationInfo" : [ {
      "@id" : "http://purl.org/np/RAIHVOMrZQ-YVIL89lAOHMHvyxxAaDbTlYLYNnvKPz1Eg#pubinfo"
    } ]
  } ],
  "@id" : "http://purl.org/np/RAIHVOMrZQ-YVIL89lAOHMHvyxxAaDbTlYLYNnvKPz1Eg#Head"
}, {
  "@graph" : [ {
    "@id" : "http://purl.org/np/RAIHVOMrZQ-YVIL89lAOHMHvyxxAaDbTlYLYNnvKPz1Eg#paragraph",
    "@type" : [ "http://purl.org/spar/doco/Paragraph" ],
    "http://purl.org/spar/c4o/hasContent" : [ {
      "@value" : "Proof. The algorithm of the Find stage iterates over all the triples associated with each distinct triple subject in T , therefore the complexity of this stage is O(|T |). In the Verify stage, the algorithm firstly iterates over the answers obtained from the previous stage, which corresponds to T . Next, the algorithm iterates over the quality issues detected in the Find stage; in the worst case, each quality issue is found in at least one triple, then, the set Q 0 is equal to Q. For each quality is- sue, the algorithm processes the triples annotated with that quality issue, which again in the worst case is T (all the triples present all the quality issues). There- fore, the complexity of the Find stage is calculated as O(|T | + |T ||Q|), then O(|T ||Q|). \u0004"
    } ]
  } ],
  "@id" : "http://purl.org/np/RAIHVOMrZQ-YVIL89lAOHMHvyxxAaDbTlYLYNnvKPz1Eg#assertion"
}, {
  "@graph" : [ {
    "@id" : "http://purl.org/np/RAIHVOMrZQ-YVIL89lAOHMHvyxxAaDbTlYLYNnvKPz1Eg#assertion",
    "http://www.w3.org/ns/prov#hadPrimarySource" : [ {
      "@id" : "http://dx.doi.org/10.3233/SW-160239"
    } ],
    "http://www.w3.org/ns/prov#wasAttributedTo" : [ {
      "@id" : "https://orcid.org/0000-0003-0530-4305"
    } ]
  } ],
  "@id" : "http://purl.org/np/RAIHVOMrZQ-YVIL89lAOHMHvyxxAaDbTlYLYNnvKPz1Eg#provenance"
}, {
  "@graph" : [ {
    "@id" : "http://purl.org/np/RAIHVOMrZQ-YVIL89lAOHMHvyxxAaDbTlYLYNnvKPz1Eg",
    "http://purl.org/dc/terms/created" : [ {
      "@type" : "http://www.w3.org/2001/XMLSchema#dateTime",
      "@value" : "2019-11-08T18:05:11+01:00"
    } ],
    "http://purl.org/pav/createdBy" : [ {
      "@id" : "https://orcid.org/0000-0002-7114-6459"
    } ]
  } ],
  "@id" : "http://purl.org/np/RAIHVOMrZQ-YVIL89lAOHMHvyxxAaDbTlYLYNnvKPz1Eg#pubinfo"
} ]