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: "playing 20 question game with policy based reinforcement learning"
  Abstract: The 20 Questions (Q20) game is a well known game which encourages deductive reasoning and creativity. In the game, the answerer first thinks of an object such as a famous person or a kind of animal. Then the questioner tries to guess the object by asking 20 questions. In a Q20 game system, the user is considered as the answerer while the system itself acts as the questioner which requires a good strategy of question selection to figure out the correct object and win the game. However, the optimal policy of question selection is hard to be derived due to the complexity and volatility of the game environment. In this paper, we propose a novel policy-based Reinforcement Learning (RL) method, which enables the questioner agent to learn the optimal policy of question selection through continuous interactions with users. To facilitate training, we also propose to use a reward network to estimate the more informative reward. Compared to previous methods, our RL method is robust to noisy answers and does not rely on the Knowledge Base of objects. Experimental results show that our RL method clearly outperforms an entropy-based engineering system and has competitive performance in a noisy-free simulation environment.

Connected through hyperedge HE-1 (induced by source paper "interactive classification by asking informative questions"):
  with members:
    - "asking clarifying questions in open domain information seeking conversations"
    - "user intent prediction in information seeking conversations"
    - "joint learning of interactive spoken content retrieval and trainable user simulator"
    - "adversarial domain adaptation for duplicate question detection"
    - "vision based navigation with language based assistance via imitation learning with indirect intervention"
    - "coqa a conversational question answering challenge"
    - "learning to ask knowledge acquisition via 20 questions"
    - "quac question answering in context"

Connected through hyperedge HE-2 (induced by source paper "learning to ask question based sequential bayesian product search"):
  with members:
    - "technology assisted reviews finding the last few relevant documents by asking yes no questions to reviewers"
    - "attentive long short term preference modeling for personalized product search"
    - "learning to ask knowledge acquisition via 20 questions"
    - "joint modeling and optimization of search and recommendation"
    - "conversational recommender system"
    - "word entity duet representations for document ranking"
    - "learning latent vector spaces for product search"
    - "autonomy and reliability of continuous active learning for technology assisted review"

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.HC(Human-Computer Interaction)