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 "on the structure and computation of random walk times in finite graphs"):
  Abstract: We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the convergence of Markov processes, as well as applications in control, machine learning, and social sciences. In this paper, we investigate the computational structure of the random walk times as a function of the set of target nodes, and find that the commute, hitting, and cover times all exhibit submodular structure, even in non-stationary random walks. We provide a unifying proof of this structure by considering each of these times as special cases of stopping times. We generalize our framework to walks in which the transition probabilities and target sets are jointly chosen to minimize the travel times, leading to polynomial-time approximation algorithms for choosing target sets. Our results are validated through numerical study.

Includes members:
  Member "optimal temporal logic planning in probabilistic semantic maps":
    also connected through other hyperedges:
      (none)
  Member "minimizing convergence error in multi agent systems via leader selection a supermodular optimization approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "shifting opinions in a social network through leader selection")
  Member "large scale spectral clustering using resistance distance and spielman teng solvers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "change detection in dynamic attributed networks")
  Member "a supermodular optimization framework for leader selection under link noise in linear multi agent systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "current flow group closeness centrality for complex networks")
  Member "opinion dynamics in social networks a local interaction game with stubborn agents":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "agent based opinion formation modeling in social network a perspective of social psychology")
  Member "mdp optimal control under temporal logic constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "planning with state abstractions for non markovian task specifications")

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.SY(Systems and Control)