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 "analyzing resilience of interest based social networks against node and link failures"):
  Abstract: In typical online social networks, users are linked by symmetric friend relations and can define circles of friends based on shared interests. In this paper, we look at social networks where users form links subject to both friendships and shared interests. Our goal is to understand resilience of these networks in terms of connectivity when both nodes and links are allowed to fail. We derive a zero-one law as well as the asymptotically exact probability result for connectivity under both node and link failures. The results answer the question of how to set the network parameters such that reliable message dissemination can be achieved. We formally prove the results and confirm the results via experiments as well.

Includes members:
  Member "k connectivity in random key graphs with unreliable links":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the strength of connectivity of inhomogeneous random k out graphs")
  Member "on resilience and connectivity of secure wireless sensor networks under node capture attacks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "kpsec secure end to end communications for multi hop wireless networks")
  Member "topological properties of secure wireless sensor networks under the q composite key predistribution scheme with unreliable links":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "kpsec secure end to end communications for multi hop wireless networks")
  Member "on connectivity and robustness in random intersection graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "determining r and r s robustness of digraphs using mixed integer linear programming")
  Member "on topological properties of wireless sensor networks under the q composite key predistribution scheme with on off channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure communication in dynamic wireless ad hoc networks")
  Member "performance of the eschenauer gligor key distribution scheme under an on off channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "k connectivity in random key graphs with unreliable links")
  Member "component evolution in general random intersection graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "k connectivity of random graphs and random geometric graphs in node fault model")

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.SI(Social and Information Networks)