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: "preprocessing chains for fast dihedral rotations is hard or even impossible"
  Abstract: We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into two subchains, and a dihedral rotation rotates one of these chains rigidly about this edge. The problem is to determine, given a chain, an edge, and an angle of rotation, if the motion can be performed without causing the chain to self-intersect. An Omega(n log n) lower bound on the time complexity of this problem is known. #R##N#We prove that preprocessing a chain of n edges and answering n dihedral rotation queries is 3SUM-hard, giving strong evidence that solving n queries requires Omega(n^2) time in the worst case. For dynamic queries, which also modify the chain if the requested dihedral rotation is feasible, we show that answering n queries is by itself 3SUM-hard, suggesting that sublinear query time is impossible after any amount of preprocessing.

Connected through hyperedge HE-1 (induced by source paper "all non trivial variants of 3 ldt are equivalent"):
  with members:
    - "the strong 3sum indexing conjecture is false"
    - "3sum with preprocessing algorithms lower bounds and cryptographic applications"
    - "near optimal linear decision trees for k sum and related problems"
    - "how hard is it to find honest witnesses"
    - "improved bounds for 3sum k sum and linear degeneracy"
    - "clustered integer 3sum via additive combinatorics"
    - "threesomes degenerates and love triangles"
    - "on hardness of jumbled indexing"

Connected through hyperedge HE-2 (induced by source paper "data structures meet cryptography 3sum with preprocessing"):
  with members:
    - "the strong 3sum indexing conjecture is false"
    - "equivalence of systematic linear data structures and matrix rigidity"
    - "lower bounds for oblivious data structures"
    - "static data structure lower bounds imply rigidity"
    - "how hard is it to find honest witnesses"
    - "conditional lower bounds for space time tradeoffs"
    - "orthogonal vectors indexing"
    - "clustered integer 3sum via additive combinatorics"

Connected through hyperedge HE-3 (induced by source paper "3sum with preprocessing algorithms lower bounds and cryptographic applications"):
  with members:
    - "encoding 3sum"
    - "static data structure lower bounds imply rigidity"
    - "near optimal linear decision trees for k sum and related problems"
    - "conditional lower bounds for space time tradeoffs"
    - "orthogonal vectors indexing"
    - "clustered integer 3sum via additive combinatorics"
    - "threesomes degenerates and love triangles"
    - "on hardness of jumbled indexing"

Connected through hyperedge HE-4 (induced by source paper "the curse of medium dimension for geometric problems in almost every norm"):
  with members:
    - "subtree isomorphism revisited"
    - "simulating branching programs with edit distance and friends or a polylog shaved is a lower bound made"
    - "if the current clique algorithms are optimal so is valiant s parser"
    - "quadratic conditional lower bounds for string problems and dynamic time warping"
    - "probabilistic polynomials and hamming nearest neighbors"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "improved bounds for 3sum k sum and linear degeneracy"):
  with members:
    - "the decision tree complexity for k sum is at most nearly quadratic"
    - "clustered integer 3sum via additive combinatorics"
    - "solving k sum using few linear queries"
    - "why walking the dog takes time frechet distance has no strongly subquadratic algorithms unless seth fails"
    - "threesomes degenerates and love triangles"
    - "3sum hardness in dynamic data structures"
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "edit distance cannot be computed in strongly subquadratic time unless seth is false"

Connected through hyperedge HE-6 (induced by source paper "threesomes degenerates and love triangles"):
  with members:
    - "near optimal linear decision trees for k sum and related problems"
    - "connectivity oracles for graphs subject to vertex failures"
    - "subquadratic algorithms for algebraic generalizations of 3sum"
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"
    - "improved bounds for 3sum k sum and linear degeneracy"
    - "clustered integer 3sum via additive combinatorics"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "popular conjectures imply strong lower bounds for dynamic problems"):
  with members:
    - "on problems as hard as cnf sat"
    - "powers of tensors and fast matrix multiplication"
    - "3sum 3xor triangles"
    - "exact weight subgraphs and the k sum conjecture"
    - "faster all pairs shortest paths via circuit complexity"
    - "dynamic approximate all pairs shortest paths breaking the o mn barrier and derandomization"
    - "navigating central path with electrical flows from flows to matchings and back"
    - "deterministic parameterized connected vertex cover"

Connected through hyperedge HE-8 (induced by source paper "3sum hardness in dynamic data structures"):
  with members:
    - "popular conjectures imply strong lower bounds for dynamic problems"
    - "on hardness of jumbled indexing"
    - "improved distance oracles and spanners for vertex labeled graphs"
    - "fast set intersection and two patterns matching"

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.CG(Computational Geometry)