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 abstract machinery of interaction long version"):
  Abstract: We provide an original reformulation of the IAM, an abstract machine introduced by Danos and Regnier based on Girard's Geometry of Interaction. We present our machine as acting directly on $\lambda$-terms, rather than on linear logic proof nets. The inductive nature of the $\lambda$-calculus allows direct and self-contained proofs of soundness and adequacy. Moreover, we improve the literature showing that the denotational semantics induced by our machine is invariant for open terms and erasing steps, solving a notorious issue of the Geometry of Interaction.

Includes members:
  Member "crumbling abstract machines":
    also connected through other hyperedges:
      (none)
  Member "proof nets and the linear substitution calculus":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "backpropagation in the simply typed lambda calculus with linear negation")
  Member "the geometry of parallelism classical probabilistic and quantum effects":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "decomposing probabilistic lambda calculi")
  Member "leftmost outermost beta reduction is invariant indeed":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "crumbling abstract machines")
  Member "on the relative usefulness of fireballs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards a semantic measure of the execution time in call by value lambda calculus")
  Member "abstract machines for dialogue games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ludics with repetitions exponentials interactive types and completeness")

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)