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: "pseudocodewords of tanner graphs"
  Abstract: This papers presents a detailed analysis of pseudocodewords of Tanner graphs. Pseudocodewords arising on the iterative decoder's computation tree are distinguished from pseudocodewords arising on finite degree lifts. Lower bounds on the minimum pseudocodeword weight are presented for the BEC, BSC, and AWGN channel. Some structural properties of pseudocodewords are examined, and pseudocodewords and graph properties that are potentially problematic with min-sum iterative decoding are identified. An upper bound on the minimum degree lift needed to realize a particular irreducible lift-realizable pseudocodeword is given in terms of its maximal component, and it is shown that all irreducible lift-realizable pseudocodewords have components upper bounded by a finite value $t$ that is dependent on the graph structure. Examples and different Tanner graph representations of individual codes are examined and the resulting pseudocodeword distributions and iterative decoding performances are analyzed. The results obtained provide some insights in relating the structure of the Tanner graph to the pseudocodeword distribution and suggest ways of designing Tanner graphs with good minimum pseudocodeword weight.

Connected through hyperedge HE-1 (induced by source paper "free pseudodistance growth rates for spatially coupled ldpc codes over the bec"):
  with members:
    - "spatially coupled ldpc codes constructed from protographs"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "exact free distance and trapping set growth rates for ldpc convolutional codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

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"
    - "a decomposition theory for binary linear codes"
    - "pseudo codeword analysis of tanner graphs from projective and euclidean planes"

Connected through hyperedge HE-3 (induced by source paper "counting in graph covers a combinatorial characterization of the bethe entropy function"):
  with members:
    - "the bethe permanent of a nonnegative matrix"
    - "beyond log supermodularity lower bounds and the bethe partition function"
    - "new generalizations of the bethe approximation via asymptotic expansion"
    - "central approximation in statistical physics and information theory"
    - "the bethe partition function of log supermodular graphical models"
    - "pseudocodewords from bethe permanents"
    - "connection between annealed free energy and belief propagation on random factor graph ensembles"
    - "normal factor graphs and holographic transformations"

Connected through hyperedge HE-4 (induced by source paper "design of multiple edge protographs for qc ldpc codes avoiding short inevitable cycles"):
  with members:
    - "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"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"
    - "shortened array codes of large girth"

Connected through hyperedge HE-5 (induced by source paper "reconstruction guarantee analysis of binary measurement matrices based on girth"):
  with members:
    - "ldpc codes for compressed sensing"
    - "deterministic construction of binary bipolar and ternary compressed sensing matrices"

Connected through hyperedge HE-6 (induced by source paper "finite alphabet iterative decoders part ii towards guaranteed error correction of ldpc codes via iterative decoder diversity"):
  with members:
    - "multilevel decoders surpassing belief propagation on the binary symmetric channel"
    - "ldpc codes which can correct three errors under iterative decoding"

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 "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"
    - "absdet pseudo codewords and perm pseudo codewords definitions and properties"
    - "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"

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)