human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "asymmetry hurts private information retrieval under asymmetric traffic constraints"):
  Abstract: We consider the classical setting of private information retrieval (PIR) of a single message (file) out of $M$ messages from $N$ distributed databases under the new constraint of \emph{asymmetric traffic} from databases. In this problem, the \emph{ratios between the traffic} from the databases are constrained, i.e., the ratio of the length of the answer string that the user (retriever) receives from the $n$th database to the total length of all answer strings from all databases is constrained to be $\tau_n$. This may happen if the user's access to the databases is restricted due database availability, channel quality to the databases, and other factors. For this problem, for fixed $M$, $N$, we develop a general upper bound $\bar{C}(\boldsymbol{\tau})$, which generalizes the converse proof of Sun-Jafar, where database symmetry was inherently used. Our converse bound is a piece-wise affine function in the traffic ratio vector $\boldsymbol{\tau}=(\tau_1, \cdots, \tau_N)$. For the lower bound, we explicitly show the achievability of $\binom{M+N-1}{M}$ corner points. For the remaining traffic ratio vectors, we perform time-sharing between these corner points. The recursive structure of our achievability scheme is captured via a system of difference equations. The upper and lower bounds exactly match for $M=2$ and $M=3$ for any $N$ and any $\boldsymbol{\tau}$. The results show strict loss of PIR capacity due to the asymmetric traffic constraints compared with the symmetric case of Sun-Jafar which implicitly uses $\tau_n=\frac{1}{N}$ for all $n$.

Includes members:
  Member "private information retrieval through wiretap channel ii privacy meets security":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "latent variable private information retrieval")
  Member "a general private information retrieval scheme for mds coded databases with colluding servers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective")
  Member "multi file private information retrieval from mds coded databases with colluding servers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "latent variable private information retrieval")
  Member "the capacity of private information retrieval with partially known private side information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "private information retrieval over gaussian mac")
  Member "fundamental limits of cache aided private information retrieval with unknown and uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "latent variable private information retrieval")
  Member "the capacity of private information retrieval with private side information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "private computation with individual and joint privacy")
  Member "the capacity of cache aided private information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "latent variable private information retrieval")
  Member "the capacity of private information retrieval from byzantine and colluding databases":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")

Question: Please tell me which class the source paper 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)