human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "optimization of graph based codes for belief propagation decoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a joint optimization technique for multi edge type ldpc codes")
  Member "the generalized area theorem and some of its consequences":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reed muller codes theory and algorithms")
  Member "capacity achieving ensembles for the binary erasure channel with bounded complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "log logarithmic time pruned polar coding")
  Member "density evolution thresholds and the stability condition for non binary ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ldpc codes over the q ary multi bit channel")

Question: Please tell me which class the source paper 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)