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: "numerically stable recurrence relations for the communication hiding pipelined conjugate gradient method"
  Abstract: Pipelined Krylov subspace methods (also referred to as communication-hiding methods) have been proposed in the literature as a scalable alternative to classic Krylov subspace algorithms for iteratively computing the solution to a large linear system in parallel. For symmetric and positive definite system matrices the pipelined Conjugate Gradient method outperforms its classic Conjugate Gradient counterpart on large scale distributed memory hardware by overlapping global communication with essential computations like the matrix-vector product, thus hiding global communication. A well-known drawback of the pipelining technique is the (possibly significant) loss of numerical stability. In this work a numerically stable variant of the pipelined Conjugate Gradient algorithm is presented that avoids the propagation of local rounding errors in the finite precision recurrence relations that construct the Krylov subspace basis. The multi-term recurrence relation for the basis vector is replaced by two-term recurrences, improving stability without increasing the overall computational cost of the algorithm. The proposed modification ensures that the pipelined Conjugate Gradient method is able to attain a highly accurate solution independently of the pipeline length. Numerical experiments demonstrate a combination of excellent parallel performance and improved maximal attainable accuracy for the new pipelined Conjugate Gradient algorithm. This work thus resolves one of the major practical restrictions for the useability of pipelined Krylov subspace methods.

Connected through hyperedge HE-1 (induced by source paper "scalable resilience against node failures for communication hiding preconditioned conjugate gradient and conjugate residual methods"):
  with members:
    - "improving strong scaling of the conjugate gradient method for solving large linear systems using global reduction pipelining"
    - "how to make the preconditioned conjugate gradient method resilient against multiple node failures"
    - "the communication hiding conjugate gradient method with deep pipelines"
    - "numerical analysis of the maximal attainable accuracy in communication hiding pipelined conjugate gradient methods"
    - "the adaptive s step conjugate gradient method"
    - "numerically stable variants of the communication hiding pipelined conjugate gradients algorithm for the parallel solution of large scale symmetric linear systems"
    - "a backward forward recovery approach for the preconditioned conjugate gradient method"

Connected through hyperedge HE-2 (induced by source paper "improving strong scaling of the conjugate gradient method for solving large linear systems using global reduction pipelining"):
  with members:
    - "analyzing and improving maximal attainable accuracy in the communication hiding pipelined bicgstab method"
    - "the communication hiding conjugate gradient method with deep pipelines"
    - "the communication hiding pipelined bicgstab method for the parallel solution of large unsymmetric linear systems"

Connected through hyperedge HE-3 (induced by source paper "new communication hiding conjugate gradient variants"):
  with members:
    - "the communication hiding conjugate gradient method with deep pipelines"
    - "numerical analysis of the maximal attainable accuracy in communication hiding pipelined conjugate gradient methods"
    - "numerically stable variants of the communication hiding pipelined conjugate gradients algorithm for the parallel solution of large scale symmetric linear systems"

Connected through hyperedge HE-4 (induced by source paper "predict and recompute conjugate gradient variants"):
  with members:
    - "numerically stable variants of the communication hiding pipelined conjugate gradients algorithm for the parallel solution of large scale symmetric linear systems"

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.NA(Numerical Analysis)