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: "quantitative information flow under generic leakage functions and adaptive adversaries"
  Abstract: We put forward a model of action-based randomization mechanisms to analyse#N#quantitative information flow (QIF) under generic leakage functions, and under#N#possibly adaptive adversaries. This model subsumes many of the QIF models#N#proposed so far. Our main contributions include the following: (1) we identify#N#mild general conditions on the leakage function under which it is possible to#N#derive general and significant results on adaptive QIF; (2) we contrast the#N#efficiency of adaptive and non-adaptive strategies, showing that the latter are#N#as efficient as the former in terms of length up to an expansion factor bounded#N#by the number of available actions; (3) we show that the maximum information#N#leakage over strategies, given a finite time horizon, can be expressed in terms#N#of a Bellman equation. This can be used to compute an optimal finite strategy#N#recursively, by resorting to standard methods like backward induction.

Connected through hyperedge HE-1 (induced by source paper "quantifying information flow in interactive systems"):
  with members:
    - "widths of regular and context free languages"
    - "quantitative information flow for scheduler dependent systems"

Connected through hyperedge HE-2 (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"
    - "type based self stabilisation for computational fields"
    - "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-3 (induced by source paper "an algebraic approach for reasoning about information flow"):
  with members:
    - "leakage and protocol composition in a game theoretic perspective"
    - "on the compositionality of quantitative information flow"
    - "compositional closure for bayes risk in probabilistic noninterference"

Connected through hyperedge HE-4 (induced by source paper "a game theoretic approach to information flow control via protocol composition"):
  with members:
    - "on the compositionality of quantitative information flow"
    - "stackelberg vs nash in security games an extended investigation of interchangeability equivalence and uniqueness"

Connected through hyperedge HE-5 (induced by source paper "information leakage games"):
  with members:
    - "type based self stabilisation for computational fields"
    - "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"

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)