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 "improved efficiency for explicit covering codes matching the sphere covering bound"):
  Abstract: A covering code is a subset of vectors over a finite field with the property that any vector in the space is close to some codeword in Hamming distance. Blinovsky [Bli90] showed that most linear codes have covering radius attaining the sphere-covering bound. Taking the direct sum of all $2^{O(n^2)}$ linear codes gives an explicit code with optimal covering density, which is, to our knowledge, the most efficient construction. In this paper, we improve the randomness efficiency of this construction by proving optimal covering property of a Wozencraft-type ensemble. This allows us to take the direct sum of only $2^{O(n\log n)}$ many codes to achieve the same covering goodness. The proof is an application of second moment method coupled with an iterative random shift trick along the lines of Blinovsky.

Includes members:
  Member "chain generalization of covering code and deterministic algorithm for k sat":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the curse and blessing of not all equal in k satisfiability")
  Member "asymptotic improvement of the gilbert varshamov bound for linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "distribution of the minimal distance of random linear 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.IT(Information Theory)