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 mackay neal codes and hsu anastasopoulos codes"
  Abstract: Kudekar et al. recently proved that for transmission over the binary erasure channel (BEC), spatial coupling of LDPC codes increases the BP threshold of the coupled ensemble to the MAP threshold of the underlying LDPC codes. One major drawback of the capacity-achieving spatially-coupled LDPC codes is that one needs to increase the column and row weight of parity-check matrices of the underlying LDPC codes. It is proved, that Hsu-Anastasopoulos (HA) codes and MacKay-Neal (MN) codes achieve the capacity of memoryless binary-input symmetric-output channels under MAP decoding with bounded column and row weight of the parity-check matrices. The HA codes and the MN codes are dual codes each other. The aim of this paper is to present an empirical evidence that spatially-coupled MN (resp. HA) codes with bounded column and row weight achieve the capacity of the BEC. To this end, we introduce a spatial coupling scheme of MN (resp. HA) codes. By density evolution analysis, we will show that the resulting spatially-coupled MN (resp. HA) codes have the BP threshold close to the Shannon limit.

Connected through hyperedge HE-1 (induced by source paper "finite length scaling based on belief propagation for spatially coupled ldpc codes"):
  with members:
    - "spatially coupled ldpc codes constructed from protographs"
    - "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"
    - "on the convergence speed of spatially coupled ldpc ensembles"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "exact free distance and trapping set growth rates for ldpc convolutional codes"
    - "finite length scaling for iteratively decoded ldpc ensembles"

Connected through hyperedge HE-2 (induced by source paper "performance improvement of iterative multiuser detection for large sparsely spread cdma systems by spatial coupling"):
  with members:
    - "iterative multiuser detection and decoding with spatially coupled interleaving"
    - "thresholds of spatially coupled systems via lyapunov s method"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "chains of mean field models"
    - "a phenomenological study on threshold improvement via spatial coupling"
    - "wave like solutions of general one dimensional spatially coupled systems"
    - "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-3 (induced by source paper "spatially coupled mackay neal codes universally achieve the symmetric information rate of arbitrary generalized erasure channels with memory"):
  with members:
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "spatially coupled mackay neal codes with no bit nodes of degree two achieve the capacity of bec"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "a phenomenological study on threshold improvement via spatial coupling"
    - "threshold saturation on channels with memory via spatial coupling"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "spatially coupled codes over the multiple access channel"

Connected through hyperedge HE-4 (induced by source paper "a simple proof of maxwell saturation for coupled scalar recursions"):
  with members:
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"
    - "approaching the rate distortion limit with spatial coupling belief propagation and decimation"
    - "threshold saturation in spatially coupled constraint satisfaction problems"
    - "nonbinary spatially coupled ldpc codes on the binary erasure channel"
    - "a proof of threshold saturation for spatially coupled ldpc codes on bms channels"
    - "thresholds of spatially coupled systems via lyapunov s method"
    - "spatial coupling as a proof technique"
    - "a simple proof of threshold saturation for coupled scalar recursions"

Connected through hyperedge HE-5 (induced by source paper "how to achieve the capacity of asymmetric channels"):
  with members:
    - "on the scaling exponent of polar codes for binary input energy harvesting channels"
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "construction of polar codes with sublinear complexity"
    - "polar codes for broadcast channels"
    - "a scaling law to predict the finite length performance of spatially coupled ldpc codes"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite length scaling for polar codes"
    - "achieving marton s region for broadcast channels using polar codes"

Connected through hyperedge HE-6 (induced by source paper "iterative lmmse channel estimation multiuser detection and decoding via spatial coupling"):
  with members:
    - "a generalization of threshold saturation application to spatially coupled bicm id"
    - "accelerating iterative detection for spatially coupled systems by collaborative training"
    - "approaching the rate distortion limit with spatial coupling belief propagation and decimation"
    - "iterative multiuser detection and decoding with spatially coupled interleaving"
    - "on an achievable rate of large rayleigh block fading mimo channels with no csi"
    - "thresholds of spatially coupled systems via lyapunov s method"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "large system analysis of joint channel and data estimation for mimo ds cdma systems"

Connected through hyperedge HE-7 (induced by source paper "design of spatially coupled ldpc codes over gf q for windowed decoding"):
  with members:
    - "threshold saturation for nonbinary sc ldpc codes on the binary erasure channel"
    - "spatially coupled ldpc codes constructed from protographs"
    - "performance comparison of ldpc block and spatially coupled codes over gf q"
    - "nonbinary spatially coupled ldpc codes on the binary erasure channel"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "threshold saturation on channels with memory via spatial coupling"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"

Connected through hyperedge HE-8 (induced by source paper "spatially coupled precoded rateless codes with bounded degree achieve the capacity of bec under bp decoding"):
  with members:
    - "spatially coupled precoded rateless codes"
    - "a simple proof of threshold saturation for coupled scalar recursions"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "universal rateless codes from coupled lt 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)