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 "on the capacity of private monomial computation"):
  Abstract: In this work, we consider private monomial computation (PMC) for replicated noncolluding databases. In PMC, a user wishes to privately retrieve an arbitrary multivariate monomial from a candidate set of monomials in $f$ messages over a finite field $\mathbb F_q$, where $q=p^k$ is a power of a prime $p$ and $k \ge 1$, replicated over $n$ databases. We derive the PMC capacity under a technical condition on $p$ and for asymptotically large $q$. The condition on $p$ is satisfied, e.g., for large enough $p$. Also, we present a novel PMC scheme for arbitrary $q$ that is capacity-achieving in the asymptotic case above. Moreover, we present formulas for the entropy of a multivariate monomial and for a set of monomials in uniformly distributed random variables over a finite field, which are used in the derivation of the capacity expression.

Includes members:
  Member "private polynomial computation for noncolluding coded databases":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "private sequential function computation")
  Member "achievable rate of private function retrieval from mds coded databases":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "private computation with individual and joint privacy")
  Member "capacity of private linear computation for coded databases":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "private sequential function computation")
  Member "private polynomial computation from lagrange encoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private sequential function computation")
  Member "private function retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "private computation with individual and joint privacy")
  Member "the capacity of private computation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "private computation with individual and joint privacy")
  Member "the capacity of private information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")

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)