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: "advanced computer algebra algorithms for the expansion of feynman integrals"
  Abstract: Two-point Feynman parameter integrals, with at most one mass and containing local operator insertions in $4+\ep$-dimensional Minkowski space, can be transformed to multi-integrals or multi-sums over hyperexponential and/or hypergeometric functions depending on a discrete parameter $n$. Given such a specific representation, we utilize an enhanced version of the multivariate Almkvist--Zeilberger algorithm (for multi-integrals) and a common summation framework of the holonomic and difference field approach (for multi-sums) to calculate recurrence relations in $n$. Finally, solving the recurrence we can decide efficiently if the first coefficients of the Laurent series expansion of a given Feynman integral can be expressed in terms of indefinite nested sums and products; if yes, the all $n$ solution is returned in compact representations, i.e., no algebraic relations exist among the occurring sums and products.

Connected through hyperedge HE-1 (induced by source paper "refined holonomic summation algorithms in particle physics"):
  with members:
    - "representing q hypergeometric products and mixed versions in difference rings"
    - "a difference ring theory for symbolic summation"
    - "modern summation methods for loop integrals in quantum field theory the packages sigma evaluatemultisums and sumproduction"
    - "complexity estimates for two uncoupling algorithms"
    - "fast algorithms for refined parameterized telescoping in difference fields"
    - "a symbolic summation approach to feynman integral calculus"
    - "a fast approach to creative telescoping"
    - "a refined difference field theory for symbolic summation"

Connected through hyperedge HE-2 (induced by source paper "modern summation methods for loop integrals in quantum field theory the packages sigma evaluatemultisums and sumproduction"):
  with members:
    - "simplifying multiple sums in difference fields"
    - "creative telescoping for holonomic functions"
    - "fast algorithms for refined parameterized telescoping in difference fields"
    - "a symbolic summation approach to feynman integral calculus"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a refined difference field theory for symbolic summation"

Connected through hyperedge HE-3 (induced by source paper "recent symbolic summation methods to solve coupled systems of differential and difference equations"):
  with members:
    - "simplifying multiple sums in difference fields"
    - "a symbolic summation approach to feynman integral calculus"
    - "a symbolic summation approach to find optimal nested sum representations"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a refined difference field theory for symbolic summation"

Connected through hyperedge HE-4 (induced by source paper "simplifying multiple sums in difference fields"):
  with members:
    - "order degree curves for hypergeometric creative telescoping"
    - "a symbolic summation approach to feynman integral calculus"
    - "a fast approach to creative telescoping"
    - "a symbolic summation approach to find optimal nested sum representations"
    - "parameterized telescoping proves algebraic independence of sums"
    - "a refined difference field theory for symbolic summation"

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)