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 "optimization based linear network coding for general connections of continuous flows"):
  Abstract: For general connections, the problem of finding network codes and optimizing resources for those codes is intrinsically difficult and little is known about its complexity. Most of the existing solutions rely on very restricted classes of network codes in terms of the number of flows allowed to be coded together, and are not entirely distributed. In this paper, we consider a new method for constructing linear network codes for general connections of continuous flows to minimize the total cost of edge use based on mixing. We first formulate the minimumcost network coding design problem. To solve the optimization problem, we propose two equivalent alternative formulations with discrete mixing and continuous mixing, respectively, and develop distributed algorithms to solve them. Our approach allows fairly general coding across flows and guarantees no greater cost than any solution without network coding.

Includes members:
  Member "a linear network code construction for general integer connections based on the constraint satisfaction problem":
    also connected through other hyperedges:
      (none)
  Member "on multi source networks enumeration rate region computation and hierarchy":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "constrained linear representability of polymatroids and algorithms for computing achievability proofs in network coding")
  Member "the two unicast problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity and achievable rate regions for linear network coding over ring alphabets")
  Member "decentralized constraint satisfaction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on a decentralized delta 1 graph coloring algorithm")
  Member "index coding an interference alignment perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "scalar linear solvability of matroidal networks associated with representable matroids":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multicast networks solvable over every finite field")
  Member "optimal reverse carpooling over wireless networks a distributed optimization approach":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "delay aware wireless network coding in adversarial traffic")
  Member "on the index coding problem and its relation to network coding and matroid theory":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "efficient 3d road map data exchange for intelligent vehicles in vehicular fog networks")

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)