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: "trajectory based dynamic map labeling"
  Abstract: In this paper we introduce trajectory-based labeling, a new variant of dynamic map labeling, where a movement trajectory for the map viewport is given. We define a general labeling model and study the active range maximization problem in this model. The problem is NP-complete and W[1]-hard. In the restricted, yet practically relevant case that no more than k labels can be active at any time, we give polynomial-time algorithms. For the general case we present a practical ILP formulation with an experimental evaluation as well as approximation algorithms.

Connected through hyperedge HE-1 (induced by source paper "wegotyoucovered the winning solver from the pace 2019 implementation challenge vertex cover track"):
  with members:
    - "scalable kernelization for maximum independent sets"
    - "exact algorithms for maximum independent set"
    - "accelerating local search for the maximum independent set problem"
    - "on the power of simple reductions for the maximum independent set problem"
    - "efficient classification for metric data"
    - "linear time fpt algorithms via network flow"

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

Connected through hyperedge HE-3 (induced by source paper "placing arrows in directed graph drawings"):
  with members:
    - "evaluation of labeling strategies for rotating maps"

Connected through hyperedge HE-4 (induced by source paper "graph partitioning for independent sets"):
  with members:
    - "partitioning complex networks via size constrained clustering"
    - "dynamic local search for the maximum clique problem"

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

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)