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: "proxy voting for better outcomes"
  Abstract: We consider a social choice problem where only a small number of people out of a large population are sufficiently available or motivated to vote. A common solution to increase participation is to allow voters use a proxy, that is, transfer their voting rights to another voter. Considering social choice problems on metric spaces, we compare voting with and without the use of proxies to see which mechanism better approximates the optimal outcome, and characterize the regimes in which proxy voting is beneficial. When voters' opinions are located on an interval, both the median mechanism and the mean mechanism are substantially improved by proxy voting. When voters vote on many binary issues, proxy voting is better when the sample of active voters is too small to provide a good outcome. Our theoretical results extend to situations where available voters choose strategically whether to participate. We support our theoretical findings with empirical results showing substantial benefits of proxy voting on simulated and real preference data.

Connected through hyperedge HE-1 (induced by source paper "sybil resilient social choice with partial participation"):
  with members:
    - "sybil resilient conductance based community growth"
    - "sybil resilient reality aware social choice"
    - "incorporating reality into social choice"
    - "sample complexity for winner prediction in elections"
    - "equilibria of plurality voting with abstentions"

Connected through hyperedge HE-2 (induced by source paper "flexible representative democracy an introduction with binary issues"):
  with members:
    - "on rational delegations in liquid democracy"
    - "a mathematical model for optimal decisions in a representative democracy"
    - "the conference paper assignment problem using order weighted averages to assign indivisible goods"
    - "binary voting with delegable proxy an analysis of liquid democracy"
    - "what do we elect committees for a voting committee model for multi winner rules"
    - "finding a collective set of items from proportional multirepresentation to group recommendation"
    - "justified representation in approval based committee voting"

Connected through hyperedge HE-3 (induced by source paper "the convergence of iterative delegations in liquid democracy"):
  with members:
    - "on rational delegations in liquid democracy"
    - "binary voting with delegable proxy an analysis of liquid democracy"
    - "plurality voting under uncertainty"
    - "new results on equilibria in strategic candidacy"
    - "on the computation of fully proportional representation"

Connected through hyperedge HE-4 (induced by source paper "on rational delegations in liquid democracy"):
  with members:
    - "the fluid mechanics of liquid democracy"
    - "binary voting with delegable proxy an analysis of liquid democracy"
    - "voting behaviour and power in online democracy a study of liquidfeedback in germany s pirate party"

Connected through hyperedge HE-5 (induced by source paper "a mathematical model for optimal decisions in a representative democracy"):
  with members:
    - "what do we elect committees for a voting committee model for multi winner rules"
    - "a maximum likelihood approach for selecting sets of alternatives"
    - "common voting rules as maximum likelihood estimators"

Connected through hyperedge HE-6 (induced by source paper "efficient crowdsourcing via proxy voting"):
  with members:
    - "a survey on truth discovery"
    - "double or nothing multiplicative incentive mechanisms for crowdsourcing"

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)