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: "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes"
  Abstract: We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the tradeoff between performance and complexity of iterative decoding for the binary erasure channel. We derive lower and upper bounds for the stopping redundancy hierarchy via Lovasz's local lemma (LLL) and Bonferroni-type inequalities, and specialize them for codes with cyclic parity-check matrices. Based on the observed properties of parity-check matrices with good stopping redundancy characteristics, we develop a novel decoding technique, termed automorphism group decoding, that combines iterative message passing and permutation decoding. We also present bounds on the smallest number of permutations of an automorphism group decoder needed to correct any set of erasures up to a prescribed size. Simulation results demonstrate that for a large number of algebraic codes, the performance of the new decoding method is close to that of maximum-likelihood (ML) decoding.

Connected through hyperedge HE-1 (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"
    - "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"
    - "on the stopping distance and the stopping redundancy of codes"
    - "improved upper bounds on stopping redundancy"

Connected through hyperedge HE-2 (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"
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "on the stopping distance and the stopping redundancy of codes"

Connected through hyperedge HE-3 (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"
    - "on the stopping distance and the stopping redundancy of codes"
    - "graph cover decoding and finite length analysis of message passing iterative decoding of ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "enhanced recursive reed muller erasure decoding"):
  with members:
    - "soft decision decoding of reed muller codes recursive lists"
    - "decoding high rate reed muller codes from random errors in near linear time"
    - "reed muller codes for random erasures and errors"

Connected through hyperedge HE-5 (induced by source paper "refined upper bounds on stopping redundancy of binary linear codes"):
  with members:
    - "on the pseudocodeword redundancy of binary linear codes"
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "on the stopping distance and the stopping redundancy of codes"
    - "improved upper bounds on stopping redundancy"

Connected through hyperedge HE-6 (induced by source paper "stopping sets of algebraic geometry codes"):
  with members:
    - "on generic erasure correcting sets and related problems"
    - "stopping set distributions of some linear codes"
    - "single exclusion number and the stopping redundancy of mds codes"
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "complete enumeration of stopping sets of full rank parity check matrices of hamming codes"
    - "on the stopping distance and the stopping redundancy of codes"
    - "hard problems of algebraic geometry codes"
    - "improved upper bounds on stopping redundancy"

Connected through hyperedge HE-7 (induced by source paper "on generic erasure correcting sets and related problems"):
  with members:
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "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 "multiple bases belief propagation decoding of high density cyclic codes"):
  with members:
    - "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    - "on the hardness of approximating stopping and trapping sets in ldpc codes"
    - "complete enumeration of stopping sets of full rank parity check matrices of hamming codes"
    - "on the stopping distance and the stopping redundancy of codes"
    - "improved upper bounds on stopping redundancy"
    - "pseudocodewords of tanner graphs"
    - "iterative soft input soft output decoding of reed solomon codes by adapting the parity check matrix"

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)