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 complexity of the winner problem for young elections"
  Abstract: In 1977, Young proposed a voting scheme that extends the Condorcet Principle based on the fewest possible number of voters whose removal yields a Condorcet winner. We prove that both the winner and the ranking problem for Young elections is complete for the class of problems solvable in polynomial time by parallel access to NP. Analogous results for Lewis Carroll's 1876 voting scheme were recently established by Hemaspaandra et al. In contrast, we prove that the winner and ranking problems in Fishburn's homogeneous variant of Carroll's voting scheme can be solved efficiently by linear programming.

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 "minimal envy and popular matchings"):
  with members:
    - "competitive division of a mixed manna"
    - "popular matchings with two sided preferences and one sided ties"
    - "counting popular matchings in house allocation problems"
    - "weighted popular matchings"

Connected through hyperedge HE-3 (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 analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np"

Connected through hyperedge HE-4 (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-5 (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-6 (induced by source paper "single peakedness and total unimodularity efficiently solve voting problems without even trying"):
  with members:
    - "multiwinner analogues of plurality rule axiomatic and algorithmic perspectives"
    - "structure in dichotomous preferences"
    - "finding a collective set of items from proportional multirepresentation to group recommendation"
    - "computational aspects of multi winner approval voting"
    - "on the computation of fully proportional representation"

Connected through hyperedge HE-7 (induced by source paper "properties of multiwinner voting rules"):
  with members:
    - "finding a collective set of items from proportional multirepresentation to group recommendation"
    - "justified representation in approval based committee voting"
    - "computational aspects of multi winner approval voting"
    - "achieving fully proportional representation approximability results"
    - "on the computation of fully proportional representation"
    - "the complexity of fully proportional representation for single crossing electorates"
    - "fully proportional representation as resource allocation approximability results"
    - "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np"

Connected through hyperedge HE-8 (induced by source paper "on choosing committees based on approval votes in the presence of outliers"):
  with members:
    - "sample complexity for winner prediction in elections"
    - "ptas for minimax approval voting"
    - "justified representation in approval based committee voting"
    - "on approximating string selection problems with outliers"
    - "multimode control attacks on elections"
    - "a richer understanding of the complexity of election systems"
    - "anyone but him the complexity of precluding an alternative"

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)