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 achievability of gaussian interference channel capacity to within one bit"
  Abstract: In the earlier version of this paper, it was wrongly claimed that time-sharing is required to achieve the capacity region of the Gaussian interference channel to within one bit, especially at corner points. The flaw in the argument of the earlier version lies in fixing the decoding paradigm for a fixed common/private message splitting encoding strategy. More specifically, the additional constraints (7b) and (7d) in the earlier version arise if we force the common messages to be always decoded at unintended receivers. However, (7b) and (7d) can be eliminated by allowing the decoders to ignore unintended common messages, particularly at corner points of the rate region, without resorting to time-sharing at the transmit side, as suggested in the earlier version. For these reasons, our earlier claim is invalid.

Connected through hyperedge HE-1 (induced by source paper "a new sum rate outer bound for interference channels with three source destination pairs"):
  with members:
    - "interference channels with source cooperation"
    - "k user interference channels general outer bound and sum capacity for certain gaussian channels"
    - "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-2 (induced by source paper "a new rate region for general interference channel improved hk region"):
  with members:
    - "multi user privacy the gray wyner system and generalized common information"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "the capacity region of a class of discrete degraded interference channels"
    - "interference channels with common information"

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)