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: "spatially coupled turbo codes principles and finite length performance"
  Abstract: In this paper, we give an overview of spatially coupled turbo codes (SC-TCs), the spatial coupling of parallel and serially concatenated convolutional codes, recently introduced by the authors. For presentation purposes, we focus on spatially coupled serially concatenated codes (SC-SCCs). We review the main principles of SC-TCs and discuss their exact density evolution (DE) analysis on the binary erasure channel. We also consider the construction of a family of rate-compatible SC-SCCs with simple 4-state component encoders. For all considered code rates, threshold saturation of the belief propagation (BP) to the maximum a posteriori threshold of the uncoupled ensemble is demonstrated, and it is shown that the BP threshold approaches the Shannon limit as the coupling memory increases. Finally we give some simulation results for finite lengths.

Connected through hyperedge HE-1 (induced by source paper "spatially coupled turbo like codes"):
  with members:
    - "finite length weight enumerator analysis of braided convolutional codes"
    - "spatially coupled ldpc codes constructed from protographs"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "braided convolutional codes a class of spatially coupled turbo like codes"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "analysis and design of tuned turbo 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 "information coupled turbo codes for lte systems"):
  with members:
    - "spatially coupled ldpc codes constructed from protographs"
    - "what will 5g be"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "windowed decoding of spatially coupled codes"

Connected through hyperedge HE-3 (induced by source paper "threshold saturation for spatially coupled turbo like codes over the binary erasure channel"):
  with members:
    - "braided convolutional codes a class of spatially coupled turbo like codes"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "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)