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 "a combination of testability and decodability by tensor products"):
  Abstract: Ben-Sasson and Sudan (RSA 2006) showed that repeated tensor products of linear codes with a very large distance are locally testable. Due to the requirement of a very large distance the associated tensor products could be applied only over sufficiently large fields. Then Meir (SICOMP 2009) used this result (as a black box) to present a combinatorial construction of locally testable codes that match best known parameters. As a consequence, this construction was obtained over sufficiently large fields. #R##N#In this paper we improve the result of Ben-Sasson and Sudan and show that for \emph{any} linear codes the associated tensor products are locally testable. Consequently, the construction of Meir can be taken over any field, including the binary field. #R##N#Moreover, a combination of our result with the result of Spielman (IEEE IT, 1996) implies a construction of linear codes (over any field) that combine the following properties: have constant rate and constant relative distance; have blocklength $n$ and testable with $n^{\epsilon}$ queries, for any constant $\epsilon > 0$; linear time encodable and linear-time decodable from a constant fraction of errors. #R##N#Furthermore, a combination of our result with the result of Guruswami et al. (STOC 2009) implies a similar corollary regarding the list-decodable codes.

Includes members:
  Member "list decoding tensor products and interleaved codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new lower bounds on the generalized hamming weights of ag codes")
  Member "adaptive simulated annealing a near optimal connection between sampling and counting":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fast sampling and counting k sat solutions in the local lemma regime")
  Member "improved nearly mds expander codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "linear time erasure list decoding of expander codes")
  Member "robust locally testable codes and products of codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "high rate locally correctable and locally testable codes with sub polynomial query complexity")
  Member "some applications of coding theory in computational complexity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a lower bound for relaxed locally decodable 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)