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 "conferencing in wyner s asymmetric interference network effect of number of rounds"):
  Abstract: Our goal is to study the effect of the number of conferencing rounds on the capacity of large interference networks. We do this at hand of the per-user multiplexing gain (MG) of Wyner's soft-handoff model with dedicated conferencing links between neighbouring transmitters and receivers. We present upper and lower bounds on the per-user MG of this network, which depend on the capacities of the transmitter- and receiver-conferencing links and on the number of allowed conferencing rounds. The bounds are tight when: the prelogs of the conferencing links are small or high; there is only transmitter conferencing or only receiver conferencing; or some symmetry conditions between transmitter-conferencing and receiver-conferencing hold. We also determine the per-user MG of the network when the number of conferencing rounds is unlimited. Our results show that for small conferencing prelogs around 1/6, a single conferencing round suffices to attain the maximum per-user MG when the number of conferencing rounds is unconstrained. In contrast, when the prelogs are large, then every additional conferencing round increases the maximum per-user MG.

Includes members:
  Member "cognitive wyner networks with clustered decoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of dynamic interference management with flexible message assignments")
  Member "cellular interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "degrees of freedom of cache aided wireless cellular networks")
  Member "interference mitigation through limited transmitter cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exploiting computation replication for mobile edge computing a fundamental computation communication tradeoff study")
  Member "interference mitigation through limited receiver cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "how much can d2d communication reduce content delivery latency in fog networks with edge caching")
  Member "on cognitive interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "degrees of freedom of interference networks with transmitter side caches")
  Member "broadcast channels with cooperating decoders":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the capacity on degraded relay broadcast channel")

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)