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: "group secret key generation using algebraic rings in three user wireless networks"
  Abstract: Physical-layer Group Secret-Key (GSK) generation is an effective way of synthesizing symmetric keys across multiple nodes in wireless networks. Unlike the case of two-user key generation, GSK generation necessitates some nodes to act as facilitators, which broadcast linear combinations of the channel realizations thereby assisting all the nodes to witness the intended common source of randomness. However, in practice, radio devices are designed to transmit symbols from finite complex constellations, and as a result, the channel realizations are typically quantized by the facilitator which in turn impacts the overall secret-key rate. Identifying this issue, we propose a class of GSK generation protocols, called Symmetrically Quantized GSK (SQGSK) protocols, in a network of three nodes. In the proposed protocols, due to quantization of symbols at the facilitator, the other two nodes also quantize their channel realizations, and use them appropriately to generate the keys. Under special conditions, we analytically show that the SQGSK protocols provide higher key-rate than the baselines wherein only the facilitator quantizes the channel realizations. We use extensive simulations to demonstrate the benefits of the proposed protocols when the facilitator employs finite constellations such as 4-, 16-, and 64-QAM.

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.IT(Information Theory)