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: "contrasting effects of replication in parallel systems from overload to underload and back"
  Abstract: Task replication has recently been advocated as a practical solution to reduce latencies in parallel systems. In addition to several convincing empirical studies, some others provide analytical results, yet under some strong assumptions such as Poisson arrivals, exponential service times, or independent service times of the replicas themselves, which may lend themselves to some contrasting and perhaps contriving behavior. For instance, under the second assumption, an overloaded system can be stabilized by a replication factor, but can be sent back in overload through further replication. In turn, under the third assumption, strictly larger stability regions of replication systems do not necessarily imply smaller delays. #R##N#Motivated by the need to dispense with such common and restricting assumptions, which may additionally cause unexpected behavior, we develop a unified and general theoretical framework to compute tight bounds on the distribution of response times in general replication systems. These results immediately lend themselves to the optimal number of replicas minimizing response time quantiles, depending on the parameters of the system (e.g., the degree of correlation amongst replicas). As a concrete application of our framework, we design a novel replication policy which can improve the stability region of classical fork-join queueing systems by $\mathcal{O}(\ln K)$, in the number of servers $K$.

Connected through hyperedge HE-1 (induced by source paper "delay optimal policies in partial fork join systems with redundancy and random slowdowns"):
  with members:
    - "mds coding is better than replication for job completion times"
    - "delay comparison of delivery and coding policies in data clusters"
    - "on delay optimal scheduling in queueing systems with replications"
    - "efficient redundancy techniques for latency reduction in cloud systems"
    - "using straggler replication to reduce latency in large scale parallel computing"
    - "efficient task replication for fast response times in parallel computation"
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "when do redundant requests reduce latency"

Connected through hyperedge HE-2 (induced by source paper "task replication for deadline constrained vehicular cloud computing optimal policy performance analysis and implications on road traffic"):
  with members:
    - "energy efficient resource allocation for mobile edge computation offloading"
    - "provably delay efficient data retrieving in storage clouds"
    - "using straggler replication to reduce latency in large scale parallel computing"
    - "a high reliability asymptotic approach for packet inter delivery time optimization in cyber physical systems"
    - "when do redundant requests reduce latency"
    - "on myopic sensing for multi channel opportunistic access structure optimality and performance"
    - "femtocell networks a survey"

Connected through hyperedge HE-3 (induced by source paper "non asymptotic delay bounds for multi server systems with synchronization constraints"):
  with members:
    - "non asymptotic delay bounds for k l fork join systems and multi stage fork join networks"
    - "network calculus for parallel processing"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "an end to end probabilistic network calculus with moment generating functions"

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.PF(Performance)