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 "on selfish creation of robust networks"):
  Abstract: Robustness is one of the key properties of nowadays networks. However, robustness cannot be simply enforced by design or regulation since many important networks, most prominently the Internet, are not created and controlled by a central authority. Instead, Internet-like networks emerge from strategic decisions of many selfish agents. Interestingly, although lacking a coordinating authority, such naturally grown networks are surprisingly robust while at the same time having desirable properties like a small diameter. #R##N#To investigate this phenomenon we present the first simple model for selfish network creation which explicitly incorporates agents striving for a central position in the network while at the same time protecting themselves against random edge-failure. We show that networks in our model are diverse and we prove the versatility of our model by adapting various properties and techniques from the non-robust versions which we then use for establishing bounds on the Price of Anarchy. Moreover, we analyze the computational hardness of finding best possible strategies and investigate the game dynamics of our model.

Includes members:
  Member "strategic network formation with attack and immunization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "geometric network creation games")
  Member "a bounded budget network creation game":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the price of anarchy for high price links")
  Member "network formation games with heterogeneous players and the internet structure":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "geometric network creation games")
  Member "formation games of reliable networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "geometric network creation games")
  Member "the price of anarchy in bilateral network formation in an adversary model":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient best response computation for strategic network formation under attack")
  Member "on dynamics in selfish network creation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the efficiency of best response dynamics")
  Member "the price of anarchy for network formation in an adversary model":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "geometric network creation games")
  Member "greedy selfish network creation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "geometric network creation games")

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)