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: "state dependent multiple access channels with feedback"
  Abstract: In this paper, we examine discrete memoryless Multiple Access Channels (MACs) with two-sided feedback in the presence of two correlated channel states that are correlated in the sense of Slepian-Wolf (SW). We find achievable rate region for this channel when the states are provided non-causally to the transmitters and show that our achievable rate region subsumes Cover-Leung achievable rate for the discrete memoryless MAC with two-sided feedback as its special case. We also find the capacity region of discrete memoryless MAC with two-sided feedback and with SW-type correlated states available causally or strictly causally to the transmitters. We also study discrete memoryless MAC with partial feedback in the presence of two SW-type correlated channel states that are provided non-causally, causally, or strictly causally to the transmitters. An achievable rate region is found when channel states are non-causally provided to the transmitters whereas capacity regions are characterized when channel states are causally, or strictly causally available at the transmitters.

Connected through hyperedge HE-1 (induced by source paper "state dependent z channel"):
  with members:
    - "compound multiple access channel with common message and intersymbol interference"
    - "three receiver broadcast channels with side information"
    - "lattice strategies for the dirty multiple access channel"
    - "rate regions for relay broadcast channels"

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)