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: "consistent labeling of rotating maps"
  Abstract: Dynamic maps that allow continuous map rotations, e.g., on mobile devices, encounter new issues unseen in static map labeling before. We study the following dynamic map labeling problem: The input is a static, labeled map, i.e., a set P of points in the plane with attached non-overlapping horizontal rectangular labels. The goal is to find a consistent labeling of P under rotation that maximizes the number of visible labels for all rotation angles such that the labels remain horizontal while the map is rotated. A labeling is consistent if a single active interval of angles is selected for each label such that labels neither intersect each other nor occlude points in P at any rotation angle. We first introduce a general model for labeling rotating maps and derive basic geometric properties of consistent solutions. We show NP-completeness of the active interval maximization problem even for unit-square labels. We then present a constant-factor approximation for this problem based on line stabbing, and refine it further into an efficient polynomial-time approximation scheme (EPTAS). Finally, we extend the EPTAS to the more general setting of rectangular labels of bounded size and aspect ratio.

Connected through hyperedge HE-1 (induced by source paper "independent sets of dynamic rectangles algorithms and experiments"):
  with members:
    - "online matching with general arrivals"
    - "fully dynamic maximal independent set in expected poly log update time"
    - "exploring semi automatic map labeling"
    - "fully dynamic maximal independent set with polylogarithmic update time"
    - "fully dynamic maximal independent set with sublinear update time"
    - "a deamortization approach for dynamic spanner and dynamic maximal matching"
    - "dynamic algorithms for graph coloring"
    - "on approximating maximum independent set of rectangles"

Connected through hyperedge HE-2 (induced by source paper "packing rotating segments"):
  with members:
    - "evaluation of labeling strategies for rotating maps"
    - "approximation schemes for maximum weight independent set of rectangles"
    - "approximation algorithms for maximum independent set of pseudo disks"

Connected through hyperedge HE-3 (induced by source paper "a framework for algorithm stability"):
  with members:
    - "on topological changes in the delaunay triangulation of moving points"
    - "smoothed analysis of algorithms why the simplex algorithm usually takes polynomial time"

Connected through hyperedge HE-4 (induced by source paper "temporal map labeling a new unified framework with experiments"):
  with members:
    - "evaluation of labeling strategies for rotating maps"
    - "trajectory based dynamic map labeling"
    - "fast point feature label placement for dynamic visualizations thesis"

Connected through hyperedge HE-5 (induced by source paper "evaluation of labeling strategies for rotating maps"):
  with members:
    - "trajectory based dynamic map labeling"

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.CG(Computational Geometry)