human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "tight space approximation tradeoff for the multi pass streaming set cover problem"
  Abstract: We study the classic set cover problem in the streaming model: the sets that comprise the instance are revealed one by one in a stream and the goal is to solve the problem by making one or few passes over the stream while maintaining a sublinear space $o(mn)$ in the input size; here $m$ denotes the number of the sets and $n$ is the universe size. Notice that in this model, we are mainly concerned with the space requirement of the algorithms and hence do not restrict their computation time. #R##N#Our main result is a resolution of the space-approximation tradeoff for the streaming set cover problem: we show that any $\alpha$-approximation algorithm for the set cover problem requires $\widetilde{\Omega}(mn^{1/\alpha})$ space, even if it is allowed polylog${(n)}$ passes over the stream, and even if the sets are arriving in a random order in the stream. This space-approximation tradeoff matches the best known bounds achieved by the recent algorithm of Har-Peled et.al. (PODS 2016) that requires only $O(\alpha)$ passes over the stream in an adversarial order, hence settling the space complexity of approximating the set cover problem in data streams in a quite robust manner. Additionally, our approach yields tight lower bounds for the space complexity of $(1- \epsilon)$-approximating the streaming maximum coverage problem studied in several recent works.

Connected through hyperedge HE-1 (induced by source paper "two player hidden pointer chasing and multi pass lower bounds in turnstile streams"):
  with members:
    - "approximate maximum matching in random streams"
    - "polynomial pass lower bounds for graph streaming algorithms"
    - "dynamic streaming spectral sparsification in nearly linear time and space"
    - "weighted matchings via unweighted augmentations"
    - "tight bounds on the round complexity of the distributed maximum coverage problem"
    - "simplified and space optimal semi streaming for 2 epsilon approximate matching"
    - "on estimating maximum matching size in graph streams"
    - "a 2 ϵ approximation for maximum weight matching in the semi streaming model"

Connected through hyperedge HE-2 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms"):
  with members:
    - "smaller cuts higher lower bounds"
    - "parallelization does not accelerate convex optimization adaptivity lower bounds for non smooth convex minimization"
    - "an exponential speedup in parallel running time for submodular maximization without loss in approximation"
    - "non monotone submodular maximization with nearly optimal adaptivity complexity"
    - "submodular maximization with optimal approximation adaptivity and query complexity"
    - "tight bounds on the round complexity of the distributed maximum coverage problem"
    - "non monotone submodular maximization in exponentially fewer iterations"
    - "submodular maximization with nearly optimal approximation and adaptivity in nearly linear time"

Connected through hyperedge HE-3 (induced by source paper "improved local computation algorithm for set cover via sparsification"):
  with members:
    - "sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation"
    - "round compression for parallel graph algorithms in strongly sublinear space"
    - "almost optimal streaming algorithms for coverage problems"
    - "tight bounds for single pass streaming complexity of the set cover problem"
    - "towards tight bounds for the streaming set cover problem"
    - "incidence geometries and the pass complexity of semi streaming set cover"
    - "semi streaming set cover"
    - "a nearly linear time ptas for explicit fractional packing and covering linear programs"

Connected through hyperedge HE-4 (induced by source paper "streaming frequent items with timestamps and detecting large neighborhoods in graph streams"):
  with members:
    - "optimality of linear sketching under modular updates"
    - "independent sets in vertex arrival streams"
    - "tight bounds for single pass streaming complexity of the set cover problem"
    - "towards tight bounds for the streaming set cover problem"
    - "maximum matching in turnstile streams"
    - "semi streaming set cover"
    - "tight bounds for lp samplers finding duplicates in streams and related problems"
    - "analysis of a bloom filter algorithm via the supermarket model"

Connected through hyperedge HE-5 (induced by source paper "tight bounds on the round complexity of the distributed maximum coverage problem"):
  with members:
    - "distributed partial clustering"
    - "on estimating maximum matching size in graph streams"
    - "combinatorial auctions do need modest interaction"
    - "submodular optimization over sliding windows"
    - "distributed coverage maximization via sketching"
    - "almost optimal streaming algorithms for coverage problems"
    - "better streaming algorithms for the maximum coverage problem"
    - "submodular maximization over sliding windows"

Connected through hyperedge HE-6 (induced by source paper "metric sublinear algorithms via linear sampling"):
  with members:
    - "sublinear algorithms for maxcut and correlation clustering"
    - "a 2 ϵ approximation for maximum weight matching in the semi streaming model"
    - "distributed coverage maximization via sketching"
    - "almost optimal streaming algorithms for coverage problems"
    - "towards tight bounds for the streaming set cover problem"
    - "densest subgraph in dynamic graph streams"
    - "tight bounds for linear sketches of approximate matchings"
    - "line large scale information network embedding"

Connected through hyperedge HE-7 (induced by source paper "better streaming algorithms for the maximum coverage problem"):
  with members:
    - "correlation clustering in data streams"
    - "almost optimal streaming algorithms for coverage problems"
    - "tight bounds for single pass streaming complexity of the set cover problem"
    - "towards tight bounds for the streaming set cover problem"
    - "densest subgraph in dynamic graph streams"
    - "streaming algorithms for submodular function maximization"
    - "incidence geometries and the pass complexity of semi streaming set cover"
    - "maximum matching in turnstile streams"

Question: Please tell me which class the center node 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)