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: "circle formation of weak robots and lyndon words"
  Abstract: A Lyndon word is a non-empty word strictly smaller in the lexicographic order than any of its suffixes, except itself and the empty word. In this paper, we show how Lyndon words can be used in the distributed control of a set of n weak mobile robots. By weak, we mean that the robots are anonymous, memoryless, without any common sense of direction, and unable to communicate in an other way than observation. An efficient and simple deterministic protocol to form a regular n-gon is presented and proven for n prime.

Connected through hyperedge HE-1 (induced by source paper "infinite grid exploration by disoriented robots"):
  with members:
    - "arbitrary pattern formation on infinite grid by asynchronous oblivious robots"
    - "mutual visibility by luminous robots without collisions"
    - "optimal grid exploration by asynchronous oblivious robots"

Connected through hyperedge HE-2 (induced by source paper "the runs theorem"):
  with members:
    - "computing runs on a general alphabet"
    - "internal pattern matching queries in a text and applications"
    - "lyndon words and short superstrings"
    - "on the maximal sum of exponents of runs in a string"
    - "on bijective variants of the burrows wheeler transform"
    - "new lower bounds for the maximum number of runs in a string"

Connected through hyperedge HE-3 (induced by source paper "on the size of lempel ziv and lyndon factorizations"):
  with members:
    - "diverse palindromic factorization is np complete"
    - "a bijective string sorting transform"

Connected through hyperedge HE-4 (induced by source paper "deterministic leader election among disoriented anonymous sensors"):
  with members:
    - "leader election problem versus pattern formation problem"
    - "circle formation of weak mobile robots"

Connected through hyperedge HE-5 (induced by source paper "emergent velocity agreement in robot networks"):
  with members:
    - "leader election problem versus pattern formation problem"

Connected through hyperedge HE-6 (induced by source paper "scatter of weak robots"):
  with members:
    - "circle formation of weak mobile robots"

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)