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: "approximate message passing with spatially coupled structured operators with applications to compressed sensing and sparse superposition codes"
  Abstract: We study the behavior of approximate message-passing (AMP), a solver for linear sparse estimation problems such as compressed sensing, when the i.i.d matrices—for which it has been specifically designed—are replaced by structured operators, such as Fourier and Hadamard ones. We show empirically that after proper randomization, the structure of the operators does not significantly affect the performances of the solver. Furthermore, for some specially designed spatially coupled operators, this allows a computationally fast and memory efficient reconstruction in compressed sensing up to the information-theoretical limit. We also show how this approach can be applied to sparse superposition codes, allowing the AMP decoder to perform at large rates for moderate block length.

Connected through hyperedge HE-1 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding"):
  with members:
    - "sparse regression codes"
    - "the error probability of sparse superposition codes with approximate message passing decoding"
    - "spatially coupled sparse regression codes design and state evolution analysis"
    - "finite sample analysis of approximate message passing algorithms"
    - "techniques for improving the finite length performance of sparse superposition codes"
    - "approximate message passing decoder and capacity achieving sparse superposition codes"
    - "capacity achieving sparse superposition codes via approximate message passing decoding"
    - "universal sparse superposition codes with spatial coupling and gamp decoding"

Connected through hyperedge HE-2 (induced by source paper "compressed coding amp based decoding and analog spatial coupling"):
  with members:
    - "analysis of approximate message passing with non separable denoisers and markov random field priors"
    - "approximate message passing decoder and capacity achieving sparse superposition codes"
    - "capacity achieving sparse superposition codes via approximate message passing decoding"
    - "universal sparse superposition codes with spatial coupling and gamp decoding"
    - "state evolution for approximate message passing with non separable functions"
    - "generalized approximate message passing decoder for universal sparse superposition codes"
    - "threshold saturation of spatially coupled sparse superposition codes for all memoryless channels"
    - "spatially coupled ldpc codes constructed from protographs"

Connected through hyperedge HE-3 (induced by source paper "sparse regression codes"):
  with members:
    - "the error probability of sparse superposition codes with approximate message passing decoding"
    - "sparcs for unsourced random access"
    - "spatially coupled sparse regression codes design and state evolution analysis"
    - "techniques for improving the finite length performance of sparse superposition codes"
    - "approximate message passing decoder and capacity achieving sparse superposition codes"
    - "capacity achieving sparse superposition codes via approximate message passing decoding"
    - "the rate distortion function and excess distortion exponent of sparse regression codes with optimal encoding"
    - "universal sparse superposition codes with spatial coupling and gamp decoding"

Connected through hyperedge HE-4 (induced by source paper "an approximate message passing framework for side information"):
  with members:
    - "an analysis of state evolution for approximate message passing with side information"
    - "plug in estimation in high dimensional linear inverse problems a rigorous analysis"
    - "finite sample analysis of approximate message passing algorithms"
    - "state evolution for approximate message passing with non separable functions"
    - "rapid fading due to human blockage in pedestrian crowds at 5g millimeter wave frequencies"
    - "mutual information and optimality of approximate message passing in random linear estimation"
    - "the replica symmetric prediction for compressed sensing with gaussian matrices is exact"
    - "optimal trade offs in multi processor approximate message passing"

Connected through hyperedge HE-5 (induced by source paper "a compressed sensing approach for distribution matching"):
  with members:
    - "approximate message passing decoder and capacity achieving sparse superposition codes"
    - "capacity achieving sparse superposition codes via approximate message passing decoding"
    - "universal sparse superposition codes with spatial coupling and gamp decoding"
    - "generalized approximate message passing decoder for universal sparse superposition codes"
    - "comparison of geometric and probabilistic shaping with application to atsc 3 0"
    - "threshold saturation of spatially coupled sparse superposition codes for all memoryless channels"
    - "proof of threshold saturation for spatially coupled sparse superposition codes"
    - "constant composition distribution matching"

Connected through hyperedge HE-6 (induced by source paper "spatially coupled sparse regression codes design and state evolution analysis"):
  with members:
    - "techniques for improving the finite length performance of sparse superposition codes"
    - "approximate message passing decoder and capacity achieving sparse superposition codes"
    - "capacity achieving sparse superposition codes via approximate message passing decoding"
    - "universal sparse superposition codes with spatial coupling and gamp decoding"
    - "threshold saturation of spatially coupled sparse superposition codes for all memoryless channels"
    - "proof of threshold saturation for spatially coupled sparse superposition codes"
    - "spatially coupled ldpc codes constructed from protographs"
    - "threshold saturation for spatially coupled ldpc and ldgm codes on bms channels"

Connected through hyperedge HE-7 (induced by source paper "techniques for improving the finite length performance of sparse superposition codes"):
  with members:
    - "approximate message passing decoder and capacity achieving sparse superposition codes"
    - "capacity achieving sparse superposition codes via approximate message passing decoding"
    - "replica analysis and approximate message passing decoder for superposition codes"
    - "generalized approximate message passing for estimation with random linear mixing"

Connected through hyperedge HE-8 (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"

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)