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: "ldpc code design for distributed storage balancing repair bandwidth reliability and storage overhead"
  Abstract: Distributed storage systems suffer from significant repair traffic generated due to frequent storage node failures. This paper shows that properly designed low-density parity-check (LDPC) codes can substantially reduce the amount of required block downloads for repair thanks to the sparse nature of their factor graph representation. In particular, with a careful construction of the factor graph, both low repair-bandwidth and high reliability can be achieved for a given code rate. First, a formula for the average repair bandwidth of LDPC codes is developed. This formula is then used to establish that the minimum repair bandwidth can be achieved by forcing a regular check node degree in the factor graph. Moreover, it is shown that given a fixed code rate, the variable node degree should also be regular to yield minimum repair bandwidth, under some reasonable minimum variable node degree constraint. It is also shown that for a given repair-bandwidth requirement, LDPC codes can yield substantially higher reliability than currently utilized Reed-Solomon (RS) codes. Our reliability analysis is based on a formulation of the general equation for the mean-time-to-data-loss (MTTDL) associated with LDPC codes. The formulation reveals that the stopping number is closely related to the MTTDL. It is further shown that LDPC codes can be designed such that a small loss of repair-bandwidth optimality may be traded for a large improvement in erasure-correction capability and thus the MTTDL.

Connected through hyperedge HE-1 (induced by source paper "babel storage uncoordinated content delivery from multiple coded storage systems"):
  with members:
    - "mds coded distributed caching for low delay wireless content delivery"
    - "liquid cloud storage"
    - "capacity bounds for distributed storage"
    - "cache aided interference channels"
    - "stair codes a general family of erasure codes for tolerating device and sector failures"
    - "xoring elephants novel erasure codes for big data"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "locally repairable codes"

Connected through hyperedge HE-2 (induced by source paper "network traffic driven storage repair"):
  with members:
    - "repair duality with locally repairable and locally regenerating codes"
    - "product matrix msr codes with bandwidth adaptive exact repair"
    - "improved schemes for asymptotically optimal repair of mds codes"
    - "codes with unequal locality"
    - "minimum storage regenerating codes for all parameters"
    - "general sub packetized access optimal regenerating codes"
    - "hashtag erasure codes from theory to practice"
    - "balanced locally repairable codes"

Connected through hyperedge HE-3 (induced by source paper "a reliability model for dependent and distributed mds disk array units"):
  with members:
    - "founsure 1 0 an erasure code library with efficient repair and update features"
    - "liquid cloud storage"
    - "asymptotically mds array bp xor codes"
    - "distributed data storage systems with opportunistic repair"
    - "redundancy and aging of efficient multidimensional mds parity protected distributed storage systems"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"

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)