@prefix this: . @prefix sub: . @prefix schema: . @prefix gen: . @prefix np: . @prefix dct: . @prefix nt: . @prefix npx: . @prefix xsd: . @prefix rdfs: . @prefix orcid: . @prefix prov: . sub:Head { this: a np:Nanopublication; np:hasAssertion sub:assertion; np:hasProvenance sub:provenance; np:hasPublicationInfo sub:pubinfo . } sub:assertion { a schema:Question; dct:isPartOf ; rdfs:label "In what ways can nanopublications be combined with each other?"; gen:hasContent """

Since every nanopublication has a stable, resolvable identifier, nanopublications can reference each other just like web pages link to each other — and these references are themselves machine-readable. An assertion can build on a concept or claim introduced in another nanopublication, the provenance graph can declare that an assertion was derived from earlier ones, and comments, reviews, or disputes can point to the nanopublication they are about. The result is a growing, decentralized network of interlinked small knowledge units.

Some combination patterns have dedicated support. Indexes are nanopublications that list other nanopublications as elements, turning a set of them into a citable collection, such as a dataset. Superseding and retraction links chain versions of the same content together, so the history of a claim stays navigable. And shared reference points, expressed with properties like is part of, let independent nanopublications jointly form a larger resource: this FAQ, for example, is simply the set of all nanopublications declaring their entries to be part of the FAQ page.

""" . } sub:provenance { sub:assertion prov:wasAttributedTo orcid:0000-0002-1267-0234 . } sub:pubinfo { this: dct:created "2026-06-11T07:45:33Z"^^xsd:dateTime; dct:creator orcid:0000-0002-1267-0234; dct:license ; npx:hasNanopubType schema:Question; npx:supersedes ; rdfs:label "FAQ: In what ways can nanopublications be combined with each other?"; nt:wasCreatedFromProvenanceTemplate ; nt:wasCreatedFromPubinfoTemplate , , ; nt:wasCreatedFromTemplate . sub:sig npx:hasAlgorithm "RSA"; npx:hasPublicKey "MIGfMA0GCSqGSIb3DQEBAQUAA4GNADCBiQKBgQCwUtewGCpT5vIfXYE1bmf/Uqu1ojqnWdYxv+ySO80ul8Gu7m8KoyPAwuvaPj0lvPtHrg000qMmkxzKhYknEjq8v7EerxZNYp5B3/3+5ZpuWOYAs78UnQVjbHSmDdmryr4D4VvvNIiUmd0yxci47dTFUj4DvfHnGd6hVe5+goqdcwIDAQAB"; npx:hasSignature "SxQUhXbXpGqo3xgVtVg8Rig78mTavcCUNO9N1J1Gv8pHTZx7R6pzLHb3FF08Y1j8xQCYj8Q82yPyALDwJ/D1pEY1ajuXoCbr3EPOSkxyDfxsVQFaPc5g81cZAOhPMRjYB0iT65CziVPqt4F3rGc8FEQA9MDRfOvA0FSaSKIemj0="; npx:hasSignatureTarget this:; npx:signedBy orcid:0000-0002-1267-0234 . }