human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "private function retrieval"
  Abstract: The widespread use of cloud computing services raises the question of how one can delegate the processing tasks to the untrusted distributed parties without breeching the privacy of its data and algorithms. Motivated by the algorithm privacy concerns in a distributed computing system, in this paper, we introduce the private function retrieval (PFR) problem, where a user wishes to efficiently retrieve a linear function of $K$ messages from $N$ non-communicating replicated servers while keeping the function hidden from each individual server. The goal is to find a scheme with minimum communication cost. To characterize the fundamental limits of the communication cost, we define the capacity of PFR problem as the size of the message that can be privately retrieved (which is the size of one file) normalized to the required downloaded information bits. We first show that for the PFR problem with $K$ messages, $N=2$ servers and a linear function with binary coefficients the capacity is $C=\frac{1}{2}\Big(1-\frac{1}{2^K}\Big)^{-1}$. Interestingly, this is the capacity of retrieving one of $K$ messages from $N=2$ servers while keeping the index of the requested message hidden from each individual server, the problem known as private information retrieval (PIR). Then, we extend the proposed achievable scheme to the case of arbitrary number of servers and coefficients in the field $GF(q)$ with arbitrary $q$ and obtain $R=\Big(1-\frac{1}{N}\Big)\Big(1+\frac{\frac{1}{N-1}}{(\frac{q^K-1}{q-1})^{N-1}}\Big)$.

Connected through hyperedge HE-1 (induced by source paper "private computation with individual and joint privacy"):
  with members:
    - "on an equivalence between single server pir with side information and locally recoverable codes"
    - "private information retrieval with private coded side information the multi server case"
    - "single server single message online private information retrieval with side information"
    - "single server multi message individually private information retrieval with side information"
    - "the role of coded side information in single server private information retrieval"
    - "multi server private information retrieval with coded side information"
    - "achievable rate of private function retrieval from mds coded databases"
    - "multi message private information retrieval with private side information"

Connected through hyperedge HE-2 (induced by source paper "on the capacity of private monomial computation"):
  with members:
    - "private polynomial computation for noncolluding coded databases"
    - "achievable rate of private function retrieval from mds coded databases"
    - "capacity of private linear computation for coded databases"
    - "private computation of systematically encoded data with colluding servers"
    - "private polynomial computation from lagrange encoding"
    - "the capacity of private computation"
    - "the capacity of private information retrieval"

Connected through hyperedge HE-3 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective"):
  with members:
    - "the capacity of private information retrieval from heterogeneous uncoded caching databases"
    - "on the storage cost of private information retrieval"
    - "on the information leakage in private information retrieval systems"
    - "capacity achieving private information retrieval codes from mds coded databases with minimum message size"
    - "improved storage for efficient private information retrieval"
    - "staircase pir universally robust private information retrieval"
    - "noisy private information retrieval on separability of channel coding and information retrieval"
    - "the capacity of private information retrieval from uncoded storage constrained databases"

Connected through hyperedge HE-4 (induced by source paper "the capacity of private information retrieval from heterogeneous uncoded caching databases"):
  with members:
    - "staircase pir universally robust private information retrieval"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "private information retrieval from a cellular network with caching at the edge"
    - "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers"
    - "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "converse for multi server single message pir with side information"

Connected through hyperedge HE-5 (induced by source paper "private sequential function computation"):
  with members:
    - "private inner product retrieval for distributed machine learning"
    - "on the capacity of computation broadcast"
    - "private information retrieval with private coded side information the multi server case"
    - "on the asymptotic capacity of x secure t private information retrieval with graph based replicated storage"
    - "private polynomial computation for noncolluding coded databases"
    - "on the upload versus download cost for secure and private matrix multiplication"
    - "private proximity retrieval codes"
    - "achievable rate of private function retrieval from mds coded databases"

Connected through hyperedge HE-6 (induced by source paper "improved storage for efficient private information retrieval"):
  with members:
    - "the capacity of private information retrieval from heterogeneous uncoded caching databases"
    - "staircase pir universally robust private information retrieval"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "private information retrieval from a cellular network with caching at the edge"
    - "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "private information retrieval through wiretap channel ii privacy meets security"
    - "the capacity of private information retrieval with private side information under storage constraints"

Connected through hyperedge HE-7 (induced by source paper "on the asymptotic capacity of x secure t private information retrieval with graph based replicated storage"):
  with members:
    - "achievable rate of private function retrieval from mds coded databases"
    - "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers"
    - "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "the capacity of private information retrieval with eavesdroppers"
    - "private information retrieval through wiretap channel ii privacy meets security"
    - "private information retrieval in graph based replication systems"
    - "asymmetry hurts private information retrieval under asymmetric traffic constraints"

Connected through hyperedge HE-8 (induced by source paper "private proximity retrieval codes"):
  with members:
    - "capacity of private linear computation for coded databases"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "private computation of systematically encoded data with colluding servers"
    - "private polynomial computation from lagrange encoding"
    - "achieving private information retrieval capacity in distributed storage using an arbitrary linear code"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "linear symmetric private information retrieval for mds coded distributed storage with colluding servers"
    - "the capacity of private computation"

Question: Please tell me which class the center node 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)