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 "cross subspace alignment and the asymptotic capacity of x secure t private information retrieval"):
  Abstract: $X$-secure and $T$-private information retrieval (XSTPIR) is a form of private information retrieval where data security is guaranteed against collusion among up to $X$ servers and the user's privacy is guaranteed against collusion among up to $T$ servers. The capacity of XSTPIR is characterized for arbitrary number of servers $N$, and arbitrary security and privacy thresholds $X$ and $T$, in the limit as the number of messages $K\rightarrow\infty$. Capacity is also characterized for any number of messages if either $N=3, X=T=1$ or if $N\leq X+T$. Insights are drawn from these results, about aligning versus decoding noise, dependence of PIR rate on field size, and robustness to symmetric security constraints. In particular, the idea of cross subspace alignment, i.e., introducing a subspace dependence between Reed-Solomon code parameters, emerges as the optimal way to align undesired terms while keeping desired terms resolvable.

Includes members:
  Member "the capacity of multi round private information retrieval from byzantine databases":
    also connected through other hyperedges:
      (none)
  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 "an mds pir capacity achieving protocol for distributed storage using non mds linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "latent variable private information retrieval")
  Member "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "latent variable private information retrieval")
  Member "multi message private information retrieval with private side information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "latent variable private information retrieval")
  Member "the capacity of private information retrieval with eavesdroppers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "latent variable private information retrieval")
  Member "private information retrieval through wiretap channel ii privacy meets security":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "latent variable private information retrieval")
  Member "single server multi message private information retrieval with side information":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)