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: "k user interference channels general outer bound and sum capacity for certain gaussian channels"
  Abstract: This paper derives an outer bound on the capacity region of a general memoryless interference channel with an arbitrary number of users. The derived bound is the first known outer bound region valid for any memoryless channel besides the cut-set bound, which is loose even in the two-user case. In Gaussian noise, classes of channels for which the proposed bound gives the sum-rate capacity are identified, including degraded channels and a class of Z-channels.

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"
    - "on the sum capacity of k user cascade gaussian z interference channel"
    - "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 "on the sum capacity of many to one and one to many gaussian interference channels"):
  with members:
    - "on the gaussian many to one x channel"
    - "lattice codes for many to one interference channels with and without cognitive messages"
    - "capacity bounds for the k user gaussian interference channel"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "on the capacity of the k user cyclic gaussian interference channel"
    - "interference alignment and a noisy interference regime for many to one interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "new outer bounds on the capacity region of gaussian interference channels"

Connected through hyperedge HE-3 (induced by source paper "capacity bounds for the k user gaussian interference channel"):
  with members:
    - "on the high snr capacity of the gaussian interference channel and new capacity bounds"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "wireless network information flow a deterministic approach"
    - "settling the feasibility of interference alignment for the mimo interference channel the symmetric square case"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "a new sum rate outer bound for interference channels with three source destination pairs"
    - "the wideband slope of interference channels the large bandwidth case"

Connected through hyperedge HE-4 (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"
    - "approximate sum capacity of k user cognitive interference channels with cumulative message sharing"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "the effect of maximal rate codes on the interfering message rate"):
  with members:
    - "on mmse properties of codes for the gaussian broadcast and wiretap channels"
    - "sub optimality of the han kobayashi achievable region for interference channels"
    - "random coding error exponents for the two user interference channel"
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "on the two user interference channel with lack of knowledge of the interference codebook at one receiver"
    - "sub optimality of treating interference as noise in the cellular uplink with weak interference"
    - "on discrete alphabets for the two user gaussian interference channel with one receiver lacking knowledge of the interfering codebook"
    - "on the optimality of treating interference as noise general message sets"

Connected through hyperedge HE-6 (induced by source paper "on the corner points of the capacity region of a two user gaussian interference channel"):
  with members:
    - "the effect of maximal rate codes on the interfering message rate"
    - "the han kobayashi region for a class of gaussian interference channels with mixed interference"
    - "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-7 (induced by source paper "a new sum rate outer bound for interference channels with three source destination pairs"):
  with members:
    - "on achievability of gaussian interference channel capacity to within one bit"
    - "interference channels with source cooperation"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "sum capacity of k user gaussian degraded interference channels"
    - "outer bounds for the interference channel with a cognitive relay"
    - "interference channel with generalized feedback a k a with source cooperation part i achievable region"
    - "lecture notes on network information theory"
    - "new inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results"

Connected through hyperedge HE-8 (induced by source paper "mmse of bad codes"):
  with members:
    - "soft decoding based strategies for relay and interference channels analysis and achievable rates using ldpc codes"
    - "communication with disturbance constraints"
    - "interference networks with point to point codes"
    - "sub optimality of treating interference as noise in the cellular uplink"
    - "statistical physics of signal estimation in gaussian noise theory and examples of phase transitions"
    - "estimation in gaussian noise properties of the minimum mean square error"
    - "on mmse properties and i mmse implications in parallel mimo gaussian channels"
    - "to decode the interference or to consider it as noise"

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)