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 "strong bisimulation for control operators"):
  Abstract: The purpose of this paper is to identify programs with control operators whose reduction semantics are in exact correspondence. This is achieved by introducing a relation $\simeq$, defined over a revised presentation of Parigot's $\lambda\mu$-calculus we dub $\Lambda M$. Our result builds on three main ingredients which guide our semantical development: (1) factorization of Parigot's $\lambda\mu$-reduction into multiplicative and exponential steps by means of explicit operators, (2) adaptation of Laurent's original $\sigma$-equivalence to $\Lambda M$, and (3) interpretation of $\Lambda M$ into Laurent's polarized proof-nets (PPN). More precisely, we first give a translation of $\Lambda M$-terms into PPN which simulates the reduction relation of our calculus into cut elimination of PPN. Second, we establish a precise relation between our relation $\simeq$ and Laurent's $\sigma$-equivalence for $\lambda\mu$-terms. Moreover, $\simeq$ is shown to characterize structural equivalence in PPN. Most notably, $\simeq$ is shown to be a strong bisimulation with respect to reduction in $\Lambda M$, \ie two $\simeq$-equivalent terms have the exact same reduction semantics, a result which fails for Regnier's $\sigma$-equivalence in $\lambda$-calculus as well as for Laurent's $\sigma$-equivalence in $\lambda\mu$.

Includes members:
  Member "non idempotent types for classical calculi in natural deduction style":
    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 "the abstract machinery of interaction long version")
  Member "a fully abstract semantics of lambda mu in the pi calculus":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "characterisation of approximation and head normalisation for λμ using strict intersection types")
  Member "a theory of explicit substitutions with safe and full composition":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reduction monads and their signatures")

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)