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 "concurrent regenerating codes and scalable application in network storage"):
  Abstract: To recover simultaneous multiple failures in erasure coded storage systems, Patrick Lee et al introduce concurrent repair based minimal storage regenerating codes to reduce repair traffic. The architecture of this approach is simpler and more practical than that of the cooperative mechanism in non-fully distributed environment, hence this paper unifies such class of regenerating codes as concurrent regenerating codes and further studies its characteristics by analyzing cut-based information flow graph in the multiple-node recovery model. We present a general storage-bandwidth tradeoff and give closed-form expressions for the points on the curve, including concurrent repair mechanism based on minimal bandwidth regenerating codes. We show that the general concurrent regenerating codes can be constructed by reforming the existing single-node regenerating codes or multiplenode cooperative regenerating codes. Moreover, a connection to strong-MDS is also analyzed. On the other respect, the application of RGC is hardly limited to "repairing". It is of great significance for "scaling", a scenario where we need to increase(decrease) nodes to upgrade(degrade) redundancy and reliability. Thus, by clarifying the similarities and differences, we integrate them into a unified model to adjust to the dynamic storage network.

Includes members:
  Member "core augmenting regenerating coding based recovery for single and concurrent failures in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "codes for distributed storage from 3 regular graphs")
  Member "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "enabling optimal access and error correction for the repair of reed solomon codes")
  Member "interference alignment in regenerating codes for distributed storage necessity and code constructions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "exact scalar minimum storage coordinated regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "scalar mscr codes via the product matrix construction")
  Member "cooperative regenerating codes for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")
  Member "repairing multiple failures with coordinated and adaptive regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new constructions of cooperative msr codes reducing node size to exp o n")
  Member "a survey on network codes for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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")

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)