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: "theta 3 is connected"
  Abstract: In this paper, we show that the @q-graph with three cones is connected. We also provide an alternative proof of the connectivity of the Yao graph with three cones.

Connected through hyperedge HE-1 (induced by source paper "expected complexity of routing in theta 6 and half theta 6 graphs"):
  with members:
    - "on the spanning and routing ratio of theta four"
    - "the θ 5 graph is a spanner"
    - "towards tight bounds on theta graphs"
    - "optimal local routing on delaunay triangulations defined by empty equilateral triangles"

Connected through hyperedge HE-2 (induced by source paper "the price of order"):
  with members:
    - "the θ 5 graph is a spanner"
    - "towards tight bounds on theta graphs"
    - "optimal local routing on delaunay triangulations defined by empty equilateral triangles"
    - "on the stretch factor of the theta 4 graph"

Connected through hyperedge HE-3 (induced by source paper "towards tight bounds on theta graphs"):
  with members:
    - "the θ 5 graph is a spanner"
    - "on the stretch factor of the theta 4 graph"

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)