@prefix this: . @prefix sub: . @prefix np: . @prefix dct: . @prefix nt: . @prefix xsd: . @prefix rdfs: . @prefix prov: . @prefix npx: . sub:Head { this: a np:Nanopublication; np:hasAssertion sub:assertion; np:hasProvenance sub:provenance; np:hasPublicationInfo sub:pubinfo . } sub:assertion { . } sub:provenance { sub:assertion prov:wasDerivedFrom . } sub:pubinfo { this: dct:created "2026-08-18T08:47:02Z"^^xsd:dateTime; dct:creator ; dct:license ; rdfs:label "Proof of the bounded path set (Lemma 2) proves: Bounding the number of trust paths keeps the cost o..."; nt:wasCreatedFromProvenanceTemplate ; nt:wasCreatedFromPubinfoTemplate , ; nt:wasCreatedFromTemplate . sub:sig npx:hasAlgorithm "RSA"; npx:hasPublicKey "MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAxxo+arlpyxYYoHYYVTNSOWe/es90yVMBA8vaDyaAQk4pnOjTlpPptP5IkGg6zuCRIlm11QrHKkiU536witBT6gdh9kP9ay3S6m7wZ3iM7YcPMfhVHUXN6TBnuiKHHyJdVeK6RxMZlfXRKEz9HYcND+PGCXMVp8BofpKBKke3y4m8FTt+8aMEcgVcFBHFdrkWXoIIvkMlodtXkMgSwuGK8yXt/9lXqChIWpsbzu2juuX6pktMkfexkfQTwIH7oNSr/ma4KzZXERuLrCSO6IH5SfWXwjQUery6rKHiEMyie58mgBf0ssKh+uJoaZOqgbmj0f+EDwTIzq0dNsPA0A+n2QIDAQAB"; npx:hasSignature "LL5NZQDNDpc2EMs/EwY/C3lpo5eaFGKluGMrhR/ZvRNwRly3O7dMlb5L2aHPIlStS+7Hslc2GfmYA4lYAh8fFMsG0Gyg4ACFKL4FCpr9AJm7QpPxzL6GtPM4vcyPqK6cReLtV0YS8ceFTnxJnR4AqDOz+1sVTCQthpUoaZRbvVsTZqYE6KGIe9xQRkpJrQ2gqh0gOyK/X5ssqFTiZ7v8Bd3znvCsP1R9rQYT/+luxVHO+giVVf7UTVJ04wAcgPvqiaKXZ6PowQ8p0Xnnm5Pddxro6gfJ3PtKxPFH1vkVb8VXLSa6KltuEQCB8jXHf+wYDKtiBpbHTDe7pinMlLQicA=="; npx:hasSignatureTarget this:; npx:signedBy . }