human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a mathematical model for optimal decisions in a representative democracy"):
  Abstract: Direct democracy is a special case of an ensemble of classifiers, where every person (classifier) votes on every issue. This fails when the average voter competence (classifier accuracy) falls below 50%, which can happen in noisy settings where voters have only limited information, or when there are multiple topics and the average voter competence may not be high enough for some topics. Representative democracy, where voters choose representatives to vote, can be an elixir in both these situations. Representative democracy is a specific way to improve the ensemble of classifiers. We introduce a mathematical model for studying representative democracy, in particular understanding the parameters of a representative democracy that gives maximum decision making capability. Our main result states that under general and natural conditions, #R##N#1. Representative democracy can make the correct decisions simultaneously for multiple noisy issues. #R##N#2. When the cost of voting is fixed, the optimal representative democracy requires that representatives are elected from constant sized groups: the number of representatives should be linear in the number of voters. #R##N#3. When the cost and benefit of voting are both polynomial, the optimal group size is close to linear in the number of voters. This work sets the mathematical foundation for studying the quality-quantity tradeoff in a representative democracy-type ensemble (fewer highly qualified representatives versus more less qualified representatives).

Includes members:
  Member "proxy voting for better outcomes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sybil resilient social choice with partial participation")
  Member "what do we elect committees for a voting committee model for multi winner rules":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a quantitative analysis of multi winner rules")
  Member "a maximum likelihood approach for selecting sets of alternatives":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "evaluating approval based multiwinner voting in terms of robustness to noise")
  Member "common voting rules as maximum likelihood estimators":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "evaluating approval based multiwinner voting in terms of robustness to noise")

Question: Please tell me which class the source paper 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)