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: "many access channels the gaussian case with random user activities"
  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 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 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 "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"
    - "capacity of gaussian many access channels"
    - "a proof of the strong converse theorem for gaussian multiple access channels"
    - "the third order term in the normal approximation for the awgn channel"
    - "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-2 (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-3 (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"
    - "capacity of gaussian many access channels"
    - "sign compute resolve for tree splitting random access"
    - "code design for short blocks a survey"

Connected through hyperedge HE-4 (induced by source paper "privacy of dependent users against statistical matching"):
  with members:
    - "asymptotic limits of privacy in bayesian time series matching"
    - "a concentration of measure approach to database de anonymization"
    - "single server single message online private information retrieval with side information"
    - "asymptotic loss in privacy due to dependency in gaussian traces"
    - "fundamental limits of database alignment"
    - "community detection with side information exact recovery under the stochastic block model"
    - "matching graphs with community structure a concentration of measure approach"
    - "on the performance of a canonical labeling for matching correlated erdős renyi graphs"

Connected through hyperedge HE-5 (induced by source paper "random access channel coding in the finite blocklength regime"):
  with members:
    - "lossless source coding in the point to point multiple access and random access scenarios"
    - "capacity of gaussian many access channels"
    - "a proof of the strong converse theorem for gaussian multiple access channels"
    - "on the dispersions of three network information theory problems"
    - "aloha random access that operates as a rateless code"
    - "second order rate region of constant composition codes for the multiple access channel"
    - "random access an information theoretic perspective"

Connected through hyperedge HE-6 (induced by source paper "sparse ofdm a compressive sensing approach to asynchronous neighbor discovery"):
  with members:
    - "massive connectivity with massive mimo part i device activity detection and channel estimation"
    - "on frame asynchronous coded slotted aloha asymptotic finite length and delay analysis"
    - "detection and combining techniques for asynchronous random access with time diversity"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "probabilistic rateless multiple access for machine to machine communication"
    - "asynchronous code division random access using convex optimization"
    - "neighbor discovery in a wireless sensor network multipacket reception capability and physical layer signal processing"
    - "neighbor discovery for wireless networks via compressed sensing"

Connected through hyperedge HE-7 (induced by source paper "capacity of gaussian many access channels"):
  with members:
    - "on or many access channels"
    - "sparse ofdm a compressive sensing approach to asynchronous neighbor discovery"
    - "identifying randomly activated users via sign compute resolve on graphs"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "many access for small packets based on precoding and sparsity aware recovery"
    - "many broadcast channels definition and capacity in the degraded case"
    - "sparse signal processing with linear and non linear observations a unified shannon theoretic approach"
    - "error performance of channel coding in random access communication"

Connected through hyperedge HE-8 (induced by source paper "sign compute resolve for tree splitting random access"):
  with members:
    - "identifying randomly activated users via sign compute resolve on graphs"
    - "coded random access applying codes on graphs to design random access protocols"
    - "sign compute resolve for random access"
    - "coded splitting tree protocols"
    - "random access with physical layer network coding"
    - "reliable physical layer network coding"
    - "physical layer network coding tutorial survey and beyond"
    - "collision helps algebraic collision recovery for wireless erasure networks"

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)