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: "approximate sum capacity of k user cognitive interference channels with cumulative message sharing"
  Abstract: This paper considers the K user cognitive interference channel with one primary and K-1 secondary/cognitive transmitters with a cumulative message sharing structure, i.e cognitive transmitter $i\in [2:K]$ knows non-causally all messages of the users with index less than i. We propose a computable outer bound valid for any memoryless channel. We first evaluate the sum-rate outer bound for the high- SNR linear deterministic approximation of the Gaussian noise channel. This is shown to be capacity for the 3-user channel with arbitrary channel gains and the sum-capacity for the symmetric K-user channel. Interestingly. for the K user channel having only the K th cognitive know all the other messages is sufficient to achieve capacity i.e cognition at transmitter 2 to K-1 is not needed. Next the sum capacity of the symmetric Gaussian noise channel is characterized to within a constant additive and multiplicative gap. The proposed achievable scheme for the additive gap is based on Dirty paper coding and can be thought of as a MIMO-broadcast scheme where only one encoding order is possible due to the message sharing structure. As opposed to other multiuser interference channel models, a single scheme suffices for both the weak and strong interference regimes. With this scheme the generalized degrees of freedom (gDOF) is shown to be a function of K, in contrast to the non cognitive case and the broadcast channel case. Interestingly, it is show that as the number of users grows to infinity the gDoF of the K-user cognitive interference channel with cumulative message sharing tends to the gDoF of a broadcast channel with a K-antenna transmitter and K single-antenna receivers. The analytical additive additive and multiplicative gaps are a function of the number of users. Numerical evaluations of inner and outer bounds show that the actual gap is less than the analytical one.

Connected through hyperedge HE-1 (induced by source paper "multi user cognitive interference channels a survey and new capacity results"):
  with members:
    - "the two user causal cognitive interference channel novel outer bounds and constant gap result for the symmetric gaussian noise channel in weak interference"
    - "on the capacity region of the two user interference channel with a cognitive relay"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "on the capacity of the two user gaussian causal cognitive interference channel"
    - "on the gaussian interference channel with half duplex causal cognition"
    - "multiuser cognitive radio networks an information theoretic perspective"
    - "simultaneous nonunique decoding is rate optimal"
    - "three user cognitive interference channel capacity region with strong interference"

Connected through hyperedge HE-2 (induced by source paper "interference as noise friend or foe"):
  with members:
    - "on the two user interference channel with lack of knowledge of the interference codebook at one receiver"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "on discrete alphabets for the two user gaussian interference channel with one receiver lacking knowledge of the interfering codebook"
    - "soft decoding based strategies for relay and interference channels analysis and achievable rates using ldpc codes"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "wireless network information flow a deterministic approach"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "k user interference channels general outer bound and sum capacity for certain gaussian channels"

Connected through hyperedge HE-3 (induced by source paper "lattice codes for many to one interference channels with and without cognitive messages"):
  with members:
    - "asymmetric compute and forward with csit"
    - "compute and forward finding the best equation"
    - "multiuser cognitive radio networks an information theoretic perspective"
    - "is non unique decoding necessary"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "inner and outer bounds for the gaussian cognitive interference channel and new capacity results"
    - "nested lattice codes for gaussian relay networks with interference"
    - "integer forcing linear receivers"

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)