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: "new affine invariant codes from lifting"
  Abstract: In this work we explore error-correcting codes derived from the "lifting" of "affine-invariant" codes. Affine-invariant codes are simply linear codes whose coordinates are a vector space over a field and which are invariant under affine-transformations of the coordinate space. Lifting takes codes defined over a vector space of small dimension and lifts them to higher dimensions by requiring their restriction to every subspace of the original dimension to be a codeword of the code being lifted. While the operation is of interest on its own, this work focusses on new ranges of parameters that can be obtained by such codes, in the context of local correction and testing. In particular we present four interesting ranges of parameters that can be achieved by such lifts, all of which are new in the context of affine-invariance and some may be new even in general. The main highlight is a construction of high-rate codes with sublinear time decoding. The only prior construction of such codes is due to Kopparty, Saraf and Yekhanin \cite{KSY}. All our codes are extremely simple, being just lifts of various parity check codes (codes with one symbol of redundancy), and in the final case, the lift of a Reed-Solomon code. #R##N#We also present a simple connection between certain lifted codes and lower bounds on the size of "Nikodym sets". Roughly, a Nikodym set in $\mathbb{F}_q^m$ is a set $S$ with the property that every point has a line passing through it which is almost entirely contained in $S$. While previous lower bounds on Nikodym sets were roughly growing as $q^m/2^m$, we use our lifted codes to prove a lower bound of $(1 - o(1))q^m$ for fields of constant characteristic.

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"
    - "high rate locally correctable codes via lifting"

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 "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"
    - "high rate locally correctable codes via lifting"
    - "weighted reed muller codes revisited"

Connected through hyperedge HE-4 (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-5 (induced by source paper "lifted projective reed solomon codes"):
  with members:
    - "list decoding algorithms for lifted codes"

Connected through hyperedge HE-6 (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"
    - "high rate locally correctable codes via lifting"

Connected through hyperedge HE-7 (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"
    - "high rate locally correctable codes via lifting"

Connected through hyperedge HE-8 (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"
    - "local correctability of expander codes"
    - "some improvements to total degree tests"
    - "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"

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)