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 "computing with hereditarily finite sequences"):
  Abstract: We use Prolog as a exible meta-language to provide ex- ecutable specications of some fundamental mathematical objects and their transformations. In the process, isomorphisms are unraveled be- tween natural numbers and combinatorial objects (rooted ordered trees representing hereditarily nite sequences and rooted ordered binary trees representing Godel's System T types). This paper focuses on an application that can be seen as an unex- pected \paradigm shift": we provide recursive denitions showing that the resulting representations are directly usable to perform symbolically arbitrary-length integer computations. Besides the theoretically interesting fact of \breaking the arithmetic/sym- bolic barrier", the arithmetic operations performed with symbolic objects like trees or types turn out to be genuinely ecient { we derive implemen- tations with asymptotic performance comparable to ordinary bitstring implementations of arbitrary-length integer arithmetic. The source code of the paper, organized as a literate Prolog program, is available at http://logic.cse.unt.edu/tarau/research/2011/pPAR.pl Keywords: modeling nite mathematics in logic programming, symbolic arbitrary precision arithmetic, ranking/unranking of hereditarily nite sequences, balanced parenthesis languages,

Includes members:
  Member "declarative combinatorics isomorphisms hylomorphisms and hereditarily finite data types in haskell":
    also connected through other hyperedges:
      (none)
  Member "type arithmetics computation based on the theory of types":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tree based arithmetic and compressed representations of giant numbers")
  Member "formal properties of xml grammars and languages":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bijective term encodings")

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)