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 "symmetric private information retrieval for mds coded distributed storage"):
  Abstract: A user wants to retrieve a file from a database without revealing the identity of the file retrieved at the database, which is known as the problem of private information retrieval (PIR). If it is further required that the user obtains no information about the database other than the desired file, the concept of symmetric private information retrieval (SPIR) is introduced to guarantee privacy for both parties. In this paper, the problem of SPIR is studied for a database stored among $N$ nodes in a distributed way, by using an $(N,M)$-MDS storage code. The information-theoretic capacity of SPIR, defined as the maximum number of symbols of the desired file retrieved per downloaded symbol, for the coded database is derived. It is shown that the SPIR capacity for coded database is $1-\frac{M}{N}$, when the amount of the shared common randomness of distributed nodes (unavailable at the user) is at least $\frac{M}{N-M}$ times the file size. Otherwise, the SPIR capacity for the coded database equals zero.

Includes members:
  Member "the capacity of robust private information retrieval with colluding databases":
    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 "the capacity of symmetric private information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "latent variable private information retrieval")
  Member "the capacity of private information retrieval":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "pir with low storage overhead coding instead of replication":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes")
  Member "private information retrieval for coded storage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the capacity of single server weakly 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)