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: "fast computation of isomorphisms between finite fields using elliptic curves"
  Abstract: We propose a randomized algorithm to compute isomorphisms between finite fields using elliptic curves. To compute an isomorphism between two fields of cardinality $q^n$, our algorithm takes $\widetilde{O}\left(n \log^2 q + \max_{\ell} (\ell^{n_\ell + 1} \log^2 q + \ell \log^5q)\right)$ time, where $\ell$ runs through primes dividing $n$ but not $q(q-1)$ and $n_\ell$ denotes the highest power of $\ell$ dividing $n$. Prior to this work, the best known run time dependence on $n$ was quadratic. Our run time dependence on $n$ is at worst quadratic but is subquadratic if $n$ has no large prime factor. In particular, the $n$ for which our run time is linear in $n$ have natural density at least $3/10$.The crux of our approach is finding preimages under the Lang map on elliptic curves over finite fields. We formulate a computational problem concerning Lang maps whose resolution would solve the finite field isomorphism problem with run time linear in $n$.

Connected through hyperedge HE-1 (induced by source paper "computing isomorphisms and embeddings of finite fields"):
  with members:
    - "powers of tensors and fast matrix multiplication"
    - "taking roots over high extensions of finite fields"
    - "faster polynomial multiplication via multipoint kronecker substitution"

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)