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 "near linear time algorithms for streett objectives in graphs and mdps"):
  Abstract: The fundamental model-checking problem, given as input a model and a specification, asks for the algorithmic verification of whether the model satisfies the specification. Two classical models for reactive systems are graphs and Markov decision processes (MDPs). A basic specification formalism in the verification of reactive systems is the strong fairness (aka Streett) objective, where given different types of requests and corresponding grants, the requirement is that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All omega-regular objectives can be expressed as Streett objectives and hence they are canonical in verification. Consider graphs/MDPs with n vertices, m edges, and a Streett objectives with k pairs, and let b denote the size of the description of the Streett objective for the sets of requests and grants. The current best-known algorithm for the problem requires time O(min(n^2, m sqrt{m log n}) + b log n). In this work we present randomized near-linear time algorithms, with expected running time O~(m + b), where the O~ notation hides poly-log factors. Our randomized algorithms are near-linear in the size of the input, and hence optimal up to poly-log factors.

Includes members:
  Member "decremental strongly connected components and single source reachability in near linear time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "a storm is coming a modern probabilistic model checker":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the probabilistic model checker storm")
  Member "improved algorithms for one pair and k pair streett objectives":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "quasipolynomial set based symbolic algorithms for parity games")
  Member "from ltl to deterministic automata a safraless compositional approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semantic labelling and learning for parity game solving in ltl synthesis")
  Member "improved algorithms for parity and streett objectives":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "universal trees grow inside separating automata quasi polynomial lower bounds for parity games")
  Member "automata with generalized rabin pairs for probabilistic model checking and ltl synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "ltl to smaller self loop alternating automata and back")

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.GT(Computer Science and Game Theory)