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 multiplicity codes"):
  Abstract: Lifted Reed Solomon Codes (Guo, Kopparty, Sudan 2013) were introduced in the context of locally correctable and testable codes. They are multivariate polynomials whose restriction to any line is a codeword of a Reed-Solomon code. We generalize their construction by introducing lifted multiplicity codes, multivariate polynomial codes whose restriction to any line is a codeword of a multiplicity code (Kopparty, Saraf, Yekhanin 2014). We show that lifted multiplicity codes have a better trade-off between redundancy and a notion of locality called the $t$-disjoint-repair-group property than previously known constructions. More precisely, we show that lifted multiplicity codes with length $N$ and redundancy $O(t^{0.585} \sqrt{N})$ have the property that any symbol of a codeword can be reconstructed in $t$ different ways, each using a disjoint subset of the other coordinates. This gives the best known trade-off for this problem for any super-constant $t < \sqrt{N}$. We also give an alternative analysis of lifted Reed Solomon codes using dual codes, which may be of independent interest.

Includes members:
  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 "lower bound on the redundancy of pir codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "pir codes with short block length")
  Member "bounds on the parameters of locally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "some remarks on multiplicity codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "beyond the guruswami sudan and parvaresh vardy radii folded reed solomon multiplicity and derivative codes")
  Member "high rate locally correctable and locally testable codes with sub polynomial query complexity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "bounds on locally recoverable codes with multiple recovering sets":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")

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)