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 "learning robotic ultrasound scanning using probabilistic temporal ranking"):
  Abstract: This paper addresses a common class of problems where a robot learns to perform a discovery task based on example solutions, or human demonstrations. For example consider the problem of ultrasound scanning, where the demonstration requires that an expert adaptively searches for a satisfactory view of internal organs, vessels or tissue and potential anomalies while maintaining optimal contact between the probe and surface tissue. Such problems are currently solved by inferring notional rewards that, when optimised for, result in a plan that mimics demonstrations. A pivotal assumption, that plans with higher reward should be exponentially more likely, leads to the de facto approach for reward inference in robotics. While this approach of maximum entropy inverse reinforcement learning leads to a general and elegant formulation, it struggles to cope with frequently encountered sub-optimal demonstrations. In this paper, we propose an alternative approach to cope with the class of problems where sub-optimal demonstrations occur frequently. We hypothesise that, in tasks which require discovery, successive states of any demonstration are progressively more likely to be associated with a higher reward. We formalise this temporal ranking approach and show that it improves upon maximum-entropy approaches to perform reward inference for autonomous ultrasound scanning, a novel application of learning from demonstration in medical imaging.

Includes members:
  Member "extrapolating beyond suboptimal demonstrations via inverse reinforcement learning from observations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "safe imitation learning via fast bayesian reward inference from preferences")
  Member "rapid probabilistic interest learning from domain specific pairwise image comparisons":
    also connected through other hyperedges:
      (none)
  Member "a divergence minimization perspective on imitation learning methods":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "safe imitation learning via fast bayesian reward inference from preferences")
  Member "composing diverse policies for temporally extended tasks":
    also connected through other hyperedges:
      (none)
  Member "generative adversarial imitation learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep reinforcement learning for autonomous driving a survey")
  Member "informative path planning and mapping with multiple uavs in wind fields":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "memetic algorithm based path generation for multiple dubins vehicles performing remote tasks")
  Member "maximum entropy deep inverse reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "don t feed the troll detecting troll behavior via inverse reinforcement learning")

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.RO(Robotics)