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: "practical period finding on ibm q quantum speedups in the presence of errors"
  Abstract: We implemented Simon's quantum period finding circuit for functions $\mathbb{F}_2^n \rightarrow \mathbb{F}_2^n$ with period $\vec s \in \mathbb{F}_2^n$ up to $n=7$ on the 14-qubit quantum device IBM Q 16 Melbourne. Our experiments show that with a certain probability $\tau(n)$ we measure erroneous vectors that are not orthogonal to $\vec s$. While Simon's algorithm for extracting $\vec s$ runs in polynomial time in the error-free case $\tau(n)=0$, we show that the problem of extracting $\vec s \in \mathbb{F}_2^n$ in the general setting $0 \leq \tau(n) \leq \frac 1 2$ is as hard as solving LPN (Learning Parity with Noise) with parameters $n$ and $\tau(n)$. Hence, in the error-prone case we may not hope to find periods in time polynomial in $n$. However, we also demonstrate theoretically and experimentally that erroneous quantum measurements are still useful to find periods faster than with purely classical algorithms, even for large errors $\tau(n)$ close to $\frac 1 2$.

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.CR(Cryptography and Security)