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: "the trapping redundancy of linear block codes"
  Abstract: We generalize the notion of the stopping redundancy in order to study the smallest size of a trapping set in Tanner graphs of linear block codes. In this context, we introduce the notion of the trapping redundancy of a code, which quantifies the relationship between the number of redundant rows in any parity-check matrix of a given code and the size of its smallest trapping set. Trapping sets with certain parameter sizes are known to cause error-floors in the performance curves of iterative belief propagation (BP) decoders, and it is therefore important to identify decoding matrices that avoid such sets. Bounds on the trapping redundancy are obtained using probabilistic and constructive methods, and the analysis covers both general and elementary trapping sets. Numerical values for these bounds are computed for the [2640, 1320] Margulis code and the class of projective geometry codes, and compared with some new code-specific trapping set size estimates.

Connected through hyperedge HE-1 (induced by source paper "performance bounds and estimates for quantized ldpc decoders"):
  with members:
    - "thresholds of absorbing sets in low density parity check codes"
    - "on characterization of elementary trapping sets of variable regular ldpc codes"
    - "controlling the error floor in ldpc decoding"
    - "error floor approximation for ldpc codes in the awgn channel"
    - "quantized iterative message passing decoders with low error floor for ldpc codes"

Connected through hyperedge HE-2 (induced by source paper "bounds on separating redundancy of linear codes and rates of x codes"):
  with members:
    - "probabilistic bounds on the trapping redundancy of linear codes"
    - "on generic erasure correcting sets and related problems"
    - "a combinatorial approach to x tolerant compaction circuits"
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "results on parity check matrices with optimal stopping and or dead end set enumerators"
    - "on the stopping distance and the stopping redundancy of codes"
    - "improved upper bounds on stopping redundancy"

Connected through hyperedge HE-3 (induced by source paper "characterization and efficient exhaustive search algorithm for elementary trapping sets of irregular ldpc codes"):
  with members:
    - "on characterization of elementary trapping sets of variable regular ldpc codes"
    - "design of finite length irregular protograph codes with low error floors over the binary input awgn channel using cyclic liftings"

Connected through hyperedge HE-4 (induced by source paper "probabilistic bounds on the trapping redundancy of linear codes"):
  with members:
    - "error floor approximation for ldpc codes in the awgn channel"
    - "asymptotic improvement of the gilbert varshamov bound for linear codes"

Connected through hyperedge HE-5 (induced by source paper "new characterization and efficient exhaustive search algorithm for elementary trapping sets of variable regular ldpc codes"):
  with members:
    - "on characterization of elementary trapping sets of variable regular ldpc codes"
    - "practical graph isomorphism ii"
    - "design of finite length irregular protograph codes with low error floors over the binary input awgn channel using cyclic liftings"

Connected through hyperedge HE-6 (induced by source paper "ldpc code density evolution in the error floor region"):
  with members:
    - "controlling the error floor in ldpc decoding"
    - "error floor approximation for ldpc codes in the awgn channel"
    - "on the dynamics of the error floor behavior in regular ldpc codes"
    - "on the block error probability of lp decoding of ldpc codes"
    - "a general method for finding low error rates of ldpc codes"

Connected through hyperedge HE-7 (induced by source paper "on characterization of elementary trapping sets of variable regular ldpc codes"):
  with members:
    - "lowering the error floor of ldpc codes using cyclic liftings"
    - "on the dynamics of the error floor behavior in regular ldpc codes"
    - "trapping set enumerators for repeat multiple accumulate code ensembles"
    - "a general method for finding low error rates of ldpc codes"
    - "pseudo codewords of cycle codes via zeta functions"

Connected through hyperedge HE-8 (induced by source paper "error floor approximation for ldpc codes in the awgn channel"):
  with members:
    - "ldpc code density evolution in the error floor region"
    - "the sum product algorithm for degree 2 check nodes and trapping sets"
    - "numerical issues affecting ldpc error floors"
    - "controlling the error floor in ldpc decoding"
    - "quantized iterative message passing decoders with low error floor for ldpc codes"
    - "on the dynamics of the error floor behavior in regular ldpc codes"
    - "informed dynamic scheduling for belief propagation decoding of ldpc codes"
    - "a general method for finding low error rates 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)