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: "multiparty routing secure routing for mixnets"
  Abstract: Anonymous communication networks are important building blocks for online privacy protection. One approach to achieve anonymity is to relay messages through multiple routers, where each router shuffles messages independently. To achieve anonymity, at least one router needs to be honest. In the presence of an adversary that is controlling a subset of the routers unbiased routing is important for guaranteeing anonymity. However, the routing strategy also influenced other factors such as the scalability and the performance of the system. One solution is to use a fixed route for relaying all messages with many routers. If the route is not fixed the routing decision can either be made by the communication initiator or the intermediate routers. However, the existing routing types each have limitations. For example, one faces scalability issues when increasing the throughput of systems with fixed routes. Moreover, when the routing decision is left to the initiator, the initiator needs to maintain an up-to-date view of the system at all times, which also does not scale. If the routing decision is left to intermediate routers the routing of the communication can be influenced by an adversary. In this work, we propose a novel multiparty routing approach for anonymous communication that addresses these shortcomings. We distribute the routing decision and verify the correctness of routing to achieve routing integrity. More concretely, we provide a mixnet design that uses our routing approach and that in addition, addresses load balancing. We show that our system is secure against a global active adversary.

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)