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 condorcet optimal participatory budgeting algorithm"
  Abstract: The budget is the key means for effecting policy in democracies, yet its preparation is typically an opaque and arcane process. Participatory budgeting is making inroads in municipalities, but is usually limited to a small fraction of the total budget as its methods do not scale: They cannot handle quantitative budget items nor hierarchical budget construction. Here we apply the Condorcet principle to participatory budgeting. We say that a budget is globally-optimal if it is feasible (i.e., within the budget limit) and no other feasible budget is preferred over it by a majority of the voters. A globally-optimal budget does not always exist due to Condorcet cycles; hence, we settle for a Condorcet-optimal budget, which is globally-optimal up to such cycles. We devise a polynomial-time algorithm that, given a budget proposal, a set of votes (rankings) over it, and a budget limit, produces a Condorcet-optimal budget. We argue that in practice the resulting budget would most often be either globally-optimal or almost globally-optimal. Our method handles quantitative budget items of arbitrary cost and supports hierarchical budget construction, thus may be applied to entire budgets.

Connected through hyperedge HE-1 (induced by source paper "point foundations of e democracy"):
  with members:
    - "crowdsourcing for participatory democracies efficient elicitation of social choice functions"

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)