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: "non binary ldpc codes over the binary erasure channel density evolution analysis"
  Abstract: In this paper we present a thorough analysis of non binary LDPC codes over the binary erasure channel. First, the decoding of non binary LDPC codes is investigated. The proposed algorithm performs on-the-fly decoding, i.e. it starts decoding as soon as the first symbols are received, which generalizes the erasure decoding of binary LDPC codes. Next, we evaluate the asymptotical performance of ensembles of non binary LDPC codes, by using the density evolution method. Density evolution equations are derived by taking into consideration both the irregularity of the bipartite graph and the probability distribution of the graph edge labels. Finally, infinite-length performance of some ensembles of non binary LDPC codes for different edge label distributions are shown.

Connected through hyperedge HE-1 (induced by source paper "design and performance of rate compatible non binary ldpc convolutional codes"):
  with members:
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "threshold saturation on bms channels via spatial coupling"
    - "density evolution thresholds and the stability condition for non binary ldpc codes"

Connected through hyperedge HE-2 (induced by source paper "extended non binary low density parity check codes over erasure channels"):
  with members:
    - "optimized puncturing distributions for irregular non binary ldpc codes"
    - "binary linear time erasure decoding for non binary ldpc codes"

Connected through hyperedge HE-3 (induced by source paper "scheduled peg construction of ldpc codes for upper layer fec"):
  with members:
    - "binary linear time erasure decoding for non binary ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "optimized puncturing distributions for irregular non binary ldpc codes"):
  with members:
    - "min max decoding for non binary ldpc codes"
    - "density evolution thresholds and the stability condition for non binary ldpc codes"

Connected through hyperedge HE-5 (induced by source paper "binary linear time erasure decoding for non binary ldpc codes"):
  with members:
    - "density evolution thresholds and the stability condition for non binary 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)