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 decodable zero rate codes"
  Abstract: We consider list-decoding in the zero-rate regime for two cases: the binary alphabet and the spherical codes in Euclidean space. Specifically, we study the maximal $\tau \in [0,1]$ for which there exists an arrangement of $M$ balls of relative Hamming radius $\tau$ in the binary hypercube (of arbitrary dimension) with the property that no point of the latter is covered by $L$ or more of them. As $M\to \infty$ the maximal $\tau$ decreases to a well-known critical value $\tau_L$. In this work, we prove several results on the rate of this convergence. #R##N#For the binary case, we show that the rate is $\Theta(M^{-1})$ when $L$ is even, thus extending the classical results of Plotkin and Levenshtein for $L=2$. For $L=3$ the rate is shown to be $\Theta(M^{-\tfrac{2}{3}})$. #R##N#For the similar question about spherical codes, we prove the rate is $\Omega(M^{-1})$ and $O(M^{-\tfrac{2L}{L^2-L+2}})$.

Connected through hyperedge HE-1 (induced by source paper "generalized list decoding"):
  with members:
    - "list decodable linear regression"
    - "list decodable learning via sum of squares"
    - "list decodable robust mean estimation and learning mixtures of spherical gaussians"
    - "an improved bound on the fraction of correctable deletions"
    - "upper bound on list decoding radius of binary codes"
    - "a characterization of the capacity of online causal binary channels"
    - "it ll probably work out improved list decoding through random operations"
    - "list decoding reed muller codes over small fields"

Connected through hyperedge HE-2 (induced by source paper "on two fold packings of radius 1 balls in hamming graphs"):
  with members:
    - "a generalized concatenation construction for q ary 1 perfect codes"
    - "upper bound on list decoding radius of binary codes"

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)