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 "exploration of synergistic and redundant information sharing in static and dynamical gaussian systems"):
  Abstract: To fully characterize the information that two source variables carry about a third target variable, one must decompose the total information into redundant, unique, and synergistic components, i.e., obtain a partial information decomposition (PID). However, Shannon's theory of information does not provide formulas to fully determine these quantities. Several recent studies have begun addressing this. Some possible definitions for PID quantities have been proposed and some analyses have been carried out on systems composed of discrete variables. Here we present an in-depth analysis of PIDs on Gaussian systems, both static and dynamical. We show that, for a broad class of Gaussian systems, previously proposed PID formulas imply that (i) redundancy reduces to the minimum information provided by either source variable and hence is independent of correlation between sources, and (ii) synergy is the extra information contributed by the weaker source when the stronger source is known and can either increase or decrease with correlation between sources. We find that Gaussian systems frequently exhibit net synergy, i.e., the information carried jointly by both sources is greater than the sum of information carried by each source individually. Drawing from several explicit examples, we discuss the implications of these findings for measures of information transfer and information-based measures of complexity, both generally and within a neuroscience setting. Importantly, by providing independent formulas for synergy and redundancy applicable to continuous time-series data, we provide an approach to characterizing and quantifying information sharing amongst complex system variables.

Includes members:
  Member "quantifying unique information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an operational information decomposition via synergistic disclosure")
  Member "quantifying synergistic mutual information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an operational information decomposition via synergistic disclosure")
  Member "a principled infotheoretic phi like measure":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "is consciousness computable quantifying integrated information using algorithmic information theory")
  Member "intersection information based on common randomness":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an operational information decomposition via synergistic disclosure")
  Member "bivariate measure of redundant information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "a differentiable measure of pointwise shared information")
  Member "nonnegative decomposition of multivariate information":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an operational information decomposition via synergistic disclosure")

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)