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: "absdet pseudo codewords and perm pseudo codewords definitions and properties"
  Abstract: The linear-programming decoding performance of a binary linear code crucially depends on the structure of the fundamental cone of the parity-check matrix that describes the code. Towards a better understanding of fundamental cones and the vectors therein, we introduce the notion of absdet-pseudo-codewords and perm-pseudo-codewords: we give the definitions, we discuss some simple examples, and we list some of their properties.

Connected through hyperedge HE-1 (induced by source paper "bounding the bethe and the degree m bethe permanents"):
  with members:
    - "hierarchical and high girth qc ldpc codes"
    - "the bethe permanent of a nonnegative matrix"
    - "design of multiple edge protographs for qc ldpc codes avoiding short inevitable cycles"
    - "bounds on the minimum distance of punctured quasi cyclic ldpc codes"
    - "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"
    - "the bethe partition function of log supermodular graphical models"
    - "computing the permanent with belief propagation"
    - "approximating the permanent with belief propagation"

Connected through hyperedge HE-2 (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-3 (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"
    - "necessary and sufficient conditions for sparsity pattern recovery"
    - "on the iterative decoding of high rate ldpc codes with applications in compressed sensing"
    - "probabilistic analysis of linear programming decoding"

Connected through hyperedge HE-4 (induced by source paper "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"):
  with members:
    - "searching for voltage graph based ldpc tailbiting codes with large girth"
    - "deriving good ldpc convolutional codes from ldpc block codes"
    - "lowering the error floor of ldpc codes using cyclic liftings"
    - "on distance properties of quasi cyclic protograph based ldpc codes"
    - "adaptive methods for linear programming decoding"
    - "pseudo codeword analysis of tanner graphs from projective and euclidean planes"
    - "a new construction for ldpc codes using permutation polynomials over integer rings"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-5 (induced by source paper "pseudocodewords from bethe permanents"):
  with members:
    - "hierarchical and high girth qc ldpc codes"
    - "design of multiple edge protographs for qc ldpc codes avoiding short inevitable cycles"
    - "bounds on the minimum distance of punctured quasi cyclic ldpc codes"
    - "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"
    - "approximating the permanent with belief propagation"
    - "belief propagation and beyond for particle tracking"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-6 (induced by source paper "lp decoding meets lp decoding a connection between channel coding and compressed sensing"):
  with members:
    - "on the iterative decoding of high rate ldpc codes with applications in compressed sensing"
    - "probabilistic analysis of linear programming decoding"
    - "a decomposition theory for binary linear codes"
    - "combining geometry and combinatorics a unified approach to sparse signal recovery"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "the benefit of thresholding in lp decoding of ldpc codes"
    - "pseudocodewords of tanner graphs"

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)