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: "on the list decodability of random linear codes"
  Abstract: For every fixed finite field $\F_q$, $p \in (0,1-1/q)$ and $\epsilon > 0$, we prove that with high probability a random subspace $C$ of $\F_q^n$ of dimension $(1-H_q(p)-\epsilon)n$ has the property that every Hamming ball of radius $pn$ has at most $O(1/\epsilon)$ codewords. #R##N#This answers a basic open question concerning the list-decodability of linear codes, showing that a list size of $O(1/\epsilon)$ suffices to have rate within $\epsilon$ of the "capacity" $1-H_q(p)$. Our result matches up to constant factors the list-size achieved by general random codes, and gives an exponential improvement over the best previously known list-size bound of $q^{O(1/\epsilon)}$. #R##N#The main technical ingredient in our proof is a strong upper bound on the probability that $\ell$ random vectors chosen from a Hamming ball centered at the origin have too many (more than $\Theta(\ell)$) vectors from their linear span also belong to the ball.

Connected through hyperedge HE-1 (induced by source paper "ldpc codes achieve list decoding capacity"):
  with members:
    - "improved list decodability of random linear binary codes"
    - "improved decoding of folded reed solomon and multiplicity codes"
    - "linear time list recovery of high rate expander codes"
    - "analysis of boolean functions"
    - "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"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "folded codes from function field towers and improved optimal rate list decoding"

Connected through hyperedge HE-2 (induced by source paper "combinatorial list decoding of reed solomon codes beyond the johnson radius"):
  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"
    - "restricted isometry of fourier matrices and list decodability of random linear codes"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-3 (induced by source paper "improved list decodability of random linear binary codes"):
  with members:
    - "on the list decodability of random linear rank metric codes"
    - "linear time list recovery of high rate expander codes"
    - "it ll probably work out improved list decoding through random operations"
    - "optimal locally repairable codes via rank metric codes"
    - "bounds on list decoding of rank metric codes"
    - "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"
    - "error resilience in distributed storage via rank metric codes"

Connected through hyperedge HE-4 (induced by source paper "code constructions for physical unclonable functions and biometric secrecy systems"):
  with members:
    - "controllable identifier measurements for private authentication with secret keys"
    - "secure and reliable key agreement with physical unclonable functions"
    - "privacy secrecy and storage with multiple noisy measurements of identifiers"
    - "the likelihood encoder for lossy compression"
    - "polar coding for secret key generation"
    - "informational divergence approximations to product distributions"
    - "secret key generation using correlated sources and channels"
    - "separation of reliability and secrecy in rate limited secret key generation"

Connected through hyperedge HE-5 (induced by source paper "on the list decodability of random linear rank metric codes"):
  with members:
    - "average radius list recovery of random linear codes it really ties the room together"
    - "some gabidulin codes cannot be list decoded efficiently at any radius"
    - "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"
    - "bounds on list decoding gabidulin codes"
    - "on identity testing of tensors low rank recovery and compressed sensing"
    - "restricted isometry of fourier matrices and list decodability of random linear codes"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-6 (induced by source paper "average radius list recovery of random linear codes it really ties the room together"):
  with members:
    - "linear time list recovery of high rate expander codes"
    - "it ll probably work out improved list decoding through random operations"
    - "on the list decodability of random linear codes with large error rates"

Connected through hyperedge HE-7 (induced by source paper "on the list decodability of random self orthogonal codes"):
  with members:
    - "on the list decodability of random linear codes with large error rates"

Connected through hyperedge HE-8 (induced by source paper "on list decodability of random rank metric codes"):
  with members:
    - "on the geometry of balls in the grassmannian and list decoding of lifted gabidulin codes"
    - "explicit rank metric codes list decodable with optimal redundancy"
    - "bounds on list decoding gabidulin codes"
    - "list decoding subspace codes from insertions and deletions"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "coding for errors and erasures in random network coding"
    - "packing and covering properties of rank metric 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)