human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "opportunistic treating interference as noise"
  Abstract: We consider a $K$-user interference network with $M$ states, where each transmitter has $M$ messages and over State $m$, Receiver $k$ wishes to decode the first $\pi_k(m) \in \{1,2,\cdots,M\}$ messages from its desired transmitter. This problem of channel with states models opportunistic communications, where more messages are sent for better channel states. The first message from each transmitter has the highest priority as it is required to be decoded regardless of the state of the receiver; the second message is opportunistically decoded if the state allows a receiver to decode 2 messages; and the $M$-th message has the lowest priority as it is decoded if and only if the receiver wishes to decode all $M$ messages. For this interference network with states, we show that if any possible combination of the channel states satisfies a condition under which power control and treating interference as noise (TIN) are sufficient to achieve the entire generalized degrees of freedom (GDoF) region of this channel state by itself, then a simple layered superposition encoding scheme with power control and a successive decoding scheme with TIN achieves the entire GDoF region of the network with $M$ states for all $KM$ messages.

Connected through hyperedge HE-1 (induced by source paper "optimality of treating inter cell interference as noise under finite precision csit"):
  with members:
    - "on the optimality of treating inter cell interference as noise downlink cellular networks and uplink downlink duality"
    - "towards an extremal network theory robust gdof gain of transmitter cooperation over tin"
    - "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective"
    - "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit"
    - "on the optimality of treating interference as noise for interfering multiple access channels"
    - "on the optimality of treating inter cell interference as noise in uplink cellular networks"
    - "generalized degrees of freedom of the symmetric k user interference channel under finite precision csit"
    - "optimality of treating interference as noise a combinatorial perspective"

Connected through hyperedge HE-2 (induced by source paper "towards an extremal network theory robust gdof gain of transmitter cooperation over tin"):
  with members:
    - "on multi cell uplink downlink duality with treating inter cell interference as noise"
    - "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit"
    - "on the optimality of treating inter cell interference as noise in uplink cellular networks"
    - "k user symmetric m times n mimo interference channel under finite precision csit a gdof perspective"
    - "aligned image sets and the generalized degrees of freedom of symmetric mimo interference channel with partial csit"
    - "network coherence time matters aligned image sets and the degrees of freedom of interference networks with finite precision csit and perfect csir"
    - "elevated multiplexing and signal space partitioning in the 2 user mimo ic with partial csit"
    - "rate splitting for mimo wireless networks a promising phy layer strategy for lte evolution"

Connected through hyperedge HE-3 (induced by source paper "on the optimality of treating inter cell interference as noise downlink cellular networks and uplink downlink duality"):
  with members:
    - "towards an extremal network theory robust gdof gain of transmitter cooperation over tin"
    - "on the optimality of treating interference as noise for interfering multiple access channels"
    - "on the optimality of treating inter cell interference as noise in uplink cellular networks"
    - "optimality of treating interference as noise a combinatorial perspective"
    - "on the optimality of treating interference as noise compound interference networks"
    - "on the optimality of treating interference as noise general message sets"
    - "on the optimality of treating interference as noise for k user parallel gaussian interference networks"
    - "wireless network information flow a deterministic approach"

Connected through hyperedge HE-4 (induced by source paper "on multi cell uplink downlink duality with treating inter cell interference as noise"):
  with members:
    - "on the optimality of treating inter cell interference as noise in uplink cellular networks"
    - "optimality of treating interference as noise a combinatorial perspective"
    - "on the optimality of treating interference as noise compound interference networks"
    - "on the optimality of treating interference as noise general message sets"
    - "on the optimality of treating interference as noise for k user parallel gaussian interference networks"
    - "downlink interference alignment"

Connected through hyperedge HE-5 (induced by source paper "on the optimality of treating inter cell interference as noise in uplink cellular networks"):
  with members:
    - "on multi cell uplink downlink duality with treating inter cell interference as noise"
    - "on the optimality of treating interference as noise for interfering multiple access channels"
    - "interference as noise friend or foe"
    - "optimality of treating interference as noise a combinatorial perspective"
    - "on the optimality of treating interference as noise compound interference networks"
    - "on the optimality of treating interference as noise general message sets"
    - "on the optimality of treating interference as noise for k user parallel gaussian interference networks"
    - "achievable and crystallized rate regions of the interference channel with interference as noise"

Question: Please tell me which class the center node 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)