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 and joints"
  Abstract: Let $L$ be a set of $n$ lines in $\reals^d$, for $d\ge 3$. A {\em joint} of $L$ is a point incident to at least $d$ lines of $L$, not all in a common hyperplane. Using a very simple algebraic proof technique, we show that the maximum possible number of joints of $L$ is $\Theta(n^{d/(d-1)})$. For $d=3$, this is a considerable simplification of the orignal algebraic proof of Guth and Katz~\cite{GK}, and of the follow-up simpler proof of Elekes et al. \cite{EKS}.

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

Connected through hyperedge HE-2 (induced by source paper "some remarks on multiplicity codes"):
  with members:
    - "local correctability of expander codes"
    - "high rate locally correctable codes via lifting"
    - "new affine invariant codes from lifting"
    - "optimal rate list decoding via derivative codes"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-3 (induced by source paper "almost tight bounds for eliminating depth cycles in three dimensions"):
  with members:
    - "removing depth order cycles among triangles an efficient algorithm generating triangular fragments"
    - "eliminating depth cycles among triangles in three dimensions"
    - "on range searching with semialgebraic sets ii"

Connected through hyperedge HE-4 (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 joints and incidences in three dimensions"
    - "fast multipoint evaluation of bivariate polynomials"

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

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

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

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)