human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "parallel gaussian networks with a common state cognitive helper"):
  Abstract: A class of state-dependent parallel networks with a common state-cognitive helper, in which $K$ transmitters wish to send $K$ messages to their corresponding receivers over $K$ state-corrupted parallel channels, and a helper who knows the state information noncausally wishes to assist these receivers to cancel state interference. Furthermore, the helper also has its own message to be sent simultaneously to its corresponding receiver. Since the state information is known only to the helper, but not to the corresponding transmitters $1,\dots,K$, transmitter-side state cognition and receiver-side state interference are mismatched. Our focus is on the high state power regime, i.e., the state power goes to infinity. Three (sub)models are studied. Model I serves as a basic model, which consists of only one transmitter-receiver (with state corruption) pair in addition to a helper that assists the receiver to cancel state in addition to transmitting its own message. Model II consists of two transmitter-receiver pairs in addition to a helper, and only one receiver is interfered by a state sequence. Model III generalizes model I include multiple transmitter-receiver pairs with each receiver corrupted by independent state. For all models, inner and outer bounds on the capacity region are derived, and comparison of the two bounds leads to characterization of either full or partial boundary of the capacity region under various channel parameters.

Includes members:
  Member "on the achievable rate regions for state dependent gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multicoding schemes for interference channels")
  Member "secret key agreement with channel state information at the transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "key and message semantic security over state dependent channels")
  Member "the state dependent semideterministic broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wiretap and gelfand pinsker channels analogy and its applications")
  Member "bounds on the capacity of the relay channel with noncausal state at source":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the arbitrarily varying relay channel")
  Member "capacity bounds for multiuser channels with non causal channel state information at the transmitters":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "broadcasting information subject to state masking over a mimo state dependent gaussian channel")
  Member "distributed interference cancellation in multiple access channels":
    also connected through other hyperedges:
      (none)
  Member "on the capacity of compound state dependent channels with states known at the transmitter":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the capacity of the carbon copy onto dirty paper channel")
  Member "lattice strategies for the dirty multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")

Question: Please tell me which class the source paper 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)