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: "on the streaming complexity of fundamental geometric problems"
  Abstract: In this paper, we focus on lower bounds and algorithms for some basic geometric problems in the one-pass (insertion only) streaming model. The problems considered are grouped into three categories: #R##N#(i) Klee's measure #R##N#(ii) Convex body approximation, geometric query, and #R##N#(iii) Discrepancy #R##N#Klee's measure is the problem of finding the area of the union of hyperrectangles. Under convex body approximation, we consider the problems of convex hull, convex body approximation, linear programming in fixed dimensions. The results for convex body approximation implies a property testing type result to find if a query point lies inside a convex polyhedron. Under discrepancy, we consider both the geometric and combinatorial discrepancy. For all the problems considered, we present (randomized) lower bounds on space. Most of our lower bounds are in terms of approximating the solution with respect to an error parameter $\epsilon$. We provide approximation algorithms that closely match the lower bound on space for most of the problems.

Connected through hyperedge HE-1 (induced by source paper "structural parameterization for graph deletion problems over data streams"):
  with members:
    - "tight bounds for single pass streaming complexity of the set cover problem"
    - "faster deterministic feedback vertex set"
    - "interval deletion is fixed parameter tractable"
    - "linear kernels and single exponential algorithms via protrusion decompositions"
    - "preprocessing subgraph and minor problems when does a small vertex cover help"
    - "hitting forbidden minors approximation and kernelization"

Connected through hyperedge HE-2 (induced by source paper "fixed parameter tractability of graph deletion problems over data streams"):
  with members:
    - "tight bounds for single pass streaming complexity of the set cover problem"
    - "preprocessing subgraph and minor problems when does a small vertex cover help"

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)