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 random sampling auctions for digital goods"
  Abstract: In the context of auctions for digital goods, an interesting random sampling auction has been proposed by Goldberg, Hartline, and Wright [2001]. This auction has been analyzed by Feige, Flaxman, Hartline, and Kleinberg [2005], who have shown that it is 15-competitive in the worst case {which is substantially better than the previously proven constant bounds but still far from the conjectured competitive ratio of 4. In this paper, we prove that the aforementioned random sampling auction is indeed 4-competitive for a large class of instances where the number of bids above (or equal to) the optimal sale price is at least 6. We also show that it is 4:68-competitive for the small class of remaining instances thus leaving a negligible gap between the lower and upper bound. We employ a mix of probabilistic techniques and dynamic programming to compute these bounds.

Connected through hyperedge HE-1 (induced by source paper "double auctions in markets for multiple kinds of goods"):
  with members:
    - "approximating gains from trade in two sided markets via simple mechanisms"
    - "polyhedral clinching auctions for two sided markets"
    - "fixed price approximability of the optimal gain from trade"
    - "approximately efficient two sided combinatorial auctions"
    - "the pseudo dimension of near optimal auctions"
    - "prior independent mechanisms for scheduling"
    - "ascending auctions and walrasian equilibrium"
    - "envy freedom and prior free mechanism design"

Connected through hyperedge HE-2 (induced by source paper "profit maximizing prior free multi unit procurement auctions with capacitated sellers"):
  with members:
    - "optimal competitive auctions"
    - "prior free auctions for budgeted agents"
    - "envy freedom and prior free mechanism design"
    - "on the approximability of budget feasible mechanisms"
    - "budget feasible mechanisms"

Connected through hyperedge HE-3 (induced by source paper "competitive analysis via benchmark decomposition"):
  with members:
    - "optimal competitive auctions"
    - "the biased sampling profit extraction auction"
    - "prior free auctions for budgeted agents"
    - "envy freedom and prior free mechanism design"
    - "competitive auctions for markets with positive externalities"
    - "mechanism design via consensus estimates cross checking and profit extraction"

Connected through hyperedge HE-4 (induced by source paper "optimal competitive auctions"):
  with members:
    - "approximate revenue maximization with multiple items"
    - "competitive auctions for markets with positive externalities"
    - "optimal mechansim design and money burning"

Connected through hyperedge HE-5 (induced by source paper "optimal platform design"):
  with members:
    - "optimal competitive auctions"

Connected through hyperedge HE-6 (induced by source paper "constant competitive prior free auction with ordered bidders"):
  with members:
    - "an algorithmic characterization of multi dimensional mechanisms"
    - "sequential posted pricing and multi parameter mechanism design"
    - "budget constrained auctions with heterogeneous items"
    - "algorithmic pricing via virtual valuations"
    - "optimal mechansim design and money burning"

Connected through hyperedge HE-7 (induced by source paper "envy freedom and prior free mechanism design"):
  with members:
    - "optimal competitive auctions"
    - "prior free auctions for budgeted agents"
    - "mechanism design via consensus estimates cross checking and profit extraction"
    - "optimal mechansim design and money burning"

Connected through hyperedge HE-8 (induced by source paper "near optimal multi unit auctions with ordered bidders"):
  with members:
    - "optimal mechansim design and money burning"

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)