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 lines joints and incidences in three dimensions"
  Abstract: We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz \cite{GK}, to obtain several sharp bounds on the number of incidences between lines and points in three dimensions. Specifically, we show: (i) The maximum possible number of incidences between $n$ lines in $\reals^3$ and $m$ of their joints (points incident to at least three non-coplanar lines) is $\Theta(m^{1/3}n)$ for $m\ge n$, and $\Theta(m^{2/3}n^{2/3}+m+n)$ for $m\le n$. (ii) In particular, the number of such incidences cannot exceed $O(n^{3/2})$. (iii) The bound in (i) also holds for incidences between $n$ lines and $m$ arbitrary points (not necessarily joints), provided that no plane contains more than O(n) points and each point is incident to at least three lines. As a preliminary step, we give a simpler proof of (an extension of) the bound $O(n^{3/2})$, established by Guth and Katz, on the number of joints in a set of $n$ lines in $\reals^3$. We also present some further extensions of these bounds, and give a proof of Bourgain's conjecture on incidences between points and lines in 3-space, which constitutes a simpler alternative to the proof of \cite{GK}.

Connected through hyperedge HE-1 (induced by source paper "homotheties and incidences"):
  with members:
    - "on lines and joints"

Connected through hyperedge HE-2 (induced by source paper "on range searching with semialgebraic sets ii"):
  with members:
    - "fast multipoint evaluation of bivariate polynomials"

Connected through hyperedge HE-3 (induced by source paper "computing the distance between piecewise linear bivariate functions"):
  with members:
    - "incidences in three dimensions and distinct distances in the plane"
    - "on lines and joints"
    - "fast multipoint evaluation of bivariate polynomials"

Connected through hyperedge HE-4 (induced by source paper "collinearities in kinetic point sets"):
  with members:
    - "a kinetic triangulation scheme for moving points in the plane"
    - "on lines and joints"

Connected through hyperedge HE-5 (induced by source paper "incidences in three dimensions and distinct distances in the plane"):
  with members:
    - "on lines and joints"

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)