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 "capacity bounds for state dependent broadcast channels"):
  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 comprises 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. We derive inner bounds for all the three classes of channels. For the first and second class of channels, we discuss the rate penalty on the achievable region for having to deal with side-information. For channels of third class, we characterize the rate penalties for having to deal not only with side-information, but also to satisfy confidentiality constraints. We then derive outer bounds, where we present an explicit characterization of sum-rate bounds for the first and third class of channels. For channels of the second class, we show that our outer bounds are within a fixed gap away from the achievable rate region, where the gap is independent of the distribution characterizing this class of channels. The channel models presented in this paper are useful variants of the classical broadcast channel, and provide fundamental building blocks for cellular downlink communications with side-information, such as fading in the wireless medium, interference caused by neighboring nodes in the network, {\etc}. at the encoder; two-way relay communications; and secure wireless broadcasting.

Includes members:
  Member "secure broadcasting with side information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on state dependent broadcast channels with side information at the transmitter")
  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 "on state dependent broadcast channels with side information at the transmitter")
  Member "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "secrecy capacity of a class of broadcast channels with an eavesdropper":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "feedback coding schemes for the broadcast channel with mutual secrecy requirement")
  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)