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 "capacity of a class of linear binary field multi source relay networks"):
  Abstract: Characterizing the capacity region of multi-source wireless relay networks is one of the fundamental issues in network information theory. The problem is, however, quite challenging due to inter-user interference when there exist multiple source--destination (S--D) pairs in the network. By focusing on a special class of networks, we show that the capacity can be found. Namely, we study a layered linear binary field network with time-varying channels, which is a simplified model reflecting broadcast, interference, and fading natures of wireless communications. We observe that fading can play an important role in mitigating inter-user interference effectively for both single-hop and multi-hop networks. We propose new encoding and relaying schemes with randomized channel pairing, which exploit such channel variations, and derive their achievable rates. By comparing them with the cut-set upper bound, the capacity region of single-hop networks and the sum capacity of multi-hop networks can be characterized for some classes of channel distributions and network topologies. For these classes, we show that the capacity region or sum capacity can be interpreted as the max-flow min-cut theorem.

Includes members:
  Member "the approximate capacity of the many to one and one to many gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "deterministic relay networks with state information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on min cut algorithms for half duplex relay networks")
  Member "ergodic interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the interference channel revisited aligning interference by adjusting receive antenna separation")
  Member "on models of multi user gaussian channels with fading":
    also connected through other hyperedges:
      (none)
  Member "approximate capacity of the two way relay channel a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "state space adaptive nonlinear self interference cancellation for full duplex communication")
  Member "multiple access outerbounds and the inseparability of parallel interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "ergodic fading interference channels sum capacity and separability")
  Member "the two user gaussian interference channel a deterministic view":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "dof region of the decentralized mimo broadcast channel unicode x2014 how many informed antennas do we need")
  Member "approximate capacity of gaussian relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "multihop backhaul compression for the uplink of cloud radio access 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)