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 "computational interpretations of classical reasoning from the epsilon calculus to stateful programs"):
  Abstract: The problem of giving a computational meaning to classical reasoning lies at the heart of logic. This article surveys three famous solutions to this problem – the epsilon calculus, modified realizability and the Dialectica interpretation – and re-examines them from a modern perspective, with a particular emphasis on connections with algorithms and programming.

Includes members:
  Member "extracting verified decision procedures dpll and resolution":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "up to techniques for branching bisimilarity")
  Member "spector bar recursion over finite partial functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an algorithmic approach to the existence of ideal objects in commutative algebra")
  Member "applying godel s dialectica interpretation to obtain a constructive proof of higman s lemma":
    also connected through other hyperedges:
      (none)
  Member "existential witness extraction in classical realizability and via a negative translation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a constructive proof of dependent choice in classical arithmetic via memoization")
  Member "interactive learning based realizability for heyting arithmetic with em1":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "formal modeling and smt based parameterized verification of data aware bpmn")

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)