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: "achievable and crystallized rate regions of the interference channel with interference as noise"
  Abstract: The interference channel achievable rate region is presented when the interference is treated as noise. The formulation starts with the 2-user channel, and then extends the results to the n-user case. The rate region is found to be the convex hull of the union of n power control rate regions, where each power control rate region is upperbounded by a (n-1)-dimensional hyper-surface characterized by having one of the transmitters transmitting at full power. The convex hull operation lends itself to a time-sharing operation depending on the convexity behavior of those hyper-surfaces. In order to know when to use time-sharing rather than power control, the paper studies the hyper-surfaces convexity behavior in details for the 2-user channel with specific results pertaining to the symmetric channel. It is observed that most of the achievable rate region can be covered by using simple On/Off binary power control in conjunction with time-sharing. The binary power control creates several corner points in the n-dimensional space. The crystallized rate region, named after its resulting crystal shape, is hence presented as the time-sharing convex hull imposed onto those corner points; thereby offering a viable new perspective of looking at the achievable rate region of the interference channel.

Connected through hyperedge HE-1 (induced by source paper "treating interference as noise in cellular networks a stochastic geometry approach"):
  with members:
    - "system level modeling and optimization of the energy efficiency in cellular networks a stochastic geometry framework"
    - "downlink and uplink decoupling in two tier heterogeneous networks with multi antenna base stations"
    - "backscatter communications for the internet of things a stochastic geometry approach"
    - "enhanced cellular coverage and throughput using rateless codes"
    - "analytical modeling of interference aware power control for the uplink of heterogeneous cellular networks"
    - "stochastic geometry modeling and analysis of multi tier millimeter wave cellular networks"
    - "optimality of treating interference as noise a combinatorial perspective"
    - "coverage and rate analysis for millimeter wave cellular networks"

Connected through hyperedge HE-2 (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"
    - "opportunistic treating interference as noise"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "on the optimality of treating interference as noise for interfering multiple access channels"):
  with members:
    - "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"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-4 (induced by source paper "sub optimality of treating interference as noise in the cellular uplink with weak interference"):
  with members:
    - "on the optimality of treating interference as noise general message sets"
    - "extended generalized dof optimality regime of treating interference as noise in the x channel"
    - "on the optimality of treating interference as noise"
    - "the deterministic sum capacity of a multiple access channel interfering with a point to point link"
    - "interference alignment and neutralization in a cognitive 3 user mac interference channel degrees of freedom"
    - "sub optimality of treating interference as noise in the cellular uplink"
    - "rate region frontiers for n user interference channel with interference as noise"
    - "on the capacity of the 2 user gaussian mac interfering with a p2p link"

Connected through hyperedge HE-5 (induced by source paper "on the optimality of treating interference as noise compound interference networks"):
  with members:
    - "on the optimality of treating interference as noise a combinatorial optimization perspective"
    - "on the optimality of treating interference as noise general message sets"
    - "on the optimality of treating interference as noise"
    - "index coding an interference alignment perspective"
    - "wireless network information flow a deterministic approach"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "on the degrees of freedom of the compound mimo broadcast channels with finite states"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"

Connected through hyperedge HE-6 (induced by source paper "on the optimality of treating interference as noise"):
  with members:
    - "on the capacity of the k user cyclic gaussian interference channel"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-7 (induced by source paper "robust beamforming in interference channels with imperfect transmitter channel information"):
  with members:
    - "distributed robust multicell coordinated beamforming with imperfect csi an admm approach"
    - "pareto characterization of the multicell mimo performance region with simple receivers"
    - "robust monotonic optimization framework for multicell miso systems"
    - "robust linear precoder design for multi cell downlink transmission"
    - "optimal beamforming in interference networks with perfect local channel information"
    - "cooperative interference management with miso beamforming"
    - "mimo broadcast channels with finite rate feedback"

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)