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: "proof of file access in a private p2p network using blockchain"
  Abstract: While sharing files in a peer-to-peer (P2P) system significantly increases both the speed of retrieving the contents and the robustness of the system, tracing the access of files is not straightforward, even in the case of private P2P networks. In fact, a participant that has uploaded a file to a P2P network is not necessarily involved in its download. Additionally, due to the nature of the P2P network it is possible for a participant to already have all the fragments of a file, even before requesting it. #R##N#This work tries to address the problem of tracing file access in a private P2P file sharing network through the use of blockchains to improve quality of service and auditability. To this end, the proposed solution combines three elements: (1) A distributed hash table network that is used to distribute encrypted files with redundancy amongst the partner peers; (2) Shamir's secret sharing scheme to split the secret keys of each file; (3) A blockchain network to distribute and manage the secret shares amongst the partner peers. In fact, the latter makes access to a file undeniable to every node of the network. #R##N#The solution is relevant for consortia that manage a shared data pool on base of P2P technology with unrestricted access to files but where access to a file has to be recorded due to legal or billing reasons.

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)