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: "on voting and facility location"
  Abstract: We study mechanisms for candidate selection that seek to minimize the social cost, where voters and candidates are associated with points in some underlying metric space. The social cost of a candidate is the sum of its distances to each voter. Some of our work assumes that these points can be modeled on a real line, but other results of ours are more general. #R##N#A question closely related to candidate selection is that of minimizing the sum of distances for facility location. The difference is that in our setting there is a fixed set of candidates, whereas the large body of work on facility location seems to consider every point in the metric space to be a possible candidate. This gives rise to three types of mechanisms which differ in the granularity of their input space (voting, ranking and location mechanisms). We study the relationships between these three classes of mechanisms. #R##N#While it may seem that Black's 1948 median algorithm is optimal for candidate selection on the line, this is not the case. We give matching upper and lower bounds for a variety of settings. In particular, when candidates and voters are on the line, our universally truthful spike mechanism gives a [tight] approximation of two. When assessing candidate selection mechanisms, we seek several desirable properties: (a) efficiency (minimizing the social cost) (b) truthfulness (dominant strategy incentive compatibility) and (c) simplicity (a smaller input space). We quantify the effect that truthfulness and simplicity impose on the efficiency.

Connected through hyperedge HE-1 (induced by source paper "selecting voting locations for fun and profit"):
  with members:
    - "a partisan districting protocol with provably nonpartisan outcomes"
    - "network based vertex dissolution"
    - "more natural models of electoral control by partition"
    - "combinatorial voter control in elections"
    - "weighted electoral control"
    - "how hard is bribery in elections"
    - "anyone but him the complexity of precluding an alternative"

Connected through hyperedge HE-2 (induced by source paper "peeking behind the ordinal curtain improving distortion via cardinal queries"):
  with members:
    - "improved metric distortion for deterministic social choice rules"
    - "the distortion of distributed voting"
    - "awareness of voter passion greatly improves the distortion of metric social choice"
    - "approval based elections and distortion of voting rules"
    - "an analysis framework for metric voting based on lp duality"
    - "on the distortion value of the elections with abstention"
    - "random dictators with a random referee constant sample complexity mechanisms for social choice"
    - "ordinal approximation for social choice matching and facility location problems given candidate positions"

Connected through hyperedge HE-3 (induced by source paper "communication distortion and randomness in metric voting"):
  with members:
    - "comparing election methods where each voter ranks only few candidates"
    - "improved metric distortion for deterministic social choice rules"
    - "approval based elections and distortion of voting rules"
    - "an analysis framework for metric voting based on lp duality"
    - "random dictators with a random referee constant sample complexity mechanisms for social choice"
    - "of the people voting is more effective with representative candidates"
    - "on the distortion of voting with multiple representative candidates"
    - "combinatorial auctions do need modest interaction"

Connected through hyperedge HE-4 (induced by source paper "awareness of voter passion greatly improves the distortion of metric social choice"):
  with members:
    - "improved metric distortion for deterministic social choice rules"
    - "the distortion of distributed voting"
    - "manipulating elections by selecting issues"
    - "peeking behind the ordinal curtain improving distortion via cardinal queries"
    - "approval based elections and distortion of voting rules"
    - "on the distortion value of the elections with abstention"
    - "random dictators with a random referee constant sample complexity mechanisms for social choice"
    - "ordinal approximation for social choice matching and facility location problems given candidate positions"

Connected through hyperedge HE-5 (induced by source paper "the distortion of distributed voting"):
  with members:
    - "improved metric distortion for deterministic social choice rules"
    - "awareness of voter passion greatly improves the distortion of metric social choice"
    - "peeking behind the ordinal curtain improving distortion via cardinal queries"
    - "approval based elections and distortion of voting rules"
    - "relating metric distortion and fairness of social choice rules"
    - "metric distortion of social choice rules lower bounds and fairness properties"
    - "randomized social choice functions under metric preferences"
    - "more natural models of electoral control by partition"

Connected through hyperedge HE-6 (induced by source paper "improved metric distortion for deterministic social choice rules"):
  with members:
    - "ordinal approximation for social choice matching and facility location problems given candidate positions"
    - "relating metric distortion and fairness of social choice rules"
    - "tradeoffs between information and ordinal approximation for bipartite matching"
    - "of the people voting is more effective with representative candidates"
    - "on the distortion of voting with multiple representative candidates"
    - "metric distortion of social choice rules lower bounds and fairness properties"
    - "randomized social choice functions under metric preferences"

Connected through hyperedge HE-7 (induced by source paper "an analysis framework for metric voting based on lp duality"):
  with members:
    - "improved metric distortion for deterministic social choice rules"
    - "communication distortion and randomness in metric voting"
    - "a duality based unified approach to bayesian mechanism design"
    - "of the people voting is more effective with representative candidates"
    - "on the distortion of voting with multiple representative candidates"
    - "metric distortion of social choice rules lower bounds and fairness properties"
    - "randomized social choice functions under metric preferences"

Connected through hyperedge HE-8 (induced by source paper "favorite candidate voting for eliminating the least popular candidate in metric spaces"):
  with members:
    - "what do multiwinner voting rules do an experiment over the two dimensional euclidean domain"
    - "improved metric distortion for deterministic social choice rules"
    - "awareness of voter passion greatly improves the distortion of metric social choice"
    - "ordinal approximation for social choice matching and facility location problems given candidate positions"
    - "metric distortion of social choice rules lower bounds and fairness properties"
    - "randomized social choice functions under metric preferences"

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)