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: "capacity bounds for multiuser channels with non causal channel state information at the transmitters"
  Abstract: In this paper, capacity inner and outer bounds are established for the multiuser channels with Channel State Information (CSI) known non-causally at the transmitters: The Multiple Access Channel (MAC), the Broadcast Channel (BC) with common information, and the Relay Channel (RC). For each channel, the actual capacity region is also derived in some special cases. Specifically, it is shown that for some deterministic models with non-causal CSI at the transmitters, similar to Costa's Gaussian channel, the availability of CSI at the deterministic receivers does not affect the capacity region.

Connected through hyperedge HE-1 (induced by source paper "broadcasting information subject to state masking over a mimo state dependent gaussian channel"):
  with members:
    - "broadcasting information subject to state masking"
    - "information extraction under privacy constraints"
    - "information masking and amplification the source coding setting"
    - "state amplification subject to masking constraints"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

Connected through hyperedge HE-2 (induced by source paper "broadcasting information subject to state masking"):
  with members:
    - "an extremal inequality motivated by multiterminal information theoretic problems"

Connected through hyperedge HE-3 (induced by source paper "a unified inner bound for the two receiver memoryless broadcast channel with channel state and message side information"):
  with members:
    - "feedback and partial message side information on the semideterministic broadcast channel"
    - "a unified scheme for two receiver broadcast channels with receiver message side information"
    - "information networks with in block memory"
    - "on the equal rate capacity of the awgn multiway relay channel"

Connected through hyperedge HE-4 (induced by source paper "on cooperative multiple access channels with delayed csi at transmitters"):
  with members:
    - "capacity results for binary fading interference channels with delayed csit"
    - "multiple access channels with states causally known at transmitters"
    - "secure degrees of freedom of mimo x channels with output feedback and delayed csit"
    - "estimation with a helper who knows the interference"
    - "wyner ziv type versus noisy network coding for a state dependent mac"
    - "on achievable degrees of freedom for mimo x channels"
    - "wireless network information flow a deterministic approach"
    - "the state dependent semideterministic broadcast channel"

Connected through hyperedge HE-5 (induced by source paper "parallel gaussian networks with a common state cognitive helper"):
  with members:
    - "on the achievable rate regions for state dependent gaussian interference channel"
    - "secret key agreement with channel state information at the transmitter"
    - "the state dependent semideterministic broadcast channel"
    - "bounds on the capacity of the relay channel with noncausal state at source"
    - "distributed interference cancellation in multiple access channels"
    - "on the capacity of compound state dependent channels with states known at the transmitter"
    - "lattice strategies for the dirty multiple access channel"
    - "multiaccess channels with state known to some encoders and independent messages"

Connected through hyperedge HE-6 (induced by source paper "multi layer gelfand pinsker strategies for the generalized multiple access channel"):
  with members:
    - "multiple access channels with states causally known at transmitters"
    - "capacity region of multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoder"
    - "multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoder"
    - "the state dependent multiple access channel with states available at a cribbing encoder"
    - "multiple access channels with cooperative encoders and channel state information"
    - "multiaccess channels with state known to some encoders and independent messages"

Connected through hyperedge HE-7 (induced by source paper "capacity region of the broadcast channel with two deterministic channel state components"):
  with members:
    - "the two user gaussian fading broadcast channel"
    - "the state dependent semideterministic broadcast channel"
    - "completely stale transmitter channel state information is still very useful"
    - "on the capacity of the discrete memoryless broadcast channel with feedback"

Connected through hyperedge HE-8 (induced by source paper "three receiver broadcast channels with side information"):
  with members:
    - "the state dependent semideterministic broadcast channel"
    - "capacity regions of two new classes of 2 receiver broadcast channels"
    - "the capacity of a class of 3 receiver broadcast channels with degraded message sets"
    - "duality between channel capacity and rate distortion with two sided state 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)