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: "generalizing top trading cycles for housing markets with fractional endowments"
  Abstract: The housing market setting constitutes a fundamental model of exchange economies of goods. In most of the work concerning housing markets, it is assumed that agents own and are allocated discrete houses. The drawback of this assumption is that it does not cater for randomized assignments or allocation of time-shares. Recently, house allocation with fractional endowment of houses was considered by Athanassoglou and Sethuraman (2011) who posed the open problem of generalizing Gale's Top Trading Cycles (TTC) algorithm to the case of housing markets with fractional endowments. In this paper, we address the problem and present a generalization of TTC called FTTC that is polynomial-time as well as core stable and Pareto optimal with respect to stochastic dominance even if there are indifferences in the preferences. We prove that if each agent owns one discrete house, FTTC coincides with a state of the art strategyproof mechanism for housing markets with discrete endowments and weak preferences. #R##N#We show that FTTC satisfies a maximal set of desirable properties by proving two impossibility theorems. Firstly, we prove that with respect to stochastic dominance, core stability and no justified envy are incompatible. Secondly, we prove that there exists no individual rational, Pareto optimal and weak strategyproof mechanism, thereby answering another open problem posed by Athanassoglou and Sethuraman (2011). The second impossibility implies a number of results in the literature.

Connected through hyperedge HE-1 (induced by source paper "on the parameterized complexity of manipulating top trading cycles"):
  with members:
    - "allocating indivisible items in categorized domains"

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)