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: "capacity of gaussian many access channels"
  Abstract: Classical multiuser information theory studies the fundamental limits of models with a fixed (often small) number of users as the coding blocklength goes to infinity. This work proposes a new paradigm, referred to as {\em many-user information theory}, where the number of users is allowed to grow with the blocklength. This paradigm is motivated by emerging systems with a massive number of users in an area, such as machine-to-machine communication systems and sensor networks. The focus of the current paper is the {\em many-access} channel model, which consists of a single receiver and many transmitters, whose number increases unboundedly with the blocklength. Moreover, an unknown subset of transmitters may transmit in a given block and need to be identified. A new notion of capacity is introduced and characterized for the Gaussian many-access channel with random user activities. The capacity can be achieved by first detecting the set of active users and then decoding their messages.

Connected through hyperedge HE-1 (induced by source paper "unsourced multiuser sparse regression codes achieve the symmetric mac capacity"):
  with members:
    - "grant free massive random access with a massive mimo receiver"
    - "sparse regression codes"
    - "non bayesian activity detection large scale fading coefficient estimation and unsourced random access with a massive mimo receiver"
    - "polar coding and random spreading for unsourced multiple access"
    - "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"
    - "mutual information and optimality of approximate message passing in random linear estimation"

Connected through hyperedge HE-2 (induced by source paper "gaussian multiple and random access in the finite blocklength regime"):
  with members:
    - "fundamental limits of many user mac with finite payloads and fading"
    - "lossless source coding in the point to point multiple access and random access scenarios"
    - "random access channel coding in the finite blocklength regime"
    - "a proof of the strong converse theorem for gaussian multiple access channels"
    - "the third order term in the normal approximation for the awgn channel"
    - "many access channels the gaussian case with random user activities"
    - "on the dispersions of three network information theory problems"
    - "second order rate region of constant composition codes for the multiple access channel"

Connected through hyperedge HE-3 (induced by source paper "sparcs for unsourced random access"):
  with members:
    - "massive mimo unsourced random access"
    - "techniques for improving the finite length performance of sparse superposition codes"
    - "sparse signal processing for grant free massive iot connectivity"
    - "approximate message passing decoder and capacity achieving sparse superposition codes"
    - "capacity achieving sparse superposition codes via approximate message passing decoding"
    - "on or many access channels"
    - "device activity and embedded information bit detection using amp in massive mimo"
    - "state evolution for approximate message passing with non separable functions"

Connected through hyperedge HE-4 (induced by source paper "massive access for future wireless communication systems"):
  with members:
    - "fundamental limits of many user mac with finite payloads and fading"
    - "non bayesian activity detection large scale fading coefficient estimation and unsourced random access with a massive mimo receiver"
    - "on the fundamental limits of mimo massive access communication"
    - "a joint graph based coding scheme for the unsourced random access gaussian channel"
    - "polar coding and random spreading for unsourced multiple access"
    - "energy efficient coded random access for the wireless uplink"
    - "sparcs for unsourced random access"
    - "random access channel coding in the finite blocklength regime"

Connected through hyperedge HE-5 (induced by source paper "multi cell sparse activity detection for massive random access massive mimo versus cooperative mimo"):
  with members:
    - "sparse activity detection for massive connectivity"
    - "a new scaling law for activity detection in massive mimo systems"
    - "massive connectivity with massive mimo part i device activity detection and channel estimation"
    - "a random access protocol for pilot allocation in crowded massive mimo systems"
    - "user activity detection in massive random access compressed sensing vs coded slotted aloha"
    - "device activity and embedded information bit detection using amp in massive mimo"
    - "random access in c ran for user activity detection with limited capacity fronthaul"
    - "massive mimo ten myths and one critical question"

Connected through hyperedge HE-6 (induced by source paper "energy efficient coded random access for the wireless uplink"):
  with members:
    - "fundamental limits of many user mac with finite payloads and fading"
    - "a joint graph based coding scheme for the unsourced random access gaussian channel"
    - "massive mimo unsourced random access"
    - "massive random access with common alarm messages"
    - "improved scaling law for activity detection in massive mimo systems"
    - "sparse activity detection for massive connectivity"
    - "sparse signal processing for grant free massive iot connectivity"
    - "sparse signal processing for grant free massive connectivity a future paradigm for random access protocols in the internet of things"

Connected through hyperedge HE-7 (induced by source paper "on the fundamental limits of mimo massive access communication"):
  with members:
    - "fundamental limits of many user mac with finite payloads and fading"
    - "massive mimo unsourced random access"
    - "improved scaling law for activity detection in massive mimo systems"
    - "sparse activity detection for massive connectivity"
    - "massive connectivity with massive mimo part ii achievable rate characterization"
    - "a new scaling law for activity detection in massive mimo systems"
    - "massive connectivity with massive mimo part i device activity detection and channel estimation"
    - "fundamental limits of low density spreading noma with fading"

Connected through hyperedge HE-8 (induced by source paper "efficient scheduling for the massive random access gaussian channel"):
  with members:
    - "a joint graph based coding scheme for the unsourced random access gaussian channel"
    - "a coupled compressive sensing scheme for unsourced multiple access"
    - "massive multiple access based on superposition raptor codes for cellular m2m communications"
    - "gaussian multiple access via compute and forward"
    - "massive non orthogonal multiple access for cellular iot potentials and limitations"
    - "sign compute resolve for tree splitting random access"
    - "code design for short blocks a survey"
    - "massive machine type communications in 5g physical and mac layer solutions"

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)