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: "finite length construction of high performance spatially coupled codes via optimized partitioning and lifting"
  Abstract: Spatially-coupled (SC) codes are a family of graph-based codes that have attracted significant attention thanks to their capacity approaching performance and low decoding latency. An SC code is constructed by partitioning an underlying block code into a number of components and coupling their copies together. In this paper, we first introduce a general approach for the enumeration of detrimental combinatorial objects in the graph of finite-length SC codes. Our approach is general in the sense that it effectively works for SC codes with various column weights and memories. Next, we present a two-stage framework for the construction of high-performance binary SC codes optimized for additive white Gaussian noise channel; we aim at minimizing the number of detrimental combinatorial objects in the error floor regime. In the first stage, we deploy a novel partitioning scheme, called the optimal overlap partitioning, to produce optimal partitioning corresponding to the smallest number of detrimental objects. In the second stage, we apply a new circulant power optimizer to further reduce the number of detrimental objects in the lifted graph. An SC code constructed by our new framework has nearly 5 orders of magnitudes error floor performance improvement compared to the uncoupled setting.

Connected through hyperedge HE-1 (induced by source paper "analysis and optimization of tail biting spatially coupled protograph ldpc codes for bicm id systems"):
  with members:
    - "efficient search of compact qc ldpc and sc ldpc convolutional codes with large girth"
    - "improving the decoding threshold of tailbiting spatially coupled ldpc codes by energy shaping"
    - "compact qc ldpc block and sc ldpc convolutional codes for low latency communications"
    - "design and analysis of time invariant sc ldpc convolutional codes with small constraint length"
    - "wave like decoding of tail biting spatially coupled ldpc codes through iterative demapping"
    - "finite length analysis of spatially coupled regular ldpc ensembles on burst erasure channels"
    - "efficient multi dimensional mapping using qam constellations for bicm id"
    - "on probabilistic shaping of quadrature amplitude modulation for the nonlinear fiber channel"

Connected through hyperedge HE-2 (induced by source paper "managing device lifecycle reconfigurable constrained codes for m t q p lc flash memories"):
  with members:
    - "asymmetric loco codes constrained codes for flash memories"
    - "loco codes lexicographically ordered constrained codes"
    - "high performance non binary spatially coupled codes for flash memories"

Connected through hyperedge HE-3 (induced by source paper "efficient information reconciliation for energy time entanglement quantum key distribution"):
  with members:
    - "spatially coupled code design for partial response channels optimal object minimization approach"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"

Connected through hyperedge HE-4 (induced by source paper "a combinatorial methodology for optimizing non binary graph based codes theoretical analysis and applications in data storage"):
  with members:
    - "spatially coupled code design for partial response channels optimal object minimization approach"
    - "a generalized algebraic approach to optimizing sc ldpc codes"
    - "high performance non binary spatially coupled codes for flash memories"
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "spatially coupled ldpc codes constructed from protographs"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "iterative decoding of ldpc codes over the q ary partial erasure channel"
    - "thresholds of absorbing sets in low density parity check codes"

Connected through hyperedge HE-5 (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"
    - "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"
    - "new codes on graphs constructed by connecting spatially coupled chains"
    - "on characterization of elementary trapping sets of variable regular ldpc codes"

Connected through hyperedge HE-6 (induced by source paper "spatially coupled ldpc codes with sub block locality"):
  with members:
    - "ldpc codes with local and global decoding"
    - "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"
    - "new codes on graphs constructed by connecting spatially coupled chains"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

Connected through hyperedge HE-7 (induced by source paper "efficient search and elimination of harmful objects in optimized qc sc ldpc codes"):
  with members:
    - "design and analysis of time invariant sc ldpc convolutional codes with small constraint length"
    - "a generalized algebraic approach to optimizing sc ldpc codes"
    - "spatially coupled ldpc codes constructed from protographs"
    - "on characterization of elementary trapping sets of variable regular ldpc codes"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-8 (induced by source paper "a finite length construction of irregular spatially coupled codes"):
  with members:
    - "high performance non binary spatially coupled codes for flash memories"
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "design of non binary quasi cyclic ldpc codes by ace optimization"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "windowed decoding of spatially coupled codes"

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)