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: "where are the really hard manipulation problems the phase transition in manipulating the veto rule"
  Abstract: Voting is a simple mechanism to aggregate the preferences of agents. Many voting rules have been shown to be NP-hard to manipulate. However, a number of recent theoretical results suggest that this complexity may only be in the worst-case since manipulation is often easy in practice. In this paper, we show that empirical studies are useful in improving our understanding of this issue. We demonstrate that there is a smooth transition in the probability that a coalition can elect a desired candidate using the veto rule as the size of the manipulating coalition increases. We show that a rescaled probability curve displays a simple and universal form independent of the size of the problem. We argue that manipulation of the veto rule is asymptotically easy for many independent and identically distributed votes even when the coalition of manipulators is critical in size. Based on this argument, we identify a situation in which manipulation is computationally hard. This is when votes are highly correlated and the election is "hung". We show, however, that even a single uncorrelated voter is enough to make manipulation easy again.

Connected through hyperedge HE-1 (induced by source paper "deceased organ matching in australia"):
  with members:
    - "manipulating the probabilistic serial rule"
    - "online fair division analysing a food bank problem"
    - "welfare of sequential allocation mechanisms for indivisible goods"
    - "allocation in practice"
    - "possible and necessary allocations via sequential mechanisms"
    - "fair assignment of indivisible objects under ordinal preferences"
    - "a social welfare optimal sequential allocation procedure"
    - "an empirical study of the manipulability of single transferable voting"

Connected through hyperedge HE-2 (induced by source paper "generating single peaked votes"):
  with members:
    - "an empirical study of the manipulability of single transferable voting"
    - "where are the hard manipulation problems"
    - "the shield that never was societies with single peaked preferences are more open to manipulation and control"
    - "eliciting single peaked preferences using comparison queries"

Connected through hyperedge HE-3 (induced by source paper "allocation in practice"):
  with members:
    - "a study of proxies for shapley allocations of transport costs"
    - "online cake cutting"
    - "an empirical study of the manipulability of single transferable voting"
    - "where are the hard manipulation problems"
    - "the sat phase transition"

Connected through hyperedge HE-4 (induced by source paper "the computational impact of partial votes on strategic voting"):
  with members:
    - "complexity of and algorithms for borda manipulation"
    - "an empirical study of the manipulability of single transferable voting"
    - "where are the hard manipulation problems"
    - "complexity of manipulating elections with few candidates"

Connected through hyperedge HE-5 (induced by source paper "control in the presence of manipulators cooperative and competitive cases"):
  with members:
    - "x then x manipulation of same system runoff elections"
    - "online voter control in sequential elections"
    - "an atypical survey of typical case heuristic algorithms"
    - "the complexity of online manipulation of sequential elections"
    - "new candidates welcome possible winners with respect to the addition of new candidates"
    - "multimode control attacks on elections"
    - "normalized range voting broadly resists control"
    - "control complexity in fallback voting"

Connected through hyperedge HE-6 (induced by source paper "x then x manipulation of same system runoff elections"):
  with members:
    - "search versus decision for election manipulation problems"
    - "an atypical survey of typical case heuristic algorithms"
    - "eliminating the weakest link making manipulation intractable"
    - "a richer understanding of the complexity of election systems"
    - "dichotomy for voting systems"
    - "anyone but him the complexity of precluding an alternative"
    - "universal voting protocol tweaks to make manipulation hard"

Connected through hyperedge HE-7 (induced by source paper "how hard is it to control an election by breaking ties"):
  with members:
    - "control complexity in bucklin fallback and plurality voting an experimental approach"
    - "eliminating the weakest link making manipulation intractable"
    - "determining possible and necessary winners under common voting rules given partial orders"
    - "manipulation of nanson s and baldwin s rules"
    - "an empirical study of the manipulability of single transferable voting"
    - "universal voting protocol tweaks to make manipulation hard"

Connected through hyperedge HE-8 (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"
    - "a smooth transition from powerlessness to absolute power"
    - "dominating manipulations in voting with partial information"
    - "multimode control attacks on elections"
    - "how hard is bribery in elections"
    - "universal voting protocol tweaks to make manipulation hard"

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