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: "timely throughput of heterogeneous wireless networks fundamental limits and algorithms"
  Abstract: The proliferation of different wireless access technologies, together with the growing number of multi-radio wireless devices suggest that the opportunistic utilization of multiple connections at the users can be an effective solution to the phenomenal growth of traffic demand in wireless networks. In this paper we consider the downlink of a wireless network with $N$ Access Points (AP's) and $M$ clients, where each client is connected to several out-of-band AP's, and requests delay-sensitive traffic (e.g., real-time video). We adopt the framework of Hou, Borkar, and Kumar, and study the maximum total timely throughput of the network, denoted by $C_{T^3}$, which is the maximum average number of packets delivered successfully before their deadline. Solving this problem is challenging since even the number of different ways of assigning packets to the AP's is $N^M$. We overcome the challenge by proposing a deterministic relaxation of the problem, which converts the problem to a network with deterministic delays in each link. We show that the additive gap between the capacity of the relaxed problem, denoted by $C_{det}$, and $C_{T^3}$ is bounded by $2\sqrt{N(C_{det}+N/4)}$, which is asymptotically negligible compared to $C_{det}$, when the network is operating at high-throughput regime. #R##N#In addition, our numerical results show that the actual gap between $C_{T^3}$ and $C_{det}$ is in most cases much less than the worst-case gap proven analytically. Moreover, using LP rounding methods we prove that the relaxed problem can be approximated within additive gap of $N$. We extend the analytical results to the case of time-varying channel states, real-time traffic, prioritized traffic, and optimal online policies. Finally, we generalize the model for deterministic relaxation to consider fading, rate adaptation, and multiple simultaneous transmissions.

Connected through hyperedge HE-1 (induced by source paper "is deadline oblivious scheduling efficient for controlling real time traffic in cellular downlink systems"):
  with members:
    - "adaptive 360 vr video streaming divide and conquer"
    - "online advertisement optimization and stochastic networks"
    - "optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic"

Connected through hyperedge HE-2 (induced by source paper "timely throughput optimal coded computing over cloud networks"):
  with members:
    - "hierarchical coded computation"
    - "speeding up distributed machine learning using codes"
    - "coded computing for distributed graph analytics"
    - "communication aware scheduling of serial tasks for dispersed computing"
    - "lagrange coded computing optimal design for resiliency security and privacy"
    - "coded computation over heterogeneous clusters"
    - "polynomial codes an optimal design for high dimensional coded matrix multiplication"
    - "coding for distributed fog computing"

Connected through hyperedge HE-3 (induced by source paper "on the credibility of information flows in real time wireless networks"):
  with members:
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "optimizing age of information in wireless networks with perfect channel state information"
    - "scheduling for optimal rate allocation in ad hoc networks with heterogeneous delay constraints"

Connected through hyperedge HE-4 (induced by source paper "capacity and delay tradeoff of secondary cellular networks with spectrum aggregation"):
  with members:
    - "greendelivery proactive content caching and push with energy harvesting based small cells"
    - "performance laws of large heterogeneous cellular networks"
    - "the ginibre point process as a model for wireless networks with repulsion"
    - "a stochastic geometry analysis of inter cell interference coordination and intra cell diversity"
    - "modeling analysis and design for carrier aggregation in heterogeneous cellular networks"
    - "fundamentals of heterogeneous cellular networks with energy harvesting"
    - "average rate of downlink heterogeneous cellular networks over generalized fading channels a stochastic geometry approach"
    - "downlink multi antenna heterogeneous cellular network with load balancing"

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)