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 "on the access complexity of pir schemes"):
  Abstract: Private information retrieval has been reformulated in an information-theoretic perspective in recent years. The two most important parameters considered for a PIR scheme in a distributed storage system are the storage overhead and PIR rate. We take into consideration a third parameter, the access complexity of a PIR scheme, which characterizes the total amount of data to be accessed by the servers for responding to the queries throughout a PIR scheme. We use a general covering code approach as the main tool for improving the access complexity. With a given amount of storage overhead, the ultimate objective is to characterize the tradeoff between the rate and access complexity of a PIR scheme. In this paper we make a first step towards solving this problem by analyzing the rate and access complexity of several PIR schemes.

Includes members:
  Member "the capacity of private information retrieval from uncoded storage constrained databases":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "latent variable private information retrieval")
  Member "private information retrieval from mds coded data in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "latent variable private information retrieval")
  Member "private information retrieval from transversal designs":
    also connected through other hyperedges:
      (none)
  Member "on sub packetization of capacity achieving pir schemes for mds coded databases":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity of private linear computation for coded databases")
  Member "pir schemes with small download complexity and low storage requirements":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "private information retrieval from locally repairable databases with colluding servers")
  Member "the capacity of private information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "the capacity of private information retrieval from coded databases":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "optimal download cost of private information retrieval for arbitrary message length":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)