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 "specifying concurrent programs in separation logic morphisms and simulations"):
  Abstract: In addition to pre- and postconditions, program specifications in recent separation logics for concurrency have employed an algebraic structure of resources---a form of state transition system---to describe the state-based program invariants that must be preserved, and to record the permissible atomic changes to program state. In this paper we introduce a novel notion of resource morphism, i.e. structure-preserving function on resources, and show how to effectively integrate it into separation logic, using an associated notion of morphism-specific simulation. We apply morphisms and simulations to programs verified under one resource, to compositionally adapt them to operate under another resource, thus facilitating proof reuse.

Includes members:
  Member "proving linearizability using forward simulations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "pointer life cycle types for lock free data structures with memory reclamation")
  Member "concurrent data structures linked in time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "pointer life cycle types for lock free data structures with memory reclamation")
  Member "hoare style specifications as correctness conditions for non linearizable concurrent objects":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a separation logic for concurrent randomized programs")
  Member "between linearizability and quiescent consistency quantitative quiescent consistency":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "decidability and complexity for quiescent consistency and its variations")
  Member "specifying and verifying concurrent algorithms with histories and subjectivity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "decoupling lock free data structures from memory reclamation for static analysis")
  Member "linearizability with ownership transfer":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "proving linearizability using partial orders extended version")
  Member "flat combining and the synchronization parallelism tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "using skip graphs for increased numa locality")

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.PL(Programming Languages)