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 "private streaming with convolutional codes"):
  Abstract: Recently, information-theoretic private information retrieval (PIR) from coded storage systems has gained a lot of attention, and a general star product PIR scheme was proposed. In this paper, the star product scheme is adopted, with appropriate modifications, to the case of private (e.g., video) streaming. It is assumed that the files to be streamed are stored on~$n$ servers in a coded form, and the streaming is carried out via a convolutional code. The star product scheme is defined for this special case, and various properties are analyzed for two channel models related to straggling and Byzantine servers, both in the baseline case as well as with colluding servers. The achieved PIR rates for the given models are derived and, for the cases where the capacity is known, the first model is shown to be asymptotically optimal, when the number of stripes in a file is large. The second scheme introduced in this work is shown to be the equivalent of block convolutional codes in the PIR setting. For the Byzantine server model, it is shown to outperform the trivial scheme of downloading stripes of the desired file separately without memory.

Includes members:
  Member "on the capacity of private information retrieval from coded colluding and adversarial servers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the capacity of single server weakly private information retrieval")
  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 "achieving private information retrieval capacity in distributed storage using an arbitrary linear code":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the capacity of private information retrieval from heterogeneous uncoded caching databases")
  Member "the capacity of private information retrieval from byzantine and colluding 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 "secure symmetric private information retrieval from colluding databases with adversaries":
    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 "t private information retrieval schemes using transitive codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards practical private information retrieval from mds array codes")
  Member "linear symmetric private information retrieval for mds coded distributed storage with colluding servers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "towards the capacity of private information retrieval from coded and colluding servers")
  Member "the capacity of robust private information retrieval with colluding databases":
    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)