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 "cut set bounds on network information flow"):
  Abstract: Explicit characterization of the capacity region of communication networks is a long-standing problem. While it is known that network coding can outperform routing and replication, the set of feasible rates is not known in general. Characterizing the network coding capacity region requires the determination of the set of all entropic vectors. Furthermore, computing the explicitly known linear programming bound is infeasible in practice due to an exponential growth in complexity as a function of network size. This paper focuses on the fundamental problems of characterization and computation of outer bounds for multi-source multi-sink networks. Starting from the known local functional dependence induced by the communication network, we introduce the notion of irreducible sets, which characterize implied functional dependence. We provide recursions for the computation of all maximal irreducible sets. These sets act as information-theoretic bottlenecks, and provide an easily computable outer bound for networks with correlated sources. We extend the notion of irreducible sets (and resulting outer bound) for networks with independent sources. We compare our bounds with existing bounds in the literature. We find that our new bounds are the best among the known graph theoretic bounds for networks with correlated sources and for networks with independent sources.

Includes members:
  Member "beyond the cut set bound uncertainty computations in network coding with correlated sources":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the capacity of computation broadcast")
  Member "beyond the cut set bound uncertainty computations in network coding with correlated sources":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the capacity of computation broadcast")
  Member "network coding capacity a functional dependence bound":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a minimal set of shannon type inequalities for functional dependence structures")
  Member "the minimal set of ingleton inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "entropy functions and determinant inequalities")
  Member "dualities between entropy functions and network codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a local perspective on the edge removal problem")
  Member "network information flow with correlated sources":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity bounds for networks with correlated sources and characterisation of distributions by entropies")

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)