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: "secure broadcasting using independent secret keys"
  Abstract: The problem of secure broadcasting with independent secret keys is studied. The particular scenario is analyzed in which a common message has to be broadcast to two legitimate receivers, while keeping an external eavesdropper ignorant of it. The transmitter shares independent secret keys of sufficiently high rates with both legitimate receivers, which can be used in different ways: they can be used as one-time pads to encrypt the common message, as fictitious messages for wiretap coding, or as a hybrid of these. In this paper, capacity results are established when the broadcast channels involving the three receivers are degraded. If both legitimate channels are degraded versions of the eavesdropper’s channel, it is shown that the one-time pad approach is optimal for several cases, yielding corresponding capacity expressions. Alternatively, the wiretap coding approach is shown to be optimal if the eavesdropper’s channel is degraded with respect to both legitimate channels, establishing capacity in this case as well. If the eavesdropper’s channel is neither the strongest nor the weakest, an intricate scheme that carefully combines both concepts of one-time pad and wiretap coding with fictitious messages turns out to be capacity-achieving. Finally we also obtain some results for the general non-degraded broadcast channel.

Connected through hyperedge HE-1 (induced by source paper "secrecy capacity memory tradeoff of erasure broadcast channels"):
  with members:
    - "benefits of cache assignment on degraded broadcast channels"
    - "cache aided content delivery over erasure broadcast channels"
    - "cache enabled physical layer security for video streaming in backhaul limited cellular networks"
    - "a secure approach for caching contents in wireless ad hoc networks"
    - "noisy broadcast networks with receiver caching"
    - "speeding up future video distribution via channel aware caching aided coded multicast"
    - "on edge caching with secrecy constraints"
    - "fundamental limits of secretive coded caching"

Connected through hyperedge HE-2 (induced by source paper "feedback coding schemes for the broadcast channel with mutual secrecy requirement"):
  with members:
    - "finite state markov wiretap channel with delayed feedback"
    - "multiple access relay wiretap channel"
    - "wiretap channel with causal state information and secure rate limited feedback"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"
    - "the secrecy rate region of the broadcast channel"
    - "source coding for a simple network with receiver side information"
    - "the gaussian multiple access wire tap channel"

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)