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: "terminated ldpc convolutional codes with thresholds close to capacity"
  Abstract: An ensemble of LDPC convolutional codes with parity-check matrices composed of permutation matrices is considered. The convergence of the iterative belief propagation based decoder for terminated convolutional codes in the ensemble is analyzed for binary-input output-symmetric memoryless channels using density evolution techniques. We observe that the structured irregularity in the Tanner graph of the codes leads to significantly better thresholds when compared to corresponding LDPC block codes.

Connected through hyperedge HE-1 (induced by source paper "design and analysis of time invariant sc ldpc convolutional codes with small constraint length"):
  with members:
    - "on advisability of designing short length qc ldpc codes using perfect difference families"
    - "spatially coupled ldpc codes constructed from protographs"
    - "construction of high rate regular quasi cyclic ldpc codes based on cyclic difference families"
    - "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"
    - "progressive differences convolutional low density parity check codes"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "deriving good ldpc convolutional codes from ldpc block codes"

Connected through hyperedge HE-2 (induced by source paper "compact qc ldpc block and sc ldpc convolutional codes for low latency communications"):
  with members:
    - "efficient search of compact qc ldpc and sc ldpc convolutional codes with large girth"
    - "design and analysis of time invariant sc ldpc convolutional codes with small constraint length"
    - "lower bounds on the lifting degree of single edge and multiple edge qc ldpc codes by difference matrices"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"

Connected through hyperedge HE-3 (induced by source paper "efficient search of compact qc ldpc and sc ldpc convolutional codes with large girth"):
  with members:
    - "design and analysis of time invariant sc ldpc convolutional codes with small constraint length"
    - "lower bounds on the lifting degree of single edge and multiple edge qc ldpc codes by difference matrices"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"

Connected through hyperedge HE-4 (induced by source paper "universal sparse superposition codes with spatial coupling and gamp decoding"):
  with members:
    - "optimal errors and phase transitions in high dimensional generalized linear models"
    - "plug in estimation in high dimensional linear inverse problems a rigorous analysis"
    - "techniques for improving the finite length performance of sparse superposition codes"
    - "a compressed sensing approach for distribution matching"
    - "approximate message passing decoder and capacity achieving sparse superposition codes"
    - "capacity achieving sparse superposition codes via approximate message passing decoding"
    - "state evolution for approximate message passing with non separable functions"
    - "generalized approximate message passing decoder for universal sparse superposition codes"

Connected through hyperedge HE-5 (induced by source paper "design and analysis of time invariant sc ldpc codes with small constraint length"):
  with members:
    - "on advisability of designing short length qc ldpc codes using perfect difference families"
    - "spatially coupled ldpc codes constructed from protographs"
    - "hierarchical and high girth qc ldpc codes"
    - "construction of high rate regular quasi cyclic ldpc codes based on cyclic difference families"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"
    - "progressive differences convolutional low density parity check codes"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"

Connected through hyperedge HE-6 (induced by source paper "spatially coupled ldpc codes constructed from protographs"):
  with members:
    - "performance comparison of ldpc block and spatially coupled codes over gf q"
    - "deterministic constructions for large girth protograph ldpc codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "lossy source coding via spatially coupled ldgm ensembles"
    - "spatially coupled random access on graphs"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "threshold saturation on channels with memory via spatial coupling"
    - "information theoretically optimal compressed sensing via spatial coupling and approximate message passing"

Connected through hyperedge HE-7 (induced by source paper "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"):
  with members:
    - "approaching the rate distortion limit with spatial coupling belief propagation and decimation"
    - "threshold saturation in spatially coupled constraint satisfaction problems"
    - "a proof of threshold saturation for spatially coupled ldpc codes on bms channels"
    - "spatial coupling as a proof technique"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "chains of mean field models"
    - "a phenomenological study on threshold improvement via spatial coupling"

Connected through hyperedge HE-8 (induced by source paper "multistage compute and forward with multilevel lattice codes based on product constructions"):
  with members:
    - "lattices over eisenstein integers for compute and forward"
    - "structured lattice codes for some two user gaussian networks with cognition coordination and two hops"
    - "multilevel coding schemes for compute and forward with flexible decoding"
    - "connections between construction d and related constructions of lattices"
    - "an algebraic approach to physical layer network coding"
    - "a proof of threshold saturation for spatially coupled ldpc codes on bms channels"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"

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)