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 "deterministic leader election in programmable matter"):
  Abstract: Addressing a fundamental problem in programmable matter, we present the first deterministic algorithm to elect a unique leader in a system of connected amoebots assuming only that amoebots are initially contracted. Previous algorithms either used randomization, made various assumptions (shapes with no holes, or known shared chirality), or elected several co-leaders in some cases. #R##N#Some of the building blocks we introduce in constructing the algorithm are of interest by themselves, especially the procedure we present for reaching common chirality among the amoebots. Given the leader election and the chirality agreement building block, it is known that various tasks in programmable matter can be performed or improved. #R##N#The main idea of the new algorithm is the usage of the ability of the amoebots to move, which previous leader election algorithms have not used.

Includes members:
  Member "distributed leader election and computation of local identifiers for programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the convergence of network systems")
  Member "a stochastic approach to shortcut bridging in programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "on the runtime of universal coating for programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "convex hull formation for programmable matter":
    also connected through other hyperedges:
      (none)
  Member "line recovery by programmable particles":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "shape formation by programmable particles":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mobile ram and shape formation by programmable particles")
  Member "improved leader election for self organizing programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "simulation of programmable matter systems using active tile based self assembly")
  Member "universal coating for programmable matter":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "mobile ram and shape formation by programmable particles")

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)