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: "largest empty circle centered on a query line"
  Abstract: The Largest Empty Circle problem seeks the largest circle centered within the convex hull of a set P of n points in R^2 and devoid of points from P. In this paper, we introduce a query version of this well-studied problem. In our query version, we are required to preprocess P so that when given a query line Q, we can quickly compute the largest empty circle centered at some point on Q and within the convex hull of P. We present solutions for two special cases and the general case; all our queries run in O(logn) time. We restrict the query line to be horizontal in the first special case, which we preprocess in O([email protected](n)logn) time and space, where @a(n) is the slow growing inverse of Ackermann's function. When the query line is restricted to pass through a fixed point, the second special case, our preprocessing takes O([email protected](n)^O^(^@a^(^n^)^)logn) time and space. We use insights from the two special cases to solve the general version of the problem with preprocessing time and space in O(n^3logn) and O(n^3) respectively.

Connected through hyperedge HE-1 (induced by source paper "color spanning localized query"):
  with members:
    - "finding the maximal empty rectangle containing a query point"
    - "localized geometric query problems"
    - "querying for the largest empty geometric object in a desired location"

Connected through hyperedge HE-2 (induced by source paper "sharp bounds on davenport schinzel sequences of every order"):
  with members:
    - "convex hull of points lying on lines in o nlogn time after preprocessing"
    - "complexity of a single face in an arrangement of s intersecting curves"
    - "convex hull of imprecise points in o n log n time after preprocessing"
    - "a kinetic triangulation scheme for moving points in the plane"
    - "improved bounds and new techniques for davenport schinzel sequences and their generalizations"
    - "querying two boundary points for shortest paths in a polygonal domain"
    - "splay trees davenport schinzel sequences and the deque conjecture"

Connected through hyperedge HE-3 (induced by source paper "localized geometric query problems"):
  with members:
    - "finding the maximal empty rectangle containing a query point"
    - "computing largest circles separating two sets of segments"

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)