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 "model checking quantitative hyperproperties"):
  Abstract: Hyperproperties are properties of sets of computation traces. In this paper, we study quantitative hyperproperties, which we define as hyperproperties that express a bound on the number of traces that may appear in a certain relation. For example, quantitative non-interference limits the amount of information about certain secret inputs that is leaked through the observable outputs of a system. Quantitative non-interference thus bounds the number of traces that have the same observable input but different observable output. We study quantitative hyperproperties in the setting of HyperLTL, a temporal logic for hyperproperties. We show that, while quantitative hyperproperties can be expressed in HyperLTL, the running time of the HyperLTL model checking algorithm is, depending on the type of property, exponential or even doubly exponential in the quantitative bound. We improve this complexity with a new model checking algorithm based on model-counting. The new algorithm needs only logarithmic space in the bound and therefore improves, depending on the property, exponentially or even doubly exponentially over the model checking algorithm of HyperLTL. In the worst case, the new algorithm needs polynomial space in the size of the system. Our Max#Sat-based prototype implementation demonstrates, however, that the counting approach is viable on systems with nontrivial quantitative information flow requirements such as a passcode checker.

Includes members:
  Member "the density of linear time properties":
    also connected through other hyperedges:
      (none)
  Member "datalair efficient block storage with plausible deniability against multi snapshot adversaries":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sqoram read optimized sequential write only oblivious ram")
  Member "plausible deniability for privacy preserving data synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "privgen preserving privacy of sequences through data generation")
  Member "the complexity of counting models of linear time temporal logic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the density of linear time properties")
  Member "a temporal logic for hyperproperties":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a roadmap toward the resilient internet of things for cyber physical systems")
  Member "quantitative information flow as safety and liveness hyperproperties":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "quantitative aspects of programming languages and systems over the past 2 4 years and beyond")
  Member "on bounding problems of quantitative information flow":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the compositionality of dynamic leakage and its application to the quantification problem")

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)