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 "characterizations and construction methods for linear functional repair storage codes"):
  Abstract: We present a precise characterization of linear functional-repair storage codes in terms of {\em admissible states/}, with each state made up from a collection of vector spaces over some fixed finite field. To illustrate the usefulness of our characterization, we provide several applications. We first describe a simple construction of functional-repair storage codes for a family of code parameters meeting the cutset bound outside the MBR and MSR points; these codes are conjectured to have optimal rate with respect to their repair locality. Then, we employ our characterization to develop a construction method to obtain functional repair codes for given parameters using symmetry groups, which can be used both to find new codes and to improve known ones. As an example of the latter use, we describe a beautiful functional-repair storage code that was found by this method, with parameters belonging to the family investigated earlier, which can be specified in terms of only eight different vector spaces.

Includes members:
  Member "storage codes coding rate and repair locality":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "locality and availability of array codes constructed from subspaces")
  Member "analysis and construction of functional regenerating codes with uncoded repair for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on universally good flower codes")
  Member "a survey on network codes for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes")
  Member "searching for minimum storage regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cascade codes for distributed storage systems")
  Member "network coding for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")

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)