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: "high rate locally correctable and locally testable codes with sub polynomial query complexity"
  Abstract: In this work, we construct the first locally-correctable codes (LCCs), and locally-testable codes (LTCs) with constant rate, constant relative distance, and sub-polynomial query complexity. Specifically, we show that there exist binary LCCs and LTCs with block length $n$, constant rate (which can even be taken arbitrarily close to 1), constant relative distance, and query complexity $\exp(\tilde{O}(\sqrt{\log n}))$. Previously such codes were known to exist only with $\Omega(n^{\beta})$ query complexity (for constant $\beta > 0$), and there were several, quite different, constructions known. #R##N#Our codes are based on a general distance-amplification method of Alon and Luby~\cite{AL96_codes}. We show that this method interacts well with local correctors and testers, and obtain our main results by applying it to suitably constructed LCCs and LTCs in the non-standard regime of \emph{sub-constant relative distance}. #R##N#Along the way, we also construct LCCs and LTCs over large alphabets, with the same query complexity $\exp(\tilde{O}(\sqrt{\log n}))$, which additionally have the property of approaching the Singleton bound: they have almost the best-possible relationship between their rate and distance. This has the surprising consequence that asking for a large alphabet error-correcting code to further be an LCC or LTC with $\exp(\tilde{O}(\sqrt{\log n}))$ query complexity does not require any sacrifice in terms of rate and distance! Such a result was previously not known for any $o(n)$ query complexity. #R##N#Our results on LCCs also immediately give locally-decodable codes (LDCs) with the same parameters.

Connected through hyperedge HE-1 (induced by source paper "complexity theory game theory and economics the barbados lectures"):
  with members:
    - "a round collapse theorem for computationally sound protocols or tfnp is hard on average in pessiland"
    - "on communication complexity of fixed point computation"
    - "near optimal communication lower bounds for approximate nash equilibria"
    - "query to communication lifting for bpp"
    - "lifting randomized query complexity to randomized communication complexity"
    - "settling the complexity of computing approximate two player nash equilibria"
    - "communication complexity of approximate nash equilibria"
    - "the price of anarchy in auctions"

Connected through hyperedge HE-2 (induced by source paper "lifted multiplicity codes and the disjoint repair group property"):
  with members:
    - "batch and pir codes and their connections to locally repairable codes"
    - "nearly optimal constructions of pir and batch codes"
    - "locality via partially lifted codes"
    - "lower bound on the redundancy of pir codes"
    - "bounds on the parameters of locally recoverable codes"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "bounds on locally recoverable codes with multiple recovering sets"

Connected through hyperedge HE-3 (induced by source paper "lifted multiplicity codes"):
  with members:
    - "batch and pir codes and their connections to locally repairable codes"
    - "lower bound on the redundancy of pir codes"
    - "bounds on the parameters of locally recoverable codes"
    - "some remarks on multiplicity codes"
    - "bounds on locally recoverable codes with multiple recovering sets"

Connected through hyperedge HE-4 (induced by source paper "on locally decodable codes in resource bounded channels"):
  with members:
    - "relaxed locally correctable codes in computationally bounded channels"
    - "sustained space complexity"
    - "optimal rate code constructions for computationally simple channels"

Connected through hyperedge HE-5 (induced by source paper "on taking advantage of multiple requests in error correcting codes"):
  with members:
    - "local list recovery of high rate tensor codes and applications"
    - "locality via partially lifted codes"
    - "on multi point local decoding of reed muller codes"
    - "cooperative local repair in distributed storage"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "codes with locality for two erasures"
    - "a family of optimal locally recoverable codes"

Connected through hyperedge HE-6 (induced by source paper "improved decoding of folded reed solomon and multiplicity codes"):
  with members:
    - "average radius list recovery of random linear codes it really ties the room together"
    - "linear time list recovery of high rate expander codes"
    - "list decoding algorithms for lifted codes"
    - "folded codes from function field towers and improved optimal rate list decoding"
    - "subspace evasive sets"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-7 (induced by source paper "relaxed locally correctable codes in computationally bounded channels"):
  with members:
    - "sustained space complexity"
    - "optimal hashing based time space trade offs for approximate near neighbors"
    - "optimal rate code constructions for computationally simple channels"
    - "some applications of coding theory in computational complexity"

Connected through hyperedge HE-8 (induced by source paper "spanoids an abstraction of spanning structures and a barrier for lccs"):
  with members:
    - "breaking the quadratic barrier for 3 lccs over the reals"

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)