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: "local correctability of expander codes"
  Abstract: In this work, we present the first local-decoding algorithm for expander codes. This yields a new family of constant-rate codes that can recover from a constant fraction of errors in the codeword symbols, and where any symbol of the codeword can be recovered with high probability by reading $N^\epsilon$ symbols from the corrupted codeword, where $N$ is the block-length of the code. #R##N#Expander codes, introduced by Sipser and Spielman, are formed from an expander graph $G = (V,E)$ of degree $d$, and an inner code of block-length $d$ over an alphabet $\Sigma$. Each edge of the expander graph is associated with a symbol in $\Sigma$. A string in $\Sigma^{E}$ will be a codeword if for each vertex in $V$, the symbols on the adjacent edges form a codeword in the inner code. #R##N#We show that if the inner code has a smooth reconstruction algorithm in the noiseless setting, then the corresponding expander code has an efficient local-correction algorithm in the noisy setting. Instantiating our construction with inner codes based on finite geometries, we obtain novel locally decodable codes with rate approaching one. This provides an alternative to the multiplicity codes of Kopparty, Saraf and Yekhanin (STOC '11) and the lifted codes of Guo, Kopparty and Sudan (ITCS '13).

Connected through hyperedge HE-1 (induced by source paper "linear time erasure list decoding of expander codes"):
  with members:
    - "ldpc codes achieve list decoding capacity"
    - "improved decoding of folded reed solomon and multiplicity codes"
    - "local list recovery of high rate tensor codes and applications"
    - "linear time list recovery of high rate expander codes"
    - "deletion codes in the high noise and high rate regimes"
    - "erasure list decodable codes from random and algebraic geometry codes"
    - "folded codes from function field towers and improved optimal rate list decoding"
    - "improved nearly mds expander codes"

Connected through hyperedge HE-2 (induced by source paper "lifted multiplicity codes and the disjoint repair group property"):
  with members:
    - "batch and pir codes and their connections to locally repairable codes"
    - "nearly optimal constructions of pir and batch codes"
    - "locality via partially lifted codes"
    - "lower bound on the redundancy of pir codes"
    - "bounds on the parameters of locally recoverable codes"
    - "high rate locally correctable and locally testable codes with sub polynomial query complexity"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"

Connected through hyperedge HE-3 (induced by source paper "on taking advantage of multiple requests in error correcting codes"):
  with members:
    - "local list recovery of high rate tensor codes and applications"
    - "locality via partially lifted codes"
    - "on multi point local decoding of reed muller codes"
    - "cooperative local repair in distributed storage"
    - "high rate locally correctable and locally testable codes with sub polynomial query complexity"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "codes with locality for two erasures"

Connected through hyperedge HE-4 (induced by source paper "on the local correctabilities of projective reed muller codes"):
  with members:
    - "the next to minimal weights of binary projective reed muller codes"
    - "high rate locally correctable and locally testable codes with sub polynomial query complexity"
    - "some applications of coding theory in computational complexity"

Connected through hyperedge HE-5 (induced by source paper "high rate locally correctable and locally testable codes with sub polynomial query complexity"):
  with members:
    - "linear time list recovery of high rate expander codes"
    - "some remarks on multiplicity codes"
    - "some improvements to total degree tests"
    - "new affine invariant codes from lifting"
    - "a combination of testability and decodability by tensor products"
    - "dense locally testable codes cannot have constant rate and distance"
    - "locally decodable codes from nice subsets of finite fields and prime factors of mersenne numbers"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-6 (induced by source paper "linear time list recovery of high rate expander codes"):
  with members:
    - "folded codes from function field towers and improved optimal rate list decoding"
    - "linear algebraic list decoding of folded reed solomon codes"
    - "subspace evasive sets"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"
    - "distance properties of expander codes"

Connected through hyperedge HE-7 (induced by source paper "some remarks on multiplicity codes"):
  with members:
    - "high rate locally correctable codes via lifting"
    - "new affine invariant codes from lifting"
    - "optimal rate list decoding via derivative codes"
    - "on lines and joints"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-8 (induced by source paper "batch codes through dense graphs without short cycles"):
  with members:
    - "locality and availability in distributed storage"
    - "optimal locally repairable and secure codes for distributed storage systems"
    - "linear batch codes"
    - "a family of optimal locally recoverable codes"
    - "optimal combinatorial batch codes based on block designs"
    - "xoring elephants novel erasure codes for big data"
    - "zigzag codes mds array codes with optimal rebuilding"
    - "optimal locally repairable codes and connections to matroid theory"

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)