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 "on state dependent broadcast channels with side information at the transmitter"):
  Abstract: In this paper, we derive information-theoretic performance limits for three classes of two-user state-dependent discrete memoryless broadcast channels, with noncausal side-information at the encoder. The first class of channels comprise a sender broadcasting two independent messages to two non-cooperating receivers; for channels of the second class, each receiver is given the message it need not decode; and the third class comprises channels where the sender is constrained to keep each message confidential from the unintended receiver. To derive inner bounds, we employ an extension of Marton's achievability scheme for the classical two-user broadcast channel, results from the second moment method, an extension of the technique proposed by Kramer and Shamai for broadcast channels with receiver side-information, and stochastic encoders to satisfy confidentiality requirements. Outer bounds are derived by following the procedure used to prove the converse theorem for Gel'fand-Pinsker's channels with random parameters; and confidentiality constraints are utilized for deriving outer bounds for channels belonging to the third class. For channels of the second class, the bounds are tight, thereby yielding the capacity region.

Includes members:
  Member "secure broadcasting with side information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "capacity bounds for state dependent broadcast channels")
  Member "a note on outer bounds for broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "broadcast channels with privacy leakage constraints")
  Member "two classes of broadcast channels with side information capacity outer bounds":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity bounds for state dependent broadcast channels")
  Member "multiple input multiple output gaussian broadcast channels with common and confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "broadcasting with side information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "privacy utility tradeoff in a guessing framework inspired by index coding")

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)