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: "on approximating optimal weighted lobbying and frequency of correctness versus average case polynomial time"
  Abstract: We investigate issues related to two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Christian et al. [CFRS06] showed that optimal lobbying is intractable in the sense of parameterized complexity. We provide an efficient greedy algorithm that achieves a logarithmic approximation ratio for this problem and even for a more general variant--optimal weighted lobbying. We prove that essentially no better approximation ratio than ours can be proven for this greedy algorithm. #R##N#The problem of determining Dodgson winners is known to be complete for parallel access to NP [HHR97]. Homan and Hemaspaandra [HH06] proposed an efficient greedy heuristic for finding Dodgson winners with a guaranteed frequency of success, and their heuristic is a ``frequently self-knowingly correct algorithm.'' We prove that every distributional problem solvable in polynomial time on the average with respect to the uniform distribution has a frequently self-knowingly correct polynomial-time algorithm. Furthermore, we study some features of probability weight of correctness with respect to Procaccia and Rosenschein's junta distributions [PR07].

Connected through hyperedge HE-1 (induced by source paper "the complexity of probabilistic lobbying"):
  with members:
    - "manipulation of nanson s and baldwin s rules"
    - "complexity of and algorithms for borda manipulation"
    - "parameterizing by the number of numbers"
    - "control complexity in fallback voting"
    - "the shield that never was societies with single peaked preferences are more open to manipulation and control"
    - "sincere strategy preference based approval voting fully resists constructive control and broadly resists destructive control"
    - "satzilla portfolio based algorithm selection for sat"
    - "llull and copeland voting computationally resist bribery and control"

Connected through hyperedge HE-2 (induced by source paper "llull and copeland voting computationally resist bribery and control"):
  with members:
    - "sincere strategy preference based approval voting fully resists constructive control and broadly resists destructive control"
    - "copeland voting fully resists constructive control"
    - "how hard is bribery in elections"
    - "hybrid elections broaden complexity theoretic resistance to control"
    - "a richer understanding of the complexity of election systems"
    - "dichotomy for voting systems"
    - "anyone but him the complexity of precluding an alternative"
    - "guarantees for the success frequency of an algorithm for finding dodgson election winners"

Connected through hyperedge HE-3 (induced by source paper "sincere strategy preference based approval voting fully resists constructive control and broadly resists destructive control"):
  with members:
    - "llull and copeland voting computationally resist bribery and control"
    - "the strategy proofness landscape of merging"
    - "copeland voting fully resists constructive control"
    - "hybrid elections broaden complexity theoretic resistance to control"
    - "a richer understanding of the complexity of election systems"
    - "anyone but him the complexity of precluding an alternative"
    - "guarantees for the success frequency of an algorithm for finding dodgson election winners"

Connected through hyperedge HE-4 (induced by source paper "frequency of correctness versus average case polynomial time and generalized juntas"):
  with members:
    - "average case complexity"
    - "a richer understanding of the complexity of election systems"
    - "guarantees for the success frequency of an algorithm for finding dodgson election winners"
    - "exact complexity of the winner problem for young elections"
    - "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np"

Connected through hyperedge HE-5 (induced by source paper "how hard is bribery in elections"):
  with members:
    - "sincere strategy preference based approval voting fully resists constructive control and broadly resists destructive control"
    - "copeland voting fully resists constructive control"
    - "hybrid elections broaden complexity theoretic resistance to control"
    - "a richer understanding of the complexity of election systems"
    - "dichotomy for voting systems"
    - "anyone but him the complexity of precluding an alternative"
    - "guarantees for the success frequency of an algorithm for finding dodgson election winners"
    - "how many candidates are needed to make elections hard to manipulate"

Connected through hyperedge HE-6 (induced by source paper "guarantees for the success frequency of an algorithm for finding dodgson election winners"):
  with members:
    - "how hard is bribery in elections"
    - "exact complexity of the winner problem for young elections"
    - "smoothed analysis of algorithms why the simplex algorithm usually takes polynomial time"
    - "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np"

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)