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 "private names in non commutative logic"):
  Abstract: We present an expressive but decidable first-order system (named MAV1) defined by using the calculus of structures, a generalisation of the sequent calculus. In addition to first-order universal and existential quantifiers the system incorporates a de Morgan dual pair of nominal quantifiers called `new' and `wen', distinct from the self-dual Gabbay-Pitts and Miller-Tiu nominal quantifiers. The novelty of the operators `new' and `wen' is they are polarised in the sense that `new' distributes over positive operators while `wen' distributes over negative operators. This greater control of bookkeeping enables private names to be modelled in processes embedded as predicates in MAV1. Modelling processes as predicates in MAV1 has the advantage that linear implication defines a precongruence over processes that fully respects causality and branching. The transitivity of this precongruence is established by novel techniques for handling first-order quantifiers in the cut elimination proof.

Includes members:
  Member "a deep inference system with a self dual binder which is complete for linear lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "de morgan dual nominal quantifiers modelling private names in non commutative logic")
  Member "structure preserving bisimilarity supporting an operational petri net semantics of ccsp":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ensuring liveness properties of distributed systems open problems")
  Member "a quasipolynomial cut elimination procedure in deep inference via atomic flows and threshold formulae":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the proof complexity of deep inference")
  Member "on the proof complexity of deep inference":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "de morgan dual nominal quantifiers modelling private names in non commutative logic")
  Member "a system of interaction and structure":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "de morgan dual nominal quantifiers modelling private names in non commutative logic")
  Member "a system of interaction and structure ii the need for deep inference":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "de morgan dual nominal quantifiers modelling private names in non commutative logic")

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)