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 "notes on communication and computation in secure distributed matrix multiplication"):
  Abstract: We consider the problem of secure distributed matrix multiplication in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers.  We show that if the user is only concerned in optimizing the download rate, a common assumption in the literature, then the problem can be converted into a simple private information retrieval problem by means of a scheme we call Private Oracle Querying. However, this comes at large upload and computational costs for both the user and the servers.  In contrast, we show that for the right choice of parameters, polynomial codes can lower the computational time of the system, e.g. if the computational time complexity of an operation in $\mathbb{F}_q$ is at most $\mathcal{Z}_q$ and the computational time complexity of multiplying two $n\times n$ matrices is $\mathcal{O}(n^\omega \mathcal{Z}_q)$ then the user together with the servers can compute the multiplication in $\mathcal{O}(n^{4-\frac{6}{\omega+1}} \mathcal{Z}_q)$ time.

Includes members:
  Member "distributed and private coded matrix computation with flexible communication load":
    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 "on the capacity of secure distributed matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "entangled polynomial codes for secure private and batch distributed matrix multiplication breaking the cubic barrier")
  Member "on the upload versus download cost for secure and private matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "entangled polynomial codes for secure private and batch distributed matrix multiplication breaking the cubic barrier")
  Member "gasp codes for secure distributed matrix multiplication":
    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 "one shot pir refinement and lifting":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private set intersection a multi message symmetric private information retrieval perspective")
  Member "on the capacity of secure distributed matrix multiplication":
    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 "the capacity of robust private information retrieval with colluding databases":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")

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)