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 "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"):
  Abstract: The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterative decoding of low-density parity-check codes. To this end we introduce the concept of graph-cover decoding. Whereas in maximum-likelihood decoding all codewords in a code are competing to be the best explanation of the received vector, under graph-cover decoding all codewords in all finite covers of a Tanner graph representation of the code are competing to be the best explanation. We are interested in graph-cover decoding because it is a theoretical tool that can be used to show connections between linear programming decoding and message-passing iterative decoding. Namely, on the one hand it turns out that graph-cover decoding is essentially equivalent to linear programming decoding. On the other hand, because iterative, locally operating decoding algorithms like message-passing iterative decoding cannot distinguish the underlying Tanner graph from any covering graph, graph-cover decoding can serve as a model to explain the behavior of message-passing iterative decoding. Understanding the behavior of graph-cover decoding is tantamount to understanding the so-called fundamental polytope. Therefore, we give some characterizations of this polytope and explain its relation to earlier concepts that were introduced to understand the behavior of message-passing iterative decoding for finite-length codes.

Includes members:
  Member "characterizations of pseudo codewords of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a unified framework for linear programming based communication receivers")
  Member "on minimal pseudo codewords of tanner graphs from projective planes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "spectral graph analysis of quasi cyclic codes")
  Member "on the minimal pseudo codewords of codes from finite geometries":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on pseudocodewords and decision regions of linear programming decoding of hdpc codes")
  Member "bounds on the pseudo weight of minimal pseudo codewords of projective geometry codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "pseudo codeword analysis of tanner graphs from projective and euclidean planes")
  Member "the benefit of thresholding in lp decoding of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ldpc codes for compressed sensing")
  Member "pseudo codewords of cycle codes via zeta functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on characterization of elementary trapping sets of variable regular ldpc codes")
  Member "pseudocodewords of tanner graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "free pseudodistance growth rates for spatially coupled ldpc codes over the bec")

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)