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 "interactive certificates for polynomial matrices with sub linear communication"):
  Abstract: We develop and analyze new protocols to verify the correctness of#R##N#various computations on matrices over F[x], where F is a field. The#R##N#properties we verify concern an F[x]-module and therefore cannot#R##N#simply rely on previously-developed linear algebra certificates which#R##N#work only for vector spaces. Our protocols are interactive#R##N#certificates, often randomized, and featuring a constant number of#R##N#rounds of communication between the prover and verifier. We seek to#R##N#minimize the communication cost so that the amount of data sent during#R##N#the protocol is significantly smaller than the size of the result#R##N#being verified, which can be useful when combining protocols or in#R##N#some multi-party settings. The main tools we use are reductions to#R##N#existing linear algebra certificates and a new protocol to verify that#R##N#a given vector is in the F[x]-linear span of a given matrix.

Includes members:
  Member "computing popov and hermite forms of rectangular polynomial matrices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants")
  Member "computing canonical bases of modules of univariate relations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computing popov and hermite forms of rectangular polynomial matrices")
  Member "fast deterministic computation of the hermite normal form and determinant of a polynomial matrix":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants")
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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.SC(Symbolic Computation)