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 "justness a completeness criterion for capturing liveness properties"):
  Abstract: This paper poses that transition systems constitute a good model of distributed systems only in combination with a criterion telling which paths model complete runs of the represented systems. Among such criteria, progress is too weak to capture relevant liveness properties, and fairness is often too strong; for typical applications we advocate the intermediate criterion of justness. Previously, we proposed a definition of justness in terms of an asymmetric concurrency relation between transitions. Here we define such a concurrency relation for the transition systems associated to the process algebra CCS as well as its extensions with broadcast communication and signals, thereby making these process algebras suitable for capturing liveness properties requiring justness.

Includes members:
  Member "progress justness and fairness":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ensuring liveness properties of distributed systems open problems")
  Member "analysing mutual exclusion using process algebra with signals":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ensuring liveness properties of distributed systems open problems")
  Member "ensuring liveness properties of distributed systems a research agenda":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reward testing equivalences for processes")
  Member "structure preserving bisimilarity supporting an operational petri net semantics of ccsp":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "ensuring liveness properties of distributed systems open problems")
  Member "progress fairness and justness in process algebra":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ensuring liveness properties of distributed systems open problems")
  Member "a process algebra for wireless mesh networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ensuring liveness properties of distributed systems open problems")
  Member "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "ensuring liveness properties of distributed systems open problems")
  Member "on characterising distributability":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "ensuring liveness properties of distributed systems open problems")

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)