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 "modified index coding increases capacity of information centric networks"):
  Abstract: The Index Coding (IC) problem studies transmission policies when the source node broadcasts encoded data to users with side information. This paper extends the index coding problem to the case when the source node can reach users through multi-hop communications. The new approach is called Modified Index Coding (MIC) which can be applied to both wireless and wired networks. We demonstrate the benefits of our approach by applying MIC to Information-Centric Networks (ICN). We demonstrate that the combination of ICN and MIC requires a hybrid caching scheme that includes caching at the routers and the nodes to support two different goals. The caching is used at the routers to place contents closer to the users when requested (similar to ICN approach) and is used at the users as side information. Our analysis demonstrates that order optimal capacity gains can be achieved in some capacity regions, i.e., capacity gain grows with the number of nodes in the network by using MIC. We have computed the capacity gains by counting either the number of disjoint cycles or cliques in the dependency graph. It was also shown analytically that near edge caching by routers in ICN achieves close to optimal capacity. Simulation results compare the capacity improvement to the traditional ICN architecture.

Includes members:
  Member "coded caching for delay sensitive content":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "decentralized asynchronous coded caching design and performance analysis in fog radio access networks")
  Member "fundamental limits of caching in wireless d2d networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "online coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "five disruptive technology directions for 5g":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deep learning enabled optimization of downlink beamforming under per antenna power constraints algorithms and experimental demonstration")
  Member "an equivalence between network coding and index coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "embedded index coding")
  Member "dynamic index coding for wireless broadcast networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "embedded index coding")
  Member "on linear index coding for random graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "index codes with minimum locality for three receiver unicast problems")
  Member "femtocaching wireless video content delivery through distributed caching helpers":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "cache allocations for consecutive requests of categorized contents service provider s perspective")

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)