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 "defending elections against malicious spread of misinformation"):
  Abstract: The integrity of democratic elections depends on voters' access to accurate information. However, modern media environments, which are dominated by social media, provide malicious actors with unprecedented ability to manipulate elections via misinformation, such as fake news. We study a zero-sum game between an attacker, who attempts to subvert an election by propagating a fake new story or other misinformation over a set of advertising channels, and a defender who attempts to limit the attacker's impact. Computing an equilibrium in this game is challenging as even the pure strategy sets of players are exponential. Nevertheless, we give provable polynomial-time approximation algorithms for computing the defender's minimax optimal strategy across a range of settings, encompassing different population structures as well as models of the information available to each player. Experimental results confirm that our algorithms provide near-optimal defender strategies and showcase variations in the difficulty of defending elections depending on the resources and knowledge available to the defender.

Includes members:
  Member "introduction to online convex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "beyond ucb optimal and efficient contextual bandits with regression oracles")
  Member "stochastic submodular maximization the case of coverage functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "end to end learning and optimization on graphs")
  Member "equilibrium computation and robust optimization in zero sum games with submodular structure":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "robust submodular minimization with applications to cooperative modeling")
  Member "gradient methods for submodular maximization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "black box submodular maximization discrete and continuous settings")
  Member "robust budget allocation via continuous submodular functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "black box submodular maximization discrete and continuous settings")
  Member "elections with few voters candidate control can be easy":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the complexity of destructive bribery in approval based multi winner voting")
  Member "multimode control attacks on elections":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the complexity of constructive control under nearly single peaked preferences")

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