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 "signed network structural analysis and applications with a focus on balance theory"):
  Abstract: We analyse signed networks from the perspective of balance theory which predicts structural balance as a global structure for signed social networks that represent groups of friends and enemies. The scarcity of balanced networks encouraged us to define the notion of partial balance in order to quantify the extent to which a network is balanced. We evaluate several numerical measures of partial balance and recommend using the frustration index, a measure that satisfies key axiomatic properties and allows us to analyse graphs based on their levels of partial balance. The exact algorithms used in the literature to compute the frustration index, also called the line index of balance, are not scalable and cannot process graphs with a few hundred edges. We formulate computing the frustration index as a graph optimisation problem to find the minimum number of edges whose removal results in a balanced network given binary decision variables associated with graph nodes and edges. We use our first optimisation model to analyse graphs with up to 3000 edges. Reformulating the optimisation problem, we develop three more efficient binary linear programming models. Equipping the models with valid inequalities and prioritised branching as speed-up techniques allows us to process graphs with 15000 edges on inexpensive hardware. Besides making exact computations possible for large graphs, we show that our models outperform heuristics and approximation algorithms suggested in the literature by orders of magnitude. We extend the concepts of balance and frustration in signed networks to applications beyond the classic friend-enemy interpretation of balance theory in social context. Using a high-performance computer, we analyse graphs with up to 100000 edges to investigate a range of applications from biology and chemistry to finance, international relations, and physics.

Includes members:
  Member "balance and frustration in signed networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "detecting coalitions by optimally partitioning signed networks of political collaboration")
  Member "measuring partial balance in signed networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "detecting coalitions by optimally partitioning signed networks of political collaboration")
  Member "computing the line index of balance using integer programming optimisation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "detecting coalitions by optimally partitioning signed networks of political collaboration")
  Member "evaluating balance on social networks from their simple cycles":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "balance and frustration in signed networks")
  Member "spectral theory of unsigned and signed graphs applications to graph clustering a survey":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "spectral clustering of signed graphs via matrix power means")
  Member "a general purpose algorithm for counting simple cycles and simple paths of any length":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "balance and frustration in signed networks")
  Member "an exact method for computing the frustration index in signed networks using binary programming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "detecting coalitions by optimally partitioning signed networks of political collaboration")
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed 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)