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