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: "distributed interference cancellation in multiple access channel with transmitter cooperation"
  Abstract: We consider a two-user Gaussian multiple access channel with two independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. Transmitters are allowed to cooperate through finite-capacity links. The capacity region is characterized to within 3 and 1.5 bits for the stronger user and the weaker user respectively, regardless of channel parameters. As a by-product, we characterize the capacity region of the case without cooperation to within 1 and 0.5 bits for the stronger user and the weaker user respectively. These results are based on a layered modulo-lattice transmission architecture which realizes distributed interference cancellation.

Connected through hyperedge HE-1 (induced by source paper "distributed interference cancellation in multiple access channels"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "interference mitigation through limited transmitter cooperation"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "bounds on the capacity of the relay channel with noncausal state information at source"
    - "interference mitigation through limited receiver cooperation"
    - "lattice strategies for the dirty multiple access channel"
    - "multiaccess channels with state known to one encoder another case of degraded message sets"
    - "wireless network information flow"

Connected through hyperedge HE-2 (induced by source paper "multiple access channels with cooperative encoders and channel state information"):
  with members:
    - "achievable rate regions for dirty tape channels and joint writing on dirty paper and dirty tape"
    - "rate regions for the partially cooperative relay broadcast channel with non causal side 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)