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 "adaptive linear programming decoding of nonbinary linear codes over prime fields"):
  Abstract: In this work, we consider adaptive linear programming (ALP) decoding of linear codes over the finite field $\mathbb{F}_p$ of size $p$ where $p$ is a prime. In particular, we provide a general construction of valid inequalities for the codeword polytope of the so-called constant-weight embedding of a single parity-check (SPC) code over any prime field. The construction is based on classes of building blocks that are assembled to form the left-hand side of an inequality according to several rules. In the case of almost doubly-symmetric valid classes we prove that the resulting inequalities are all facet-defining, while we conjecture this to be true if and only if the class is valid and symmetric. For $p=3$, there is only a single valid symmetric class and we prove that the resulting inequalities together with the so-called simplex constraints give a completely and irredundant description of the codeword polytope of the embedded SPC code. For $p>5$, we show that there are additional facets beyond those from the proposed construction. We use these inequalities to develop an efficient (relaxed) ALP decoder for general (non-SPC) linear codes over prime fields. The key ingredient is an efficient separation algorithm based on the principle of dynamic programming. Furthermore, we construct a decoder for linear codes over arbitrary fields $\mathbb{F}_q$ with $q=p^m$ and $m>1$ by a factor graph representation that reduces to several instances of the case $m=1$, which results, in general, in a relaxation of the original decoding polytope. Finally, we present an efficient cut-generating algorithm to search for redundant parity-checks to further improve the performance towards maximum-likelihood decoding for short-to-medium block lengths. Numerical experiments confirm that our new decoder is very efficient compared to a static LP decoder for various field sizes, check-node degrees, and block lengths.

Includes members:
  Member "hardware based linear program decoding with the alternating direction method of multipliers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")
  Member "on the finite length scaling of ternary polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "near optimal finite length scaling for polar codes over large alphabets")
  Member "low complexity lp decoding of nonbinary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "admm lp decoding of non binary ldpc codes in mathbb f _ 2 m")
  Member "mathematical programming decoding of binary linear codes theory and algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")
  Member "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "admm based decoder for binary linear codes aided by deep learning")
  Member "decomposition methods for large scale lp decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "admm based decoder for binary linear codes aided by deep learning")
  Member "efficient implementation of linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the admm penalized decoder for ldpc codes")
  Member "linear programming decoding of nonbinary linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "linear programming decoding of binary linear codes for symbol pair read channel")

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)