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: "the capacity of cache aided private information retrieval"
  Abstract: The problem of cache enabled private information retrieval (PIR) is considered in which a user wishes to privately retrieve one out of $K$ messages, each of size $L$ bits from $N$ distributed databases. The user has a local cache of storage $SL$ bits which can be used to store any function of the $K$ messages. The main contribution of this work is the exact characterization of the capacity of cache aided PIR as a function of the storage parameter $S$. In particular, for a given cache storage parameter $S$, the information-theoretically optimal download cost $D^{*}(S)/L$ (or the inverse of capacity) is shown to be equal to $(1- \frac{S}{K})\left(1+ \frac{1}{N}+ \ldots + \frac{1}{N^{K-1}}\right)$. Special cases of this result correspond to the settings when $S=0$, for which the optimal download cost was shown by Sun and Jafar to be $\left(1+ \frac{1}{N}+ \ldots + \frac{1}{N^{K-1}}\right)$, and the case when $S=K$, i.e., cache size is large enough to store all messages locally, for which the optimal download cost is $0$. The intermediate points $S\in (0, K)$ can be readily achieved through a simple memory-sharing based PIR scheme. The key technical contribution of this work is the converse, i.e., a lower bound on the download cost as a function of storage $S$ which shows that memory sharing is information-theoretically optimal.

Connected through hyperedge HE-1 (induced by source paper "latent variable private information retrieval"):
  with members:
    - "x secure t private information retrieval from mds coded storage with byzantine and unresponsive servers"
    - "the capacity of private information retrieval from heterogeneous uncoded caching databases"
    - "breaking the mds pir capacity barrier via joint storage coding"
    - "robust private information retrieval from coded systems with byzantine and colluding servers"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "an mds pir capacity achieving protocol for distributed storage using non mds linear codes"
    - "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"

Connected through hyperedge HE-2 (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-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 "the capacity of multi round private information retrieval from byzantine databases"):
  with members:
    - "staircase pir universally robust private information retrieval"
    - "robust private information retrieval from coded systems with byzantine and colluding servers"
    - "noisy private information retrieval on separability of channel coding and information retrieval"
    - "asymmetry helps improved private information retrieval protocols for distributed storage"
    - "private information retrieval from a cellular network with caching at the edge"
    - "an mds pir capacity achieving protocol for distributed storage using non mds linear codes"
    - "lifting private information retrieval from two to any number of messages"
    - "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval"

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 "on coded caching with private demands"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "device to device secure coded caching"
    - "novel inter file coded placement and d2d delivery for a cache aided fog ran architecture"
    - "secrecy capacity memory tradeoff of erasure broadcast channels"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval with private side information"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"

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)