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 "trusses and trapezes easily interpreted communities in social networks"):
  Abstract: The truss, a relaxation of the clique based on triangles, serves to identify clusters of actors in a way that is easy to interpret and is computationally attractive. This paper introduces the 4-cycle-based relative to the truss, called the trapeze, presents a weighted extension of both the truss and trapeze, and offers the refinements of strong trusses and trapezes and summit trusses and trapezes. Use of trapezes permits the application to bipartite graphs, while the weighted versions permit variation of support due to natural edge weights without increasing computational complexity. Finally, strong and summit versions make for easy determination of communities across graphs of varying density. Each of these structures offers guaranteed computation in polynomial time, is motivated by a natural observation of social cohesion, and is related nicely to other standard structures.

Includes members:
  Member "why do simple algorithms for triangle enumeration work in the real world":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parallel clique counting and peeling algorithms")
  Member "truss decomposition in massive networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient bitruss decomposition for large scale bipartite graphs")

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)