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 "private information retrieval from locally repairable databases with colluding servers"):
  Abstract: Information-theoretical private information retrieval (PIR) is considered from a coded database with colluding servers. The storage code is a locally repairable code (LRC) with maximal recoverability (MR), and in particular, with optimal global minimum distance, for arbitrary code parameters: Number of local groups $ g $, locality $ r $, local distance $ \delta $, dimension $ k \leq gr $ and length $ n = g(r + \delta - 1) $. Servers are identified bijectively with local groups, and only locally non-redundant information is considered and downloaded from each server, that is, only $ r $ nodes (out of $ r+\delta-1 $) are considered per server. When the remaining MDS code, after removing all locally redundant nodes, is a linearized Reed-Solomon code, a PIR scheme is provided achieving the (download) rate $ R = (N - k - rt + 1)/N $, where $ N = gr = n - g(\delta - 1) $ is the length of the restricted MDS code, for any $ t $ colluding servers such that $ k + rt \leq N $. The field size is roughly $ g^r $, polynomial in the number of servers $ g $. Assume an arbitrarily large number of stored files. If $ N - k - rt = 0 $, the rate $ R = 1/N $ is the highest known and coincides with that of previous PIR schemes that work for any MDS storage code. If $ N - k - rt > 0 $, the achieved rate $ R > 1/N $ coincides with the best known rate of PIR schemes for MDS storage codes (but which do not work for LRCs or linearized Reed-Solomon storage codes) and is always strictly higher than that of known PIR schemes that work for arbitrary MDS storage codes. Finally, the obtained PIR scheme can also be adapted to the case where communication between the user and each server is through a linearly-coded network, achieving the same rate as previous known PIR schemes but with polynomial field sizes in the number of servers, instead of exponential.

Includes members:
  Member "maximally recoverable codes with hierarchical locality":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "universal and dynamic locally repairable codes with maximal recoverability via sum rank codes")
  Member "one shot pir refinement and lifting":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "notes on communication and computation in secure distributed matrix multiplication")
  Member "private information retrieval over networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective")
  Member "private information retrieval from mds coded data in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "latent variable private information retrieval")
  Member "a general private information retrieval scheme for mds coded databases with colluding servers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective")
  Member "skew and linearized reed solomon codes and maximum sum rank distance codes over any division ring":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "locally repairable convolutional codes with sliding window repair")
  Member "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "latent variable private information retrieval")
  Member "bounds and constructions of codes with multiple localities":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")

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)