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: "multi edge type ldpc code design with g exit charts for continuous variable quantum key distribution"
  Abstract: Continuous-variable quantum key distribution utilizes an ensemble of coherent states of light to distribute secret encryption keys between two parties. One of the challenges is thereby the requirement of capacity approaching error correcting codes in the low signal-to-noise (SNR) regime (SNR < 0 dB). Multilevel coding (MLC) combined with multistage decoding (MSD) can solve this challenge in combination with multi-edge-type low-density parity-check (MET-LDPC) codes which are ideal for low code rates in the low SNR regime due to degree-one variable nodes. However, the complexity of designing such highly efficient codes remains an open issue. Here, we introduce the concept of generalized extrinsic information transfer (G-EXIT) charts for MET-LDPC codes and demonstrate how this tool can be used to analyze their convergence behavior. We calculate the capacity for each level in the MLC-MSD scheme and use G-EXIT charts to exemplary find codes for some given rates which provide a better decoding threshold compared to previously reported codes. In comparison to the traditional density evolution method, G-EXIT charts offer a simple and fast asymptotic analysis tool for MET-LDPC codes.

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)