human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "trusty uris verifiable immutable and permanent digital artifacts for linked data"
  Abstract: To make digital resources on the web verifiable, immutable, and permanent, we propose a technique to include cryptographic hash values in URIs. We call them trusty URIs and we show how they can be used for approaches like nanopublications to make not only specific resources but their entire reference trees verifiable. Digital artifacts can be identified not only on the byte level but on more abstract levels such as RDF graphs, which means that resources keep their hash values even when presented in a different format. Our approach sticks to the core principles of the web, namely openness and decentralized architecture, is fully compatible with existing standards and protocols, and can therefore be used right away. Evaluation of our reference implementations shows that these desired properties are indeed accomplished by our approach, and that it remains practical even for very large files.

Connected through hyperedge HE-1 (induced by source paper "archive assisted archival fixity verification framework"):
  with members:
    - "mementomap framework for flexible and adaptive web archive profiling"
    - "difficulties of timestamping archived web pages"
    - "making digital artifacts on the web verifiable and reliable"
    - "decentralized trusted timestamping using the crypto currency bitcoin"
    - "http mailbox asynchronous restful communication"
    - "memento time travel for the web"
    - "preserving peer replicas by rate limited sampled voting"

Connected through hyperedge HE-2 (induced by source paper "nanopublications a growing resource of provenance centric scientific linked data"):
  with members:
    - "reliable granular references to changing linked data"
    - "nanopub java a java library for nanopublications"
    - "making digital artifacts on the web verifiable and reliable"
    - "provenance centered dataset of drug drug interactions"
    - "publishing without publishers a decentralized approach to dissemination retrieval and archiving of data"
    - "micropublications a semantic model for claims evidence arguments and annotations in biomedical communications"
    - "broadening the scope of nanopublications"

Connected through hyperedge HE-3 (induced by source paper "reliable granular references to changing linked data"):
  with members:
    - "nanopub java a java library for nanopublications"
    - "making digital artifacts on the web verifiable and reliable"
    - "provenance centered dataset of drug drug interactions"
    - "publishing without publishers a decentralized approach to dissemination retrieval and archiving of data"
    - "broadening the scope of nanopublications"
    - "an http based versioning mechanism for linked data"

Connected through hyperedge HE-4 (induced by source paper "science bots a model for the future of scientific computation"):
  with members:
    - "the rise of social bots"
    - "publishing without publishers a decentralized approach to dissemination retrieval and archiving of data"
    - "bots vs wikipedians anons vs logged ins"
    - "broadening the scope of nanopublications"

Connected through hyperedge HE-5 (induced by source paper "making digital artifacts on the web verifiable and reliable"):
  with members:
    - "publishing without publishers a decentralized approach to dissemination retrieval and archiving of data"
    - "broadening the scope of nanopublications"

Connected through hyperedge HE-6 (induced by source paper "provenance centered dataset of drug drug interactions"):
  with members:
    - "making digital artifacts on the web verifiable and reliable"
    - "publishing without publishers a decentralized approach to dissemination retrieval and archiving of data"

Connected through hyperedge HE-7 (induced by source paper "publishing without publishers a decentralized approach to dissemination retrieval and archiving of data"):
  with members:
    - "making digital artifacts on the web verifiable and reliable"
    - "science bots a model for the future of scientific computation"
    - "a survey and classification of controlled natural languages"
    - "broadening the scope of nanopublications"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.CR(Cryptography and Security)