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: "fundamental limits on delivery time in cloud and cache aided heterogeneous networks"
  Abstract: A Fog radio access network is considered as a network architecture candidate to meet the soaring demand in terms of reliability, spectral efficiency, and latency in next generation wireless networks. This architecture combines the benefits associated with centralized cloud processing and wireless edge caching enabling primarily low-latency transmission under moderate fronthaul capacity requirements. The F-RAN we consider in this paper is composed of a centralized cloud server which is connected through fronthaul links to two edge nodes serving two mobile users through a Z-shaped partially connected wireless network. We define an information-theoretic metric, the delivery time per bit (DTB), that captures the worst-case per-bit delivery latency for conveying any requested content to the users. For the cases when cloud and wireless transmission occur either sequentially or in parallel, we establish coinciding lower and upper bounds on the DTB as a function of cache size, backhaul capacity and wireless channel parameters. Through optimized rate allocation, our achievability scheme determines the best combination of private, common signalling and interference neutralization that matches the converse. Our converse bounds use subsets of wireless, fronthaul and caching resources of the F-RAN as side information that enable a single receiver to decode either one or both users' requested files. We show the optimality on the DTB for all channel regimes. In case of serial transmission, the functional DTB-behavior changes at fronthaul capacity thresholds. In this context, we combine multiple channel regimes to classes of channel regimes which share the same fronthaul capacity thresholds and as such the same DTB-functional. In total, our analysis identifies four classes; in only three of those edge caching and cloud processing can provide nontrivial synergestic and non-synergestic performance gains.

Connected through hyperedge HE-1 (induced by source paper "centralized and decentralized cache aided interference management in heterogeneous parallel channels"):
  with members:
    - "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "state adaptive coded caching for symmetric broadcast channels"
    - "on the capacity region of a cache aided gaussian broadcast channel with multi layer messages"
    - "storage latency trade off in cache aided fog radio access networks"
    - "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective"
    - "the role of caching in future communication systems and networks"
    - "fundamental limits of decentralized caching in fog rans with wireless fronthaul"

Connected through hyperedge HE-2 (induced by source paper "generalized degrees of freedom of the symmetric cache aided miso broadcast channel with partial csit"):
  with members:
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "on the dof of parallel miso bcs with partial csit total order and separability"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "on coded caching in the overloaded miso broadcast channel"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "physical layer schemes for wireless coded caching"

Connected through hyperedge HE-3 (induced by source paper "cache aided interference management in partially connected wireless networks"):
  with members:
    - "cache aided fog radio access networks with partial connectivity"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "coded caching in a multi server system with random topology"
    - "decentralized coded caching in wireless networks trade off between storage and latency"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "degrees of freedom of cache aided wireless interference networks"
    - "fundamental storage latency tradeoff in cache aided mimo interference networks"
    - "cooperative tx rx caching in interference channels a storage latency tradeoff study"

Connected through hyperedge HE-4 (induced by source paper "delivery time minimization in edge caching synergistic benefits of subspace alignment and zero forcing"):
  with members:
    - "fundamental limits on latency in transceiver cache aided hetnets"
    - "waveform and spectrum management for unmanned aerial systems beyond 2025"
    - "fundamental limits of cache aided interference management"
    - "cache aided wireless networks tradeoffs between storage and latency"
    - "cache aided interference channels"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "a systematic approach for interference alignment in csit less relay aided x networks"
    - "fundamental limits of caching"

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)