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: "parliamentary voting procedures agenda control manipulation and uncertainty"
  Abstract: We study computational problems for two popular parliamentary voting procedures: the amendment procedure and the successive procedure. While finding successful manipulations or agenda controls is tractable for both procedures, our real-world experimental results indicate that most elections cannot be manipulated by a few voters and agenda control is typically impossible. If the voter preferences are incomplete, then finding which alternatives can possibly win is NP-hard for both procedures. Whilst deciding if an alternative necessarily wins is coNP-hard for the amendment procedure, it is polynomial-time solvable for the successive one.

Connected through hyperedge HE-1 (induced by source paper "advances in machine learning for the behavioral sciences"):
  with members:
    - "using machine learning to guide cognitive modeling a case study in moral reasoning"
    - "wordnet feelings a linguistic categorisation of human feelings"
    - "mlic a maxsat based framework for learning interpretable classification rules"
    - "the interpretation of dream meaning resolving ambiguity using latent semantic analysis in a small corpus of text"
    - "semantics derived automatically from language corpora contain human like biases"
    - "on the latent variable interpretation in sum product networks"
    - "why should i trust you explaining the predictions of any classifier"
    - "deep learning in neural networks"

Connected through hyperedge HE-2 (induced by source paper "prices matter for the parameterized complexity of shift bribery"):
  with members:
    - "complexity of shift bribery in committee elections"
    - "campaign management under approval driven voting rules"
    - "elections with few voters candidate control can be easy"
    - "parameterized algorithmics for computational social choice nine research challenges"
    - "combinatorial voter control in elections"
    - "determining possible and necessary winners under common voting rules given partial orders"
    - "taking the final step to a full dichotomy of the possible winner problem in pure scoring rules"
    - "multimode control attacks on elections"

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.GT(Computer Science and Game Theory)