human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a framework for robust realistic geometric computations"):
  Abstract: We propose a new paradigm for robust geometric computations that complements the classical fixed precision paradigm and the exact geometric computation paradigm. We provide a framework where we study algorithmic problems under smoothed analysis of the input, the relaxation of the problem requirements, or the witness of a recognition problem. Our framework specifies a widely applicable set of prerequisites that make real RAM algorithms suitable for smoothed analysis. We prove that suitable algorithms can (under smoothed analysis) be robustly executed with expected logarithmic bit-precision. This shows in a formal way that inputs which need high bit-precision are contrived and that these algorithms are likely robust for realistic input. Interestingly our techniques generalize to problems with a natural notion of resource augmentation (geometric packing, the art gallery problem) and recognition problems (recognition of realizable order types or disk intersection graphs). #R##N#Our results also have theoretical implications for some ER-hard problems: These problems have input instances where their real verification algorithm requires at least exponential bit-precision which makes it difficult to place these ER-hard problems in NP. Our results imply for a host of ER-complete problems that this exponential bit-precision phenomenon comes from nearly degenerate instances. #R##N#It is not evident that problems that have a real verification algorithm belong to ER. Therefore, we conclude with a real RAM analogue to the Cook-Levin Theorem. This gives an easy proof of ER-membership, as real verification algorithms are much more versatile than ETR-formulas.

Includes members:
  Member "chirotopes of random points in space are realizable on a small integer grid":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "convex hulls of random order types")
  Member "smoothed analysis of order types":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "convex hulls of random order types")
  Member "optimal curve straightening is exists mathbb r complete":
    also connected through other hyperedges:
      (none)
  Member "beyond worst case analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "escaping cannibalization correlation robust pricing for a unit demand buyer")
  Member "the complexity of drawing a graph in a polygonal region":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "smoothed analysis of order types")
  Member "on order types of random point sets":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "chirotopes of random points in space are realizable on a small integer grid")
  Member "on the complexity of minimum link path problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "global curve simplification")
  Member "recognition and complexity of point visibility graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "drawing graphs as spanners")

Question: Please tell me which class the source paper 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)