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 optimality of myopic sensing policy with imperfect sensing in multi channel opportunistic access"
  Abstract: We consider the channel access problem under imperfect sensing of channel state in a multi-channel opportunistic communication system, where the state of each channel evolves as an independent and identically distributed Markov process. The considered problem can be cast into a restless multi-armed bandit (RMAB) problem that is of fundamental importance in decision theory. It is well-known that solving the RMAB problem is PSPACE-hard, with the optimal policy usually intractable due to the exponential computation complexity. A natural alternative is to consider the easily implementable myopic policy that maximizes the immediate reward but ignores the impact of the current strategy on the future reward. In this paper, we perform an analytical study on the optimality of the myopic policy under imperfect sensing for the considered RMAB problem. Specifically, for a family of generic and practically important utility functions, we establish the closed-form conditions under which the myopic policy is guaranteed to be optimal even under imperfect sensing. Despite our focus on the opportunistic channel access, the obtained results are generic in nature and are widely applicable in a wide range of engineering domains.

Connected through hyperedge HE-1 (induced by source paper "on the whittle index for restless multi armed hidden markov bandits"):
  with members:
    - "whittle index policy for crawling ephemeral content"
    - "congestion control of tcp flows in internet routers by means of index policy"
    - "asymptotically optimal downlink scheduling over markovian fading channels"
    - "exploiting channel memory for joint estimation and scheduling in downlink networks"
    - "on myopic sensing for multi channel opportunistic access structure optimality and performance"
    - "joint design and separation principle for opportunistic spectrum access in the presence of sensing errors"

Connected through hyperedge HE-2 (induced by source paper "sufficient conditions on the optimality of myopic sensing in opportunistic channel access a unifying framework"):
  with members:
    - "on optimality of myopic policy for restless multi armed bandit problem an axiomatic approach"
    - "multi channel opportunistic access a case of restless bandits with multiple plays"
    - "optimality of myopic sensing in multi channel opportunistic access"
    - "on myopic sensing for multi channel opportunistic access structure optimality and performance"
    - "approximation algorithms for restless bandit problems"

Connected through hyperedge HE-3 (induced by source paper "on optimality of myopic policy for restless multi armed bandit problem an axiomatic approach"):
  with members:
    - "on the optimality of myopic sensing in multi channel opportunistic access the case of sensing multiple channels"
    - "multi channel opportunistic access a case of restless bandits with multiple plays"
    - "optimality of myopic sensing in multi channel opportunistic access"
    - "on myopic sensing for multi channel opportunistic access structure optimality and performance"
    - "approximation algorithms for restless bandit problems"

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