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 "resolving sinr queries in a dynamic setting"):
  Abstract: We consider a set of transmitters broadcasting simultaneously on the same frequency under the SINR model. Transmission power may vary from one transmitter to another, and a signal's strength decreases (path loss or path attenuation) by some constant power $\alpha$ of the distance traveled. Roughly, a receiver at a given location can hear a specific transmitter only if the transmitter's signal is stronger than the signal of all other transmitters, combined. An SINR query is to determine whether a receiver at a given location can hear any transmitter, and if yes, which one. An approximate answer to an SINR query is such that one gets a definite yes or definite no, when the ratio between the strongest signal and all other signals combined is well above or well below the reception threshold, while the answer in the intermediate range is allowed to be either yes or no. We describe several compact data structures that support approximate SINR queries in the plane in a dynamic context, i.e., where both queries and updates (insertion or deletion of a transmitter) can be performed efficiently.

Includes members:
  Member "dynamic geometric data structures via shallow cuttings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "thaad efficient matching queries under temporal abstraction for anomaly detection")
  Member "dynamic planar voronoi diagrams for general distance functions and their algorithmic applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a graph theoretic additive approximation of optimal transport")
  Member "batched point location in sinr diagrams via algebraic tools":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computing shapley values for mean width in 3 d")
  Member "approximating minimization diagrams and generalized proximity search":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "approximate nearest neighbor search for ell_p spaces 2 p infty via embeddings")
  Member "sinr diagram with interference cancellation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "batched point location in sinr diagrams via algebraic tools")
  Member "the topology of wireless communication":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "batched point location in sinr diagrams via algebraic tools")

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)