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: "on bounding problems of quantitative information flow"
  Abstract: Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the guessing entropy, belief, and channel capacity. This paper investigates the hardness of precisely checking the quantitative information flow of a program according to such definitions. More precisely, we study the "bounding problem" of quantitative information flow, defined as follows: Given a program M and a positive real number q, decide if the quantitative information flow of M is less than or equal to q. We prove that the bounding problem is not a k-safety property for any k (even when q is fixed, for the Shannon-entropy-based definition with the uniform distribution), and therefore is not amenable to the self-composition technique that has been successfully applied to checking non-interference. We also prove complexity theoretic hardness results for the case when the program is restricted to loop-free boolean programs. Specifically, we show that the problem is PP-hard for all definitions, showing a gap with non-interference which is coNP-complete for the same class of programs. The paper also compares the results with the recently proved results on the comparison problems of quantitative information flow.

Connected through hyperedge HE-1 (induced by source paper "model checking quantitative hyperproperties"):
  with members:
    - "the density of linear time properties"
    - "datalair efficient block storage with plausible deniability against multi snapshot adversaries"
    - "plausible deniability for privacy preserving data synthesis"
    - "the complexity of counting models of linear time temporal logic"
    - "a temporal logic for hyperproperties"
    - "quantitative information flow as safety and liveness hyperproperties"

Connected through hyperedge HE-2 (induced by source paper "on the compositionality of dynamic leakage and its application to the quantification problem"):
  with members:
    - "quantifying dynamic leakage complexity analysis and model counting based calculation"
    - "model counting modulo theories"

Connected through hyperedge HE-3 (induced by source paper "quantifying dynamic leakage complexity analysis and model counting based calculation"):
  with members:
    - "quantitative information flow verification hardness and possibilities"

Connected through hyperedge HE-4 (induced by source paper "hypercollecting semantics and its application to static analysis of information flow"):
  with members:
    - "a temporal logic for hyperproperties"
    - "abstract interpretation based approaches to security a survey on abstract non interference and its challenging applications"
    - "a survey on product operators in abstract interpretation"
    - "the octagon abstract domain"
    - "symbolic methods to enhance the precision of numerical abstract domains"

Connected through hyperedge HE-5 (induced by source paper "model counting modulo theories"):
  with members:
    - "pkind a parallel k induction based model checker"
    - "tarmo a framework for parallelized bounded model checking"
    - "the good old davis putnam procedure helps counting models"

Connected through hyperedge HE-6 (induced by source paper "quantitative information flow as safety and liveness hyperproperties"):
  with members:
    - "quantitative information flow verification hardness and possibilities"

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.CR(Cryptography and Security)