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 sequential function computation"):
  Abstract: In this paper, we introduce the problem of private sequential function computation, where a user wishes to compute a composition of a sequence of $K$ linear functions, in a specific order, for an arbitrary input. The user does not run these computations locally, rather it exploits the existence of $N$ non-colluding servers, each can compute any of the $K$ functions on any given input. However, the user does not want to reveal any information about the desired order of computations to the servers. For this problem, we study the capacity $C$, defined as the supremum of the number of desired computations, normalized by the number of computations done at the servers, subject to the privacy constraint. In particular, we prove that $(1-\frac{1}{N})/ (1-\frac{1}{\max(K,N)}) \le C \le 1$. For the achievability, we show that the user can retrieve the desired order of computations, by choosing a proper order of inquiries among different servers, while keeping the order of computations for each server fixed, irrespective of the desired order of computations. In the end, we develop an information-theoretic converse which results an upper bound on the capacity.

Includes members:
  Member "private inner product retrieval for distributed machine learning":
    also connected through other hyperedges:
      (none)
  Member "on the capacity of computation broadcast":
    also connected through other hyperedges:
      (none)
  Member "private information retrieval with private coded side information the multi server case":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "private computation with individual and joint privacy")
  Member "on the asymptotic capacity of x secure t private information retrieval with graph based replicated storage":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "private polynomial computation for noncolluding coded databases":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the capacity of private monomial computation")
  Member "on the upload versus download cost for secure and private matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "entangled polynomial codes for secure private and batch distributed matrix multiplication breaking the cubic barrier")
  Member "private proximity retrieval codes":
    also connected through other hyperedges:
      (none)
  Member "achievable rate of private function retrieval from mds coded databases":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private computation with individual and joint privacy")

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)