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 "optimum sleep wake scheduling of sensors for quickest event detection in small extent wireless sensor networks"):
  Abstract: We consider the problem of quickest event detection with sleep-wake scheduling in small extent wireless sensor networks in which, at each time slot, each sensor node in the awake state observes a sample and communicates the information to the fusion centre. The sensor nodes in the sleep state do not sample or communicate any information to the fusion centre (FC), thereby conserving energy. At each time slot, the FC, after having received the samples from the sensor nodes in the wake state, makes a decision to stop (and thus declare that the event has occurred) or to continue observing. If it decides to continue, the FC also makes the decision of choosing the number of sensor nodes to be in the wake state in the next time slot. We consider three alternative approaches to the problem of choosing the number of sensor nodes to be in the wake state in time slot k+1, based on the information available at time slot k, namely, 1. optimal control of M_{k+1}, the number of sensor nodes to be in the awake state in time slot k+1, 2. optimal control of q_{k+1}, the probability of a sensor node to be in the awake state in time slot k+1, and 3. optimal probability q that a sensor node is in the awake state in any time slot. In each case, we formulate the problem as a sequential decision process. We show that a sufficient statistic for the decision at time k is the a posteriori probability of change Pi_k. Also, we show that the optimal stopping rule is a threshold rule on Pi_k. The optimal policy for M_{k+1} can keep very few sensors wake during the prechange phase and then quickly increase the number of sensors in the wake state when a change is "suspected". Among the three sleep-wake algorithms described, we observe that the total cost is minimum for the optimum control of M_{k+1} and is maximum for the optimum control on q.

Includes members:
  Member "delay optimal event detection on ad hoc wireless sensor networks":
    also connected through other hyperedges:
      (none)
  Member "decentralized sequential change detection using physical layer fusion":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed bayesian quickest change detection in sensor networks via two layer large deviation analysis")

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.NI(Networking and Internet Architecture)