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 "an iterative joint linear programming decoding of ldpc codes and finite state channels"):
  Abstract: In this paper, we introduce an efficient method for the joint linear-programming (LP) decoding of low-density parity-check (LDPC) codes and finite-state channels (FSCs). In particular, we extend the approach of iterative approximate LP decoding proposed by Vontobel and Koetter and further analyzed by Burshtein. By taking advantage of the dual-domain structure of the joint decoding LP, we obtain a convergent iterative algorithm for joint decoding. Our intent was to find an algorithm very similar to BCJR-based turbo equalization (TE) and it seems that we have succeeded in this respect. The result is an iterative solver for the joint decoding LP whose complexity is similar to TE but whose performance is similar to joint LP decoding. The main advantage of this decoder is that it appears to provide the predictability of joint LP decoding with the computational complexity of TE.

Includes members:
  Member "a unified framework for linear programming based communication receivers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint decoding of ldpc codes and finite state channels via linear programming")
  Member "joint decoding of ldpc codes and finite state channels via linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "linear programming decoding of binary linear codes for symbol pair read channel")
  Member "low complexity linear programming decoding of nonbinary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint decoding of ldpc codes and finite state channels via linear programming")
  Member "interior point decoding for linear vector channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a unified framework for linear programming based communication receivers")
  Member "interior point algorithms for linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "adaptive linear programming decoding of nonbinary linear codes over prime fields")
  Member "adaptive methods for linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")
  Member "towards low complexity linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "adaptive linear programming decoding of nonbinary linear codes over prime fields")

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)