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 "private information retrieval through wiretap channel ii privacy meets security"):
  Abstract: We consider the problem of private information retrieval through wiretap channel II (PIR-WTC-II). In PIR-WTC-II, a user wants to retrieve a single message (file) privately out of $M$ messages, which are stored in $N$ replicated and non-communicating databases. An external eavesdropper observes a fraction $\mu_n$ (of its choice) of the traffic exchanged between the $n$th database and the user. In addition to the privacy constraint, the databases should encode the returned answer strings such that the eavesdropper learns absolutely nothing about the \emph{contents} of the databases. We aim at characterizing the capacity of the PIR-WTC-II under the combined privacy and security constraints. We obtain a general upper bound for the problem in the form of a max-min optimization problem, which extends the converse proof of the PIR problem under asymmetric traffic constraints. We propose an achievability scheme that satisfies the security constraint by encoding a secret key, which is generated securely at each database, into an artificial noise vector using an MDS code. The user and the databases operate at one of the corner points of the achievable scheme for the PIR under asymmetric traffic constraints such that the retrieval rate is maximized under the imposed security constraint. The upper bound and the lower bound match for the case of $M=2$ and $M=3$ messages, for any $N$, and any $\boldsymbol{\mu}=(\mu_1, \cdots, \mu_N)$.

Includes members:
  Member "building capacity achieving pir schemes with optimal sub packetization over small fields":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a capacity achieving t pir scheme based on mds array codes")
  Member "asymmetry hurts private information retrieval under asymmetric traffic constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective")
  Member "private computation of systematically encoded data with colluding servers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the capacity of private monomial computation")
  Member "a general private information retrieval scheme for mds coded databases with colluding servers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (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-6 (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-7 (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-8 (induced by source paper "private computation with individual and joint privacy")

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)