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 "spectral graph analysis of quasi cyclic codes"):
  Abstract: In this paper we analyze the bound on the additive white Gaussian noise channel (AWGNC) pseudo-weight of a (c,d)-regular linear block code based on the two largest eigenvalues of H^T H. In particular, we analyze (c,d)-regular quasi-cyclic (QC) codes of length rL described by J x L block parity-check matrices with circulant block entries of size r x r. We proceed by showing how the problem of computing the eigenvalues of the rL x rL matrix H^T H can be reduced to the problem of computing eigenvalues for r matrices of size L x L. We also give a necessary condition for the bound to be attained for a circulant matrix H and show a few classes of cyclic codes satisfying this criterion.

Includes members:
  Member "pseudo codeword analysis of tanner graphs from projective and euclidean planes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "pseudocodeword free criterion for codes with cycle free tanner graph")
  Member "on minimal pseudo codewords of tanner graphs from projective planes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "pseudo codeword analysis of tanner graphs from projective and euclidean planes")
  Member "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")

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)