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: "random access channel coding in the finite blocklength regime"
  Abstract: The paper considers a random multiple access channel communication scenario with an unknown number of transmitters. The collection of active transmitters remains fixed during each epoch, but neither the transmitters nor the receiver know which subset of transmitters that is nor even the number of active transmitters. The receiver discerns from the channel output both the number of active transmitters ($k$) and their messages. The receiver takes more time to decode if the number of active transmitters is high, and it uses 1-bit feedback at fixed transmission times to inform all transmitters when it is ready to accept a new transmission. For a class of permutation-invariant channels, the central result of this work demonstrates the achievability of performance that is first-order optimal for the Multiple Access Channel (MAC) in operation during each coding epoch. In that class, the proposed scheme achieves the same dispersion using a single threshold rule as that achieved by prior multiple access schemes requiring $2^{k}-1$ simultaneous threshold rules and a fixed number of transmitters.

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"
    - "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"
    - "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-2 (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"
    - "a new scaling law for activity detection in massive mimo systems"

Connected through hyperedge HE-3 (induced by source paper "lossless source coding in the point to point multiple access and random access scenarios"):
  with members:
    - "on the calculation of the minimax converse of the channel coding problem"
    - "on the dispersions of three network information theory problems"
    - "variable length compression allowing errors"
    - "random access an information theoretic perspective"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "second order slepian wolf coding theorems for non mixed and mixed sources"
    - "fixed length lossy compression in the finite blocklength regime"
    - "network coding is zero error always possible"

Connected through hyperedge HE-4 (induced by source paper "protograph ldpc code design for asynchronous random access"):
  with members:
    - "enhancing contention resolution aloha using combining techniques"
    - "finite length analysis of irregular repetition slotted aloha in the waterfall region"
    - "on frame asynchronous coded slotted aloha asymptotic finite length and delay analysis"
    - "error floor analysis of coded slotted aloha over packet erasure channels"
    - "coded slotted aloha a graph based method for uncoordinated multiple access"
    - "aloha random access that operates as a rateless code"
    - "low density parity check codes for nonergodic block fading channels"

Connected through hyperedge HE-5 (induced by source paper "on the fundamental limits of mimo massive multiple access channels"):
  with members:
    - "rate selection and power adaptation using maximal ratio combining for the random access gaussian channel"
    - "capacity of gaussian many access channels"
    - "secure massive mimo transmission with an active eavesdropper"

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)