human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "simplifying wireless social caching via network coding"):
  Abstract: Social groups open up the opportunity for a new form of caching. This paper investigates how a social group of users can jointly optimize bandwidth usage, by each caching network-coded parts of the data demand, and then opportunistically share these parts among themselves upon meeting. First, the problem is formulated as a linear program (LP) with exponential complexity in the number of users. Then, a heuristic algorithm is proposed, which is inspired by the bipartite set-cover problem and operates in polynomial time. For some scenarios, a worst-case performance guarantee of the heuristic with respect to the optimal LP solution is proved. Finally, the performance of the algorithm is assessed using real-world mobility traces synthesized using the SWIM model and from the MIT Reality Mining project data set. The proposed heuristic offers bandwidth savings up to 65% for a waiting time of 30 minutes and up to 28% performance gains with respect to the alternative solutions. These benefits make the algorithm a feasible candidate solution for bandwidth savings.

Includes members:
  Member "optimizing mds coded caching in wireless networks with device to device communication":
    also connected through other hyperedges:
      - 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")
  Member "wireless device to device caching networks basic principles and system performance":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "optimal storage allocation for wireless cloud caching systems with a limited sum storage capacity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mobility aware content placement for device to device caching systems")
  Member "decentralized coded caching with distinct cache capacities":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an approximation algorithm for optimal clique cover delivery in coded caching")
  Member "order optimal rate of caching and coded multicasting with random demands":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an index coding approach to caching with uncoded cache placement")
  Member "multi level coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "content caching and delivery in wireless radio access networks")
  Member "decentralized coded caching attains order optimal memory rate tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "fundamental limits of caching":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

Question: Please tell me which class the source paper 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)