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: "junta correlation is testable"
  Abstract: The problem of tolerant junta testing is a natural and challenging problem which asks if the property of a function having some specified correlation with a $k$-Junta is testable. In this paper we give an affirmative answer to this question: We show that given distance parameters $\frac{1}{2} >c_u>c_{\ell} \ge 0$, there is a tester which given oracle access to $f:\{-1,1\}^n \rightarrow \{-1,1\}$, with query complexity $ 2^k \cdot \mathsf{poly}(k,1/|c_u-c_{\ell}|)$ and distinguishes between the following cases: #R##N#$\mathbf{1.}$ The distance of $f$ from any $k$-junta is at least $c_u$; #R##N#$\mathbf{2.}$ There is a $k$-junta $g$ which has distance at most $c_\ell$ from $f$. #R##N#This is the first non-trivial tester (i.e., query complexity is independent of $n$) which works for all $1/2 > c_u > c_\ell \ge 0$. The best previously known results by Blais \emph{et~ al.}, required $c_u \ge 16 c_\ell$. In fact, with the same query complexity, we accomplish the stronger goal of identifying the most correlated $k$-junta, up to permutations of the coordinates. #R##N#We can further improve the query complexity to $\mathsf{poly}(k, 1/|c_u-c_{\ell}|)$ for the (weaker) task of distinguishing between the following cases: #R##N#$\mathbf{1.}$ The distance of $f$ from any $k'$-junta is at least $c_u$. #R##N#$\mathbf{2.}$ There is a $k$-junta $g$ which is at a distance at most $c_\ell$ from $f$. #R##N#Here $k'=O(k^2/|c_u-c_\ell|)$. #R##N#Our main tools are Fourier analysis based algorithms that simulate oracle access to influential coordinates of functions.

Connected through hyperedge HE-1 (induced by source paper "approximating the distance to monotonicity of boolean functions"):
  with members:
    - "testing unateness nearly optimally"
    - "lower bounds for tolerant junta and unateness testing via rejection sampling of graphs"
    - "beyond talagrand functions new lower bounds for testing monotonicity and unateness"
    - "settling the query complexity of non adaptive junta testing"
    - "optimal unateness testers for real valued functions adaptivity helps"
    - "tolerant junta testing and the connection to submodular optimization and function isomorphism"
    - "boolean function monotonicity testing requires almost n 1 2 non adaptive queries"
    - "new algorithms and lower bounds for monotonicity testing"

Connected through hyperedge HE-2 (induced by source paper "hard properties with very short pcpps and their applications"):
  with members:
    - "lower bounds for tolerant junta and unateness testing via rejection sampling of graphs"
    - "earthmover resilience and testing in ordered structures"
    - "erasure resilient property testing"
    - "tolerant junta testing and the connection to submodular optimization and function isomorphism"
    - "tolerant testers of image properties"

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.CC(Computational Complexity)