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: "evacuation of rectilinear polygons"
  Abstract: We investigate the problem of creating fast evacuation plans for buildings that are modeled as grid polygons, possibly containing exponentially many cells. We study this problem in two contexts: the "confluent" context in which the routes to exits remain fixed over time, and the "non-confluent" context in which routes may change. Confluent evacuation plans are simpler to carry out, as they allocate contiguous regions to exits; non-confluent allocation can possibly create faster evacuation plans. We give results on the hardness of creating the evacuation plans and strongly polynomial algorithms for finding confluent evacuation plans when the building has two exits. We also give a pseudopolynomial time algorithm for non-confluent evacuation plans. Finally, we show that the worst-case bound between confluent and nonconfluent plans is 2 - O(1/k).

Connected through hyperedge HE-1 (induced by source paper "evacuation of equilateral triangles by mobile agents of limited communication range"):
  with members:
    - "evacuating robots from a disk using face to face communication"
    - "online searching with turn cost"

Connected through hyperedge HE-2 (induced by source paper "average case worst case tradeoffs for evacuating 2 robots from the disk in the face to face model"):
  with members:
    - "god save the queen"
    - "priority evacuation from a disk using mobile robots"
    - "search on a line by byzantine robots"
    - "searching with advice robot fence jumping"
    - "search and fetch with 2 robots on a disk wireless and face to face communication models"

Connected through hyperedge HE-3 (induced by source paper "search and fetch with 2 robots on a disk wireless and face to face communication models"):
  with members:
    - "fast two robot disk evacuation with wireless communication"
    - "evacuating robots from a disk using face to face communication"
    - "online searching with turn cost"
    - "optimal constructions of hybrid algorithms"

Connected through hyperedge HE-4 (induced by source paper "infinite object coating in the amoebot model"):
  with members:
    - "active self assembly of algorithmic shapes and patterns in polylogarithmic time"
    - "ameba inspired self organizing particle systems"
    - "a distributed algorithm for gathering many fat mobile robots in the plane"
    - "physarum can compute shortest paths"
    - "autonomous push down automaton built on dna"
    - "self assembly of arbitrary shapes using rnase enzymes meeting the kolmogorov bound with small scale factor extended abstract"
    - "distributed agreement in tile self assembly"
    - "polygon exploration with time discrete vision"

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.DS(Data Structures and Algorithms)