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: "locally decodable codes from nice subsets of finite fields and prime factors of mersenne numbers"
  Abstract: A k-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit x_i of the message by querying only k bits of the codeword C(x), even after some constant fraction of codeword bits has been corrupted. The major goal of LDC related research is to establish the optimal trade-off between length and query complexity of such codes. #R##N#Recently [Y] introduced a novel technique for constructing locally decodable codes and vastly improved the upper bounds for code length. The technique is based on Mersenne primes. In this paper we extend the work of [Y] and argue that further progress via these methods is tied to progress on an old number theory question regarding the size of the largest prime factors of Mersenne numbers. #R##N#Specifically, we show that every Mersenne number m=2^t-1 that has a prime factor p>m^\gamma yields a family of k(\gamma)-query locally decodable codes of length Exp(n^{1/t}). Conversely, if for some fixed k and all \epsilon > 0 one can use the technique of [Y] to obtain a family of k-query LDCs of length Exp(n^\epsilon); then infinitely many Mersenne numbers have prime factors arger than known currently.

Connected through hyperedge HE-1 (induced by source paper "high rate locally correctable and locally testable codes with sub polynomial query complexity"):
  with members:
    - "linear time list recovery of high rate expander codes"
    - "some remarks on multiplicity codes"
    - "local correctability of expander codes"
    - "some improvements to total degree tests"
    - "new affine invariant codes from lifting"
    - "a combination of testability and decodability by tensor products"
    - "dense locally testable codes cannot have constant rate and distance"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-2 (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"
    - "improved constructions for query efficient locally decodable codes of subexponential length"
    - "some applications of coding theory in computational complexity"

Connected through hyperedge HE-3 (induced by source paper "query efficient locally decodable codes of subexponential length"):
  with members:
    - "improved constructions for query efficient locally decodable codes of subexponential length"
    - "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)