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 "the algebra of recursive graph transformation language uncal complete axiomatisation and iteration categorical semantics"):
  Abstract: The aim of this paper is to provide mathematical foundations of a graph transformation language, called UnCAL, using categorical semantics of type theory and fixed points. About twenty years ago, Buneman et al. developed a graph database query language UnQL on the top of a functional meta-language UnCAL for describing and manipulating graphs. Recently, the functional programming community has shown renewed interest in UnCAL, because it provides an efficient graph transformation language which is useful for various applications, such as bidirectional computation. #R##N#In order to make UnCAL more flexible and fruitful for further extensions and applications, in this paper, we give a more conceptual understanding of UnCAL using categorical semantics. Our general interest of this paper is to clarify what is the algebra of UnCAL. Thus, we give an equational axiomatisation and categorical semantics of UnCAL, both of which are new. We show that the axiomatisation is complete for the original bisimulation semantics of UnCAL. Moreover, we provide a clean characterisation of the computation mechanism of UnCAL called "structural recursion on graphs" using our categorical semantics. We show a concrete model of UnCAL given by the lambdaG-calculus, which shows an interesting connection to lazy functional programming.

Includes members:
  Member "iteration algebras for unql graphs and completeness for bisimulation":
    also connected through other hyperedges:
      (none)
  Member "relating coalgebraic notions of bisimulation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "infinite types infinite data infinite interaction")
  Member "initial algebra semantics for cyclic sharing tree structures":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an abstract view on syntax with sharing")
  Member "orthomodular lattices foulis semigroups and dagger kernel categories":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "characterizing co nl by a group action")
  Member "small step and big step semantics for call by need":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the call by need lambda calculus revisited")
  Member "termination and confluence of higher order rewrite systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a modular termination method for second order computation")
  Member "inductive data type systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a modular termination method for second order computation")

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.LO(Logic in Computer Science)