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 the sum capacity of k user cascade gaussian z interference channel"
  Abstract: A $K$-user cascade Gaussian Z-interference channel is a subclass of the general $K$-user Gaussian interference channel, where each user, except the first one, experiences interference only from the previous user. Under simple Han-Kobayashi schemes assuming Gaussian inputs and no time sharing, it is shown that the maximum sum rate is achieved by each user transmitting either common or private signals. For K=3, channel conditions under which the achieved sum rate is either equal to or within 0.5 bits to the sum capacity are identified.

Connected through hyperedge HE-1 (induced by source paper "channel conditions for the optimality of interference decoding schemes for k user gaussian interference channels"):
  with members:
    - "on the sum capacity of many to one and one to many gaussian interference channels"
    - "on the gaussian many to one x channel"
    - "capacity bounds for the k user gaussian interference channel"
    - "k user interference channels general outer bound and sum capacity for certain gaussian channels"
    - "capacity bounds for the gaussian interference channel"
    - "new outer bounds on the capacity region of gaussian interference channels"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-2 (induced by source paper "cognitive wyner networks with clustered decoding"):
  with members:
    - "on optimal message assignments for interference channels with comp transmission"
    - "degrees of freedom dof of locally connected interference channels with coordinated multi point comp transmission"
    - "degrees of freedom of interference channels with comp transmission and reception"
    - "fundamental limits of cooperation"
    - "index coding an interference alignment perspective"
    - "interference channels with coordinated multi point transmission degrees of freedom message assignment and fractional reuse"
    - "interference cooperation and connectivity a degrees of freedom perspective"
    - "on the capacity of the k user cyclic gaussian interference channel"

Connected through hyperedge HE-3 (induced by source paper "energy efficient communication over gaussian interference networks with processing energy cost"):
  with members:
    - "on the gaussian z interference channel with processing energy cost"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-4 (induced by source paper "transmission schemes for gaussian interference channels with transmitter processing energy"):
  with members:
    - "on the gaussian z interference channel with processing energy cost"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-5 (induced by source paper "close form design of antenna constrained multi cell multi user downlink interference alignment"):
  with members:
    - "on the symmetric feedback capacity of the k user cyclic interference channel"
    - "downlink interference alignment"
    - "on the capacity of the k user cyclic gaussian interference channel"
    - "interference alignment under limited feedback for mimo interference channels"
    - "approaching the capacity of wireless networks through distributed interference alignment"
    - "multiuser mimo achievable rates with downlink training and channel state feedback"

Connected through hyperedge HE-6 (induced by source paper "on the symmetric feedback capacity of the k user cyclic interference channel"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "dependence balance based outer bounds for gaussian networks with cooperation and feedback"
    - "k user interference channels general outer bound and sum capacity for certain gaussian channels"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "on the capacity of the k user cyclic gaussian interference channel"
    - "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)