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 "modular termination checking theorems for second order computation"):
  Abstract: We present new theorems of modular termination checking for second-order computation. They are useful for proving termination of higher-order programs and foundational calculi. Moreover, they offer a decomposition technique for difficult termination problems. Our proof is based on two SN-preserving translations and nontrivial use of Blanqui's General Schema: a syntactic criterion of strong normalisation (SN). The first translation is to attach partial terms to the original system, which is a variation of author's previous work on higher-order semantic labelling. The second is to translation it to an explicit substitution system, which makes it possible to apply our modularity theorem. Experimental results obtained with our implementation SOL demonstrate that this modular SN is effective for application to various problems.

Includes members:
  Member "termination of rewrite relations on λ terms based on girard s notion of reducibility":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a modular termination method for second order computation")
  Member "second order algebraic theories":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reduction monads and their signatures")

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)