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: "upper bounds and duality relations of the linear deterministic sum capacity for cellular systems"
  Abstract: The MAC-BC duality of information theory and wireless communications is an intriguing concept for efficient algorithm design. However, no concept is known so far for the important cellular channel. To make progress on this front, we consider in this paper the linear deterministic cellular channel. In particular, we prove duality of a network with two interfering MACs in each cell and a network with two interfering BCs in each cell. The operational region is confined to the weak interference regime. First, achievable schemes as well as upper bounds will be provided. These bounds are the same for both channels. We will show, that for specific cases the upper bound corresponds to the achievable scheme and hence establishing a duality relationship between them.

Connected through hyperedge HE-1 (induced by source paper "on the gaussian multiple access wiretap channel and the gaussian wiretap channel with a helper achievable schemes and upper bounds"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "on the deterministic sum capacity of the multiple access wiretap channel"
    - "on multiuser gain and the constant gap sum capacity of the gaussian interfering multiple access channel"
    - "secure degrees of freedom of the multiple access wiretap channel with multiple antennas"
    - "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"
    - "secure degrees of freedom of the gaussian diamond wiretap channel"
    - "finite snr regime analysis of the gaussian wiretap multiple access channel"
    - "secure degrees of freedom of one hop wireless networks"

Connected through hyperedge HE-2 (induced by source paper "on multiuser gain and the constant gap sum capacity of the gaussian interfering multiple access channel"):
  with members:
    - "enabling the multi user generalized degrees of freedom in the gaussian cellular channel"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "compute and forward harnessing interference through structured codes"
    - "the two user gaussian interference channel a deterministic view"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-3 (induced by source paper "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"):
  with members:
    - "compute and forward can buy secrecy cheap"
    - "enabling the multi user generalized degrees of freedom in the gaussian cellular channel"
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "the two user gaussian interference channel a deterministic view"
    - "a deterministic approach to wireless relay networks"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-4 (induced by source paper "approximate capacity region of the mac ic mac"):
  with members:
    - "enabling the multi user generalized degrees of freedom in the gaussian cellular channel"
    - "wireless network information flow a deterministic approach"
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "on the capacity of the 2 user gaussian mac interfering with a p2p link"
    - "on the capacity of multiple access z interference channels"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-5 (induced by source paper "a unified theory of multiple access and interference channels via approximate capacity regions for the mac ic mac"):
  with members:
    - "enabling the multi user generalized degrees of freedom in the gaussian cellular channel"
    - "the capacity region of the mimo interference channel and its reciprocity to within a constant gap"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "on the capacity of the 2 user gaussian mac interfering with a p2p link"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-6 (induced by source paper "enabling the multi user generalized degrees of freedom in the gaussian cellular channel"):
  with members:
    - "on interference alignment and the deterministic capacity for cellular channels with weak symmetric cross links"
    - "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"

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)