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 "improved singleton type bounds for locally repairable codes"):
  Abstract: Locally repairable codes (LRCs) are error correcting codes used in distributed data storage. Besides a global level, they enable errors to be corrected locally, reducing the need for communication between storage nodes. There is a close connection between almost affine LRCs and matroid theory which can be utilized to construct good LRCs and derive bounds on their performance. #R##N#This article presents two improvements to such results in [T. Westerb\"ack et al., "On the Combinatorics of Locally Repairable Codes", Arxiv: 1501.00153]: The class of parameters $(n,k,d,r,\delta)$ for which there exists a matroid achieving the generalized Singleton bound for LRCs, is expanded. Also, an improved lower bound is given for $d_{\rm{max}}(n,k,r,\delta)$, the maximal achievable minimum distance $d$ that a matroid with parameters $(n,k,r,\delta)$ can have. This bound is proved to be optimal for the main class of matroids used to derive the existence bounds in [T. Westerb\"ack et al., "On the Combinatorics of Locally Repairable Codes", Arxiv: 1501.00153] and in this article. The results obtained directly translate to similar results on LRCs using the connection between them and matroids.

Includes members:
  Member "applications of polymatroid theory to distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "batch and pir codes and their connections to locally repairable codes")
  Member "locally repairable codes and matroid theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a connection between locally repairable codes and exact regenerating codes")
  Member "a family of optimal locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a locality based approach for coded computation")
  Member "optimal locally repairable linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "optimal locally repairable codes via rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "optimal locally repairable codes and connections to matroid theory":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "optimal linear codes with a local error correction property":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a locality based approach for coded computation")

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)