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: "approximation algorithms for maximum independent set of pseudo disks"
  Abstract: We present approximation algorithms for maximum independent set of pseudo-disks in the plane, both in the weighted and unweighted cases. For the unweighted case, we prove that a local search algorithm yields a \PTAS. For the weighted case, we suggest a novel rounding scheme based on an \LP relaxation of the problem, which leads to a constant-factor approximation. Most previous algorithms for maximum independent set (in geometric settings) relied on packing arguments that are not applicable in this case. As such, the analysis of both algorithms requires some new combinatorial ideas, which we believe to be of independent interest.

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 "stochastic makespan minimization in structured set systems"):
  with members:
    - "stochastic load balancing on unrelated machines"

Connected through hyperedge HE-3 (induced by source paper "parameterized approximation schemes for independent set of rectangles and geometric knapsack"):
  with members:
    - "approximating geometric knapsack via l packings"
    - "on approximating maximum independent set of rectangles"
    - "fixed parameter approximations for k center problems in low highway dimension graphs"
    - "lower bounds for approximation schemes for closest string"
    - "a fixed parameter tractable approximation scheme for the optimal cut graph of a surface"
    - "the constant inapproximability of the parameterized dominating set problem"
    - "parameterized approximability of maximizing the spread of influence in networks"
    - "parameterized approximation schemes using graph widths"

Connected through hyperedge HE-4 (induced by source paper "algorithms for intersection graphs of multiple intervals and pseudo disks"):
  with members:
    - "on approximating partial set cover and generalizations"
    - "on pseudo disk hypergraphs"
    - "epsilon approximations and epsilon nets"
    - "on partial covering for geometric set systems"
    - "approximation schemes for independent set and sparse subsets of polygons"
    - "approximation schemes for maximum weight independent set of rectangles"
    - "improved approximation algorithms for geometric set cover"
    - "a new multilayered pcp and the hardness of hypergraph vertex cover"

Connected through hyperedge HE-5 (induced by source paper "computing maximum independent set on outerstring graphs and their relatives"):
  with members:
    - "approximating dominating set on intersection graphs of rectangles and l frames"
    - "planar graphs as l intersection or l contact graphs"
    - "approximation algorithms for independence and domination on b 1 vpg and b 1 epg graphs"
    - "intersection graphs of rays and grounded segments"
    - "bend bounded path intersection graphs sausages noodles and waffles on a grill"
    - "seidel minor permutation graphs and combinatorial properties"

Connected through hyperedge HE-6 (induced by source paper "constrained orthogonal segment stabbing"):
  with members:
    - "approximating dominating set on intersection graphs of rectangles and l frames"
    - "approximating minimum dominating set on string graphs"
    - "the complexity of drawing graphs on few lines and few planes"
    - "the problem of compatible representatives"

Connected through hyperedge HE-7 (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"
    - "consistent labeling of rotating maps"

Connected through hyperedge HE-8 (induced by source paper "a polynomial time approximation scheme for facility location on planar graphs"):
  with members:
    - "local search yields approximation schemes for k means and k median in euclidean and minor free metrics"

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)