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: "leader election problem versus pattern formation problem"
  Abstract: Leader election and arbitrary pattern formation are funda- mental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the leader. The latter aims in arranging the robots in the plane to form any given pattern. The solv- ability of both these tasks turns out to be necessary in order to achieve more complex tasks. In this paper, we study the relationship between these two tasks in a model, called CORDA, wherein the robots are weak in several aspects. In particular, they are fully asynchronous and they have no direct means of communication. They cannot remember any previous observation nor computation performed in any previous step. Such robots are said to be oblivious. The robots are also uniform and anonymous, i.e, they all have the same program using no global parameter (such as an identity) allowing to differentiate any of them. Moreover, we assume that none of them share any kind of common coordinate mechanism or common sense of direction and we discuss the influence of a common handedness (i.e., chirality). In such a system, Flochini et al. proved in [11] that it is possible to elect a leader for n \geq 3 robots if it is possible to form any pattern for n \geq 3. In this paper, we show that the converse is true for n \geq 4 when the robots share a common handedness and for n \geq 5 when they do not. Thus, we deduce that with chirality (resp. without chirality) both problems are equivalent for n \geq 4 (resp. n \geq 5) in CORDA.

Connected through hyperedge HE-1 (induced by source paper "coding theory for noiseless channels realized by anonymous oblivious mobile robots"):
  with members:
    - "exploration of finite 2d square grid by a metamorphic robotic system"
    - "turingmobile a turing machine of oblivious mobile robots with limited visibility and its applications"
    - "plane formation by synchronous mobile robots in the three dimensional euclidean space"
    - "getting close without touching near gathering for autonomous mobile robots"
    - "optimal grid exploration by asynchronous oblivious robots"

Connected through hyperedge HE-2 (induced by source paper "arbitrary pattern formation by asynchronous opaque robots with lights"):
  with members:
    - "arbitrary pattern formation on infinite grid by asynchronous oblivious robots"
    - "asynchronous arbitrary pattern formation the effects of a rigorous approach"
    - "mutual visibility by luminous robots without collisions"
    - "algebraic methods in the congested clique"
    - "a distributed algorithm for gathering many fat mobile robots in the plane"

Connected through hyperedge HE-3 (induced by source paper "arbitrary pattern formation by opaque fat robots with lights"):
  with members:
    - "arbitrary pattern formation by asynchronous opaque robots with lights"
    - "arbitrary pattern formation on infinite grid by asynchronous oblivious robots"
    - "asynchronous arbitrary pattern formation the effects of a rigorous approach"
    - "a distributed algorithm for gathering many fat mobile robots in the plane"

Connected through hyperedge HE-4 (induced by source paper "arbitrary pattern formation by asynchronous opaque robots"):
  with members:
    - "mutual visibility by luminous robots without collisions"
    - "a distributed algorithm for gathering many fat mobile robots in the plane"

Connected through hyperedge HE-5 (induced by source paper "arbitrary pattern formation on infinite grid by asynchronous oblivious robots"):
  with members:
    - "arbitrary pattern formation by asynchronous opaque robots with lights"
    - "plane formation by synchronous mobile robots without chirality"
    - "asynchronous arbitrary pattern formation the effects of a rigorous approach"
    - "plane formation by synchronous mobile robots in the three dimensional euclidean space"
    - "distributed computing by mobile robots uniform circle formation"
    - "the gathering problem for two oblivious robots with unreliable compasses"

Connected through hyperedge HE-6 (induced by source paper "asynchronous pattern formation the effects of a rigorous approach"):
  with members:
    - "square formation by asynchronous oblivious robots"
    - "probabilistic asynchronous arbitrary pattern formation"
    - "plane formation by synchronous mobile robots in the three dimensional euclidean space"
    - "on the synthesis of mobile robots algorithms the case of ring gathering"
    - "pattern formation for asynchronous robots without agreement in chirality"
    - "distributed computing by mobile robots uniform circle formation"
    - "distributed computing by mobile robots solving the uniform circle formation problem"

Connected through hyperedge HE-7 (induced by source paper "asynchronous arbitrary pattern formation the effects of a rigorous approach"):
  with members:
    - "square formation by asynchronous oblivious robots"
    - "probabilistic asynchronous arbitrary pattern formation"
    - "plane formation by synchronous mobile robots in the three dimensional euclidean space"
    - "on the synthesis of mobile robots algorithms the case of ring gathering"
    - "pattern formation for asynchronous robots without agreement in chirality"
    - "distributed computing by mobile robots uniform circle formation"

Connected through hyperedge HE-8 (induced by source paper "getting close without touching near gathering for autonomous mobile robots"):
  with members:
    - "a distributed algorithm for gathering many fat mobile robots in the plane"
    - "multirobot rendezvous with visibility sensors in nonconvex environments"
    - "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)