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 multi round private information retrieval from byzantine databases"):
  Abstract: In this work, we investigate the capacity of private information retrieval (PIR) from $N$ replicated databases, where a subset of the databases are untrustworthy (byzantine) in their answers to the query of the user. We allow for multi-round queries and demonstrate that the identities of the byzantine databases can be determined with a small additional download cost. As a result, the capacity of the multi-round PIR with byzantine databases (BPIR) reaches that of the robust PIR problem when the number of byzantine databases is less than the number of trustworthy databases.

Includes members:
  Member "staircase pir universally robust private information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective")
  Member "robust private information retrieval from coded systems with byzantine and colluding servers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "latent variable private information retrieval")
  Member "noisy private information retrieval on separability of channel coding and information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "private information retrieval over gaussian mac")
  Member "asymmetry helps improved private information retrieval protocols for distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the capacity of single server weakly private information retrieval")
  Member "private information retrieval from a cellular network with caching at the edge":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective")
  Member "an mds pir capacity achieving protocol for distributed storage using non mds linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "latent variable private information retrieval")
  Member "lifting private information retrieval from two to any number of messages":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the capacity of single server weakly private information retrieval")
  Member "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval":
    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)