human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "linear time list recovery of high rate expander codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "linear time erasure list decoding of expander codes")
  Member "some remarks on multiplicity codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "beyond the guruswami sudan and parvaresh vardy radii folded reed solomon multiplicity and derivative codes")
  Member "local correctability of expander codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "linear time erasure list decoding of expander codes")
  Member "some improvements to total degree tests":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust multiplication based tests for reed muller codes")
  Member "new affine invariant codes from lifting":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lifted reed solomon codes with application to batch codes")
  Member "a combination of testability and decodability by tensor products":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "settling the complexity of computing approximate two player nash equilibria")
  Member "dense locally testable codes cannot have constant rate and distance":
    also connected through other hyperedges:
      (none)
  Member "locally decodable codes from nice subsets of finite fields and prime factors of mersenne numbers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "new lower bounds for matching vector codes")

Question: Please tell me which class the source paper 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)