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: "type based self stabilisation for computational fields"
  Abstract: Emerging network scenarios require the development of solid large-scale situated sys- tems. Unfortunately, the diffusion/aggregation computational processes therein often introduce a source of complexity that hampers predictability of the overall system behaviour. Computational fields have been introduced to help engineering such systems: they are spatially distributed data structures designed to adapt their shape to the topology of the underlying (mobile) network and to the events occurring in it, with notable applications to pervasive computing, sensor networks, and mobile robots. To assure behavioural correctness, namely, correspondence of micro-level specification (single device behaviour) with macro-level behaviour (resulting global spatial pattern), we investigate the issue of self-stabilisation for computational fields. We present a tiny, expressive, and type-sound calculus of computational fields, and define sufficient conditions for self-stabilisation, defined as the ability to react to changes in the environment finding a new stable state in finite time. A type-based approach is used to provide a correct checking procedure for self-stabilisation.

Connected through hyperedge HE-1 (induced by source paper "leakage and protocol composition in a game theoretic perspective"):
  with members:
    - "information leakage games"
    - "on the compositionality of quantitative information flow"
    - "quantitative information flow under generic leakage functions and adaptive adversaries"
    - "security games with information leakage modeling and computation"
    - "calibrating data to sensitivity in private data analysis"
    - "stackelberg vs nash in security games an extended investigation of interchangeability equivalence and uniqueness"

Connected through hyperedge HE-2 (induced by source paper "information leakage games"):
  with members:
    - "quantitative information flow under generic leakage functions and adaptive adversaries"
    - "security games with information leakage modeling and computation"
    - "projection onto the probability simplex an efficient algorithm with a simple proof and an application"
    - "calibrating data to sensitivity in private data analysis"
    - "stackelberg vs nash in security games an extended investigation of interchangeability equivalence and uniqueness"
    - "compositional closure for bayes risk in probabilistic noninterference"

Connected through hyperedge HE-3 (induced by source paper "engineering resilient collective adaptive systems by self stabilisation"):
  with members:
    - "asynchronous distributed execution of fixpoint based computational fields"
    - "organizing the aggregate languages for spatial computing"

Connected through hyperedge HE-4 (induced by source paper "resiliency with aggregate computing state of the art and roadmap"):
  with members:
    - "organizing the aggregate languages for spatial computing"
    - "statistical model checking an overview"

Connected through hyperedge HE-5 (induced by source paper "on the classes of interval graphs of limited nesting and count of lengths"):
  with members:
    - "extending partial representations of unit circular arc graphs"
    - "on the thinness and proper thinness of a graph"
    - "fo model checking of interval graphs"
    - "fo model checking on posets of bounded width"
    - "minimal and short representations of unit interval and unit circular arc graphs"
    - "bounded representations of interval and proper interval graphs"
    - "extending partial representations of interval graphs"
    - "extending partial representations of circle graphs"

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)