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 "memoization for unary logic programming characterizing ptime"):
  Abstract: We give a characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring, whose elements can be understood as logic programs or sets of rewriting rules over first-order terms. More precisely, we study the restriction of this framework to terms (and logic programs, rewriting rules) using only unary symbols. We prove it is complete for polynomial time computation, using an encoding of pushdown automata. We then introduce an algebraic counterpart of the memoization technique in order to show its PTIME soundness. We finally relate our approach and complexity results to complexity of logic programming. As an application of our techniques, we show a PTIME-completeness result for a class of logic programming queries which use only unary function symbols.

Includes members:
  Member "characterizing co nl by a group action":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "probabilistic complexity classes through semantics")
  Member "interaction graphs graphings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "probabilistic complexity classes through semantics")
  Member "unification and logarithmic space":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "logic programming and logarithmic space")
  Member "logic programming and logarithmic space":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "prams over integers do not compute maxflow efficiently")
  Member "simulation of two way pushdown automata revisited":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "abstracting definitional interpreters functional pearl")
  Member "an implicit characterization of pspace":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "logic programming and logarithmic space")
  Member "light types for polynomial time computation in lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a modular inference of linear types for multiplicity annotated arrows")

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)