<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k> <http://www.nanopub.org/nschema#hasAssertion> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/assertion> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/Head> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k> <http://www.nanopub.org/nschema#hasProvenance> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/provenance> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/Head> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k> <http://www.nanopub.org/nschema#hasPublicationInfo> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/pubinfo> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/Head> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.nanopub.org/nschema#Nanopublication> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/Head> .
<https://w3id.org/np/RAvPvZgJt_kIZwPhESmfKdtuaxXgr9gGdjcsJjsyfS3ng/proof-bounded-paths> <https://w3id.org/np/RApY2x9ZrKtmpsW-ZINc1M1cvI9LYbmZ1-Gbgl3TEJsCI/proves> <http://purl.org/aida/Bounding+the+number+of+trust+paths+keeps+the+cost+of+recomputing+a+trust+network+from+growing+combinatorially+with+the+network.> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/assertion> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/assertion> <http://www.w3.org/ns/prov#wasDerivedFrom> <https://knowledgepixels.com/nanopub-ecosystem-paper/> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/provenance> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k> <http://purl.org/dc/terms/created> "2026-08-18T08:47:02Z"^^<http://www.w3.org/2001/XMLSchema#dateTime> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/pubinfo> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k> <http://purl.org/dc/terms/creator> <https://w3id.org/np/RA0SDqJIc3dtX2AihcvcSzBR7QIWfVl5lwk6U_MbH5RoA/nanopub-ecosystem-paper-bot> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/pubinfo> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k> <http://purl.org/dc/terms/license> <https://creativecommons.org/licenses/by/4.0/> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/pubinfo> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k> <http://www.w3.org/2000/01/rdf-schema#label> "Proof of the bounded path set (Lemma 2) proves: Bounding the number of trust paths keeps the cost o..." <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/pubinfo> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k> <https://w3id.org/np/o/ntemplate/wasCreatedFromProvenanceTemplate> <http://purl.org/np/RAmRxSMXuHZWtDXqTXqTK_aM1KBPauATJg4_KqixamLiE> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/pubinfo> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k> <https://w3id.org/np/o/ntemplate/wasCreatedFromPubinfoTemplate> <https://w3id.org/np/RA0J4vUn_dekg-U1kK3AOEt02p9mT2WO03uGxLDec1jLw> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/pubinfo> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k> <https://w3id.org/np/o/ntemplate/wasCreatedFromPubinfoTemplate> <https://w3id.org/np/RAukAcWHRDlkqxk7H2XNSegc1WnHI569INvNr-xdptDGI> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/pubinfo> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k> <https://w3id.org/np/o/ntemplate/wasCreatedFromTemplate> <https://w3id.org/np/RAUyaSwDeKfbXl4-_Q4-u58fRoHh98whfp-bRbmI8T4KI> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/pubinfo> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/sig> <http://purl.org/nanopub/x/hasAlgorithm> "RSA" <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/pubinfo> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/sig> <http://purl.org/nanopub/x/hasPublicKey> "MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAxxo+arlpyxYYoHYYVTNSOWe/es90yVMBA8vaDyaAQk4pnOjTlpPptP5IkGg6zuCRIlm11QrHKkiU536witBT6gdh9kP9ay3S6m7wZ3iM7YcPMfhVHUXN6TBnuiKHHyJdVeK6RxMZlfXRKEz9HYcND+PGCXMVp8BofpKBKke3y4m8FTt+8aMEcgVcFBHFdrkWXoIIvkMlodtXkMgSwuGK8yXt/9lXqChIWpsbzu2juuX6pktMkfexkfQTwIH7oNSr/ma4KzZXERuLrCSO6IH5SfWXwjQUery6rKHiEMyie58mgBf0ssKh+uJoaZOqgbmj0f+EDwTIzq0dNsPA0A+n2QIDAQAB" <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/pubinfo> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/sig> <http://purl.org/nanopub/x/hasSignature> "LL5NZQDNDpc2EMs/EwY/C3lpo5eaFGKluGMrhR/ZvRNwRly3O7dMlb5L2aHPIlStS+7Hslc2GfmYA4lYAh8fFMsG0Gyg4ACFKL4FCpr9AJm7QpPxzL6GtPM4vcyPqK6cReLtV0YS8ceFTnxJnR4AqDOz+1sVTCQthpUoaZRbvVsTZqYE6KGIe9xQRkpJrQ2gqh0gOyK/X5ssqFTiZ7v8Bd3znvCsP1R9rQYT/+luxVHO+giVVf7UTVJ04wAcgPvqiaKXZ6PowQ8p0Xnnm5Pddxro6gfJ3PtKxPFH1vkVb8VXLSa6KltuEQCB8jXHf+wYDKtiBpbHTDe7pinMlLQicA==" <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/pubinfo> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/sig> <http://purl.org/nanopub/x/hasSignatureTarget> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/pubinfo> .
<https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/sig> <http://purl.org/nanopub/x/signedBy> <https://w3id.org/np/RA0SDqJIc3dtX2AihcvcSzBR7QIWfVl5lwk6U_MbH5RoA/nanopub-ecosystem-paper-bot> <https://w3id.org/np/RA7DfF1vGFl9oQVwa_wtR-iL2F-xzhEjNnlzmNRtzLE5k/pubinfo> .