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 "linear programming decoding of nonbinary linear codes"):
  Abstract: A framework for linear-programming (LP) decoding of nonbinary linear codes over rings is developed. This framework facilitates linear-programming based reception for coded modulation systems which use direct modulation mapping of coded symbols. It is proved that the resulting LP decoder has the 'maximum-likelihood certificate' property. It is also shown that the decoder output is the lowest cost pseudocodeword. Equivalence between pseudocodewords of the linear program and pseudocodewords of graph covers is proved. It is also proved that if the modulator-channel combination satisfies a particular symmetry condition, the codeword error rate performance is independent of the transmitted codeword. Two alternative polytopes for use with linear-programming decoding are studied, and it is shown that for many classes of codes these polytopes yield a complexity advantage for decoding. These polytope representations lead to polynomial-time decoders for a wide variety of classical nonbinary linear codes. LP decoding performance is illustrated for the [11,6] ternary Golay code with ternary PSK modulation over AWGN, and in this case it is shown that the performance of the LP decoder is comparable to codeword-error-rate-optimum hard-decision based decoding. LP decoding is also simulated for medium-length ternary and quaternary LDPC codes with corresponding PSK modulations over AWGN.

Includes members:
  Member "lower bounds on the minimum pseudodistance for linear codes with q ary psk modulation over awgn":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on pseudocodewords and improved union bound of linear programming decoding of hdpc codes")
  Member "codeword independent performance of nonbinary linear codes under linear programming and sum product decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a unified framework for linear programming based communication receivers")
  Member "pseudo codeword landscape":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")
  Member "pseudocodeword weights for non binary ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a unified framework for linear programming based communication receivers")
  Member "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "characterizations of pseudo codewords of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a unified framework for linear programming based communication receivers")
  Member "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)