human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "lifted reed solomon codes with application to batch codes"):
  Abstract: Guo, Kopparty and Sudan have initiated the study of error-correcting codes derived by lifting of affine-invariant codes. Lifted Reed-Solomon (RS) codes are defined as the evaluation of polynomials in a vector space over a field by requiring their restriction to every line in the space to be a codeword of the RS code. In this paper, we investigate lifted RS codes and discuss their application to batch codes, a notion introduced in the context of private information retrieval and load-balancing in distributed storage systems. First, we improve the estimate of the code rate of lifted RS codes for lifting parameter $m\ge 3$ and large field size. Second, a new explicit construction of batch codes utilizing lifted RS codes is proposed. For some parameter regimes, our codes have a better trade-off between parameters than previously known batch codes.

Includes members:
  Member "lifted multiplicity codes and the disjoint repair group property":
    also connected through other hyperedges:
      (none)
  Member "constructions of batch codes via finite geometry":
    also connected through other hyperedges:
      (none)
  Member "batch and pir codes and their connections to locally repairable codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes")
  Member "nearly optimal constructions of pir and batch codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "array codes for functional pir and batch codes")
  Member "lower bound on the redundancy of pir codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "pir codes with short block length")
  Member "high rate locally correctable codes via lifting":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "weighted lifted codes local correctabilities and application to robust private information retrieval")
  Member "new affine invariant codes from lifting":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lifted multiplicity codes and the disjoint repair group property")

Question: Please tell me which class the source paper 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)