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: "interference networks with caches at both ends"
  Abstract: A $K_T \times K_R$ cache-aided wireless interference network, in which both the transmitters and the receivers are equipped with cache memories is studied. Each user requests one file from a library of $N$ popular files. The goal is to design the cache contents without the knowledge of the particular user demands, such that all possible demand combinations can be satisfied reliably over the interference channel. The achievable sum degrees-of-freedom ($\mathrm{sDoF}$) and the normalized delivery time (NDT) are studied for centralized and decentralized network architectures, respectively. First, using a combination of interference alignment (IA), zero-forcing (ZF) and interference cancellation (IC) techniques, a novel caching and transmission scheme for centralized networks is introduced, and it is shown to improve the $\mathrm{sDoF}$ upon the state-of-the-art. Then, the NDT is studied when the content placement at the receiver caches is carried out in a decentralized manner. Our results indicate that, for this particular network architecture, caches located at the receiver side are more effective than those at the transmitter side in order to reduce the NDT.

Connected through hyperedge HE-1 (induced by source paper "adding transmitters dramatically boosts coded caching gains for finite file sizes"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "coded distributed computing with node cooperation substantially increases speedup factors"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "coded caching with linear subpacketization is possible using ruzsa szem eredi graphs"
    - "on coded caching in the overloaded miso broadcast channel"
    - "multi antenna coded caching"
    - "degrees of freedom of cache aided wireless interference networks"

Connected through hyperedge HE-2 (induced by source paper "degrees of freedom of cache aided wireless interference networks"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "fundamental limits of cache aided interference management"
    - "wireless device to device caching networks basic principles and system performance"
    - "cooperative tx rx caching in interference channels a storage latency tradeoff study"
    - "cloud and cache aided wireless networks fundamental latency trade offs"
    - "a layered caching architecture for the interference channel"

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)