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: "evaluation of labeling strategies for rotating maps"
  Abstract: We consider the following problem of labeling points in a dynamic map that allows rotation. We are given a set of points in the plane labeled by a set of mutually disjoint labels, where each label is an axis-aligned rectangle attached with one corner to its respective point. We require that each label remains horizontally aligned during the map rotation and our goal is to find a set of mutually non-overlapping active labels for every rotation angle $\alpha \in [0, 2\pi)$ so that the number of active labels over a full map rotation of 2$\pi$ is maximized. We discuss and experimentally evaluate several labeling models that define additional consistency constraints on label activities in order to reduce flickering effects during monotone map rotation. We introduce three heuristic algorithms and compare them experimentally to an existing approximation algorithm and exact solutions obtained from an integer linear program. Our results show that on the one hand low flickering can be achieved at the expense of only a small reduction in the objective value, and that on the other hand the proposed heuristics achieve a high labeling quality significantly faster than the other methods.

Connected through hyperedge HE-1 (induced by source paper "scalable graph algorithms"):
  with members:
    - "exactly solving the maximum weight independent set problem on large real world graphs"
    - "memetic graph clustering"
    - "practical minimum cut algorithms"
    - "scalable edge partitioning"
    - "shared memory exact minimum cuts"
    - "scalable kernelization for maximum independent sets"
    - "graph partitioning with acyclicity constraints"
    - "memetic multilevel hypergraph partitioning"

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

Connected through hyperedge HE-3 (induced by source paper "scalable kernelization for maximum independent sets"):
  with members:
    - "exact algorithms for maximum independent set"
    - "accelerating local search for the maximum independent set problem"
    - "generating massive complex networks with hyperbolic geometry faster in practice"
    - "on the power of simple reductions for the maximum independent set problem"
    - "finding near optimal independent sets at scale"
    - "parallel graph partitioning for complex networks"
    - "kernelization using structural parameters on sparse graph classes"
    - "linear time fpt algorithms via network flow"

Connected through hyperedge HE-4 (induced by source paper "accelerating local search for the maximum independent set problem"):
  with members:
    - "finding near optimal independent sets at scale"
    - "graph partitioning for independent sets"
    - "linear time fpt algorithms via network flow"
    - "dynamic local search for the maximum clique problem"

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

Connected through hyperedge HE-6 (induced by source paper "on the power of simple reductions for the maximum independent set problem"):
  with members:
    - "kernelization using structural parameters on sparse graph classes"
    - "linear time fpt algorithms via network flow"
    - "layered label propagation a multiresolution coordinate free ordering for compressing social networks"

Connected through hyperedge HE-7 (induced by source paper "placing arrows in directed graph drawings"):
  with members:
    - "trajectory based dynamic map labeling"

Connected through hyperedge HE-8 (induced by source paper "finding near optimal independent sets at scale"):
  with members:
    - "exact algorithms for maximum independent set"
    - "graph partitioning for independent sets"
    - "branch and reduce exponential fpt algorithms in practice a case study of vertex cover"
    - "linear time fpt algorithms via network flow"
    - "layered label propagation a multiresolution coordinate free ordering for compressing social networks"
    - "dynamic local search for the maximum clique 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.CG(Computational Geometry)