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 upper bounds on systematic length for linear minimum storage regenerating codes"):
  Abstract: In this paper, we revisit the problem of finding the longest systematic-length $k$ for a linear minimum storage regenerating (MSR) code with optimal repair of only systematic part, for a given per-node storage capacity $l$ and an arbitrary number of parity nodes $r$. We study the problem by following a geometric analysis of linear subspaces and operators. First, a simple quadratic bound is given, which implies that $k=r+2$ is the largest number of systematic nodes in the \emph{scalar} scenario. Second, an $r$-based-log bound is derived, which is superior to the upper bound on log-base $2$ in the prior work. Finally, an explicit upper bound depending on the value of $\frac{r^2}{l}$ is introduced, which further extends the corresponding result in the literature.

Includes members:
  Member "progress on high rate msr codes enabling arbitrary number of helper nodes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cascade codes for distributed storage systems")
  Member "minimum storage regenerating codes for all parameters":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "explicit constructions of optimal access mds codes with nearly optimal sub packetization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "on secrecy capacity of minimum storage regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "achieving secrecy capacity of minimum storage regenerating codes for all feasible n k d parameter values")
  Member "a high rate msr code with polynomial sub packetization level":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cascade codes for distributed storage systems")
  Member "a framework of constructions of minimal storage regenerating codes with the optimal access update property":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a systematic construction of mds codes with small sub packetization level and near optimal repair bandwidth")
  Member "layered exact repair regenerating codes via embedded error correction and block designs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cascade codes for distributed storage systems")
  Member "an alternate construction of an access optimal regenerating code with optimal sub packetization level":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "code constructions for distributed storage with low repair bandwidth and low repair complexity")

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)