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: "noisy private information retrieval on separability of channel coding and information retrieval"
  Abstract: We consider the problem of noisy private information retrieval (NPIR) from $N$ non-communicating databases, each storing the same set of $M$ messages. In this model, the answer strings are not returned through noiseless bit pipes, but rather through \emph{noisy} memoryless channels. We aim at characterizing the PIR capacity for this model as a function of the statistical information measures of the noisy channels such as entropy and mutual information. We derive a general upper bound for the retrieval rate in the form of a max-min optimization. We use the achievable schemes for the PIR problem under asymmetric traffic constraints and random coding arguments to derive a general lower bound for the retrieval rate. The upper and lower bounds match for $M=2$ and $M=3$, for any $N$, and any noisy channel. The results imply that separation between channel coding and retrieval is optimal except for adapting the traffic ratio from the databases. We refer to this as \emph{almost separation}. Next, we consider the private information retrieval problem from multiple access channels (MAC-PIR). In MAC-PIR, the database responses reach the user through a multiple access channel (MAC) that mixes the responses together in a stochastic way. We show that for the additive MAC and the conjunction/disjunction MAC, channel coding and retrieval scheme are \emph{inseparable} unlike in NPIR. We show that the retrieval scheme depends on the properties of the MAC, in particular on the linearity aspect. For both cases, we provide schemes that achieve the full capacity without any loss due to the privacy constraint, which implies that the user can exploit the nature of the channel to improve privacy. Finally, we show that the full unconstrained capacity is not always attainable by determining the capacity of the selection channel.

Connected through hyperedge HE-1 (induced by source paper "private information retrieval over gaussian mac"):
  with members:
    - "asymptotically optimal scheduling for compute and forward"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "the capacity of private information retrieval with partially known private side information"
    - "gaussian multiple access via compute and forward"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "the necessity of scheduling in compute and forward"
    - "the capacity of robust private information retrieval with colluding databases"
    - "the capacity of symmetric private information retrieval"

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"
    - "the capacity of private information retrieval from uncoded storage constrained databases"
    - "private information retrieval from a cellular network with caching at the edge"

Connected through hyperedge HE-3 (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"
    - "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"
    - "capacity achieving private information retrieval codes with optimal message size and upload cost"

Connected through hyperedge HE-4 (induced by source paper "private information retrieval over random linear networks"):
  with members:
    - "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "achieving private information retrieval capacity in distributed storage using an arbitrary linear code"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "private information retrieval from mds coded data with colluding servers settling a conjecture by freij hollanti et al"
    - "secure symmetric private information retrieval from colluding databases with adversaries"
    - "t private information retrieval schemes using transitive codes"
    - "sub quadratic decoding of gabidulin codes"

Connected through hyperedge HE-5 (induced by source paper "private inner product retrieval for distributed machine learning"):
  with members:
    - "private polynomial computation for noncolluding coded databases"
    - "capacity of private linear computation for coded databases"
    - "private polynomial computation from lagrange encoding"
    - "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "private function retrieval"
    - "multi message private information retrieval capacity results and near optimal schemes"
    - "the capacity of private computation"

Connected through hyperedge HE-6 (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"
    - "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"

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)