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 "capacity of private linear computation for coded databases"):
  Abstract: We consider the problem of private linear computation (PLC) in a distributed storage system. In PLC, a user wishes to compute a linear combination of $f$ messages stored in noncolluding databases while revealing no information about the coefficients of the desired linear combination to the databases. In extension of our previous work we employ linear codes to encode the information on the databases. We show that the PLC capacity, which is the ratio of the desired linear function size and the total amount of downloaded information, matches the maximum distance separable (MDS) coded capacity of private information retrieval for a large class of linear codes that includes MDS codes. In particular, the proposed converse is valid for any number of messages and linear combinations, and the capacity expression depends on the rank of the coefficient matrix obtained from all linear combinations.

Includes members:
  Member "achievable rate of private function retrieval from mds coded databases":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "private computation with individual and joint privacy")
  Member "asymmetry helps improved private information retrieval protocols for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the capacity of single server weakly private information retrieval")
  Member "an mds pir capacity achieving protocol for distributed storage using non mds linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "latent variable private information retrieval")
  Member "on the fundamental limit of private information retrieval for coded distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "breaking the mds pir capacity barrier via joint storage coding")
  Member "private information retrieval from mds coded data in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "latent variable private information retrieval")
  Member "the asymptotic capacity of private search":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "private computation with individual and joint privacy")
  Member "private computation of systematically encoded data with colluding servers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the capacity of private monomial computation")
  Member "achieving private information retrieval capacity in distributed storage using an arbitrary linear code":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the capacity of private information retrieval from heterogeneous uncoded caching databases")

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)