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 "graphs cannot be indexed in polynomial time for sub quadratic time string matching unless seth fails"):
  Abstract: We consider the following string matching problem on a node-labeled graph $G=(V,E)$: given a pattern string $P$, decide whether there exists a path in $G$ whose concatenation of node labels equals $P$. This is a basic primitive in various problems in bioinformatics, graph databases, or networks. The hardness results of Backurs and Indyk (FOCS 2016) imply that this problem cannot be solved in better than $O(|E||P|)$ time, under the Orthogonal Vectors Hypothesis (OVH), and this holds even under various restrictions on the graph (Equi et al., ICALP 2019). #R##N#In this paper we consider its offline version, namely the one in which we are allowed to index the graph in order to support time-efficient string matching queries. Indeed, it was tantalizing in the string matching community to believe that sub-quadratic time queries can be achieved, e.g. at the cost of a high-degree polynomial-time indexing. #R##N#We disprove this belief, showing that, under OVH, no polynomial-time index can support querying $P$ in time $O(|E|^\delta|P|^\beta)$, with either $\delta < 1$ or $\beta < 1$. We prove this tight bound employing a known self-reducibility technique, e.g. from the field of dynamic algorithms, which translates conditional lower bounds for an online problem to its offline version. #R##N#As a side-contribution, we formalize this technique with the notion of linear independent-components reduction, allowing for a simple proof of our result. As another illustration of our technique, we also translate the quadratic conditional lower bound of Backurs and Indyk (STOC 2015) for the problem of matching a query string inside a text, under edit distance. We obtain an analogous tight quadratic lower bound for its offline version, improving the recent result of Cohen-Addad, Feuilloley and Starikovskaya (SODA 2019), but with a slightly different boundary condition.

Includes members:
  Member "regular languages meet prefix sorting":
    also connected through other hyperedges:
      (none)
  Member "on prefix sorting finite automata":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the hardness and inapproximability of recognizing wheeler graphs")
  Member "on the hardness and inapproximability of recognizing wheeler graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the complexity of bwt runs minimization via alphabet reordering")
  Member "on the hardness of set disjointness and set intersection with bounded universe":
    also connected through other hyperedges:
      (none)
  Member "lower bounds for text indexing with mismatches and differences":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "approximate similarity search under edit distance using locality sensitive hashing")
  Member "indexing variation graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lightweight merging of compressed indices based on bwt variants")
  Member "distributed pcp theorems for hardness of approximation in p":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximating subset sum is equivalent to min plus convolution")
  Member "improving viterbi is hard better runtimes imply faster clique algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "more consequences of falsifying seth and the orthogonal vectors conjecture")

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.CC(Computational Complexity)