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: "the deterministic sum capacity of a multiple access channel interfering with a point to point link"
  Abstract: In this paper, we use the linear deterministic approximation model to study a two user multiple access channel mutually interfering with a point to point link, which represents a basic setup of a cellular system. We derive outer bounds on the achievable sum rate and construct coding schemes achieving the outer bounds. For a large parameter range, the sum capacity is identical to the sum capacity of the interference channel obtained by silencing the weaker user in the multiple access channel. For other interference configurations, the sum rate can be increased using interference alignment, which exploits the channel gain difference of the users in the multiple access channel. From these results, lower bounds on the generalized degrees of freedom for the Gaussian counterpart are derived.

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"
    - "extended generalized dof optimality regime of treating interference as noise in the x channel"
    - "on the optimality of treating interference as noise"
    - "achievable and crystallized rate regions of the interference channel with interference as noise"
    - "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)