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 "planning with state abstractions for non markovian task specifications"):
  Abstract: Often times, we specify tasks for a robot using temporal language that can also span different levels of abstraction. The example command ``go to the kitchen before going to the second floor'' contains spatial abstraction, given that ``floor'' consists of individual rooms that can also be referred to in isolation ("kitchen", for example). There is also a temporal ordering of events, defined by the word "before". Previous works have used Linear Temporal Logic (LTL) to interpret temporal language (such as "before"), and Abstract Markov Decision Processes (AMDPs) to interpret hierarchical abstractions (such as "kitchen" and "second floor"), separately. To handle both types of commands at once, we introduce the Abstract Product Markov Decision Process (AP-MDP), a novel approach capable of representing non-Markovian reward functions at different levels of abstractions. The AP-MDP framework translates LTL into its corresponding automata, creates a product Markov Decision Process (MDP) of the LTL specification and the environment MDP, and decomposes the problem into subproblems to enable efficient planning with abstractions. AP-MDP performs faster than a non-hierarchical method of solving LTL problems in over 95% of tasks, and this number only increases as the size of the environment domain increases. We also present a neural sequence-to-sequence model trained to translate language commands into LTL expression, and a new corpus of non-Markovian language commands spanning different levels of abstraction. We test our framework with the collected language commands on a drone, demonstrating that our approach enables a robot to efficiently solve temporal commands at different levels of abstraction.

Includes members:
  Member "evaluating compositionality in sentence embeddings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning to learn words from visual scenes")
  Member "accurately and efficiently interpreting human robot instructions of varying granularities":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "using natural language for reward shaping in reinforcement learning")
  Member "still not systematic after all these years on the compositional skills of sequence to sequence recurrent networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the next decade in ai four steps towards robust artificial intelligence")
  Member "interpretable apprenticeship learning with temporal logic specifications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "elaborating on learned demonstrations with temporal logic specifications")
  Member "six challenges for neural machine translation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a brief survey of multilingual neural machine translation")
  Member "generalization without systematicity on the compositional skills of sequence to sequence recurrent networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hierarchical character embeddings learning phonological and semantic representations in languages of logographic origin using recursive neural networks")
  Member "hierarchical deep reinforcement learning integrating temporal abstraction and intrinsic motivation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")
  Member "constructing abstraction hierarchies using a skill symbol loop":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "hypothesis driven skill discovery for hierarchical deep 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)