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 "storage capacity of repairable networks"):
  Abstract: In this paper, we introduce a model of a distributed storage system that is locally recoverable from any single server failure. Unlike the usual local recovery model of codes for distributed storage, this model accounts for the fact that each server or storage node in a network is connectable to only some, and not all other, nodes. This may happen for reasons such as physical separation, inhomogeneity in storage platforms, and so forth. We estimate the storage capacity of both undirected and directed networks under this model and propose some constructive schemes. From a coding theory point of view, we show that this model is approximately dual of the well-studied index coding problem. Furthermore, in this paper, we extend the above model to handle multiple server failures. Among other results, we provide an upper bound on the minimum pairwise distance of a set of words that can be stored in a graph with the local repair guarantee. The well-known impossibility bounds on the distance of locally recoverable codes follow from our result.

Includes members:
  Member "on a duality between recoverable distributed storage and index coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "embedded index coding")
  Member "a family of optimal locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a locality based approach for coded computation")
  Member "bounding multiple unicasts through index coding and locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "embedded index coding")
  Member "optimal locally repairable codes via rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "an upper bound on the size of locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complete hierarchical locality of the punctured simplex code")
  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 "codes with local regeneration":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "locally recoverable j affine variety 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)