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 "a unified framework for linear programming based communication receivers"):
  Abstract: It is shown that a large class of communication systems which admit a sum-product algorithm (SPA) based receiver also admit a corresponding linear-programming (LP) based receiver. The two receivers have a relationship defined by the local structure of the underlying graphical model, and are inhibited by the same phenomenon, which we call pseudoconfigurations. This concept is a generalization of the concept of pseudocodewords for linear codes. It is proved that the LP receiver has the `maximum likelihood certificate' property, and that the receiver output is the lowest cost pseudoconfiguration. Equivalence of graph-cover pseudoconfigurations and linear-programming pseudoconfigurations is also proved. A concept of system pseudodistance is defined which generalizes the existing concept of pseudodistance for binary and nonbinary linear codes. It is demonstrated how the LP design technique may be applied to the problem of joint equalization and decoding of coded transmissions over a frequency selective channel, and a simulation-based analysis of the error events of the resulting LP receiver is also provided. For this particular application, the proposed LP receiver is shown to be competitive with other receivers, and to be capable of outperforming turbo equalization in bit and frame error rate performance.

Includes members:
  Member "joint decoding of ldpc codes and finite state channels via linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "linear programming decoding of binary linear codes for symbol pair read channel")
  Member "graph based decoding in the presence of isi":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "design of a unified transport triggered processor for ldpc turbo decoder")
  Member "interior point decoding for linear vector channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an iterative joint linear programming decoding of ldpc codes and finite state channels")
  Member "interior point algorithms for linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mathematical programming decoding of binary linear codes theory and algorithms")
  Member "linear programming decoding of nonbinary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "adaptive linear programming decoding of nonbinary linear codes over prime fields")
  Member "codeword independent performance of nonbinary linear codes under linear programming and sum product decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "correcting a fraction of errors in nonbinary expander codes with linear programming")
  Member "towards low complexity linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adaptive linear programming decoding of nonbinary linear codes over prime fields")
  Member "pseudocodeword weights for non binary ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "linear programming decoding of nonbinary linear codes")

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)