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: "bounding the impact of unbounded attacks in stabilization"
  Abstract: Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors. Combining these two properties proved difficult: it is impossible to contain the spatial impact of Byzantine nodes in a self-stabilizing context for global tasks such as tree orientation and tree construction. We present and illustrate a new concept of Byzantine containment in stabilization. Our property, called Strong Stabilization enables to contain the impact of Byzantine nodes if they actually perform too many Byzantine actions. We derive impossibility results for strong stabilization and present strongly stabilizing protocols for tree orientation and tree construction that are optimal with respect to the number of Byzantine nodes that can be tolerated in a self-stabilizing context.

Connected through hyperedge HE-1 (induced by source paper "self stabilizing mobile byzantine tolerant regular register with bounded timestamp"):
  with members:
    - "maximum metric spanning tree made byzantine tolerant"
    - "on byzantine containment properties of the min 1 protocol"

Connected through hyperedge HE-2 (induced by source paper "reliable communication in a dynamic network in the presence of byzantine faults"):
  with members:
    - "a scalable byzantine grid"
    - "iterative approximate byzantine consensus under a generalized fault model"
    - "iterative approximate byzantine consensus in arbitrary directed graphs"
    - "on byzantine broadcast in loosely connected networks"
    - "maximum metric spanning tree made byzantine tolerant"
    - "time varying graphs and dynamic networks"
    - "on byzantine containment properties of the min 1 protocol"
    - "the impact of topology on byzantine containment in stabilization"

Connected through hyperedge HE-3 (induced by source paper "on byzantine broadcast in planar graphs"):
  with members:
    - "a scalable byzantine grid"
    - "on byzantine broadcast in loosely connected networks"
    - "maximum metric spanning tree made byzantine tolerant"
    - "on byzantine containment properties of the min 1 protocol"
    - "the impact of topology on byzantine containment in stabilization"
    - "discovering network topology in the presence of byzantine faults"

Connected through hyperedge HE-4 (induced by source paper "parameterizable byzantine broadcast in loosely connected networks"):
  with members:
    - "a scalable byzantine grid"
    - "on byzantine broadcast in loosely connected networks"
    - "maximum metric spanning tree made byzantine tolerant"
    - "on byzantine containment properties of the min 1 protocol"
    - "the impact of topology on byzantine containment in stabilization"
    - "discovering network topology in the presence of byzantine faults"

Connected through hyperedge HE-5 (induced by source paper "a scalable byzantine grid"):
  with members:
    - "maximum metric spanning tree made byzantine tolerant"
    - "on byzantine containment properties of the min 1 protocol"
    - "the impact of topology on byzantine containment in stabilization"
    - "discovering network topology in the presence of byzantine faults"

Connected through hyperedge HE-6 (induced by source paper "on byzantine broadcast in loosely connected networks"):
  with members:
    - "maximum metric spanning tree made byzantine tolerant"
    - "on byzantine containment properties of the min 1 protocol"
    - "the impact of topology on byzantine containment in stabilization"
    - "discovering network topology in the presence of byzantine faults"

Connected through hyperedge HE-7 (induced by source paper "limiting byzantien influence in multihop asynchronous networks"):
  with members:
    - "on byzantine containment properties of the min 1 protocol"
    - "the impact of topology on byzantine containment in stabilization"

Connected through hyperedge HE-8 (induced by source paper "maximum metric spanning tree made byzantine tolerant"):
  with members:
    - "a uniform self stabilizing minimum diameter spanning tree algorithm"
    - "self stabilization byzantine containment and maximizable metrics necessary conditions"
    - "on byzantine containment properties of the min 1 protocol"
    - "the impact of topology on byzantine containment in stabilization"
    - "a superstabilizing log n approximation algorithm for dynamic steiner trees"

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)