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 "local optimality guarantees for optimal decoding based on paths"):
  Abstract: This paper presents a unified analysis framework that captures recent advances in the study of local-optimality characterizations for codes on graphs. These local-optimality characterizations are based on combinatorial structures embedded in the Tanner graph of the code. Local-optimality implies both unique maximum-likelihood (ML) optimality and unique linear-programming (LP) decoding optimality. Also, an iterative message-passing decoding algorithm is guaranteed to find the unique locally-optimal codeword, if one exists. #R##N#We demonstrate this proof technique by considering a definition of local-optimality that is based on the simplest combinatorial structures in Tanner graphs, namely, paths of length $h$. We apply the technique of local-optimality to a family of Tanner codes. Inverse polynomial bounds in the code length are proved on the word error probability of LP-decoding for this family of Tanner codes.

Includes members:
  Member "correcting a fraction of errors in nonbinary expander codes with linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on decoding irregular tanner codes with local optimality guarantees")
  Member "on decoding irregular tanner codes with local optimality guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analysis of the min sum algorithm for packing and covering problems via linear programming")
  Member "lp decoding of regular ldpc codes in memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the admm penalized decoder for ldpc codes")
  Member "error bounds for repeat accumulate codes decoded via linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mathematical programming decoding of binary linear codes theory and algorithms")
  Member "probabilistic analysis of linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the admm penalized decoder for ldpc codes")
  Member "on the block error probability of lp decoding of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "impact of redundant checks on the lp decoding thresholds of ldpc codes")
  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)