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: "fixed parameter tractability and lower bounds for stabbing problems"
  Abstract: We study the following general stabbing problem from a parameterized complexity point of view: Given a setS of n translates of an object in R d , nd a set of k lines with the property that every object inS is "stabbed" (intersected) by at least one line. We show that when S consists of axis-parallel unit squares in R 2 the (decision) problem of stabbing S with axis-parallel lines is W[1]-hard with respect to k (and thus, not

Connected through hyperedge HE-1 (induced by source paper "geometric hitting set for segments of few orientations"):
  with members:
    - "on the approximability of covering points by lines and related problems"
    - "point line cover the easy kernel is essentially tight"
    - "analytical approach to parallel repetition"
    - "tight lower bounds for the size of epsilon nets"
    - "improved approximation algorithms for geometric set cover"

Connected through hyperedge HE-2 (induced by source paper "the limited blessing of low dimensionality when 1 1 d is the best possible exponent for d dimensional geometric problems"):
  with members:
    - "constraint solving via fractional edge covers"
    - "the parameterized complexity of some geometric problems in unbounded dimension"
    - "hypertree decompositions and tractable queries"

Connected through hyperedge HE-3 (induced by source paper "fixed parameter complexity and approximability of norm maximization"):
  with members:
    - "the parameterized complexity of some geometric problems in unbounded dimension"

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)