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: "multiple access demodulation in the lifted signal graph with spatial coupling"
  Abstract: Demodulation in a random multiple access channel is considered where the signals are chosen uniformly randomly with unit energy, a model applicable to several modern transmission systems. It is shown that by lifting (replicating) the graph of this system and randomizing the graph connections, a simple iterative cancellation demodulator can be constructed which achieves the same performance as an optimal symbol-by-symbol detector of the original system. The iterative detector has a complexity that is linear in the number of users, while the direct optimal approach is known to be NP-hard. However, the maximal system load of this lifted graph is limited to \alpha<2.07, even for signal-to-noise ratios going to infinity - the system is interference limited. We then show that by introducing spatial coupling between subsequent lifted graphs, and anchoring the initial graphs, this limitation can be avoided and arbitrary system loads are achievable. Our results apply to several well-documented system proposals, such as IDMA, partitioned spreading, and certain forms of MIMO communications.

Connected through hyperedge HE-1 (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-2 (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-3 (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-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 "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-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 "new codes on graphs constructed by connecting spatially coupled chains"):
  with members:
    - "a proof of threshold saturation for spatially coupled ldpc codes on bms channels"
    - "spatially coupled quasi cyclic quantum ldpc codes"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "universality for the noisy slepian wolf problem via spatial coupling"
    - "coupled graphical models and their thresholds"
    - "bilayer ldpc convolutional codes for half duplex relay channels"
    - "improvement of bp based cdma multiuser detection by spatial coupling"
    - "universal rateless codes from coupled lt codes"

Connected through hyperedge HE-8 (induced by source paper "non adaptive pooling strategies for detection of rare faulty items"):
  with members:
    - "compressed sensing under matrix uncertainty optimum thresholds and robust approximate message passing"
    - "non adaptive group testing explicit bounds and novel algorithms"
    - "compressed sensing of approximately sparse signals phase transitions and optimal reconstruction"
    - "boolean compressed sensing and noisy group testing"
    - "compressed sensing with sparse structured matrices"
    - "information theoretically optimal compressed sensing via spatial coupling and approximate message passing"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "improvement of bp based cdma multiuser detection by spatial coupling"

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)