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: "density evolution thresholds and the stability condition for non binary ldpc codes"
  Abstract: We derive the density evolution equations for non-binary low-density parity-check (LDPC) ensembles when transmission takes place over the binary erasure channel. We introduce ensembles defined with respect to the general linear group over the binary field. For these ensembles the density evolution equations can be written compactly. The density evolution for the general linear group helps us in understanding the density evolution for codes defined with respect to finite fields. We compute thresholds for different alphabet sizes for various LDPC ensembles. Surprisingly, the threshold is not a monotonic function of the alphabet size. We state the stability condition for non-binary LDPC ensembles over any binary memoryless symmetric channel. We also give upper bounds on the MAP thresholds for various non-binary ensembles based on EXIT curves and the area theorem.

Connected through hyperedge HE-1 (induced by source paper "multi edge type ldpc code design with g exit charts for continuous variable quantum key distribution"):
  with members:
    - "optimization of graph based codes for belief propagation decoding"
    - "the generalized area theorem and some of its consequences"
    - "capacity achieving ensembles for the binary erasure channel with bounded complexity"

Connected through hyperedge HE-2 (induced by source paper "ldpc codes over the q ary multi bit channel"):
  with members:
    - "erasure correction of scalar codes in the presence of stragglers"
    - "iterative decoding of ldpc codes over the q ary partial erasure channel"
    - "design of non binary quasi cyclic ldpc codes by ace optimization"
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"

Connected through hyperedge HE-3 (induced by source paper "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"):
  with members:
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "threshold analysis of non binary spatially coupled ldpc codes with windowed decoding"
    - "nonbinary spatially coupled ldpc codes on the binary erasure channel"
    - "a proof of threshold saturation for spatially coupled ldpc codes on bms channels"
    - "thresholds of spatially coupled systems via lyapunov s method"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-4 (induced by source paper "iterative decoding of ldpc codes over the q ary partial erasure channel"):
  with members:
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"

Connected through hyperedge HE-5 (induced by source paper "design of spatially coupled ldpc codes over gf q for windowed decoding"):
  with members:
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "spatially coupled ldpc codes constructed from protographs"
    - "performance comparison of ldpc block and spatially coupled codes over gf q"
    - "nonbinary spatially coupled ldpc codes on the binary erasure channel"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "threshold saturation on channels with memory via spatial coupling"
    - "spatially coupled mackay neal codes and hsu anastasopoulos codes"

Connected through hyperedge HE-6 (induced by source paper "threshold analysis of non binary spatially coupled ldpc codes with windowed decoding"):
  with members:
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "nonbinary spatially coupled ldpc codes on the binary erasure channel"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "design and performance of rate compatible non binary ldpc convolutional codes"
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"

Connected through hyperedge HE-7 (induced by source paper "nonbinary spatially coupled ldpc codes on the binary erasure channel"):
  with members:
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "design and performance of rate compatible non binary ldpc convolutional codes"
    - "threshold saturation on bms channels via spatial coupling"
    - "maxwell construction the hidden bridge between iterative and maximum a posteriori decoding"

Connected through hyperedge HE-8 (induced by source paper "quantum error correction beyond the bounded distance decoding limit"):
  with members:
    - "quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength"

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)