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 "the capacity of single server weakly private information retrieval"):
  Abstract: A private information retrieval (PIR) protocol guarantees that a user can privately retrieve files stored in database without revealing any information about the identity of the requested file. Existing information-theoretic PIR protocols ensure strong privacy, i.e., zero information leakage to the server, but at the cost of high download. In this work, we present weakly-private information retrieval (WPIR) schemes that trade off strong privacy to improve the download cost when the database is stored on a single server, i.e., for the single server scenario. We study the tradeoff between the download cost and information leakage in terms of mutual information (MI) and maximal leakage (MaxL) privacy metrics. By relating the WPIR problem to rate-distortion theory, the download-leakage function, which is defined as the minimum required download cost of all single-server WPIR schemes for a given level of information leakage, is introduced. By characterizing the download-leakage function for the MI and MaxL metrics, the capacity of single-server WPIR can be fully characterized.

Includes members:
  Member "x secure t private information retrieval from mds coded storage with byzantine and unresponsive servers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "on the information leakage in private information retrieval systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective")
  Member "weakly private information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the information leakage in private information retrieval systems")
  Member "on the capacity of private information retrieval from coded colluding and adversarial servers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards the capacity of private information retrieval from coded and colluding servers")
  Member "asymmetry helps improved private information retrieval protocols for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the capacity of multi round private information retrieval from byzantine databases")
  Member "lifting private information retrieval from two to any number of messages":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards the capacity of private information retrieval from coded and colluding servers")
  Member "an operational approach to information leakage":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "robust generalization via α mutual information")
  Member "capacity achieving private information retrieval codes with optimal message size and upload cost":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "latent variable private information retrieval")

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)