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: "list decoding tensor products and interleaved codes"
  Abstract: We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. We show that for {\em every} code, the ratio of its list decoding radius to its minimum distance stays unchanged under the tensor product operation (rather than squaring, as one might expect). This gives the first efficient list decoders and new combinatorial bounds for some natural codes including multivariate polynomials where the degree in each variable is bounded. We show that for {\em every} code, its list decoding radius remains unchanged under $m$-wise interleaving for an integer $m$. This generalizes a recent result of Dinur et al \cite{DGKS}, who proved such a result for interleaved Hadamard codes (equivalently, linear transformations). Using the notion of generalized Hamming weights, we give better list size bounds for {\em both} tensoring and interleaving of binary linear codes. By analyzing the weight distribution of these codes, we reduce the task of bounding the list size to bounding the number of close-by low-rank codewords. For decoding linear transformations, using rank-reduction together with other ideas, we obtain list size bounds that are tight over small fields.

Connected through hyperedge HE-1 (induced by source paper "new lower bounds on the generalized hamming weights of ag codes"):
  with members:
    - "an extension of massey scheme for secret sharing"
    - "on some invariants in numerical semigroups and estimations of the order bound"
    - "on the order bounds for one point ag codes"
    - "on semigroups generated by two consecutive integers and improved hermitian codes"

Connected through hyperedge HE-2 (induced by source paper "edge coloring and stopping sets analysis in product codes with mds components"):
  with members:
    - "a bound on rate of codes with locality with sequential recovery from multiple erasures"
    - "reed muller codes achieve capacity on erasure channels"
    - "reed muller codes achieve capacity on the binary erasure channel under map decoding"
    - "codes with locality for two erasures"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "irregular product codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-3 (induced by source paper "decoding of repeated root cyclic codes up to new bounds on their minimum distance"):
  with members:
    - "generalizing bounds on the minimum distance of cyclic codes using cyclic product codes"
    - "a new bound on the minimum distance of cyclic codes using small minimum distance cyclic codes"
    - "linear algebraic list decoding of folded reed solomon codes"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"

Connected through hyperedge HE-4 (induced by source paper "the weight hierarchy of some reducible cyclic codes"):
  with members:
    - "new lower bounds on the generalized hamming weights of ag codes"
    - "generalized hamming weights of irreducible cyclic codes"

Connected through hyperedge HE-5 (induced by source paper "it ll probably work out improved list decoding through random operations"):
  with members:
    - "every list decodable code for high noise has abundant near optimal rate puncturings"
    - "on the list decodability of random linear codes with large error rates"
    - "combinatorial limitations of average radius list decoding"
    - "folded codes from function field towers and improved optimal rate list decoding"
    - "restricted isometry of fourier matrices and list decodability of random linear codes"
    - "linear algebraic list decoding of folded reed solomon codes"
    - "subspace evasive sets"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-6 (induced by source paper "list decoding group homomorphisms between supersolvable groups"):
  with members:
    - "group homomorphisms as error correcting codes"
    - "linear algebraic list decoding of folded reed solomon codes"
    - "optimal rate list decoding via derivative codes"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-7 (induced by source paper "restricted isometry of fourier matrices and list decodability of random linear codes"):
  with members:
    - "coding theoretic methods for sparse recovery"
    - "applications of derandomization theory in coding"
    - "on the list decodability of random linear codes"
    - "new and improved johnson lindenstrauss embeddings via the restricted isometry property"

Connected through hyperedge HE-8 (induced by source paper "a combination of testability and decodability by tensor products"):
  with members:
    - "adaptive simulated annealing a near optimal connection between sampling and counting"
    - "improved nearly mds expander codes"
    - "robust locally testable codes and products of codes"
    - "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.IT(Information Theory)