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: "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.

Connected through hyperedge HE-1 (induced by source paper "adaptive linear programming decoding of nonbinary linear codes over prime fields"):
  with members:
    - "hardware based linear program decoding with the alternating direction method of multipliers"
    - "on the finite length scaling of ternary polar codes"
    - "low complexity lp decoding of nonbinary linear codes"
    - "mathematical programming decoding of binary linear codes theory and algorithms"
    - "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"
    - "a separation algorithm for improved lp decoding of linear block codes"

Connected through hyperedge HE-2 (induced by source paper "linear programming decoding of binary linear codes for symbol pair read channel"):
  with members:
    - "joint decoding of ldpc codes and finite state channels via linear programming"
    - "adaptive methods for linear programming decoding"

Connected through hyperedge HE-3 (induced by source paper "introduction to mathematical programming based error correction decoding"):
  with members:
    - "efficient maximum likelihood decoding of linear block codes on binary memoryless channels"
    - "towards combinatorial lp turbo decoding"
    - "mathematical programming decoding of binary linear codes theory and algorithms"
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "polytope of correct linear programming decoding and low weight pseudo codewords"
    - "efficient implementation of linear programming decoding"
    - "a decomposition theory for binary linear codes"
    - "a separation algorithm for improved lp decoding of linear block codes"

Connected through hyperedge HE-4 (induced by source paper "lp decodable multipermutation codes"):
  with members:
    - "the admm penalized decoder for ldpc codes"
    - "admm lp decoding of non binary ldpc codes in mathbb f _ 2 m"
    - "multipermutation codes in the ulam metric for nonvolatile memories"
    - "systematic error correcting codes for rank modulation"
    - "error correction in flash memories via codes in the ulam metric"
    - "decomposition methods for large scale lp decoding"
    - "coded modulation for power line communications"
    - "snake in the box codes for rank modulation"

Connected through hyperedge HE-5 (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"
    - "lp decoding of regular ldpc codes in memoryless channels"
    - "efficient implementation of linear programming decoding"

Connected through hyperedge HE-6 (induced by source paper "low complexity lp decoding of nonbinary linear codes"):
  with members:
    - "decomposition methods for large scale lp decoding"
    - "trellis based check node processing for low complexity nonbinary lp decoding"
    - "efficient implementation of linear programming decoding"
    - "towards low complexity linear programming decoding"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-7 (induced by source paper "mathematical programming decoding of binary linear codes theory and algorithms"):
  with members:
    - "polytope of correct linear programming decoding and low weight pseudo codewords"
    - "efficient linear programming decoding of hdpc codes"
    - "error bounds for repeat accumulate codes decoded via linear programming"
    - "efficient implementation of linear programming decoding"
    - "a decomposition theory for binary linear codes"
    - "max product for maximum weight matching convergence correctness and lp duality"
    - "interior point algorithms for linear programming decoding"
    - "a cutting plane method based on redundant rows for improving fractional distance"

Connected through hyperedge HE-8 (induced by source paper "a unified framework for linear programming based communication receivers"):
  with members:
    - "joint decoding of ldpc codes and finite state channels via linear programming"
    - "graph based decoding in the presence of isi"
    - "interior point decoding for linear vector channels"
    - "interior point algorithms for linear programming decoding"
    - "codeword independent performance of nonbinary linear codes under linear programming and sum product decoding"
    - "towards low complexity linear programming decoding"
    - "pseudocodeword weights for non binary ldpc codes"
    - "characterizations of pseudo codewords 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)