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 "independent sets of dynamic rectangles algorithms and experiments"):
  Abstract: We study the maximal independent set (MIS) and maximum independent set (MAX-IS) problems on dynamic sets of $O(n)$ axis-parallel rectangles, which can be modeled as dynamic rectangle intersection graphs. We consider the fully dynamic vertex update (insertion/deletion) model for two types of rectangles: (i) uniform height and width and (ii) uniform height and arbitrary width. These types of dynamic vertex update problems arise, e.g., in interactive map labeling. We present the first deterministic algorithm for maintaining a MIS (and thus a 4-approximate MAX-IS) of a dynamic set of uniform rectangles with amortized sub-logarithmic update time. This breaks the natural barrier of $O(\Delta)$ update time (where $\Delta$ is the maximum degree in the graph) for vertex updates presented by Assadi et al. (STOC 2018). We continue by investigating MAX-IS and provide a series of deterministic dynamic approximation schemes. For uniform rectangles, we first give an algorithm that maintains a $4$-approximate MAX-IS with $O(1)$ update time. In a subsequent algorithm, we establish the trade-off between approximation quality $2(1+\frac{1}{k})$ and update time $O(k^2\log n)$ for $k\in \mathbb{N}$. We conclude with an algorithm that maintains a $2$-approximate MAX-IS for dynamic sets of uniform height and arbitrary width rectangles with $O(\omega \log n)$ update time, where $\omega$ is the largest number of maximal cliques stabbed by any axis-parallel line. We have implemented our algorithms and report the results of an experimental comparison exploring the trade-off between solution size and update time for synthetic and real-world map labeling data sets.

Includes members:
  Member "online matching with general arrivals":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online graph matching problems with a worst case reassignment budget")
  Member "fully dynamic maximal independent set in expected poly log update time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dynamic graph algorithms with batch updates in the massively parallel computation model")
  Member "exploring semi automatic map labeling":
    also connected through other hyperedges:
      (none)
  Member "fully dynamic maximal independent set with polylogarithmic update time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynamic graph algorithms with batch updates in the massively parallel computation model")
  Member "fully dynamic maximal independent set with sublinear update time":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "a deamortization approach for dynamic spanner and dynamic maximal matching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dynamic graph algorithms with batch updates in the massively parallel computation model")
  Member "dynamic algorithms for graph coloring":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "on approximating maximum independent set of rectangles":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "dynamic approximate maximum independent set of intervals hypercubes and hyperrectangles")

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)