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: "efficient replication of queued tasks for latency reduction in cloud systems"
  Abstract: In cloud computing systems, assigning a job to multiple servers and waiting for the earliest copy to finish is an effective method to combat the variability in response time of individual servers. Although adding redundant replicas always reduces service time, the total computing time spent per job may be higher, thus increasing waiting time in queue. The total time spent per job is also proportional to the cost of computing resources. We analyze how different redundancy strategies, for eg. number of replicas, and the time when they are issued and canceled, affect the latency and computing cost. We get the insight that the log-concavity of the service time distribution is a key factor in determining whether adding redundancy reduces latency and cost. If the service distribution is log-convex, then adding maximum redundancy reduces both latency and cost. And if it is log-concave, then having fewer replicas and canceling the redundant requests early is more effective.

Connected through hyperedge HE-1 (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"):
  with members:
    - "a geometric view of the service rates of codes problem and its application to the service rate of the first order reed muller codes"
    - "load balancing performance in distributed storage with regular balanced redundancy"
    - "analyzing the download time of availability codes"
    - "service rate region of content access from erasure coded storage"
    - "simplex queues for hot data download"
    - "batch and pir codes and their connections to locally repairable codes"
    - "on distributed storage allocations of large files for maximum service rate"
    - "on the service capacity region of accessing erasure coded content"

Connected through hyperedge HE-2 (induced by source paper "efficient straggler replication in large scale parallel computing"):
  with members:
    - "speeding up distributed machine learning using codes"
    - "rateless codes for near perfect load balancing in distributed matrix vector multiplication"
    - "polynomial codes an optimal design for high dimensional coded matrix multiplication"
    - "short dot computing large linear transforms distributedly using coded short dot products"
    - "revisiting distributed synchronous sgd"
    - "provably delay efficient data retrieving in storage clouds"
    - "using straggler replication to reduce latency in large scale parallel computing"
    - "efficient task replication for fast response times in parallel computation"

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)