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 "index coding problem with side information repositories"):
  Abstract: To tackle the expected enormous increase in mobile video traffic in cellular networks, an architecture involving a base station along with caching femto stations (referred to as helpers), storing popular files near users, has been proposed [1]. The primary benefit of caching is the enormous increase in downloading rate when a popular file is available at helpers near a user requesting that file. In this work, we explore a secondary benefit of caching in this architecture through the lens of index coding. We assume a system with n users and constant number of caching helpers. Only helpers store files, i.e. have side information. We investigate the following scenario: Each user requests a distinct file that is not found in the set of helpers nearby. Users are served coded packets (through an index code) by an omniscient base station. Every user decodes its desired packet from the coded packets and the side information packets from helpers nearby. We assume that users can obtain any file stored in their neighboring helpers without incurring transmission costs. With respect to the index code employed, we investigate two achievable schemes: 1) XOR coloring based on coloring of the side information graph associated with the problem and 2)Vector XOR coloring based on fractional coloring of the side information graph. We show that the general problem reduces to a canonical problem where every user is connected to exactly one helper under some topological constraints. For the canonical problem, with constant number of helpers (k), we show that the complexity of computing the best XOR/vector XOR coloring schemes are polynomial in the number of users n. The result exploits a special complete bi-partite structure that the side information graphs exhibit for any finite k.

Includes members:
  Member "fundamental limits of caching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "index coding an interference alignment perspective":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "optimal index codes for a class of multicast networks with receiver side information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cooperative multi sender index coding")
  Member "optimal index codes with near extreme rates":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an optimal linear error correcting delivery scheme for coded caching with shared caches")
  Member "dynamic index coding for wireless broadcast networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "embedded index coding")
  Member "on linear index coding for random graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "cache allocations for consecutive requests of categorized contents service provider s perspective")
  Member "linear index coding via semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the generalized orthogonality dimension of generalized kneser graphs bounds and applications")

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)