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 "improved truthful mechanisms for combinatorial auctions with submodular bidders"):
  Abstract: A longstanding open problem in Algorithmic Mechanism Design is to design computationally-efficient truthful mechanisms for (approximately) maximizing welfare in combinatorial auctions with submodular bidders. The first such mechanism was obtained by Dobzinski, Nisan, and Schapira [STOC'06] who gave an $O(\log^2{m})$-approximation where $m$ is the number of items. This problem has been studied extensively since, culminating in an $O(\sqrt{\log{m}})$-approximation mechanism by Dobzinski [STOC'16]. #R##N#We present a computationally-efficient truthful mechanism with approximation ratio that improves upon the state-of-the-art by an exponential factor. In particular, our mechanism achieves an $O((\log\log{m})^3)$-approximation in expectation, uses only $O(n)$ demand queries, and has universal truthfulness guarantee. This settles an open question of Dobzinski on whether $\Theta(\sqrt{\log{m}})$ is the best approximation ratio in this setting in negative.

Includes members:
  Member "complement free couples must communicate a hardness result for two player combinatorial auctions":
    also connected through other hyperedges:
      (none)
  Member "beyond 1 2 approximation for submodular maximization on massive data streams":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "regularized submodular maximization at scale")
  Member "prophet secretary for combinatorial auctions and matroids":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "on simultaneous two player combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")
  Member "combinatorial auctions do need modest interaction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")
  Member "breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the nisan ronen conjecture for submodular valuations")
  Member "computational efficiency requires simple taxation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "implementation in advised strategies welfare guarantees from posted price mechanisms when demand queries are np hard")
  Member "online matroid intersection beating half for random arrival":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "robust algorithms for the secretary problem")

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)