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: "the effect of faults on network expansion"
  Abstract: We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i.e., linear-sized) connected component with approximately the same expansion as the original fault-free network. We use a pruning technique that culls away those parts of the faulty network that have poor expansion. The faults may occur at random or be caused by an adversary. Our techniques apply in either case. In the adversarial setting we prove that for every network with expansion $\alpha,$ a large connected component with basically the same expansion as the original network exists for up to a constant times $\alpha \cdot n$ faults. We show this result is tight in the sense that every graph G of size n and uniform expansion $\alpha(\cdot)$ can be broken into components of size o(n) with $\omega(\alpha(n) \cdot n)$ faults. Unlike the adversarial case, the expansion of a graph gives a very weak bound on its resilience to random faults. While it is the case, as before, that there are networks of uniform expansion $\Omega(1/{\rm log}\, n)$ that are not resilient against a fault probability of a constant times $1/{\log}\, n,$ it is also observed that there are networks of uniform expansion $O(1/\sqrt{n})$ that are resilient against a constant fault probability. Thus, we introduce a different parameter, called the span of a graph, which gives us a more precise handle on the maximum fault probability. We use the span to show the first known results for the effect of random faults on the expansion of d-dimensional meshes.

Connected through hyperedge HE-1 (induced by source paper "storage and search in dynamic peer to peer networks"):
  with members:
    - "stochastic analysis of a churn tolerant structured peer to peer scheme"
    - "fast distributed computation in dynamic networks via random walks"
    - "time varying graphs and dynamic networks"

Connected through hyperedge HE-2 (induced by source paper "contagious sets in expanders"):
  with members:
    - "a proof of alon s second eigenvalue conjecture and related problems"

Connected through hyperedge HE-3 (induced by source paper "distributed agreement in dynamic peer to peer networks"):
  with members:
    - "fast distributed computation in dynamic networks via random walks"
    - "dex self healing expanders"
    - "xheal localized self healing using expanders"
    - "information spreading in dynamic graphs"
    - "faster information dissemination in dynamic networks via network coding"
    - "time varying graphs and dynamic networks"
    - "breaking the o n 2 bit barrier scalable byzantine agreement with an adaptive adversary"
    - "fast distributed algorithms for computing separable 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.DC(Distributed, Parallel, and Cluster Computing)