human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "logical metric and algorithmic characterisations of probabilistic bisimulation"
  Abstract: Many behavioural equivalences or preorders for probabilistic processes involve a lifting operation that turns a relation on states into a relation on distributions of states. We show that several existing proposals for lifting relations can be reconciled to be different presentations of essentially the same lifting operation. More interestingly, this lifting operation nicely corresponds to the Kantorovich metric, a fundamental concept used in mathematics to lift a metric on states to a metric on distributions of states, besides the fact the lifting operation is related to the maximum flow problem in optimisation theory. The lifting operation yields a neat notion of probabilistic bisimulation, for which we provide logical, metric, and algorithmic characterisations. Specifically, we extend the Hennessy-Milner logic and the modal mu-calculus with a new modality, resulting in an adequate and an expressive logic for probabilistic bisimilarity, respectively. The correspondence of the lifting operation and the Kantorovich metric leads to a natural characterisation of bisimulations as pseudometrics which are post-fixed points of a monotone function. We also present an “on the fly” algorithm to check if two states in a finitary system are related by probabilistic bisimilarity, exploiting the close relationship between the lifting operation and the maximum flow problem.

Connected through hyperedge HE-1 (induced by source paper "sos based modal decomposition on nondeterministic probabilistic processes"):
  with members:
    - "divide and congruence ii from decomposition of modal formulas to preservation of delay and weak bisimilarity"
    - "logical characterization of trace metrics"
    - "logical characterization of bisimulation metrics"
    - "revisiting trace and testing equivalences for nondeterministic and probabilistic processes"

Connected through hyperedge HE-2 (induced by source paper "logical characterization of trace metrics"):
  with members:
    - "logical characterization of bisimulation metrics"
    - "revisiting trace and testing equivalences for nondeterministic and probabilistic processes"
    - "game refinement relations and metrics"

Connected through hyperedge HE-3 (induced by source paper "logical characterization of bisimulation metrics"):
  with members:
    - "divide and congruence ii from decomposition of modal formulas to preservation of delay and weak bisimilarity"
    - "modal characterisations of behavioural pseudometrics"
    - "topologies of stochastic markov models computational aspects"
    - "probabilistic bisimulation naturally on distributions"
    - "fixed point characterization of compositionality properties of probabilistic processes combinators"
    - "when equivalence and bisimulation join forces in probabilistic automata"
    - "continuous markovian logics axiomatization and quantified metatheory"
    - "characterising probabilistic processes logically"

Connected through hyperedge HE-4 (induced by source paper "proving differential privacy via probabilistic couplings"):
  with members:
    - "computer aided verification for mechanism design"
    - "understanding the sparse vector technique for differential privacy"
    - "relational reasoning via probabilistic coupling"
    - "on the privacy properties of variants on the sparse vector technique"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"
    - "proving differential privacy in hoare logic"
    - "preserving statistical validity in adaptive data analysis"
    - "calibrating data to sensitivity in private data analysis"

Connected through hyperedge HE-5 (induced by source paper "open bisimulation for quantum processes"):
  with members:
    - "contextual equivalence for higher order pi calculus revisited"

Question: Please tell me which class the center node 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)