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 "capacity of cellular networks with femtocache"):
  Abstract: The capacity of next generation of cellular networks using femtocaches is studied when multihop communications and decentralized cache placement are considered. We show that the storage capability of future network User Terminals (UT) can be effectively used to increase the capacity in random decentralized uncoded caching. We further propose a random decentralized coded caching scheme which achieves higher capacity results than the random decentralized uncoded caching. The result shows that coded caching which is suitable for systems with limited storage capabilities can improve the capacity of cellular networks by a factor of log(n) where n is the number of nodes served by the femtocache.

Includes members:
  Member "multihop caching aided coded multicasting for the next generation of cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "full characterization of optimal uncoded placement for the structured clique cover delivery of nonuniform demands")
  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 "caching in wireless multihop device to device networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cache placement in two tier hetnets with limited storage capacity cache or buffer")
  Member "index coding with coded side information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "code equivalences between network codes with link errors and index codes with side information errors")
  Member "hierarchical coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "modified index coding increases capacity of information centric networks":
    also connected through other hyperedges:
      (none)
  Member "fundamental limits of caching in wireless d2d networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "fundamental limits of caching improved bounds for small buffer users":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an index coding approach to caching with uncoded cache placement")

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)