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: "a decomposition theory for binary linear codes"
  Abstract: The decomposition theory of matroids initiated by Paul Seymour in the 1980s has had an enormous impact on research in matroid theory. This theory, when applied to matrices over the binary field, yields a powerful decomposition theory for binary linear codes. In this paper, we give an overview of this code decomposition theory, and discuss some of its implications in the context of the recently discovered formulation of maximum-likelihood (ML) decoding of a binary linear code over a binary-input discrete memoryless channel as a linear programming problem. We translate matroid-theoretic results of Grotschel and Truemper from the combinatorial optimization literature to give examples of nontrivial families of codes for which the ML decoding problem can be solved in time polynomial in the length of the code. One such family is that consisting of codes for which the codeword polytope is identical to the Koetter-Vontobel fundamental polytope derived from the entire dual code Cperp. However, we also show that such families of codes are not good in a coding-theoretic sense-either their dimension or their minimum distance must grow sublinearly with code length. As a consequence, we have that decoding by linear programming, when applied to good codes, cannot avoid failing occasionally due to the presence of pseudocode words.

Connected through hyperedge HE-1 (induced by source paper "on the number of circuits in regular matroids with connections to lattices and codes"):
  with members:
    - "on the weight distribution of random binary linear codes"
    - "isolating a vertex via lattices polytopes with totally unimodular faces"
    - "extended formulations for independence polytopes of regular matroids"
    - "a polynomial time algorithm for estimating the partition function of the ferromagnetic ising model on a regular matroid"
    - "matroid secretary for regular and decomposable matroids"

Connected through hyperedge HE-2 (induced by source paper "pseudocodeword free criterion for codes with cycle free tanner graph"):
  with members:
    - "on the pseudocodeword redundancy of binary linear codes"
    - "pseudo codeword analysis of tanner graphs from projective and euclidean planes"
    - "pseudocodewords of tanner graphs"

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"
    - "linear programming decoding of nonbinary linear codes"
    - "a separation algorithm for improved lp decoding of linear block codes"

Connected through hyperedge HE-4 (induced by source paper "on the combinatorics of locally repairable codes via matroid theory"):
  with members:
    - "constructions and properties of linear locally repairable codes"
    - "codes between mbr and msr points with exact repair property"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "new codes and inner bounds for exact repair in distributed storage systems"
    - "codes with locality for two erasures"
    - "an integer programming based bound for locally repairable codes"
    - "a family of optimal locally recoverable codes"
    - "capacity and security of heterogeneous distributed storage systems"

Connected through hyperedge HE-5 (induced by source paper "impact of redundant checks on the lp decoding thresholds of ldpc codes"):
  with members:
    - "lp sdp hierarchy lower bounds for decoding random ldpc codes"
    - "linear programming decoding of spatially coupled codes"
    - "improved linear programming decoding of ldpc codes and bounds on the minimum and fractional distance"
    - "probabilistic analysis of linear programming decoding"
    - "a cutting plane method based on redundant rows for improving fractional distance"
    - "adaptive methods for linear programming decoding"
    - "on the block error probability of lp decoding of ldpc codes"
    - "bounds on the threshold of linear programming decoding"

Connected through hyperedge HE-6 (induced by source paper "optimal locally repairable codes and connections to matroid theory"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "on the combinatorics of locally repairable codes via matroid theory"
    - "a family of optimal locally recoverable codes"
    - "explicit maximally recoverable codes with locality"
    - "update efficiency and local repairability limits for capacity approaching codes"
    - "xoring elephants novel erasure codes for big data"
    - "on the locality of codeword symbols in non linear codes"
    - "an upper bound on the size of locally recoverable codes"

Connected through hyperedge HE-7 (induced by source paper "ldpc codes for compressed sensing"):
  with members:
    - "counting in graph covers a combinatorial characterization of the bethe entropy function"
    - "compressed sensing how sharp is the restricted isometry property"
    - "compressed sensing performance bounds under poisson noise"
    - "construction of a large class of deterministic sensing matrices that satisfy a statistical isometry property"
    - "lp decoding meets lp decoding a connection between channel coding and compressed sensing"
    - "absdet pseudo codewords and perm pseudo codewords definitions and properties"
    - "necessary and sufficient conditions for sparsity pattern recovery"
    - "on the iterative decoding of high rate ldpc codes with applications in compressed sensing"

Connected through hyperedge HE-8 (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"
    - "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"
    - "linear programming decoding of nonbinary linear 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.DM(Discrete Mathematics)