human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "lp decoding of regular ldpc codes in memoryless channels"
  Abstract: We study error bounds for linear programming decoding of regular LDPC codes. For memoryless binary-input output-symmetric channels, we prove bounds on the word error probability that are inverse doubly-exponential in the girth of the factor graph. For memoryless binary-input AWGN channel, we prove lower bounds on the threshold for regular LDPC codes whose factor graphs have logarithmic girth under LP-decoding. Specifically, we prove a lower bound of $\sigma=0.735$ (upper bound of $\frac{Eb}{N_0}=2.67$dB) on the threshold of $(3,6)$-regular LDPC codes whose factor graphs have logarithmic girth. #R##N#Our proof is an extension of a recent paper of Arora, Daskalakis, and Steurer [STOC 2009] who presented a novel probabilistic analysis of LP decoding over a binary symmetric channel. Their analysis is based on the primal LP representation and has an explicit connection to message passing algorithms. We extend this analysis to any MBIOS channel.

Connected through hyperedge HE-1 (induced by source paper "the admm penalized decoder for ldpc codes"):
  with members:
    - "hierarchical and high girth qc ldpc codes"
    - "linear programming decoding of spatially coupled codes"
    - "an improved three weight message passing algorithm"
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"
    - "mathematical programming decoding of binary linear codes theory and algorithms"
    - "error floor approximation for ldpc codes in the awgn channel"
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "decomposition methods for large scale lp decoding"

Connected through hyperedge HE-2 (induced by source paper "admm lp decoding of non binary ldpc codes in mathbb f _ 2 m"):
  with members:
    - "the admm penalized decoder for ldpc codes"
    - "low complexity lp decoding of nonbinary linear codes"
    - "linear programming decoding of spatially coupled codes"
    - "online alternating direction method"
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "decomposition methods for large scale lp decoding"
    - "efficient implementation of linear programming decoding"
    - "probabilistic analysis of linear programming decoding"

Connected through hyperedge HE-3 (induced by source paper "the bethe permanent of a nonnegative matrix"):
  with members:
    - "extropy complementary dual of entropy"
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"
    - "map estimation linear programming and belief propagation with convex free energies"
    - "a new class of upper bounds on the log partition function"
    - "the bethe partition function of log supermodular graphical models"
    - "pseudocodewords from bethe permanents"
    - "belief propagation for weighted b matchings on arbitrary graphs and its relation to linear programs with integer solutions"
    - "partition functions of normal factor graphs"

Connected through hyperedge HE-4 (induced by source paper "lp decoding of expander codes a simpler proof"):
  with members:
    - "efficient implementation of linear programming decoding"
    - "interior point algorithms for linear programming decoding"
    - "on the block error probability of lp decoding of ldpc codes"
    - "towards low complexity linear programming decoding"
    - "bounds on the threshold of linear programming decoding"
    - "some applications of coding theory in computational complexity"

Connected through hyperedge HE-5 (induced by source paper "local optimality guarantees for optimal decoding based on paths"):
  with members:
    - "correcting a fraction of errors in nonbinary expander codes with linear programming"
    - "on decoding irregular tanner codes with local optimality guarantees"
    - "error bounds for repeat accumulate codes decoded via linear programming"
    - "probabilistic analysis of linear programming decoding"
    - "on the block error probability of lp decoding of ldpc codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-6 (induced by source paper "on decoding irregular tanner codes with local optimality guarantees"):
  with members:
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"
    - "convergence of weighted min sum decoding via dynamic programming on trees"
    - "correcting a fraction of errors in nonbinary expander codes with linear programming"
    - "error bounds for repeat accumulate codes decoded via linear programming"
    - "probabilistic analysis of linear programming decoding"
    - "on the block error probability of lp decoding of ldpc codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-7 (induced by source paper "convergence of weighted min sum decoding via dynamic programming on trees"):
  with members:
    - "on the optimality of tree reweighted max product message passing"
    - "probabilistic analysis of linear programming decoding"
    - "sufficient conditions for convergence of the sum product algorithm"
    - "on the block error probability of lp decoding of ldpc codes"
    - "bounds on the threshold of linear programming decoding"

Connected through hyperedge HE-8 (induced by source paper "local optimality certificates for lp decoding of tanner codes"):
  with members:
    - "convergence of weighted min sum decoding via dynamic programming on trees"
    - "error bounds for repeat accumulate codes decoded via linear programming"
    - "on the block error probability of lp decoding of ldpc codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Question: Please tell me which class the center node 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)