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 asymptotic performance of iterative decoders for product codes"
  Abstract: We consider hard-decision iterative decoders for product codes over the erasure channel, which employ repeated rounds of decoding rows and columns alternatingly. We derive the exact asymptotic probability of decoding failure as a function of the error-correction capabilities of the row and column codes, the number of decoding rounds, and the channel erasure probability. We examine both the case of codes capable of correcting a constant amount of errors, and the case of codes capable of correcting a constant fraction of their length.

Connected through hyperedge HE-1 (induced by source paper "approaching miscorrection free performance of product and generalized product codes"):
  with members:
    - "a 9 52 db ncg fec scheme and 162 b cycle low complexity product decoder architecture"
    - "miscorrection free decoding of staircase codes"
    - "stall pattern avoidance in polynomial product codes"
    - "irregular product codes"
    - "staircase codes fec for 100 gb s otn"
    - "approaching capacity at high rates with iterative hard decision decoding"

Connected through hyperedge HE-2 (induced by source paper "edge coloring and stopping sets analysis in product codes with mds components"):
  with members:
    - "a bound on rate of codes with locality with sequential recovery from multiple erasures"
    - "reed muller codes achieve capacity on erasure channels"
    - "reed muller codes achieve capacity on the binary erasure channel under map decoding"
    - "codes with locality for two erasures"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "irregular product codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-3 (induced by source paper "density evolution for deterministic generalized product codes on the binary erasure channel at high rates"):
  with members:
    - "density evolution for deterministic generalized product codes with higher order modulation"
    - "deterministic and ensemble based spatially coupled product codes"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "irregular product codes"
    - "staircase codes fec for 100 gb s otn"
    - "approaching capacity at high rates with iterative hard decision decoding"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "finite length scaling for iteratively decoded ldpc ensembles"

Connected through hyperedge HE-4 (induced by source paper "spatially coupled split component codes with iterative algebraic decoding"):
  with members:
    - "density evolution for deterministic generalized product codes on the binary erasure channel at high rates"
    - "deterministic and ensemble based spatially coupled product codes"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "staircase codes fec for 100 gb s otn"
    - "approaching capacity at high rates with iterative hard decision decoding"
    - "finite length scaling for iteratively decoded ldpc ensembles"

Connected through hyperedge HE-5 (induced by source paper "density evolution for deterministic generalized product codes on the binary erasure channel"):
  with members:
    - "density evolution for deterministic generalized product codes with higher order modulation"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "irregular product codes"
    - "staircase codes fec for 100 gb s otn"
    - "approaching capacity at high rates with iterative hard decision decoding"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "finite length scaling for iteratively decoded ldpc ensembles"

Connected through hyperedge HE-6 (induced by source paper "approaching capacity at high rates with iterative hard decision decoding"):
  with members:
    - "density evolution for deterministic generalized product codes on the binary erasure channel at high rates"
    - "deterministic and ensemble based spatially coupled product codes"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "threshold saturation in spatially coupled constraint satisfaction problems"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "staircase codes fec for 100 gb s otn"
    - "wave like solutions of general one dimensional spatially coupled systems"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

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)