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 "two way networks when adaptation is useless"):
  Abstract: In two-way networks, nodes act as both sources and destinations of messages. This allows for "adaptation" at or "interaction" between the nodes - a node's channel inputs may be functions of its message(s) and previously received signals. How to best adapt is key to two-way communication, rendering it challenging. However, examples exist of point-to-point channels where adaptation is not beneficial from a capacity perspective. We ask whether analogous examples exist for multi-user two-way networks. #R##N#We first consider deterministic two-way channel models: the binary modulo-2 addition channel and a generalization thereof, and the linear deterministic channel. For these deterministic models we obtain the capacity region for the two-way multiple access/broadcast channel, the two-way Z channel and the two-way interference channel (IC). In all cases we permit all nodes to adapt channel inputs to past outputs (except for portions of the linear deterministic two-way IC where we only permit 2 of the 4 nodes to fully adapt). However, we show that this adaptation is useless from a capacity region perspective and capacity is achieved by strategies where the channel inputs at each use do not adapt to previous inputs. Finally, we consider the Gaussian two-way IC, and show that partial adaptation is useless when the interference is very strong. In the strong and weak interference regimes, we show that the non-adaptive Han and Kobayashi scheme utilized in parallel in both directions achieves to within a constant gap for the symmetric rate of the fully (some regimes) or partially (remaining regimes) adaptive models. #R##N#The central technical contribution is the derivation of new, computable outer bounds which allow for adaptation. Inner bounds follow from non-adaptive achievability schemes of the corresponding one-way channel models.

Includes members:
  Member "two way interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "two way function computation")
  Member "on constant gaps for the two way gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "degrees of freedom of the mimo three way channel with node intermittency")
  Member "wireless network information flow a deterministic approach":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "best relay selection in gaussian half duplex diamond networks")
  Member "interference channels with rate limited feedback":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity results for intermittent x channels with delayed channel state feedback")
  Member "feedback capacity of the gaussian interference channel to within 2 bits":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "capacity limits of full duplex cellular network")
  Member "on channel output feedback in deterministic interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "two way interference channel capacity how to have the cake and eat it too")
  Member "the two user gaussian interference channel a deterministic view":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "dof region of the decentralized mimo broadcast channel unicode x2014 how many informed antennas do we need")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)