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: "a smooth transition from powerlessness to absolute power"
  Abstract: We study the phase transition of the coalitional manipulation problem for generalized scoring rules. Previously it has been shown that, under some conditions on the distribution of votes, if the number of manipulators is $o(\sqrt{n})$, where $n$ is the number of voters, then the probability that a random profile is manipulable by the coalition goes to zero as the number of voters goes to infinity, whereas if the number of manipulators is $\omega(\sqrt{n})$, then the probability that a random profile is manipulable goes to one. Here we consider the critical window, where a coalition has size $c\sqrt{n}$, and we show that as $c$ goes from zero to infinity, the limiting probability that a random profile is manipulable goes from zero to one in a smooth fashion, i.e., there is a smooth phase transition between the two regimes. This result analytically validates recent empirical results, and suggests that deciding the coalitional manipulation problem may be of limited computational hardness in practice.

Connected through hyperedge HE-1 (induced by source paper "how private is your voting a framework for comparing the privacy of voting mechanisms"):
  with members:
    - "bayesian mechanism design with efficiency privacy and approximate truthfulness"

Connected through hyperedge HE-2 (induced by source paper "distance rationalization of anonymous and homogeneous voting rules"):
  with members:
    - "distance rationalization of social rules"
    - "rationalizations of condorcet consistent rules via distances of hamming type"
    - "how hard is bribery in elections"

Connected through hyperedge HE-3 (induced by source paper "election attacks with few candidates"):
  with members:
    - "coalitional manipulation for schulze s rule"
    - "weighted electoral control"
    - "schulze and ranked pairs voting are fixed parameter tractable to bribe manipulate and control"
    - "multimode control attacks on elections"
    - "is computational complexity a barrier to manipulation"
    - "multivariate complexity analysis of swap bribery"
    - "sincere strategy preference based approval voting fully resists constructive control and broadly resists destructive control"

Connected through hyperedge HE-4 (induced by source paper "is it ever safe to vote strategically"):
  with members:
    - "universal voting protocol tweaks to make manipulation hard"

Connected through hyperedge HE-5 (induced by source paper "how many vote operations are needed to manipulate a voting system"):
  with members:
    - "combining voting rules together"
    - "eliminating the weakest link making manipulation intractable"
    - "dominating manipulations in voting with partial information"
    - "multimode control attacks on elections"
    - "where are the really hard manipulation problems the phase transition in manipulating the veto rule"
    - "how hard is bribery in elections"
    - "universal voting protocol tweaks to make manipulation hard"

Connected through hyperedge HE-6 (induced by source paper "normalized range voting broadly resists control"):
  with members:
    - "how many vote operations are needed to manipulate a voting system"
    - "complexity of and algorithms for borda manipulation"
    - "bucklin voting is broadly resistant to control"
    - "control complexity in fallback voting"
    - "where are the hard manipulation problems"
    - "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"
    - "llull and copeland voting computationally resist bribery and control"

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)