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 "how credible is the prediction of a party based election"):
  Abstract: In a party-based election system, the voters are grouped into parties and all voters of a party are assumed to vote according to the party preferences over the candidates. Hence, once the party preferences are declared the outcome of the election can be determined. However, in the actual election, the members of some "instable" parties often leave their own party to join other parties. We introduce two parameters to measure the credibility of the prediction based on party preferences: Min is the minimum number of voters leaving the instable parties such that the prediction is no longer true, while Max is the maximum number of voters leaving the instable parties such that the prediction remains valid. Concerning the complexity of computing Min and Max, we consider both positional scoring rules (Plurality, Veto, r-Approval and Borda) and Condorcet-consistent rules (Copeland and Maximin). We show that for all considered scoring rules, Min is polynomial-time computable, while it is NP-hard to compute Min for Copeland and Maximin. With the only exception of Borda, Max can be computed in polynomial time for other scoring rules. We have NP-hardness results for the computation of Max under Borda, Maximin and Copeland.

Includes members:
  Member "weighted electoral control":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "selecting voting locations for fun and profit")
  Member "multimode control attacks on elections":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")
  Member "how hard is bribery in elections":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "selecting voting locations for fun and profit")

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.MA(Multiagent Systems)