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 "3sum with preprocessing algorithms lower bounds and cryptographic applications"):
  Abstract: Given a set of integers $\{a_1, \ldots, a_N\}$, the 3SUM problem requires finding $a_i, a_j, a_k \in A$ such that $a_i + a_j = a_k$. A preprocessing version of 3SUM, called 3SUM-Indexing, considers an initial offline phase where a computationally unbounded algorithm receives $a_1,\ldots,a_N$ and produces a data structure with $S$ words of $w$ bits each, followed by an online phase where one is given the target $b$ and needs to find a pair $(i, j)$ such that $a_i + a_j = b$ by probing only $T$ memory cells of the data structure. In this paper, we study the 3SUM-Indexing problem and show the following. #R##N#[New algorithms:] Goldstein et al. conjectured that there is no data structure for 3SUM-Indexing with $S=N^{2-\varepsilon}$ and $T=N^{1-\varepsilon}$ for any constant $\varepsilon>0$. Our first contribution is to disprove this conjecture by showing a suite of algorithms with $S^3 \cdot T = \tilde{O}(N^6)$; for example, this achieves $S=\tilde{O}(N^{1.9})$ and $T=\tilde{O}(N^{0.3})$. #R##N#[New lower bounds:] Demaine and Vadhan in 2001 showed that every 1-query algorithm for 3SUM-Indexing requires space $\tilde{\Omega}(N^2)$. Our second result generalizes their bound to show that for every space-$S$ algorithm that makes $T$ non-adaptive queries, $S = \tilde{\Omega}(N^{1+1/T})$. Any asymptotic improvement to our result will result in a major breakthrough in static data structure lower bounds. #R##N#[New cryptographic applications:] A natural question in cryptography is whether we can use a "backdoored" random oracle to build secure cryptography. We provide a novel formulation of this problem, modeling a random oracle whose truth table can be arbitrarily preprocessed by an unbounded adversary into an exponentially large lookup table to which the online adversary has oracle access. We construct one-way functions in this model assuming the hardness of a natural average-case variant of 3SUM-Indexing.

Includes members:
  Member "encoding 3sum":
    also connected through other hyperedges:
      (none)
  Member "static data structure lower bounds imply rigidity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tight static lower bounds for non adaptive data structures")
  Member "near optimal linear decision trees for k sum and related problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "all non trivial variants of 3 ldt are equivalent")
  Member "conditional lower bounds for space time tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "data structures meet cryptography 3sum with preprocessing")
  Member "orthogonal vectors indexing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "data structures meet cryptography 3sum with preprocessing")
  Member "clustered integer 3sum via additive combinatorics":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "all non trivial variants of 3 ldt are equivalent")
  Member "threesomes degenerates and love triangles":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the fine grained complexity of parity problems")
  Member "on hardness of jumbled indexing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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.DS(Data Structures and Algorithms)