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 "achieving fully proportional representation approximability results"):
  Abstract: We study the complexity of (approximate) winner determination under the Monroe and Chamberlin--Courant multiwinner voting rules, which determine the set of representatives by optimizing the total (dis)satisfaction of the voters with their representatives. The total (dis)satisfaction is calculated either as the sum of individual (dis)satisfactions (the utilitarian case) or as the (dis)satisfaction of the worst off voter (the egalitarian case). We provide good approximation algorithms for the satisfaction-based utilitarian versions of the Monroe and Chamberlin--Courant rules, and inapproximability results for the dissatisfaction-based utilitarian versions of them and also for all egalitarian cases. Our algorithms are applicable and particularly appealing when voters submit truncated ballots. We provide experimental evaluation of the algorithms both on real-life preference-aggregation data and on synthetic data. These experiments show that our simple and fast algorithms can in many cases find near-perfect solutions.

Includes members:
  Member "group activity selection problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robustness against agent failure in hedonic games")
  Member "approximating the maxcover problem with bounded frequencies in fpt time":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "parameterized algorithmics for computational social choice nine research challenges")
  Member "on the computation of fully proportional representation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "the complexity of fully proportional representation for single crossing electorates":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "multimode control attacks on elections":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "where are the hard manipulation problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lie on the fly strategic voting in an iterative preference elicitation process")
  Member "guarantees for the success frequency of an algorithm for finding dodgson election winners":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the complexity of online voter control in sequential elections")
  Member "exact complexity of the winner problem for young elections":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "incomplete preferences in single peaked electorates")

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.AI(Artificial Intelligence)