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: "two classes of broadcast channels with side information capacity outer bounds"
  Abstract: In this paper, we derive outer bounds on the capacity region of two classes of the general two-user discrete memoryless broadcast channels with side-information at the transmitter. The first class comprises the classical broadcast channel where a sender transmits two independent messages to two receivers. A constraint that each message must be kept confidential from the unintended receiver constitutes the second class. For both classes, the conditional distribution characterizing the channel depends on a state process and the encoder has side-information provided to it in a noncausal manner. For the first class of channels, an outer bound is derived employing techniques used to prove the converse theorem for the Gel'fand-Pinsker's channel with random parameters; the bounds are tight for individual rate constraints, but can be improved upon for the sum rate. The technique for deriving outer bounds for the second class of channels hinges on the confidentiality requirements; we also derive a genie-aided outer bound, where a hypothetical genie gives the unintended message to a receiver which treats it as side-information during equivocation computation. For both classes of channels, Csisz\'{a}r's sum identity plays a central role in establishing the capacity outer bounds.

Connected through hyperedge HE-1 (induced by source paper "on state dependent broadcast channels with side information at the transmitter"):
  with members:
    - "secure broadcasting with side information"
    - "a note on outer bounds for broadcast channel"
    - "multiple input multiple output gaussian broadcast channels with common and confidential messages"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "broadcasting with side information"

Connected through hyperedge HE-2 (induced by source paper "capacity bounds for state dependent broadcast channels"):
  with members:
    - "secure broadcasting with side information"
    - "a note on outer bounds for broadcast channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"
    - "broadcasting with side information"

Connected through hyperedge HE-3 (induced by source paper "secure broadcasting with side information"):
  with members:
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "broadcasting with side 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)