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: "fast self stabilizing minimum spanning tree construction using compact nearest common ancestor labeling scheme"
  Abstract: We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is $O(\log^2n)$ bits and it converges in $O(n^2)$ rounds. Thus, this algorithm improves the convergence time of previously known self-stabilizing asynchronous MST algorithms by a multiplicative factor $\Theta(n)$, to the price of increasing the best known space complexity by a factor $O(\log n)$. The main ingredient used in our algorithm is the design, for the first time in self-stabilizing settings, of a labeling scheme for computing the nearest common ancestor with only $O(\log^2n)$ bits.

Connected through hyperedge HE-1 (induced by source paper "on underlay aware self stabilizing overlay networks"):
  with members:
    - "a self stabilizing general de bruijn graph"
    - "fast and compact self stabilizing verification computation and fault detection of an mst"
    - "fast self stabilizing minimum spanning tree construction"
    - "a new self stabilizing minimum spanning tree construction with loop free property"

Connected through hyperedge HE-2 (induced by source paper "fast and compact self stabilizing verification computation and fault detection of an mst"):
  with members:
    - "randomized distributed decision"
    - "on the impact of identifiers on local decision"
    - "distributed verification and hardness of distributed approximation"
    - "local distributed decision"
    - "a new self stabilizing minimum spanning tree construction with loop free property"

Connected through hyperedge HE-3 (induced by source paper "polynomial time space optimal silent self stabilizing minimum degree spanning tree construction"):
  with members:
    - "fast and compact self stabilizing verification computation and fault detection of an mst"

Connected through hyperedge HE-4 (induced by source paper "near optimal labeling schemes for nearest common ancestors"):
  with members:
    - "labeling schemes with queries"

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)