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: "delay performance of multi antenna multicasting in wireless networks"
  Abstract: Low-latency communication is currently attracting significant attention due to the emergence of mission-critical Internet of Things (IoT) applications and content-centric services. A deep understanding of the delay performance is essential for efficient wireless system design and end-to-end latency guarantees. In this paper, we investigate the network-layer performance of physical layer multi-antenna multicasting, i.e., when the same data is simultaneously conveyed to multiple users. We provide a statistical characterization of the service process in terms of its Mellin transform and derive probabilistic delay bounds using tools from stochastic network calculus. Furthermore, using extreme value theory, we characterize the service process for very large number of users and derive scaling laws as the number of antennas and/or users is taken to infinity. Our results can be used for system dimensioning to guarantee the delay requirements in wireless multicast networks.

Connected through hyperedge HE-1 (induced by source paper "closed form whittle s index enabled random access for timely status update"):
  with members:
    - "age of information in g g 1 1 systems age expressions bounds special cases and optimization"
    - "age of information scaling in large networks with hierarchical cooperation"
    - "using erasure feedback for online timely updating with an energy harvesting sensor"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "information aging through queues a mutual information perspective"
    - "towards massive connectivity support for scalable mmtc communications in 5g networks"
    - "age optimal sampling and transmission scheduling in multi source systems"
    - "age of information in multihop multicast networks"

Connected through hyperedge HE-2 (induced by source paper "delay performance of the multiuser miso downlink under imperfect csi and finite length coding"):
  with members:
    - "delay performance of the multiuser miso downlink"
    - "delay performance of miso wireless communications"
    - "analysis of wireless communications with finite blocklength and imperfect channel knowledge"
    - "the dispersion of nearest neighbor decoding for additive non gaussian channels"
    - "optimal design of energy efficient multi user mimo systems is massive mimo the answer"
    - "effects of channel aging in massive mimo systems"
    - "multi user diversity vs accurate channel state information in mimo downlink channels"
    - "multi mode transmission for the mimo broadcast channel with imperfect channel state information"

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)