human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "homomorphic self repairing codes for agile maintenance of distributed storage systems"
  Abstract: Distributed data storage systems are essential to deal with the need to store massive volumes of data. In order to make such a system fault-tolerant, some form of redundancy becomes crucial, incurring various overheads - most prominently in terms of storage space and maintenance bandwidth requirements. Erasure codes, originally designed for communication over lossy channels, provide a storage efficient alternative to replication based redundancy, however entailing high communication overhead for maintenance, when some of the encoded fragments need to be replenished in news ones after failure of some storage devices. We propose as an alternative a new family of erasure codes called self-repairing codes (SRC) taking into account the peculiarities of distributed storage systems, specifically the maintenance process. SRC has the following salient features: (a) encoded fragments can be repaired directly from other subsets of encoded fragments by downloading less data than the size of the complete object, ensuring that (b) a fragment is repaired from a fixed number of encoded fragments, the number depending only on how many encoded blocks are missing and independent of which specific blocks are missing. This paper lays the foundations by defining the novel self-repairing codes, elaborating why the defined characteristics are desirable for distributed storage systems. Then homomorphic self-repairing codes (HSRC) are proposed as a concrete instance, whose various aspects and properties are studied and compared - quantitatively or qualitatively with respect to other codes including traditional erasure codes as well as other recent codes designed specifically for storage applications.

Connected through hyperedge HE-1 (induced by source paper "optimal locally repairable and secure codes for distributed storage systems"):
  with members:
    - "zigzag codes mds array codes with optimal rebuilding"
    - "data secrecy in distributed storage systems under exact repair"
    - "explicit mbr all symbol locality codes"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "regenerating codes for errors and erasures in distributed storage"
    - "codes with local regeneration"
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "error resilience in distributed storage via rank metric codes"

Connected through hyperedge HE-2 (induced by source paper "optimal locally repairable codes via rank metric codes"):
  with members:
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "xoring elephants novel erasure codes for big data"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "storage codes coding rate and repair locality"
    - "codes with local regeneration"
    - "on locality in distributed storage systems"
    - "error resilience in distributed storage via rank metric codes"
    - "optimal linear codes with a local error correction property"

Connected through hyperedge HE-3 (induced by source paper "error resilience in distributed storage via rank metric codes"):
  with members:
    - "zigzag codes mds array codes with optimal rebuilding"
    - "regenerating codes for errors and erasures in distributed storage"
    - "optimal linear codes with a local error correction property"
    - "locally repairable codes"
    - "on the locality of codeword symbols"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "information theoretically secure regenerating codes for distributed storage"
    - "byzantine fault tolerance of regenerating codes"

Connected through hyperedge HE-4 (induced by source paper "distributed storage codes with repair by transfer and nonachievability of interior points on the storage bandwidth tradeoff"):
  with members:
    - "interference alignment in regenerating codes for distributed storage necessity and code constructions"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "a construction of systematic mds codes with minimum repair bandwidth"
    - "enabling node repair in any erasure code for distributed storage"
    - "distributed data storage with minimum storage regenerating codes exact and functional repair are asymptotically equally efficient"
    - "self repairing homomorphic codes for distributed storage systems"
    - "double circulant minimum storage regenerating codes"
    - "on the existence of optimal exact repair mds codes for distributed storage"

Connected through hyperedge HE-5 (induced by source paper "on locality in distributed storage systems"):
  with members:
    - "error resilience in distributed storage via rank metric codes"
    - "optimal linear codes with a local error correction property"
    - "self repairing codes for distributed storage a projective geometric construction"
    - "on the locality of codeword symbols"
    - "network coding for distributed storage systems"

Connected through hyperedge HE-6 (induced by source paper "an overview of codes tailor made for better repairability in networked distributed storage systems"):
  with members:
    - "storage codes coding rate and repair locality"
    - "on locality in distributed storage systems"
    - "an empirical study of the repair performance of novel coding schemes for networked distributed storage systems"
    - "cooperative regenerating codes"
    - "mds array codes with optimal rebuilding"
    - "self repairing codes for distributed storage a projective geometric construction"
    - "on the locality of codeword symbols"
    - "cooperative regenerating codes for distributed storage systems"

Question: Please tell me which class the center node 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)