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: "on interference alignment and the deterministic capacity for cellular channels with weak symmetric cross links"
  Abstract: In this paper, we study the uplink of a cellular system using the linear deterministic approximation model, where there are two users transmitting to a receiver, mutually interfering with a third transmitter communicating with a second receiver. We give an achievable coding scheme and prove its optimality, i.e. characterize the capacity region. This scheme is a form of interference alignment which exploits the channel gain difference of the two-user cell.

Connected through hyperedge HE-1 (induced by source paper "enabling the multi user generalized degrees of freedom in the gaussian cellular channel"):
  with members:
    - "upper bounds and duality relations of the linear deterministic sum capacity for cellular systems"
    - "on gaussian multiple access channels with interference achievable rates and upper bounds"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "a layered lattice coding scheme for a class of three user gaussian interference channels"
    - "the two user gaussian interference channel a deterministic view"
    - "a deterministic approach to wireless relay networks"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-2 (induced by source paper "the deterministic sum capacity of a multiple access channel interfering with a point to point link"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "on the capacity of the 2 user gaussian mac interfering with a p2p link"
    - "the two user gaussian interference channel a deterministic view"
    - "generalized degrees of freedom of the symmetric gaussian k user interference channel"
    - "a deterministic approach to wireless relay networks"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "on the capacity of multiple access z interference channels"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "on a class of discrete memoryless broadcast interference channels"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "on the capacity of the 2 user gaussian mac interfering with a p2p link"
    - "lattice strategies for the dirty multiple access channel"
    - "a layered lattice coding scheme for a class of three user gaussian interference channels"
    - "on polar polytopes and the recovery of sparse representations"

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)