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: "multi library coded caching"
  Abstract: We study the problem of coded caching when the server has access to several libraries and each user makes independent requests from every library. The single-library scenario has been well studied and it has been proved that coded caching can significantly improve the delivery rate compared to uncoded caching. In this work we show that when all the libraries have the same number of files, memory-sharing is optimal and the delivery rate cannot be improved via coding across files from different libraries. In this setting, the optimal memory-sharing strategy is one that divides the cache of each user proportional to the size of the files in different libraries. As for the general case, when the number of files in different libraries are arbitrary, we propose an inner-bound based on memory-sharing and an outer-bound based on concatenation of files from different libraries.

Connected through hyperedge HE-1 (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"
    - "fundamental limits of cache aided interference management"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "cloud and cache aided wireless networks fundamental latency trade offs"):
  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"
    - "fog computing based radio access networks issues and challenges"
    - "a new converse bound for coded caching"
    - "placing dynamic content in caches with small population"
    - "on caching with more users than files"
    - "content centric sparse multicast beamforming for cache enabled cloud ran"
    - "critical database size for effective caching"

Connected through hyperedge HE-3 (induced by source paper "wireless caching technical misconceptions and business barriers"):
  with members:
    - "cooperative caching and transmission design in cluster centric small cell networks"
    - "placing dynamic content in caches with small population"
    - "content centric sparse multicast beamforming for cache enabled cloud ran"
    - "analysis on cache enabled wireless heterogeneous networks"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "optimizing mds codes for caching at the edge"
    - "optimal geographic caching in cellular networks"
    - "a transfer learning approach for cache enabled wireless networks"

Connected through hyperedge HE-4 (induced by source paper "wireless coded caching a topological perspective"):
  with members:
    - "information theoretic caching the multi user case"
    - "noisy broadcast networks with receiver caching"
    - "fundamental limits of cache aided interference management"
    - "complete interference mitigation through receiver caching in wyner s networks"
    - "effect of number of users in multi level coded caching"
    - "cache enabled broadcast packet erasure channels with state feedback"
    - "cache aided interference channels"
    - "improved lower bounds for coded 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)