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: "high rate locally correctable codes via lifting"
  Abstract: We present a general framework for constructing high rate error correcting codes that are locally correctable (and hence locally decodable if linear) with a sublinear number of queries, based on lifting codes with respect to functions on the coordinates. Our approach generalizes the lifting of affine-invariant codes of Guo, Kopparty, and Sudan and its generalization automorphic lifting, suggested by Ben-Sasson et al, which lifts algebraic geometry codes with respect to a group of automorphisms of the code. Our notion of lifting is a natural alternative to the degree-lifting of Ben-Sasson et al and it carries two advantages. First, it overcomes the rate barrier inherent in degree-lifting. Second, it is extremely flexible, requiring no special properties (e.g. linearity, invariance) of the base code, and requiring very little structure on the set of functions on the coordinates of the code. #R##N#As an application, we construct new explicit families of locally correctable codes by lifting algebraic geometry codes. Like the multiplicity codes of Kopparty, Saraf, Yekhanin and the affine-lifted codes of Guo, Kopparty, Sudan, our codes of block-length $N$ can achieve $N^\epsilon$ query complexity and $1-\alpha$ rate for any given $\epsilon, \alpha > 0$ while correcting a constant fraction of errors, in contrast to the Reed-Muller codes and the degree-lifted AG codes of Ben-Sasson et al which face a rate barrier of $\epsilon^{O(1/\epsilon)}$. However, like the degree-lifted AG codes, our codes are over an alphabet significantly smaller than that obtained by Reed-Muller codes, affine-lifted codes, and multiplicity codes.

Connected through hyperedge HE-1 (induced by source paper "lifted reed solomon codes with application to batch codes"):
  with members:
    - "lifted multiplicity codes and the disjoint repair group property"
    - "constructions of batch codes via finite geometry"
    - "batch and pir codes and their connections to locally repairable codes"
    - "nearly optimal constructions of pir and batch codes"
    - "lower bound on the redundancy of pir codes"
    - "new affine invariant codes from lifting"

Connected through hyperedge HE-2 (induced by source paper "weighted lifted codes local correctabilities and application to robust private information retrieval"):
  with members:
    - "private information retrieval from mds coded data in distributed storage systems"
    - "private information retrieval in distributed storage systems using an arbitrary linear code"
    - "private information retrieval from coded databases with colluding servers"
    - "a storage efficient and robust private information retrieval scheme allowing few servers"
    - "new affine invariant codes from lifting"
    - "weighted reed muller codes revisited"

Connected through hyperedge HE-3 (induced by source paper "efficient multi point local decoding of reed muller codes via interleaved codex"):
  with members:
    - "efficiently list decodable punctured reed muller codes"
    - "efficiently decoding reed muller codes from random errors"
    - "efficient list decoding of punctured reed muller codes"
    - "new affine invariant codes from lifting"

Connected through hyperedge HE-4 (induced by source paper "on multi point local decoding of reed muller codes"):
  with members:
    - "efficiently decoding reed muller codes from random errors"
    - "efficient list decoding of punctured reed muller codes"
    - "new affine invariant codes from lifting"

Connected through hyperedge HE-5 (induced by source paper "some remarks on multiplicity codes"):
  with members:
    - "local correctability of expander codes"
    - "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-6 (induced by source paper "list decoding algorithms for lifted codes"):
  with members:
    - "local correctability of expander codes"
    - "new affine invariant codes from lifting"

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)