human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "fast generalized bruhat decomposition"
  Abstract: The deterministic recursive pivot-free algorithms for computing the generalized Bruhat decomposition of the matrix in the field and for the computation of the inverse matrix are presented. This method has the same complexity as algorithm of matrix multiplication, and it is suitable for the parallel computer systems.

Connected through hyperedge HE-1 (induced by source paper "recursive matrix algorithms in commutative domain for cluster with distributed memory"):
  with members:
    - "recursive method for the solution of systems of linear equations"
    - "time and space efficient generators for quasiseparable matrices"
    - "triangular decomposition of matrices in a domain"
    - "generalized bruhat decomposition in commutative domains"
    - "simultaneous computation of the row and column rank profiles"
    - "algorithms for the solution of systems of linear equations in commutative rings"

Connected through hyperedge HE-2 (induced by source paper "fast computation of the rank profile matrix and the generalized bruhat decomposition"):
  with members:
    - "computing the rank profile matrix"
    - "parallel computation of echelon forms"
    - "generalized bruhat decomposition in commutative domains"
    - "simultaneous computation of the row and column rank profiles"
    - "fast matrix rank algorithms and applications"
    - "rank profile revealing gaussian elimination and the cup matrix decomposition"

Connected through hyperedge HE-3 (induced by source paper "time and space efficient generators for quasiseparable matrices"):
  with members:
    - "fast computation of the rank profile matrix and the generalized bruhat decomposition"
    - "computing with quasiseparable matrices"
    - "computing the rank profile matrix"
    - "powers of tensors and fast matrix multiplication"
    - "simultaneous computation of the row and column rank profiles"
    - "rank profile revealing gaussian elimination and the cup matrix decomposition"

Connected through hyperedge HE-4 (induced by source paper "computing with quasiseparable matrices"):
  with members:
    - "fast computation of the rank profile matrix and the generalized bruhat decomposition"
    - "computing the rank profile matrix"
    - "simultaneous computation of the row and column rank profiles"

Connected through hyperedge HE-5 (induced by source paper "computing the rank profile matrix"):
  with members:
    - "parallel computation of echelon forms"
    - "simultaneous computation of the row and column rank profiles"
    - "rank profile revealing gaussian elimination and the cup matrix decomposition"

Connected through hyperedge HE-6 (induced by source paper "triangular decomposition of matrices in a domain"):
  with members:
    - "generalized bruhat decomposition in commutative domains"

Connected through hyperedge HE-7 (induced by source paper "simultaneous computation of the row and column rank profiles"):
  with members:
    - "rank profile revealing gaussian elimination and the cup matrix decomposition"

Question: Please tell me which class the center node 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)