human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "spatially coupled split component codes with iterative algebraic decoding"):
  Abstract: We analyze a class of high performance, low decoding-data-flow error-correcting codes suitable for high bit-rate optical-fiber communication systems. A spatially-coupled split-component ensemble is defined, generalizing from the most important codes of this class, staircase codes and braided block codes, and preserving a deterministic partitioning of component-code bits over code blocks. Our analysis focuses on low-complexity iterative algebraic decoding, which, for the binary erasure channel, is equivalent to a generalization of the peeling decoder. Using the differential equation method, we derive a vector recursion that tracks the expected residual graph evolution throughout the decoding process. The threshold of the recursion is found using potential function analysis. We generalize the analysis to mixture ensembles consisting of more than one type of component code, which provide increased flexibility of ensemble parameters and can improve performance. The analysis extends to the binary symmetric channel by assuming mis-correction-free component-code decoding. Simple upper-bounds on the number of errors correctable by the ensemble are derived. Finally, we analyze the threshold of spatially-coupled split-component ensembles under beyond bounded-distance component decoding.

Includes members:
  Member "density evolution for deterministic generalized product codes on the binary erasure channel at high rates":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "binary message passing decoding of product like codes")
  Member "deterministic and ensemble based spatially coupled product codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "asymptotic analysis and spatial coupling of counter braids")
  Member "a scaling law to predict the finite length performance of spatially coupled ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")
  Member "a simple proof of maxwell saturation for coupled scalar recursions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "staircase codes fec for 100 gb s otn":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")
  Member "approaching capacity at high rates with iterative hard decision decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "on the asymptotic performance of iterative decoders for product codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "approaching miscorrection free performance of product and generalized product codes")
  Member "finite length scaling for iteratively decoded ldpc ensembles":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "finite length scaling of spatially coupled ldpc codes under window decoding over the bec")

Question: Please tell me which class the source paper 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)