@prefix dcterms: .
@prefix orcid: .
@prefix this: .
@prefix sub: .
@prefix xsd: .
@prefix prov: .
@prefix pav: .
@prefix np: .
@prefix doco: .
@prefix c4o: .
sub:Head {
this: np:hasAssertion sub:assertion;
np:hasProvenance sub:provenance;
np:hasPublicationInfo sub:pubinfo;
a np:Nanopublication .
}
sub:assertion {
sub:paragraph c4o:hasContent "Proof. In the Find stage, a microtask is generated when the number of triples within task exceeds the threshold α. Since in this stage each microtask groups triples by subjects, then l the number of microtaks m i ,p,o)∈T }| per subject is given by |{(p,o)|(s α , where {(p, o)|(s i , p, o) ∈ T } corresponds to triples with sub- ject s i . In total, in the Find stage, l the exact number m of P i ,p,o)∈T }| microtasks generated is s i ∈S |{(p,o)|(s α , which is less than |T | (for α >1). In the Verify stage, each microtask groups RDF triples with the same quality issue. When considering β as the maximum number of triples contained within a microtask, then the number l of microtasks created per quality issue m |{t|t∈T ∧ q i ∈ φ̇(t)}| . Therefore, the exact q i ∈ Q is β number l of microtasks generated in the Verify stage is m P |{t|t∈T ∧ q i ∈ φ̇(t)}| , which is ≤ |T ||Q|. Con- q i ∈Q β sidering that the set Q is considerably smaller than T , we can affirm that the number of microtasks generated in the Verify stage is linear with respect to T .";
a doco:Paragraph .
}
sub:provenance {
sub:assertion prov:hadPrimarySource ;
prov:wasAttributedTo orcid:0000-0003-0530-4305 .
}
sub:pubinfo {
this: dcterms:created "2019-11-08T18:05:11+01:00"^^xsd:dateTime;
pav:createdBy orcid:0000-0002-7114-6459 .
}