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 "finite tree analysis for constraint logic based languages the complete unabridged version"):
  Abstract: Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occurs-check) and increased expressivity (cyclic terms can provide very efficient representations of grammars and other useful objects). Unfortunately, the use of infinite rational trees has problems. For instance, many of the built-in and library predicates are ill-defined for such trees and need to be supplemented by run-time checks whose cost may be significant. Moreover, some widely-used program analysis and manipulation techniques are correct only for those parts of programs working over finite trees. It is thus important to obtain, automatically, a knowledge of the program variables (the finite variables) that, at the program points of interest, will always be bound to finite terms. For these reasons, we propose here a new data-flow analysis, based on abstract interpretation, that captures such information.

Includes members:
  Member "an application of rational trees in a logic programming interpreter for a procedural language":
    also connected through other hyperedges:
      (none)
  Member "a correct precise and efficient integration of set sharing freeness and linearity for the analysis of finite and rational tree languages":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the interaction between sharing and linearity")
  Member "enhanced sharing analysis techniques a comprehensive evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal multibinding unification for sharing and linearity analysis")
  Member "cti a constraint based termination inference tool for iso prolog":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "correctness and completeness of logic programs")
  Member "soundness idempotence and commutativity of set sharing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a correct precise and efficient integration of set sharing freeness and linearity for the analysis of finite and rational tree languages")
  Member "decomposing non redundant sharing by complementation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a correct precise and efficient integration of set sharing freeness and linearity for the analysis of finite and rational tree languages")

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.PL(Programming Languages)