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: "on the hardness of distance oracle for sparse graph"
  Abstract: In this paper we show that set-intersection is harder than distance oracle on sparse graphs. Given a collection of total size n which consists of m sets drawn from universe U, the set-intersection problem is to build a data structure which can answer whether two sets have any intersection. A distance oracle is a data structure which can answer distance queries on a given graph. We show that if one can build distance oracle for sparse graph G=(V,E), which requires s(|V|,|E|) space and answers a (2-\epsilon,c)-approximate distance query in time t(|V|,|E|) where (2-\epsilon) is a multiplicative error and c is a constant additive error, then, set-intersection can be solved in t(m+|U|,n) time using s(m+|U|,n) space.

Connected through hyperedge HE-1 (induced by source paper "fast join project query evaluation using matrix multiplication"):
  with members:
    - "memory efficient group by aggregates over multi way joins"
    - "trade offs in static and dynamic evaluation of hierarchical queries"
    - "size bounds and query plans for relational joins"
    - "extracting and analyzing hidden graphs from relational databases"
    - "compressed representations of conjunctive query results"
    - "improved rectangular matrix multiplication using powers of the coppersmith winograd tensor"
    - "set containment join revisited"
    - "data structure lower bounds for document indexing problems"

Connected through hyperedge HE-2 (induced by source paper "on the hardness of set disjointness and set intersection with bounded universe"):
  with members:
    - "how hard is it to find honest witnesses"
    - "conditional lower bounds for space time tradeoffs"
    - "data structure lower bounds for document indexing problems"
    - "dynamic set intersection"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "on hardness of jumbled indexing"
    - "higher lower bounds from the 3sum conjecture"
    - "approximate distance oracle with constant query time"

Connected through hyperedge HE-3 (induced by source paper "hardness of exact distance queries in sparse graphs through hub labeling"):
  with members:
    - "near optimal compression for the planar graph metric"
    - "a note on distance labeling in planar graphs"
    - "linear size distance preservers"
    - "optimal distance labeling schemes for trees"
    - "simpler faster and shorter labels for distances in graphs"
    - "sublinear space distance labeling using hubs"
    - "maximum matching in turnstile streams"
    - "sublinear distance labeling"

Connected through hyperedge HE-4 (induced by source paper "conditional lower bounds for space time tradeoffs"):
  with members:
    - "how hard is it to find honest witnesses"
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"
    - "clustered integer 3sum via additive combinatorics"
    - "subtree isomorphism revisited"
    - "if the current clique algorithms are optimal so is valiant s parser"
    - "quadratic conditional lower bounds for string problems and dynamic time warping"
    - "why walking the dog takes time frechet distance has no strongly subquadratic algorithms unless seth fails"
    - "dynamic set intersection"

Connected through hyperedge HE-5 (induced by source paper "pruning based distance sketches with provable guarantees on random graphs"):
  with members:
    - "an axiomatic and an average case analysis of algorithms and heuristics for metric properties of graphs"
    - "algorithmic and hardness results for the hub labeling problem"
    - "on the complexity of hub labeling"
    - "sublinear distance labeling for sparse graphs"
    - "route planning in transportation networks"
    - "hop doubling label indexing for point to point distance querying on scale free networks"
    - "a scalable generative graph model with community structure"
    - "separating hierarchical and general hub labelings"

Connected through hyperedge HE-6 (induced by source paper "compressed representations of conjunctive query results"):
  with members:
    - "size bounds and query plans for relational joins"
    - "conditional lower bounds for space time tradeoffs"
    - "answering conjunctive queries under updates"
    - "extracting and analyzing hidden graphs from relational databases"
    - "data structure lower bounds for document indexing problems"
    - "aggregation and ordering in factorised databases"
    - "structural tractability of counting of solutions to conjunctive queries"
    - "skew strikes back new developments in the theory of join algorithms"

Connected through hyperedge HE-7 (induced by source paper "orthogonal vectors indexing"):
  with members:
    - "conditional lower bounds for space time tradeoffs"
    - "subquadratic algorithms for succinct stable matching"
    - "faster online matrix vector multiplication"
    - "quadratic conditional lower bounds for string problems and dynamic time warping"
    - "why walking the dog takes time frechet distance has no strongly subquadratic algorithms unless seth fails"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "edit distance cannot be computed in strongly subquadratic time unless seth is false"
    - "known algorithms for edge clique cover are probably optimal"

Connected through hyperedge HE-8 (induced by source paper "data structure lower bounds for document indexing problems"):
  with members:
    - "clustered integer 3sum via additive combinatorics"
    - "space efficient string indexing for wildcard pattern matching"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "dictionary matching with one gap"
    - "higher lower bounds from the 3sum conjecture"
    - "word packing algorithms for dynamic connectivity and dynamic sets"
    - "orthogonal range searching on the ram revisited"
    - "string indexing for patterns with wildcards"

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)