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 "understanding interdependency through complex information sharing"):
  Abstract: The interactions between three or more random variables are often nontrivial, poorly understood and, yet, are paramount for future advances in fields such as network information theory, neuroscience and genetics. In this work, we analyze these interactions as different modes of information sharing. Towards this end, and in contrast to most of the literature that focuses on analyzing the mutual information, we introduce an axiomatic framework for decomposing the joint entropy that characterizes the various ways in which random variables can share information. Our framework distinguishes between interdependencies where the information is shared redundantly and synergistic interdependencies where the sharing structure exists in the whole, but not between the parts. The key contribution of our approach is to focus on symmetric properties of this sharing, which do not depend on a specific point of view for differentiating roles between its components. We show that our axioms determine unique formulas for all of the terms of the proposed decomposition for systems of three variables in several cases of interest. Moreover, we show how these results can be applied to several network information theory problems, providing a more intuitive understanding of their fundamental limits.

Includes members:
  Member "exploration of synergistic and redundant information sharing in static and dynamical gaussian systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an operational information decomposition via synergistic disclosure")
  Member "justification of logarithmic loss via the benefit of side information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")
  Member "quantifying unique information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an operational information decomposition via synergistic disclosure")
  Member "quantifying synergistic mutual information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an operational information decomposition via synergistic disclosure")
  Member "intersection information based on common randomness":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an operational information decomposition via synergistic disclosure")
  Member "bivariate measure of redundant information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an operational information decomposition via synergistic disclosure")
  Member "shared information new insights and problems in decomposing information in complex systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a differentiable measure of pointwise shared information")
  Member "anatomy of a bit information in a time series observation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "quantifying high order interdependencies via multivariate extensions of the mutual information")

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.IT(Information Theory)