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 decentralized uncoded caching databases"
  Abstract: We consider the private information retrieval (PIR) problem from decentralized uncoded caching databases. There are two phases in our problem setting, a caching phase, and a retrieval phase. In the caching phase, a data center containing all the $K$ files, where each file is of size $L$ bits, and several databases with storage size constraint $\mu K L$ bits exist in the system. Each database independently chooses $\mu K L$ bits out of the total $KL$ bits from the data center to cache through the same probability distribution in a decentralized manner. In the retrieval phase, a user (retriever) accesses $N$ databases in addition to the data center, and wishes to retrieve a desired file privately. We characterize the optimal normalized download cost to be $\frac{D}{L} = \sum_{n=1}^{N+1} \binom{N}{n-1} \mu^{n-1} (1-\mu)^{N+1-n} \left( 1+ \frac{1}{n} + \dots+ \frac{1}{n^{K-1}} \right)$. We show that uniform and random caching scheme which is originally proposed for decentralized coded caching by Maddah-Ali and Niesen, along with Sun and Jafar retrieval scheme which is originally proposed for PIR from replicated databases surprisingly result in the lowest normalized download cost. This is the decentralized counterpart of the recent result of Attia, Kumar and Tandon for the centralized case. The converse proof contains several ingredients such as interference lower bound, induction lemma, replacing queries and answering string random variables with the content of distributed databases, the nature of decentralized uncoded caching databases, and bit marginalization of joint caching distributions.

Connected through hyperedge HE-1 (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-2 (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-3 (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-4 (induced by source paper "private information retrieval from heterogeneous uncoded storage constrained databases with reduced sub messages"):
  with members:
    - "the capacity of private information retrieval from heterogeneous uncoded caching databases"
    - "a new design of private information retrieval for storage constrained databases"
    - "improved storage for efficient private information retrieval"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "the capacity of private information retrieval"
    - "the capacity of private information retrieval from coded databases"
    - "optimal download cost of private information retrieval for arbitrary message length"

Connected through hyperedge HE-5 (induced by source paper "an optimal iterative placement algorithm for pir from heterogeneous storage constrained databases"):
  with members:
    - "streamlines for motion planning in underwater currents"
    - "the capacity of private information retrieval from heterogeneous uncoded caching databases"
    - "a new design of private information retrieval for storage constrained databases"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "the capacity of private information retrieval"
    - "optimal download cost of private information retrieval for arbitrary message length"
    - "fundamental limits of caching"

Connected through hyperedge HE-6 (induced by source paper "a new design of private information retrieval for storage constrained databases"):
  with members:
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"
    - "the capacity of private information retrieval"
    - "optimal download cost of private information retrieval for arbitrary message length"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"

Connected through hyperedge HE-7 (induced by source paper "private information retrieval from non replicated databases"):
  with members:
    - "the capacity of private information retrieval from heterogeneous uncoded caching databases"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "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"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"

Connected through hyperedge HE-8 (induced by source paper "private information retrieval from a cellular network with caching at the edge"):
  with members:
    - "converse for multi server single message pir with side information"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "achieving private information retrieval capacity in distributed storage using an arbitrary linear code"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval with private side information"
    - "cache aided private information retrieval with partially known uncoded prefetching fundamental limits"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "optimizing mds coded caching in wireless networks with device to device communication"

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)