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: "pseudo codeword landscape"
  Abstract: We discuss the performance of Low-Density-Parity-Check (LDPC) codes decoded by means of Linear Programming (LP) at moderate and large Signal-to-Noise-Ratios (SNR). Utilizing a combination of the previously introduced pseudo-codeword-search method and a new "dendro" trick, which allows us to reduce the complexity of the LP decoding, we analyze the dependence of the Frame-Error-Rate (FER) on the SNR. Under Maximum-A-Posteriori (MAP) decoding the dendro-code, having only checks with connectivity degree three, performs identically to its original code with high-connectivity checks. For a number of popular LDPC codes performing over the Additive-White-Gaussian-Noise (AWGN) channel we found that either an error-floor sets at a relatively low SNR, or otherwise a transient asymptote, characterized by a faster decay of FER with the SNR increase, precedes the error-floor asymptote. We explain these regimes in terms of the pseudo-codeword spectra of the codes.

Connected through hyperedge HE-1 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis"):
  with members:
    - "minimum polytope based linear programming decoder for ldpc codes via admm approach"
    - "the admm penalized decoder for ldpc codes"
    - "hardware based linear program decoding with the alternating direction method of multipliers"
    - "hardware based projection onto the parity polytope and probability simplex"
    - "mathematical programming decoding of binary linear codes theory and algorithms"
    - "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"
    - "improved linear programming decoding of ldpc codes and bounds on the minimum and fractional distance"
    - "efficient linear programming decoding of hdpc codes"

Connected through hyperedge HE-2 (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-3 (induced by source paper "adaptive cut generation algorithm for improved linear programming decoding of binary linear codes"):
  with members:
    - "mathematical programming decoding of binary linear codes theory and algorithms"
    - "efficient implementation of linear programming decoding"
    - "a cutting plane method based on redundant rows for improving fractional distance"
    - "a separation algorithm for improved lp decoding of linear block codes"
    - "adaptive methods for linear programming decoding"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "efficient linear programming decoding of hdpc codes"):
  with members:
    - "efficient implementation of linear programming decoding"
    - "a separation algorithm for improved lp decoding of linear block codes"
    - "towards low complexity linear programming decoding"
    - "bounds on the threshold of linear programming decoding"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "iterative soft input soft output decoding of reed solomon codes by adapting the parity check matrix"

Connected through hyperedge HE-5 (induced by source paper "efficient implementation of linear programming decoding"):
  with members:
    - "interior point algorithms for linear programming decoding"
    - "adaptive methods for linear programming decoding"
    - "towards low complexity linear programming decoding"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"
    - "map estimation via agreement on hyper trees message passing and linear programming"

Connected through hyperedge HE-6 (induced by source paper "a separation algorithm for improved lp decoding of linear block codes"):
  with members:
    - "efficient implementation of linear programming decoding"
    - "probabilistic analysis of linear programming decoding"
    - "a cutting plane method based on redundant rows for improving fractional distance"
    - "guessing facets polytope structure and improved lp decoder"
    - "adaptive methods for linear programming decoding"
    - "reducing the error floor"
    - "loop calculus helps to improve belief propagation and linear programming decodings of low density parity check codes"
    - "towards low complexity linear programming decoding"

Connected through hyperedge HE-7 (induced by source paper "a cutting plane method based on redundant rows for improving fractional distance"):
  with members:
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "guessing facets polytope structure and improved lp decoder"
    - "adaptive methods for linear programming decoding"
    - "minimum pseudo weight and minimum pseudo codewords of ldpc codes"
    - "characterizations of pseudo codewords of ldpc codes"
    - "on the stopping distance and the stopping redundancy of codes"
    - "improved upper bounds on stopping redundancy"

Connected through hyperedge HE-8 (induced by source paper "linear programming decoding of nonbinary linear codes"):
  with members:
    - "lower bounds on the minimum pseudodistance for linear codes with q ary psk modulation over awgn"
    - "codeword independent performance of nonbinary linear codes under linear programming and sum product decoding"
    - "pseudocodeword weights for non binary ldpc codes"
    - "design and analysis of nonbinary ldpc codes for arbitrary discrete memoryless channels"
    - "characterizations of pseudo codewords of ldpc codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding 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)