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: "content caching and delivery in wireless radio access networks"
  Abstract: Today's mobile data traffic is dominated by content-oriented traffic. Caching popular contents at the network edge can alleviate network congestion and reduce content delivery latency. This paper provides a comprehensive and unified study of caching and delivery techniques in wireless radio access networks (RANs) with caches at all edge nodes (ENs) and user equipments (UEs). Three cache-aided RAN architectures are considered: RANs without fronthaul, with dedicated fronthaul, and with wireless fronthaul. It first reviews in a tutorial nature how caching facilitates interference management in these networks by enabling interference cancellation (IC), zero-forcing (ZF), and interference alignment (IA). Then, two new delivery schemes are presented. One is for RANs with dedicated fronthaul, which considers centralized cache placement at the ENs but both centralized and decentralized placement at the UEs. This scheme combines IA, ZF, and IC together with soft-transfer fronthauling. The other is for RANs with wireless fronthaul, which considers decentralized cache placement at all nodes. It leverages the broadcast nature of wireless fronthaul to fetch not only uncached but also cached contents to boost transmission cooperation among the ENs. Numerical results show that both schemes outperform existing results for a wide range of system parameters, thanks to the various caching gains obtained opportunistically.

Connected through hyperedge HE-1 (induced by source paper "degrees of freedom of cache aided wireless cellular networks"):
  with members:
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "cache aided fog radio access networks with partial connectivity"
    - "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "scalable content delivery with coded caching in multi antenna fading channels"
    - "on heterogeneous coded distributed computing"
    - "degrees of freedom of cache aided wireless interference networks"

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)