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: "converse for multi server single message pir with side information"
  Abstract: Multi-server single-message private information retrieval is studied in the presence of side information. In this problem, $K$ independent messages are replicatively stored at $N$ non-colluding servers. The user wants to privately download one message from the servers without revealing the index of the message to any of the servers, leveraging its $M$ side information messages. We assume that the servers only know the number of the side information messages available at the user but not their indices. We prove a converse bound on the maximum download rates, which coincides with the known achievability scheme proposed by Kadhe {\it et. al.}. Hence, we characterize the capacity for this problem, which is $(1+\frac{1}{N}+\frac{1}{N^2}+\dots+\frac{1}{N^{\left\lceil \frac{K}{M+1}\right\rceil-1}})^{-1}$. The proof leverages a novel concept that we call {\it virtual side information}, which, for a fixed query and any message, identifies the side information that would be needed in order to recover that message.

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"
    - "the capacity of private information retrieval with eavesdroppers"

Connected through hyperedge HE-3 (induced by source paper "multi server private information retrieval with coded side information"):
  with members:
    - "single server single message online private information retrieval with side information"
    - "multi message private information retrieval with private side information"
    - "single server multi message private information retrieval with side information"
    - "on the capacity of single server multi message private information retrieval with side information"
    - "capacity of single server single message private information retrieval with coded side information"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "the capacity of private information retrieval from decentralized uncoded caching databases"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "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"
    - "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"

Connected through hyperedge HE-5 (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-6 (induced by source paper "private information retrieval from a cellular network with caching at the edge"):
  with members:
    - "the capacity of private information retrieval from decentralized uncoded caching databases"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "the capacity of private information retrieval with private side information"):
  with members:
    - "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval"
    - "multi message private information retrieval with private side information"
    - "on the capacity of single server multi message private information retrieval with side information"
    - "capacity of single server single message private information retrieval with coded side information"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of cache aided private information retrieval"
    - "cache aided private information retrieval with partially known uncoded prefetching fundamental limits"

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)