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: "optimal dynamic resource allocation for multi antenna broadcasting with heterogeneous delay constrained traffic"
  Abstract: This paper is concerned with dynamic resource allocation in a cellular wireless network with slow fading for support of data traffic having heterogeneous transmission delay requirements. The multiple-input single-output (MISO) fading broadcast channel (BC) is of interest where the base station (BS) employs multiple transmit antennas to realize simultaneous downlink transmission at the same frequency to multiple mobile users each having a single receive antenna. An information-theoretic approach is taken for characterizing capacity limits of the fading MISO-BC under various transmission delay considerations. First, this paper studies transmit optimization at the BS when some users have delay-tolerant ldquopacketrdquo data and the others have delay-sensitive ldquocircuitrdquo data for transmission at the same time. Based on the convex optimization framework, an online resource allocation algorithm is derived that is amenable to efficient cross-layer implementation of both physical (PHY) - layer multi-antenna transmission and media-access-control (MAC) - layer multiuser rate scheduling. Secondly, this paper investigates the fundamental throughput-delay tradeoff for transmission over the fading MISO-BC. By comparing the network throughput under completely relaxed versus strictly zero transmission delay constraint, this paper characterizes the limiting loss in sum capacity due to the vanishing delay tolerance, termed the delay penalty, under some prescribed user fairness for transmit rate allocation.

Connected through hyperedge HE-1 (induced by source paper "multiplexing gain region of sectorized cellular networks with mixed delay constraints"):
  with members:
    - "resource allocation for multi user downlink urllc ofdma systems"
    - "non orthogonal multiplexing of ultra reliable and broadband services in fog radio architectures"
    - "coexistence of urllc and embb services in the c ran uplink an information theoretic study"
    - "channels with cooperation links that may be absent"
    - "layered uplink transmission in clustered cellular networks"

Connected through hyperedge HE-2 (induced by source paper "mixed delay constraints in wyner s soft handoff network"):
  with members:
    - "the broadcast channel with degraded message sets and unreliable conference"

Connected through hyperedge HE-3 (induced by source paper "joint scheduling and power allocations for traffic offloading via dual connectivity"):
  with members:
    - "mapel achieving global optimality for a non convex wireless power control problem"

Connected through hyperedge HE-4 (induced by source paper "on ergodic sum capacity of fading cognitive multiple access and broadcast channels"):
  with members:
    - "optimal power allocation for fading channels in cognitive radio networks ergodic capacity and outage capacity"
    - "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks"
    - "on peak versus average interference power constraints for protecting primary users in cognitive radio networks"
    - "weighted sum rate optimization for cognitive radio mimo broadcast channels"
    - "scaling laws of cognitive networks"
    - "cognitive radio an information theoretic perspective"
    - "capacity limits of cognitive radio with distributed and dynamic spectral activity"

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)