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: "on the stopping distance and the stopping redundancy of codes"
  Abstract: It is now well known that the performance of a linear code $C$ under iterative decoding on a binary erasure channel (and other channels) is determined by the size of the smallest stopping set in the Tanner graph for $C$. Several recent papers refer to this parameter as the \emph{stopping distance} $s$ of $C$. This is somewhat of a misnomer since the size of the smallest stopping set in the Tanner graph for $C$ depends on the corresponding choice of a parity-check matrix. It is easy to see that $s \le d$, where $d$ is the minimum Hamming distance of $C$, and we show that it is always possible to choose a parity-check matrix for $C$ (with sufficiently many dependent rows) such that $s = d$. We thus introduce a new parameter, termed the \emph{stopping redundancy} of $C$, defined as the minimum number of rows in a parity-check matrix $H$ for $C$ such that the corresponding stopping distance $s(H)$ attains its largest possible value, namely $s(H) = d$. #R##N#We then derive general bounds on the stopping redundancy of linear codes. We also examine several simple ways of constructing codes from other codes, and study the effect of these constructions on the stopping redundancy. Specifically, for the family of binary Reed-Muller codes (of all orders), we prove that their stopping redundancy is at most a constant times their conventional redundancy. We show that the stopping redundancies of the binary and ternary extended Golay codes are at most 35 and 22, respectively. Finally, we provide upper and lower bounds on the stopping redundancy of MDS codes.

Connected through hyperedge HE-1 (induced by source paper "decoder tailored polar code design using the genetic algorithm"):
  with members:
    - "genetic algorithm based polar code construction for the awgn channel"
    - "design of polar codes in 5g new radio"
    - "belief propagation list decoding of polar codes"
    - "mitigating clipping effects on error floors under belief propagation decoding of polar codes"
    - "polar code construction for list decoding"
    - "comparison of polar decoders with existing low density parity check and turbo decoders"
    - "minimum distance based construction of multi kernel polar codes"
    - "improving belief propagation decoding of polar codes using scattered exit charts"

Connected through hyperedge HE-2 (induced by source paper "genetic algorithm based polar code construction for the awgn channel"):
  with members:
    - "design of polar codes in 5g new radio"
    - "belief propagation list decoding of polar codes"
    - "mitigating clipping effects on error floors under belief propagation decoding of polar codes"
    - "polar code construction for list decoding"
    - "combining belief propagation and successive cancellation list decoding of polar codes on a gpu platform"
    - "a comparative study of polar code constructions for the awgn channel"
    - "a rm polar codes"
    - "from polar to reed muller codes a technique to improve the finite length performance"

Connected through hyperedge HE-3 (induced by source paper "decoder in the loop genetic optimization based ldpc code design"):
  with members:
    - "decoder tailored polar code design using the genetic algorithm"
    - "efficient error correcting codes in the short blocklength regime"
    - "scattered exit charts for finite length ldpc code design"
    - "sparse graphs for belief propagation decoding of polar codes"

Connected through hyperedge HE-4 (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"
    - "the trapping redundancy of linear block codes"
    - "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"
    - "improved upper bounds on stopping redundancy"

Connected through hyperedge HE-5 (induced by source paper "stopping redundancy hierarchy beyond the minimum distance"):
  with members:
    - "distance properties of short ldpc codes and their impact on the bp ml and near ml decoding performance"
    - "on the pseudocodeword redundancy of binary linear codes"
    - "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes"
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "generating parity check equations for bounded distance iterative erasure decoding"
    - "improved upper bounds on stopping redundancy"

Connected through hyperedge HE-6 (induced by source paper "failure analysis of the interval passing algorithm for compressed sensing"):
  with members:
    - "asymptotic analysis and spatial coupling of counter braids"
    - "on the minimum stopping distance of array low density parity check codes"
    - "verification based interval passing algorithm for compressed sensing"
    - "information theoretically optimal compressed sensing via spatial coupling and approximate message passing"
    - "a simple message passing algorithm for compressed sensing"
    - "message passing algorithms for compressed sensing"

Connected through hyperedge HE-7 (induced by source paper "new two stage automorphism group decoders for cyclic codes in the erasure channel"):
  with members:
    - "stopping sets of algebraic geometry codes"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "multiple bases belief propagation decoding of high density cyclic codes"
    - "single exclusion number and the stopping redundancy of mds codes"
    - "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes"
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"

Connected through hyperedge HE-8 (induced by source paper "distance properties of short ldpc codes and their impact on the bp ml and near ml decoding performance"):
  with members:
    - "ml and near ml decoding of ldpc codes over the bec bounds and decoding algorithms"
    - "refined upper bounds on stopping redundancy of binary linear codes"
    - "on the pseudocodeword redundancy of binary linear codes"
    - "tree structure expectation propagation for decoding ldpc codes over binary erasure channels"
    - "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic 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)