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 of cache aided interference management"
  Abstract: We consider a system, comprising a library of files (e.g., movies) and a wireless network with an arbitrary number of transmitters and receivers, where each node is equipped with a local cache memory. The system operates in two phases, the prefetching phase, where each cache is pre-populated from the contents of the library, up to its limited size, and then the delivery phase, where each receiver reveals its request for a file from the library, and the system needs to deliver the requested files. The objective is to design the cache placement and the communication scheme to maximize the rate of delivery for arbitrary set of requested files. We characterize the sum degrees-of-freedom (sum-DoF) of this network to within a factor of 2 for all system parameters, under one-shot linear schemes. In particular, we show that the linear sum-DoF scales linearly with the aggregate cache size in the network (i.e., the cumulative memory available at all nodes). The proposed achievable scheme exploits the redundancy of the content at transmitters' caches to cooperatively zero-force some outgoing interference, and availability of the unintended content at the receivers' caches to cancel (subtract) some of the incoming interference. The outer bound is derived by an optimization argument which bounds the number of communication blocks needed to deliver any requested contents to the receivers. This result demonstrates that in this setting, caches at the transmitters' side are equally valuable as the caches at the receivers' side. In addition, it shows that caching can offer a throughput gain that scales linearly with the size of the network.

Connected through hyperedge HE-1 (induced by source paper "the exact rate memory tradeoff for caching with uncoded prefetching"):
  with members:
    - "coding for distributed fog computing"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "how to optimally allocate resources for coded distributed computing"
    - "information theoretic caching the multi user case"
    - "degrees of freedom of cache aided wireless interference networks"
    - "noisy broadcast networks with receiver caching"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "coded caching for a large number of users"

Connected through hyperedge HE-2 (induced by source paper "fog aided wireless networks for content delivery fundamental latency tradeoffs"):
  with members:
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "a learning based approach to caching in heterogenous small cell networks"
    - "fundamental storage latency tradeoff in cache aided mimo interference networks"
    - "fog computing based radio access networks issues and challenges"
    - "a new converse bound for coded caching"
    - "joint optimization of cloud and edge processing for fog radio access networks"
    - "placing dynamic content in caches with small population"
    - "on caching with more users than files"

Connected through hyperedge HE-3 (induced by source paper "cache aided content delivery over erasure broadcast channels"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "noisy broadcast networks with receiver caching"
    - "centralized coded caching for heterogeneous lossy requests"
    - "content delivery in erasure broadcast channels with cache and feedback"
    - "coded caching for a large number of users"
    - "a new converse bound for coded caching"
    - "wireless coded caching a topological perspective"
    - "wireless content caching for small cell and d2d networks"

Connected through hyperedge HE-4 (induced by source paper "characterizing the rate memory tradeoff in cache networks within a factor of 2"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "information theoretic caching the multi user case"
    - "noisy broadcast networks with receiver caching"
    - "coded caching for a large number of users"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "a new converse bound for coded caching"
    - "fundamental limits of caching improved delivery rate cache capacity trade off"
    - "caching and delivery via interference elimination"

Connected through hyperedge HE-5 (induced by source paper "fundamental tradeoff between storage and latency in cache aided wireless interference networks"):
  with members:
    - "degrees of freedom of cache aided wireless interference networks"
    - "wireless caching technical misconceptions and business barriers"
    - "cooperative tx rx caching in interference channels a storage latency tradeoff study"
    - "cloud and cache aided wireless networks fundamental latency trade offs"
    - "cache aided wireless networks tradeoffs between storage and latency"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "fundamental limits of cache aided wireless bc interplay of coded caching and csit feedback"
    - "cache aided interference channels"

Connected through hyperedge HE-6 (induced by source paper "on the dof of two way 2 2 2 relay networks with or without relay caching"):
  with members:
    - "on the capacity regions of two way diamond channels"
    - "beyond one way communication degrees of freedom of multi way relay mimo interference networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "caching eliminates the wireless bottleneck in video aware wireless networks"
    - "design and characterization of a full duplex multiantenna system for wifi networks"
    - "nested lattice codes for gaussian two way relay channels"
    - "lattice coding for the two way two relay channel"
    - "two unicast two hop interference network finite field model"

Connected through hyperedge HE-7 (induced by source paper "interference networks with caches at both ends"):
  with members:
    - "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"
    - "decentralized coded caching with distinct cache capacities"
    - "wireless content caching for small cell and d2d networks"
    - "cache aided wireless networks tradeoffs between storage and latency"
    - "cache aided interference channels"
    - "real interference alignment exploiting the potential of single antenna systems"

Connected through hyperedge HE-8 (induced by source paper "fundamental limits on delivery time in cloud and cache aided heterogeneous networks"):
  with members:
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "degrees of freedom of cache aided wireless interference networks"
    - "coded caching for a large number of users"
    - "fog computing based radio access networks issues and challenges"
    - "joint optimization of cloud and edge processing for fog radio access networks"
    - "backhaul traffic balancing and dynamic content centric clustering for the downlink of fog radio access network"
    - "content centric sparse multicast beamforming for cache enabled cloud ran"
    - "cooperation for interference management a gdof perspective"

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)