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 "data structures meet cryptography 3sum with preprocessing"):
  Abstract: This paper shows several connections between data structure problems and cryptography against preprocessing attacks. Our results span data structure upper bounds, cryptographic applications, and data structure lower bounds, as summarized next.  First, we apply Fiat--Naor inversion, a technique with cryptographic origins, to obtain a data structure upper bound. In particular, our technique yields a suite of algorithms with space $S$ and (online) time $T$ for a preprocessing version of the $N$-input 3SUM problem where $S^3\cdot T = \widetilde{O}(N^6)$. This disproves a strong conjecture (Goldstein et al., WADS 2017) that there is no data structure that solves this problem for $S=N^{2-\delta}$ and $T = N^{1-\delta}$ for any constant $\delta>0$.  Secondly, we show equivalence between lower bounds for a broad class of (static) data structure problems and one-way functions in the random oracle model that resist a very strong form of preprocessing attack. Concretely, given a random function $F: [N] \to [N]$ (accessed as an oracle) we show how to compile it into a function $G^F: [N^2] \to [N^2]$ which resists $S$-bit preprocessing attacks that run in query time $T$ where $ST=O(N^{2-\varepsilon})$ (assuming a corresponding data structure lower bound on 3SUM). In contrast, a classical result of Hellman tells us that $F$ itself can be more easily inverted, say with $N^{2/3}$-bit preprocessing in $N^{2/3}$ time. We also show that much stronger lower bounds follow from the hardness of kSUM. Our results can be equivalently interpreted as security against adversaries that are very non-uniform, or have large auxiliary input, or as security in the face of a powerfully backdoored random oracle.  Thirdly, we give lower bounds for 3SUM and a range of geometric problems which match the best known lower bounds for static data structure problems (Larsen, FOCS 2012).

Includes members:
  Member "the strong 3sum indexing conjecture is false":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "all non trivial variants of 3 ldt are equivalent")
  Member "equivalence of systematic linear data structures and matrix rigidity":
    also connected through other hyperedges:
      (none)
  Member "lower bounds for oblivious data structures":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lower bounds for oblivious near neighbor search")
  Member "static data structure lower bounds imply rigidity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tight static lower bounds for non adaptive data structures")
  Member "how hard is it to find honest witnesses":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "3sum with preprocessing algorithms lower bounds and cryptographic applications")
  Member "orthogonal vectors indexing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "3sum with preprocessing algorithms lower bounds and cryptographic applications")
  Member "clustered integer 3sum via additive combinatorics":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "all non trivial variants of 3 ldt are equivalent")

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)