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 "double circulant minimum storage regenerating codes"):
  Abstract: Abstract—Storage optimization in distributed environments isa major concern when talking about availability in this kind ofschemes. Although replication is the most used option, erasurecoding is a more optimized one.However, erasure coding uses a lot of bandwidth to replaceone node. In a dynamic scheme, where nodes enter and leavethe system frequently, bandwidth use could be an importantdrawback.Regenerating Codes introduced by Dimakis et al. minimizethe code repair problem by applying Network Coding to thedistributed storage scheme. However ﬁnding the coefﬁcients forthe linear combinations used to replace a node is not easy,specially for the systematic case, and must be calculated for eachnew node fail.For the special case when the dimension k and the redundancyn k of the system are the same, and the number of nodesparticipating in the regeneration phase is d = k+1, we purposea new optimal family of Minimum Storage Regenerating codeswhere coefﬁcients are precalculated and node regeneration hasfew computational requirements.This new family is connected to classical Double circulant codeswhich are a special case of Quasi-cyclic codes.

Includes members:
  Member "searching for minimum storage regenerating codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cascade codes for distributed storage systems")
  Member "network coding for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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.DC(Distributed, Parallel, and Cluster Computing)