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: "cache aided interference management in partially connected wireless networks"
  Abstract: Cache-aided communication is emerging as a new topic in wireless networks. Previous works have shown that caching in interference networks can change the interference topology by changing the information flow and hence facilitate advanced interference management. This paper studies the gain of caching in partially connected interference networks where each receiver can only communicate with a subset of transmitters. The performance is characterized by an information-theoretic metric, normalized delivery time (NDT). We obtain an order-optimal NDT for the (K+L-1) x K partially connected linear interference network with any number of receivers K, any receiver connectivity L <= K, and with caches equipped at all transmitters and receivers. The cache placement phase adopts a file splitting strategy tailor-made for the partial receiver connectivity. Via the aid of virtual receivers, the proposed delivery strategy exploits coded multicasting gain by XOR combining and transmitter coordination gain by interference alignment. In the special case when L is a divisor of K, our NDT results are directly applicable to K x K partially connected circular interference networks.

Connected through hyperedge HE-1 (induced by source paper "content caching and delivery in wireless radio access networks"):
  with members:
    - "mobility aware coded storage and delivery"
    - "cache aided fog radio access networks with partial connectivity"
    - "a converse bound for cache aided interference networks"
    - "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective"
    - "fundamental limits of decentralized caching in fog rans with wireless fronthaul"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "decentralized coded caching in wireless networks trade off between storage and latency"
    - "online edge caching and wireless delivery in fog aided networks with dynamic content popularity"

Connected through hyperedge HE-2 (induced by source paper "wyner s network on caches combining receiver caching with a flexible backhaul"):
  with members:
    - "resolving a feedback bottleneck of multi antenna coded caching"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "generalized degrees of freedom of the symmetric cache aided miso broadcast channel with partial csit"
    - "multi antenna coded caching"
    - "complete interference mitigation through receiver caching in wyner s networks"
    - "multi server coded caching"
    - "flexible backhaul design and degrees of freedom for linear interference networks"
    - "fundamental limits of caching"

Connected through hyperedge HE-3 (induced by source paper "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "fundamental limits of decentralized caching in fog rans with wireless fronthaul"
    - "alpha fair coded caching"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "generalized degrees of freedom of the symmetric cache aided miso broadcast channel with partial csit"

Connected through hyperedge HE-4 (induced by source paper "cache assisted broadcast relay wireless networks a delivery time cache memory tradeoff"):
  with members:
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "fundamental limits on latency in transceiver cache aided hetnets"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "waveform and spectrum management for unmanned aerial systems beyond 2025"
    - "decentralized caching and coded delivery with distinct cache capacities"
    - "content centric sparse multicast beamforming for cache enabled cloud ran"
    - "fundamental limits of cache aided wireless bc interplay of coded caching and csit feedback"
    - "multi server coded caching"

Connected through hyperedge HE-5 (induced by source paper "cache aided combination networks with interference"):
  with members:
    - "cache aided fog radio access networks with partial connectivity"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "a reinforcement learning approach to proactive caching in wireless networks"
    - "coded caching in a multi server system with random topology"
    - "decentralized coded caching in wireless networks trade off between storage and latency"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "coded caching schemes with reduced subpacketization from linear block codes"

Connected through hyperedge HE-6 (induced by source paper "cache aided fog radio access networks with partial connectivity"):
  with members:
    - "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"
    - "noisy broadcast networks with receiver caching"
    - "wireless content caching for small cell and d2d networks"
    - "coded caching for networks with the resolvability property"
    - "decentralized caching and coded delivery with distinct cache capacities"

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)