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 "pseudocodewords from bethe permanents"):
  Abstract: It was recently conjectured that a vector with components equal to the Bethe permanent of certain submatrices of a parity-check matrix is a pseudocodeword. In this paper we prove a stronger version of this conjecture for some important cases and investigate the families of pseudocodewords obtained by using the Bethe permanent. We also highlight some interesting properties of the permanent of block matrices and their effects on pseudocodewords.

Includes members:
  Member "hierarchical and high girth qc ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi dimensional spatially coupled code design enhancing the cycle properties")
  Member "design of multiple edge protographs for qc ldpc codes avoiding short inevitable cycles":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a new multi edge metric constrained peg algorithm for designing binary ldpc code with improved cycle structure")
  Member "bounds on the minimum distance of punctured quasi cyclic ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "characterization and efficient search of non elementary trapping sets of ldpc codes with applications to stopping sets")
  Member "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi dimensional spatially coupled code design enhancing the cycle properties")
  Member "absdet pseudo codewords and perm pseudo codewords definitions and properties":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bounding the bethe and the degree m bethe permanents")
  Member "approximating the permanent with belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "approximating the permanent by sampling from adaptive partitions")
  Member "belief propagation and beyond for particle tracking":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "approximating the permanent by sampling from adaptive partitions")
  Member "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)