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 private information retrieval from uncoded storage constrained databases"
  Abstract: Private information retrieval (PIR) allows a user to retrieve a desired message from a set of databases without revealing the identity of the desired message. The replicated databases scenario was considered by Sun and Jafar, 2016, where $N$ databases can store the same $K$ messages completely. A PIR scheme was developed to achieve the optimal download cost given by $\left(1+ \frac{1}{N}+ \frac{1}{N^{2}}+ \cdots + \frac{1}{N^{K-1}}\right)$. In this work, we consider the problem of PIR from storage constrained databases. Each database has a storage capacity of $\mu KL$ bits, where $L$ is the size of each message in bits, and $\mu \in [1/N, 1]$ is the normalized storage. On one extreme, $\mu=1$ is the replicated databases case. On the other hand, when $\mu= 1/N$, then in order to retrieve a message privately, the user has to download all the messages from the databases achieving a download cost of $1/K$. We aim to characterize the optimal download cost versus storage trade-off for any storage capacity in the range $\mu \in [1/N, 1]$. For any $(N,K)$, we show that the optimal trade-off between storage, $\mu$, and the download cost, $D(\mu)$, is given by the lower convex hull of the $N$ pairs $\left(\mu= \frac{t}{N},D(\mu) = \left(1+ \frac{1}{t}+ \frac{1}{t^{2}}+ \cdots + \frac{1}{t^{K-1}}\right)\right)$ for $t=1,2,\ldots, N$. To prove this result, we first present the storage constrained PIR scheme for any $(N,K)$. We next obtain a general lower bound on the download cost for PIR, which is valid for the following storage scenarios: replicated or storage constrained, coded or uncoded, and fixed or optimized. We then specialize this bound using the uncoded storage assumption to obtain lower bounds matching the achievable download cost of the storage constrained PIR scheme for any value of the available storage.

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"
    - "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"
    - "multi message private information retrieval with private side information"

Connected through hyperedge HE-2 (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"
    - "private information retrieval from a cellular network with caching at the edge"

Connected through hyperedge HE-3 (induced by source paper "the capacity of private information retrieval from heterogeneous uncoded caching databases"):
  with members:
    - "staircase pir universally robust private information retrieval"
    - "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"
    - "the capacity of private information retrieval with eavesdroppers"

Connected through hyperedge HE-4 (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"
    - "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"
    - "the capacity of private information retrieval from decentralized uncoded caching databases"

Connected through hyperedge HE-5 (induced by source paper "on coded caching with private demands"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "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"
    - "the capacity of cache aided private information retrieval"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"

Connected through hyperedge HE-6 (induced by source paper "on the storage cost of private information retrieval"):
  with members:
    - "how to use undiscovered information inequalities direct applications of the copy lemma"
    - "breaking the mds pir capacity barrier via joint storage coding"
    - "an open source toolbox for computer aided investigation on the fundamental limits of information systems version 0 1"
    - "capacity achieving private information retrieval codes from mds coded databases with minimum message size"
    - "improved storage for efficient private information retrieval"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "on the capacity of locally decodable codes"
    - "the capacity of private information retrieval with partially known private side information"

Connected through hyperedge HE-7 (induced by source paper "breaking the mds pir capacity barrier via joint storage coding"):
  with members:
    - "the capacity of private information retrieval from heterogeneous uncoded caching databases"
    - "an optimal iterative placement algorithm for pir from heterogeneous storage constrained databases"
    - "capacity achieving private information retrieval codes from mds coded databases with minimum message size"
    - "batch and pir codes and their connections to locally repairable codes"
    - "on the fundamental limit of private information retrieval for coded distributed storage"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "on sub packetization and access number of capacity achieving pir schemes for mds coded non colluding servers"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"

Connected through hyperedge HE-8 (induced by source paper "on the capacity of secure distributed matrix multiplication"):
  with members:
    - "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval"
    - "straggler mitigation in distributed matrix multiplication fundamental limits and optimal coding"
    - "single server multi message private information retrieval with side information"
    - "on the capacity of secure distributed matrix multiplication"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval with private side information"
    - "the capacity of cache aided private information retrieval"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"

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)