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: "extended generalized dof optimality regime of treating interference as noise in the x channel"
  Abstract: The simple scheme of treating interference as noise (TIN) is studied in this paper for the 3 x 2 X channel. A new sum-capacity upper bound is derived. This upper bound is transformed into a generalized degrees-of-freedom (GDoF) upper bound, and is shown to coincide with the achievable GDoF of scheme that combines TDMA and TIN for some conditions on the channel parameters. These conditions specify a noisy interference regime which extends noisy interference regimes available in literature. As a by-product, the sum-capacity of the 3 x 2 X channel is characterized within a constant gap in the given noisy interference regime.

Connected through hyperedge HE-1 (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"
    - "on the optimality of treating interference as noise"
    - "achievable and crystallized rate regions of the interference channel with 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"

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)