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 "complement free couples must communicate a hardness result for two player combinatorial auctions"):
  Abstract: We study the communication complexity of welfare maximization in combinatorial auctions with $m$ items and two subadditive bidders. A $\frac{1}{2}$-approximation can be guaranteed by a trivial randomized protocol with zero communication, or a trivial deterministic protocol with $O(1)$ communication. We show that outperforming these trivial protocols requires exponential communication, settling an open question of [DobzinskiNS10, Feige09]. #R##N#Specifically, we show that any (randomized) protocol guaranteeing a $(\frac{1}{2}+\frac{6}{\log_2 m})$-approximation requires communication exponential in $m$. This is tight even up to lower-order terms: we further present a $(\frac{1}{2}+\frac{1}{O(\log m)})$-approximation in poly($m$) communication. #R##N#To derive our results, we introduce a new class of subadditive functions that are "far from" fractionally subadditive functions, and may be of independent interest for future works. Beyond our main result, we consider the spectrum of valuations between fractionally-subadditive and subadditive via the MPH hierarchy. Finally, we discuss the implications of our results towards combinatorial auctions with strategic bidders.

Includes members:
  Member "combinatorial auctions do need modest interaction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "welfare maximization with limited interaction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")
  Member "inapproximability of truthful mechanisms via generalizations of the vc dimension":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "a unifying hierarchy of valuations with complements and substitutes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "beyond submodular maximization")
  Member "the computational complexity of truthfulness in combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")
  Member "information equals amortized communication":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "communication for generating correlation a unifying survey")
  Member "an impossibility result for truthful combinatorial auctions with submodular valuations":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "improved truthful mechanisms for combinatorial auctions with submodular bidders")

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)