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: "distributed pcp theorems for hardness of approximation in p"
  Abstract: We present a new distributed model of probabilistically checkable proofs (PCP). A satisfying assignment $x \in \{0,1\}^n$ to a CNF formula $\varphi$ is shared between two parties, where Alice knows $x_1, \dots, x_{n/2}$, Bob knows $x_{n/2+1},\dots,x_n$, and both parties know $\varphi$. The goal is to have Alice and Bob jointly write a PCP that $x$ satisfies $\varphi$, while exchanging little or no information. Unfortunately, this model as-is does not allow for nontrivial query complexity. Instead, we focus on a non-deterministic variant, where the players are helped by Merlin, a third party who knows all of $x$. #R##N#Using our framework, we obtain, for the first time, PCP-like reductions from the Strong Exponential Time Hypothesis (SETH) to approximation problems in P. In particular, under SETH we show that there are no truly-subquadratic approximation algorithms for Bichromatic Maximum Inner Product over {0,1}-vectors, Bichromatic LCS Closest Pair over permutations, Approximate Regular Expression Matching, and Diameter in Product Metric. All our inapproximability factors are nearly-tight. In particular, for the first two problems we obtain nearly-polynomial factors of $2^{(\log n)^{1-o(1)}}$; only $(1+o(1))$-factor lower bounds (under SETH) were known before.

Connected through hyperedge HE-1 (induced by source paper "graphs cannot be indexed in polynomial time for sub quadratic time string matching unless seth fails"):
  with members:
    - "regular languages meet prefix sorting"
    - "on prefix sorting finite automata"
    - "on the hardness and inapproximability of recognizing wheeler graphs"
    - "on the hardness of set disjointness and set intersection with bounded universe"
    - "lower bounds for text indexing with mismatches and differences"
    - "indexing variation graphs"
    - "improving viterbi is hard better runtimes imply faster clique algorithms"
    - "the gremlin graph traversal machine and language invited talk"

Connected through hyperedge HE-2 (induced by source paper "approximating subset sum is equivalent to min plus convolution"):
  with members:
    - "an improved fptas for 0 1 knapsack"
    - "approximating apsp without scaling equivalence of approximate min plus and exact min max"
    - "on problems equivalent to min convolution"
    - "subquadratic approximation scheme for partition"
    - "fast algorithms for knapsack via convolution and prediction"
    - "an equivalence class for orthogonal vectors"
    - "on integer programming and convolution"
    - "on the hardness of approximate and exact bichromatic maximum inner product"

Connected through hyperedge HE-3 (induced by source paper "the space complexity of inner product filters"):
  with members:
    - "norm ranging lsh for maximum inner product search"
    - "approximate nearest neighbors in limited space"
    - "adaptive mapreduce similarity joins"
    - "practical data dependent metric compression with provable guarantees"
    - "flexpoint an adaptive numerical format for efficient training of deep neural networks"
    - "bolt accelerated data mining with fast vector compression"
    - "scalable and robust set similarity join"
    - "on the complexity of inner product similarity join"

Connected through hyperedge HE-4 (induced by source paper "subsets and supermajorities unifying hashing based set similarity search"):
  with members:
    - "norm ranging lsh for maximum inner product search"
    - "an equivalence class for orthogonal vectors"
    - "hardness of approximate nearest neighbor search"
    - "fast similarity sketching"
    - "optimal hashing based time space trade offs for approximate near neighbors"
    - "on the complexity of inner product similarity join"
    - "polynomial representations of threshold functions and algorithmic applications"
    - "set similarity search beyond minhash"

Connected through hyperedge HE-5 (induced by source paper "similarity problems in high dimensions"):
  with members:
    - "approximate furthest neighbor with application to annulus query"
    - "embedjoin efficient edit similarity joins via embeddings"
    - "parameter free locality sensitive hashing for spherical range reporting"
    - "a framework for similarity search with space time tradeoffs using locality sensitive filtering"
    - "optimal hashing based time space trade offs for approximate near neighbors"
    - "set similarity search beyond minhash"
    - "distance sensitive bloom filters without false negatives"
    - "fast and powerful hashing using tabulation"

Connected through hyperedge HE-6 (induced by source paper "approximating apsp without scaling equivalence of approximate min plus and exact min max"):
  with members:
    - "on problems equivalent to min convolution"
    - "subquadratic approximation scheme for partition"
    - "hardness of approximate nearest neighbor search"
    - "on the hardness of approximate and exact bichromatic maximum inner product"
    - "from gap eth to fpt inapproximability clique dominating set and more"
    - "on the fine grained complexity of one dimensional dynamic programming"
    - "improved rectangular matrix multiplication using powers of the coppersmith winograd tensor"
    - "a fast numerical method for max convolution and the application to efficient max product inference in bayesian networks"

Connected through hyperedge HE-7 (induced by source paper "lower bounds for oblivious near neighbor search"):
  with members:
    - "sanns scaling up secure approximate k nearest neighbors search"
    - "hardness of approximate nearest neighbor search"
    - "scalable secure computation of statistical functions with applications to k nearest neighbors"
    - "lower bounds for oblivious data structures"
    - "crossing the logarithmic barrier for dynamic boolean data structure lower bounds"
    - "new unconditional hardness results for dynamic and online problems"
    - "secure k nearest neighbor query over encrypted data in outsourced environments"
    - "the cell probe complexity of dynamic range counting"

Connected through hyperedge HE-8 (induced by source paper "interaction hard thresholding consistent sparse quadratic regression in sub quadratic time and space"):
  with members:
    - "high dimensional robust sparse regression"
    - "on the hardness of approximate and exact bichromatic maximum inner product"
    - "nonconvex sparse learning via stochastic optimization with progressive variance reduction"
    - "a greedy approach for budgeted maximum inner product search"
    - "diamond sampling for approximate maximum all pairs dot product mad search"
    - "on iterative hard thresholding methods for high dimensional m estimation"
    - "sparse polynomial learning and graph sketching"
    - "compressed matrix multiplication"

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)