@prefix cito: <http://purl.org/spar/cito/> .
@prefix dcterms: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix hycl: <http://purl.org/petapico/o/hycl#> .
@prefix np: <http://www.nanopub.org/nschema#> .
@prefix npx: <http://purl.org/nanopub/x/> .
@prefix nt: <https://w3id.org/np/o/ntemplate/> .
@prefix orcid: <https://orcid.org/> .
@prefix prov: <http://www.w3.org/ns/prov#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix schema1: <http://schema.org/> .
@prefix sub1: <https://w3id.org/np/RA_-fn7lBnkMhiNTspX406Ew2EKs0vsvQ_0X0_lWuaEHw/> .
@prefix this: <https://w3id.org/np/RA_-fn7lBnkMhiNTspX406Ew2EKs0vsvQ_0X0_lWuaEHw> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

sub1:Head {
  this: a np:Nanopublication;
    np:hasAssertion sub1:assertion;
    np:hasProvenance sub1:provenance;
    np:hasPublicationInfo sub1:pubinfo .
}

sub1:assertion {
  <http://purl.org/aida/Quantum%20approximate%20optimization%20algorithms%20outperform%20classical%20methods%20for%20disjoint%20network%20motif%20identification%20in%20biological%20networks.>
    a hycl:AIDA-Sentence;
    dcterms:isPartOf <https://w3id.org/np/RAvk9pmoZ2IberoDe7zUWV0bVithiy6CnbSG5y06YuKM0/quantum-computing-applications-for-biodiversity-re>;
    cito:obtainsSupportFrom <https://doi.org/10.1093/bioadv/vbae208>;
    schema1:about <http://www.wikidata.org/entity/Q17995793>, <http://www.wikidata.org/entity/Q7001080> .
}

sub1:provenance {
  sub1:assertion prov:wasAttributedTo orcid:0000-0002-1784-2920 .
}

sub1:pubinfo {
  <http://www.wikidata.org/entity/Q17995793> nt:hasLabelFromApi "quantum computing" .
  
  <http://www.wikidata.org/entity/Q7001080> nt:hasLabelFromApi "network motif" .
  
  orcid:0000-0002-1784-2920 foaf:name "Anne Fouilloux" .
  
  this: dcterms:created "2026-01-10T20:08:08+00:00"^^xsd:dateTime;
    dcterms:creator orcid:0000-0002-1784-2920;
    dcterms:license <https://creativecommons.org/licenses/by/4.0/>;
    npx:hasNanopubType hycl:AIDA-Sentence, <http://purl.org/petapico/o/hycl>;
    npx:introduces <http://purl.org/aida/Quantum%20approximate%20optimization%20algorithms%20outperform%20classical%20methods%20for%20disjoint%20network%20motif%20identification%20in%20biological%20networks.>;
    npx:wasCreatedAt <https://nanodash.knowledgepixels.com/>;
    rdfs:label "AIDA sentence: Quantum approximate optimization algorithms outperform classical methods for disjoint network motif ...";
    nt:wasCreatedFromProvenanceTemplate <https://w3id.org/np/RA7lSq6MuK_TIC6JMSHvLtee3lpLoZDOqLJCLXevnrPoU>;
    nt:wasCreatedFromPubinfoTemplate <https://w3id.org/np/RA0J4vUn_dekg-U1kK3AOEt02p9mT2WO03uGxLDec1jLw>,
      <https://w3id.org/np/RAukAcWHRDlkqxk7H2XNSegc1WnHI569INvNr-xdptDGI>;
    nt:wasCreatedFromTemplate <https://w3id.org/np/RALmXhDw3rHcMveTgbv8VtWxijUHwnSqhCmtJFIPKWVaA> .
  
  sub1:sig npx:hasAlgorithm "RSA";
    npx:hasPublicKey "MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAosxbitQQzLXi1949Zd9JmSkGfYHHlj/CZZ7iiYs1TrZ5/Jk/wGA7kHEv7f9NtsinOdBo9EtHj/jgHE5W2Vv404JbOAY280PvH5Jns5ObWdVZmtHeCw0ZIdPEqNrurrEweKhzcTJW/YRpYWPwVPo47XyIW6IAcmx6gfdtmdPddMpplqExrP6G99ksXfXlZI0InQtZJRSGK5lYLLNzaofFtupPI5OAAGjooDyHijp0Ap2HIXH6WpO4S44cFPKU34pH2xhIY4/XT5DG1X5UoiVHs2Yoo30BHFudj/kAFwdzcy6Yh4tMDaB3ox6p7pi267d7n0y7kypC0Nt+hfgHQ1FpgwIDAQAB";
    npx:hasSignature "Bzi7GfRghjFmeIWZchwLEKcdHD0U6NzeBMUSJsudEzccOcHd6hBHTGBraDFmOxqNF1SvgZeRLhzta6fRpIe4BvoWON3jjzVeR5K1E5qCEwMIk+EMVDtapclzhOh+E1SyNRlEZPnJYqx1m4/bnRuwMnUawoMwBJhjoOhue0MEplfaZb2Mk1G2ou5NCijKaamjyp9aO+Ss1TV58veRke97zxGyBD6OrbeAz5wdLCTTKzbJPqx4RNhGWC6m9zsboMsHnlqcFkrHi+jscPV21FrENPwPyT4K12Lkw/GqeA8gIidzZ32QOcbEDXals4BFRdDMbO7DotD3/V/nMpNjYYagDw==";
    npx:hasSignatureTarget this:;
    npx:signedBy orcid:0000-0002-1784-2920 .
}