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 "hardness of rna folding problem with four symbols"):
  Abstract: An RNA sequence is a string composed of four types of nucleotides, $A, C, G$, and $U$. The goal of the RNA folding problem is to find a maximum cardinality set of crossing-free pairs of the form $\{A,U\}$ or $\{C,G\}$ in a given RNA sequence. The problem is central in bioinformatics and has received much attention over the years. Abboud, Backurs, and Williams (FOCS 2015) demonstrated a conditional lower bound for a generalized version of the RNA folding problem based on a conjectured hardness of the $k$-clique problem. Their lower bound requires the RNA sequence to have at least 36 types of symbols, making the result not applicable to the RNA folding problem in real life (i.e., alphabet size 4). In this paper, we present an improved lower bound that works for the alphabet size 4 case. #R##N#We also investigate the Dyck edit distance problem, which is a string problem closely related to RNA folding. We demonstrate a reduction from RNA folding to Dyck edit distance with alphabet size 10. This leads to a much simpler proof of the conditional lower bound for Dyck edit distance problem given by Abboud, Backurs, and Williams (FOCS 2015), and lowers the alphabet size requirement.

Includes members:
  Member "truly sub cubic algorithms for language edit distance and rna folding via fast bounded difference min plus product":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "streaming with oracle new streaming algorithms for edit distance and lcs")
  Member "clustered integer 3sum via additive combinatorics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "all non trivial variants of 3 ldt are equivalent")
  Member "time and space efficient algorithms for rna folding with the four russians technique":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "if the current clique algorithms are optimal so is valiant s parser")
  Member "if the current clique algorithms are optimal so is valiant s parser":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "quadratic conditional lower bounds for string problems and dynamic time warping":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "streaming with oracle new streaming algorithms for edit distance and lcs")
  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 "language edit distance maximum likelihood parsing of stochastic grammars faster algorithms connection to fundamental graph problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "streaming with oracle new streaming algorithms for edit distance and lcs")
  Member "on hardness of jumbled indexing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "graphs cannot be indexed in polynomial time for sub quadratic time string matching unless seth fails")

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)