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: "new codes on graphs constructed by connecting spatially coupled chains"
  Abstract: A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are described by protographs, comprised of several protograph-based chains characterizing individual SC-LDPC codes. We demonstrate that code ensembles obtained by connecting appropriately chosen SC-LDPC code chains at specific points have improved iterative decoding thresholds compared to those of single SC-LDPC coupled chains. In addition, it is shown that the improved decoding properties of the connected ensembles result in reduced decoding complexity required to achieve a specific bit error probability. The constructed ensembles are also asymptotically good, in the sense that the minimum distance grows linearly with the block length. Finally, we show that the improved asymptotic properties of the connected chain ensembles also translate into improved finite length performance.

Connected through hyperedge HE-1 (induced by source paper "non uniform windowed decoding for multi dimensional spatially coupled ldpc codes"):
  with members:
    - "minimizing the number of detrimental objects in multi dimensional graph based codes"
    - "finite length analysis of spatially coupled regular ldpc ensembles on burst erasure channels"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "windowed decoding of spatially coupled codes"

Connected through hyperedge HE-2 (induced by source paper "multi dimensional spatially coupled code design enhancing the cycle properties"):
  with members:
    - "efficient search and elimination of harmful objects in optimized qc sc ldpc codes"
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "multi dimensional spatially coupled code design through informed relocation of circulants"
    - "spatially coupled code design for partial response channels optimal object minimization approach"
    - "high performance non binary spatially coupled codes for flash memories"
    - "hierarchical and high girth qc ldpc codes"
    - "multi dimensional spatially coupled codes"
    - "on characterization of elementary trapping sets of variable regular ldpc codes"

Connected through hyperedge HE-3 (induced by source paper "spatially coupled ldpc codes with sub block locality"):
  with members:
    - "ldpc codes with local and global decoding"
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
    - "multi block interleaved codes for local and global read access"
    - "integrated interleaved codes as locally recoverable codes properties and performance"
    - "spatially coupled ldpc codes constructed from protographs"
    - "a family of optimal locally recoverable codes"
    - "multi dimensional spatially coupled codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

Connected through hyperedge HE-4 (induced by source paper "minimizing the number of detrimental objects in multi dimensional graph based codes"):
  with members:
    - "a combinatorial methodology for optimizing non binary graph based codes theoretical analysis and applications in data storage"
    - "multi dimensional spatially coupled code design through informed relocation of circulants"
    - "high performance non binary spatially coupled codes for flash memories"

Connected through hyperedge HE-5 (induced by source paper "multi dimensional spatially coupled code design through informed relocation of circulants"):
  with members:
    - "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"

Connected through hyperedge HE-6 (induced by source paper "continuous transmission of spatially coupled ldpc code chains"):
  with members:
    - "spatially coupled ldpc codes constructed from protographs"
    - "triggering wave like convergence of tail biting spatially coupled ldpc codes"
    - "triggering wave like convergence of tail biting spatially coupled ldpc codes single and dual channel setup"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "terminated and tailbiting spatially coupled codes with optimized bit mappings for spectrally efficient fiber optical systems"
    - "on the convergence speed of spatially coupled ldpc ensembles"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

Connected through hyperedge HE-7 (induced by source paper "improving the finite length performance of spatially coupled ldpc codes by connecting multiple code chains"):
  with members:
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "analytical solution of covariance evolution for irregular ldpc codes"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "exact free distance and trapping set growth rates for ldpc convolutional codes"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "connecting spatially coupled ldpc code chains"
    - "improvement of bp based cdma multiuser detection by spatial coupling"
    - "scaling behavior of convolutional ldpc ensembles 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)