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 "locality in index coding for large min rank"):
  Abstract: An index code is said to be locally decodable if each receiver can decode its demand using its side information and by querying only a subset of the transmitted codeword symbols instead of observing the entire codeword. Local decodability can be a beneficial feature in some communication scenarios, such as when the receivers can afford to listen to only a part of the transmissions because of limited availability of power. The locality of an index code is the ratio of the maximum number of codeword symbols queried by a receiver to the message length. In this paper we analyze the optimum locality of linear codes for the family of index coding problems whose min-rank is one less than the number of receivers in the network. We first derive the optimal trade-off between the index coding rate and locality with vector linear coding when the side information graph is a directed cycle. We then provide the optimal trade-off achieved by scalar linear coding for a larger family of problems, viz., problems where the min-rank is only one less than the number of receivers. While the arguments used for achievability are based on known coding techniques, the converse arguments rely on new results on the structure of locally decodable index codes.

Includes members:
  Member "privacy in index coding k limited access schemes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "index codes with minimum locality for three receiver unicast problems")
  Member "on locally decodable index codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "embedded index coding")
  Member "on a duality between recoverable distributed storage and index coding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "embedded index coding")
  Member "bounding multiple unicasts through index coding and locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "embedded index coding")
  Member "fundamental limits of caching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "an equivalence between network coding and index coding":
    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 "on the security of index coding with side information":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "secure decentralized pliable index coding")

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)