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: "the single crossing property on a tree"
  Abstract: AbstractWe generalize the classical single-crossing property to single-crossingproperty on trees and obtain new ways to construct Condorcet domainswhich are sets of linear orders which possess the property that everyproﬁle composed from those orders have transitive majority relation. Weprove that for any tree there exist proﬁles that are single-crossing on thattree; moreover, that tree is minimal in this respect for at least one suchproﬁle. Finally, we provide a polynomial-time algorithm to recognizewhether or not a given proﬁle is single-crossing with respect to sometree. We also show that ﬁnding winners for Chamberlin-Courant rule ispolynomial for proﬁles that are single-crossing on trees. 1 Introduction Condorcet’s famous paradox demonstrates that pairwise majority voting may produceintransitive collective preferences. The question whether, and if so, how, this problem canbe overcome by means of restrictions on the domain of admissible individual preferenceshas attracted constant interest over the recent decades, see Gaertner (2001) for a detailedoverview. Probably the best-known of these is single-peakedness Black (1948) which isfrequently employed in models of political economy. It stipulates that all alternativescan be arranged along one dimension, for instance according to the political left-rightspectrum. The concept of single-peakedness itself can be generalized considerably, how-ever, the suﬃciency of single-peakedness for transitivity of the (strict) majority relationis conﬁned to the classical one-dimensional case.

Connected through hyperedge HE-1 (induced by source paper "recognizing and eliciting weakly single crossing profiles on trees"):
  with members:
    - "computational aspects of nearly single peaked electorates"
    - "elicitation for preferences single peaked on trees"
    - "preference elicitation for single crossing domain"
    - "structure in dichotomous preferences"
    - "on the computation of fully proportional representation"
    - "the complexity of fully proportional representation for single crossing electorates"
    - "the complexity of manipulative attacks in nearly single peaked electorates"
    - "eliciting single peaked preferences using comparison queries"

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)