human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "on underlay aware self stabilizing overlay networks"):
  Abstract: We present a self-stabilizing protocol for an overlay network that constructs the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted tree. The weight of an overlay edge between two nodes is the weighted length of their shortest path in the tree. We rigorously prove that our protocol works correctly under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes after $\mathcal{O}(N^2)$ asynchronous rounds where $N$ is the number of nodes in the overlay.

Includes members:
  Member "a self stabilizing general de bruijn graph":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "some problems in compact message passing")
  Member "fast and compact self stabilizing verification computation and fault detection of an mst":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "proof labeling schemes broadcast unicast and in between")
  Member "fast self stabilizing minimum spanning tree construction using compact nearest common ancestor labeling scheme":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fast and compact self stabilizing verification computation and fault detection of an mst")
  Member "fast self stabilizing minimum spanning tree construction":
    also connected through other hyperedges:
      (none)
  Member "a new self stabilizing minimum spanning tree construction with loop free property":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fast and compact self stabilizing verification computation and fault detection of an mst")

Question: Please tell me which class the source paper 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)