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: "improved constructions for query efficient locally decodable codes of subexponential length"
  Abstract: A (k, δ, e)-locally decodable code $C:{\bf F}_{q}^{n} \ ightarrow {\bf F}_{q}^{N}$ is an error-correcting code that encodes $\vec{x}=(x_{1},x_{2},\ldots,x_{n}) \in {\bf F}_{q}^{n}$ to $C(\vec{x}) \in {\bf F}_{q}^{N}$ and has the following property: For any $\vec{y} \in {\bf F}_{q}^{N}$ such that $d(\vec{y},C(\vec{x})) \leq \delta N$ and each 1 l i l n, the symbol xi of $ of $\vec{x}$ can be recovered with probability at least 1 - e by a randomized decoding algorithm looking at only k coordinates of $\vec{y}$. The efficiency of a (k, δ, e)-locally decodable code $C:{\bf F}_{q}^{n} \ ightarrow {\bf F}_{q}^{N}$ is measured by the code length N and the number k of queries. For a k-query locally decodable code $C:{\bf F}_{q}^{n} \ ightarrow {\bf F}_{q}^{N}$, the code length N was conjectured to be exponential of n, i.e., N = exp(nΩ(1)), however, this was disproved. Yekhanin [In Proc. of STOC, 2007] showed that there exists a 3-query locally decodable code $C:{\bf F}_{2}^{n} \ ightarrow {\bf F}_{2}^{N}$ such that N=exp(n1/log log n) assuming that infinitely many Mersenne primes exist. For a 3-query locally decodable code $C:{\bf F}_{q}^{n} \ ightarrow {\bf F}_{q}^{N}$, Efremenko [ECCC Report No.69, 2008] further reduced the code length to $N=\exp(n^{O((\log \log n/ \log n)^{1/2})})$, and in general showed that for any integer r > 1, there exists a 2r-query locally decodable code $C:{\bf F}_{q}^{n} \ ightarrow {\bf F}_{q}^{N}$ such that $N=\exp(n^{O((\log \log n/ \log n)^{1-1/r})})$. In this paper, we will present improved constructions for query-efficient locally decodable codes by introducing a technique of “composition of locally decodable codes,” and show that for any integer r > 5, there exists a 9 · 2r-4-query locally decodable code $C:{\bf F}_{q}^{n} \ ightarrow {\bf F}_{q}^{N}$ such that $N=\exp(n^{O((\log \log n/ \log n)^{1-1/r})})$.

Connected through hyperedge HE-1 (induced by source paper "2 server pir with sub polynomial communication"):
  with members:
    - "public key exchange using matrices over group rings"
    - "query efficient locally decodable codes of subexponential length"

Connected through hyperedge HE-2 (induced by source paper "local correctability of expander codes"):
  with members:
    - "new affine invariant codes from lifting"
    - "query efficient locally decodable codes of subexponential length"
    - "distance properties of expander codes"

Connected through hyperedge HE-3 (induced by source paper "new lower bounds for matching vector codes"):
  with members:
    - "an additive combinatorics approach to the log rank conjecture in communication complexity"
    - "locally decodable codes from nice subsets of finite fields and prime factors of mersenne numbers"
    - "some applications of coding theory in computational complexity"

Connected through hyperedge HE-4 (induced by source paper "on the bringer chabanne epir protocol for polynomial evaluation"):
  with members:
    - "query efficient locally decodable codes of subexponential length"

Connected through hyperedge HE-5 (induced by source paper "query efficient locally decodable codes of subexponential length"):
  with members:
    - "locally decodable codes from nice subsets of finite fields and prime factors of mersenne numbers"
    - "some applications of coding theory in computational complexity"

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)