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: "asynchronous arbitrary pattern formation the effects of a rigorous approach"
  Abstract: Given any multiset F of points in the Euclidean plane and a set R of robots such that |R|=|F|, the Arbitrary Pattern Formation (APF) problem asks for a distributed algorithm that moves robots so as to reach a configuration similar to F. Similarity means that robots must be disposed as F regardless of translations, rotations, reflections, uniform scalings. Initially, each robot occupies a distinct position. When active, a robot operates in standard LCM cycles. Robots are asynchronous, oblivious, anonymous, silent and execute the same distributed algorithm. So far, the problem has been mainly addressed by assuming chirality, that is robots share a common left-right orientation. We are interested in removing such a restriction. While working on the subject, we faced several issues that required close attention. We deeply investigated how such difficulties were overcome in the literature, revealing that crucial arguments for the correctness proof of the existing algorithms have been neglected. The systematic lack of rigorous arguments with respect to necessary conditions required for providing correctness proofs deeply affects the validity as well as the relevance of strategies proposed in the literature. Here we design a new deterministic distributed algorithm that fully characterizes APF showing its equivalence with the well-known Leader Election problem in the asynchronous model without chirality. Our approach is characterized by the use of logical predicates in order to formally describe our algorithm as well as its correctness. In addition to the relevance of our achievements, our techniques might help in revising previous results. In fact, it comes out that well-established results like [Fujinaga et al, SIAM J. Comp. 44(3) 2015], more recent approaches like [Bramas et al, PODC and SSS 2016] and 'unofficial' results like [Dieudonne et al, arXiv:0902.2851] revealed to be not correct.

Connected through hyperedge HE-1 (induced by source paper "positional encoding by robots with non rigid movements"):
  with members:
    - "arbitrary pattern formation on infinite grid by asynchronous oblivious robots"
    - "meeting in a polygon by anonymous oblivious robots"
    - "getting close without touching near gathering for autonomous mobile robots"
    - "perspective simple agents learn to find their way an introduction on mapping polygons"
    - "a distributed algorithm for gathering many fat mobile robots in the plane"
    - "how to meet asynchronously almost everywhere"
    - "asynchronous deterministic rendezvous in bounded terrains"

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"
    - "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"
    - "leader election problem versus pattern formation problem"

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"
    - "a distributed algorithm for gathering many fat mobile robots in the plane"
    - "leader election problem versus pattern formation problem"

Connected through hyperedge HE-4 (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"
    - "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"
    - "leader election problem versus pattern formation problem"

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)