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 "model and objective separation with conditional lower bounds disjunction is harder than conjunction"):
  Abstract: Given a model of a system and an objective, the model-checking question asks whether the model satisfies the objective. We study polynomial-time problems in two classical models, graphs and Markov Decision Processes (MDPs), with respect to several fundamental $\omega$-regular objectives, e.g., Rabin and Streett objectives. For many of these problems the best-known upper bounds are quadratic or cubic, yet no super-linear lower bounds are known. In this work our contributions are two-fold: First, we present several improved algorithms, and second, we present the first conditional super-linear lower bounds based on widely believed assumptions about the complexity of CNF-SAT and combinatorial Boolean matrix multiplication. A separation result for two models with respect to an objective means a conditional lower bound for one model that is strictly higher than the existing upper bound for the other model, and similarly for two objectives with respect to a model. Our results establish the following separation results: (1) A separation of models (graphs and MDPs) for disjunctive queries of reachability and B\"uchi objectives. (2) Two kinds of separations of objectives, both for graphs and MDPs, namely, (2a) the separation of dual objectives such as reachability/safety (for disjunctive questions) and Streett/Rabin objectives, and (2b) the separation of conjunction and disjunction of multiple objectives of the same type such as safety, B\"uchi, and coB\"uchi. In summary, our results establish the first model and objective separation results for graphs and MDPs for various classical $\omega$-regular objectives. Quite strikingly, we establish conditional lower bounds for the disjunction of objectives that are strictly higher than the existing upper bounds for the conjunction of the same objectives.

Includes members:
  Member "finding 2 edge and 2 vertex strongly connected components in quadratic time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "computing and testing small connectivity in near linear time and queries via fast local cut algorithms")
  Member "quadratic conditional lower bounds for string problems and dynamic time warping":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "streaming with oracle new streaming algorithms for edit distance and lcs")
  Member "approximation and fixed parameter subquadratic algorithms for radius and diameter":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized fine grained reductions")
  Member "why walking the dog takes time frechet distance has no strongly subquadratic algorithms unless seth fails":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graphs cannot be indexed in polynomial time for sub quadratic time string matching unless seth fails")
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "edit distance cannot be computed in strongly subquadratic time unless seth is false":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "streaming with oracle new streaming algorithms for edit distance and lcs")
  Member "improved algorithms for one pair and k pair streett objectives":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "near linear time algorithms for streett objectives in graphs and mdps")
  Member "faster all pairs shortest paths via circuit complexity":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deterministic algorithms for decremental approximate shortest paths faster and simpler")

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.DS(Data Structures and Algorithms)