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: "delivery time minimization in edge caching synergistic benefits of subspace alignment and zero forcing"
  Abstract: An emerging trend of next generation communication systems is to provide network edges with additional capabilities such as additional storage resources in the form of caches to reduce file delivery latency. To investigate this aspect, we study the fundamental limits of a cache-aided wireless network consisting of one central base station, $M$ transceivers and $K$ receivers from a latency-centric perspective. We use the normalized delivery time (NDT) to capture the per-bit latency for the worst-case file request pattern at high signal-to-noise ratios (SNR), normalized with respect to a reference interference-free system with unlimited transceiver cache capabilities. For various special cases with $M=\{1,2\}$ and $K=\{1,2,3\}$ that satisfy $M+K\leq 4$, we establish the optimal tradeoff between cache storage and latency. This is facilitated through establishing a novel converse (for arbitrary $M$ and $K$) and an achievability scheme on the NDT. Our achievability scheme is a synergistic combination of multicasting, zero-forcing beamforming and interference alignment.

Connected through hyperedge HE-1 (induced by source paper "joint fronthaul multicast and cooperative beamforming for cache enabled cloud based small cell networks an mds codes aided approach"):
  with members:
    - "joint long term cache allocation and short term content delivery in green cloud small cell networks"
    - "layered group sparse beamforming for cache enabled green wireless networks"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "joint optimization of user association data delivery rate and precoding for cache enabled f rans"
    - "optimizing mds coded caching in wireless networks with device to device communication"
    - "coded multicast fronthauling and edge caching for multi connectivity transmission in fog radio access networks"
    - "fronthauling for 5g lte u ultra dense cloud small cell networks"
    - "content centric sparse multicast beamforming for cache enabled cloud ran"

Connected through hyperedge HE-2 (induced by source paper "full duplex enabled mobile edge caching from distributed to cooperative caching"):
  with members:
    - "modeling and performance analysis of full duplex communications in cache enabled d2d networks"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "edge caching wireless networks performance analysis and optimization"
    - "cache aided full duplex small cells"
    - "wireless device to device caching networks basic principles and system performance"
    - "octopus a cooperative hierarchical caching strategy for cloud radio access networks"
    - "wireless content caching for small cell and d2d networks"
    - "energy efficiency of downlink networks with caching at base stations"

Connected through hyperedge HE-3 (induced by source paper "delivery time minimization in cache assisted broadcast relay wireless networks with imperfect csi"):
  with members:
    - "fundamental limits on latency in transceiver cache aided hetnets"
    - "cache aided wireless networks tradeoffs between storage and latency"
    - "cache aided interference channels"
    - "fundamental limits of caching in wireless d2d 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)