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: "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np"
  Abstract: In 1876, Lewis Carroll proposed a voting system in which the winner is the candidate who with the fewest changes in voters' preferences becomes a Condorcet winner---a candidate who beats all other candidates in pairwise majority-rule elections. Bartholdi, Tovey, and Trick provided a lower bound---NP-hardness---on the computational complexity of determining the election winner in Carroll's system. We provide a stronger lower bound and an upper bound that matches our lower bound. In particular, determining the winner in Carroll's system is complete for parallel access to NP, i.e., it is complete for $\thetatwo$, for which it becomes the most natural complete problem known. It follows that determining the winner in Carroll's elections is not NP-complete unless the polynomial hierarchy collapses.

Connected through hyperedge HE-1 (induced by source paper "incomplete preferences in single peaked electorates"):
  with members:
    - "on the likelihood of single peaked preferences"
    - "computational aspects of nearly single peaked electorates"
    - "recognising multidimensional euclidean preferences"
    - "modeling single peakedness for votes with ties"
    - "single peaked consistency for weak orders is easy"
    - "reinstating combinatorial protections for manipulation and bribery in single peaked and nearly single peaked electorates"
    - "the one dimensional euclidean domain finitely many obstructions are not enough"
    - "complexity of manipulative actions when voting with ties"

Connected through hyperedge HE-2 (induced by source paper "the complexity of online bribery in sequential elections extended abstract"):
  with members:
    - "the complexity of online bribery in sequential elections"
    - "computational social choice and computational complexity bffs"
    - "high multiplicity election problems"
    - "prices matter for the parameterized complexity of shift bribery"
    - "the complexity of controlling candidate sequential elections"
    - "the complexity of online manipulation of sequential elections"
    - "the complexity of online voter control in sequential elections"
    - "new candidates welcome possible winners with respect to the addition of new candidates"

Connected through hyperedge HE-3 (induced by source paper "complexity of stability"):
  with members:
    - "finding optimal solutions with neighborly help"
    - "core stability in hedonic coalition formation"
    - "application of graph colouring to biological networks"
    - "exact complexity of exact four colorability"

Connected through hyperedge HE-4 (induced by source paper "election score can be harder than winner"):
  with members:
    - "very hard electoral control problems"
    - "cycles and intractability in a large class of aggregation rules"
    - "complexity of manipulative actions when voting with ties"
    - "clone structures in voters preferences"
    - "exact complexity of the winner problem for young elections"

Connected through hyperedge HE-5 (induced by source paper "computational social choice and computational complexity bffs"):
  with members:
    - "consensus halving is ppa complete"
    - "online voter control in sequential elections"
    - "the complexity of online manipulation of sequential elections"
    - "hybrid elections broaden complexity theoretic resistance to control"
    - "a richer understanding of the complexity of election systems"
    - "raising np lower bounds to parallel np lower bounds"

Connected through hyperedge HE-6 (induced by source paper "high multiplicity election problems"):
  with members:
    - "the complexity of succinct elections"
    - "complexity dichotomies for unweighted scoring rules"
    - "a control dichotomy for pure scoring rules"
    - "polynomiality for bin packing with a constant number of item types"
    - "weighted electoral control"
    - "the complexity of online manipulation of sequential elections"
    - "complexity of and algorithms for borda manipulation"
    - "towards a dichotomy for the possible winner problem in elections based on scoring rules"

Connected through hyperedge HE-7 (induced by source paper "modeling single peakedness for votes with ties"):
  with members:
    - "computational aspects of nearly single peaked electorates"
    - "single peaked consistency for weak orders is easy"
    - "reinstating combinatorial protections for manipulation and bribery in single peaked and nearly single peaked electorates"
    - "complexity of manipulative actions when voting with ties"
    - "complexity of manipulation in elections with top truncated ballots"
    - "the computational impact of partial votes on strategic voting"
    - "the complexity of manipulative attacks in nearly single peaked electorates"
    - "the shield that never was societies with single peaked preferences are more open to manipulation and control"

Connected through hyperedge HE-8 (induced by source paper "single peaked consistency for weak orders is easy"):
  with members:
    - "computational aspects of nearly single peaked electorates"
    - "testing top monotonicity"
    - "the computational impact of partial votes on strategic voting"
    - "the complexity of manipulative attacks in nearly single peaked electorates"
    - "clone structures in voters preferences"
    - "the shield that never was societies with single peaked preferences are more open to manipulation 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.CC(Computational Complexity)