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 "rank matching for multihop multiflow"):
  Abstract: We study the degrees of freedom (DoF) of the layered 2 X 2 X 2 MIMO interference channel where each node is equipped with arbitrary number of antennas, the channels between the nodes have arbitrary rank constraints, and subject to the rank-constraints the channel coefficients can take arbitrary values. The DoF outer bounds reveal a fundamental rank-matching phenomenon, reminiscent of impedance matching in circuit theory. It is well known that the maximum power transfer in a circuit is achieved not for the maximum or minimum load impedance but for the load impedance that matches the source impedance. Similarly, the maximum DoF in the rank- constrained 2 X 2 X 2 MIMO interference network is achieved not for the maximum or minimum ranks of the destination hop, but when the ranks of the destination hop match the ranks of the source hop. In fact, for mismatched settings of interest, the outer bounds identify a DoF loss penalty that is precisely equal to the rank-mismatch between the two hops. For symmetric settings, we also provide achievability results to show that along with the min-cut max-flow bounds, the rank-mismatch bounds are the best possible, i.e., they hold for all channels that satisfy the rank-constraints and are tight for almost all channels that satisfy the rank-constraints. Limited extensions - from sum-DoF to DoF region, from 2 unicasts to X message sets, from 2 hops to more than 2 hops and from 2 nodes per layer to more than 2 nodes per layer - are considered to illustrate how the insights generalize beyond the elemental 2 X 2 X 2 channel model.

Includes members:
  Member "topological interference management through index coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective")
  Member "precoding based network alignment for three unicast sessions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "conditional disclosure of secrets a noise and signal alignment approach")
  Member "on interference networks over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "structured mappings and conferencing common information for multiple access channels")
  Member "on the capacity of the finite field counterparts of wireless interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an achievable rate region for the three user interference channel based on coset codes")
  Member "degrees of freedom of two hop wireless networks everyone gets the entire cake":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "opportunistic network decoupling with virtual full duplex operation in multi source interfering relay networks")
  Member "multiple unicast capacity of 2 source 2 sink networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the degrees of freedom of two unicast wireless networks with delayed csit")

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)