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: "liquid cloud storage"
  Abstract: A liquid system provides durable object storage based on spreading redundantly generated data across a network of hundreds to thousands of potentially unreliable storage nodes. A liquid system uses a combination of a large code, lazy repair, and a flow storage organization. We show that a liquid system can be operated to enable flexible and essentially optimal combinations of storage durability, storage overhead, repair bandwidth usage, and access performance.

Connected through hyperedge HE-1 (induced by source paper "repair rate lower bounds for distributed storage"):
  with members:
    - "maximally recoverable codes for grid like topologies"
    - "xoring elephants novel erasure codes for big data"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-2 (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"
    - "ldpc code design for distributed storage balancing repair bandwidth reliability and storage overhead"
    - "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-3 (induced by source paper "scdp systematic rateless coding for efficient data transport in data centres"):
  with members:
    - "elmo source routed multicast for cloud services"
    - "dual structure data center multicast using software defined networking"
    - "repflow minimizing flow completion times with replicated flows in data centers"
    - "jellyfish networking data centers randomly"

Connected through hyperedge HE-4 (induced by source paper "capacity of dynamical storage systems"):
  with members:
    - "capacity of clustered distributed storage"
    - "coding for fast content download"
    - "repairing multiple failures with coordinated and adaptive regenerating codes"
    - "cost bandwidth tradeoff in distributed storage systems"

Connected through hyperedge HE-5 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions"):
  with members:
    - "explicit msr codes with optimal access optimal sub packetization and small field size for d k 1 k 2 k 3"
    - "a tight rate bound and a matching construction for locally recoverable codes with sequential recovery from any number of multiple erasures"
    - "optimal lrc codes for all lenghts n q"
    - "optimal locally repairable codes of distance 3 and 4 via cyclic codes"
    - "on optimal ternary locally repairable codes"
    - "rate optimal binary linear locally repairable codes with small availability"
    - "bounds and constructions of codes with all symbol locality and availability"
    - "a study on the impact of locality in the decoding of binary cyclic codes"

Connected through hyperedge HE-6 (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"
    - "asymptotically mds array bp xor codes"
    - "ldpc code design for distributed storage balancing repair bandwidth reliability and storage overhead"
    - "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)