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: "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels"
  Abstract: The wiretap channel models secure communication between two users in the presence of an eavesdropper who must be kept ignorant of transmitted messages. The performance of such a system is usually characterized by its secrecy capacity which determines the maximum transmission rate of secure communication. In this paper, the issue of whether or not the secrecy capacity is a continuous function of the system parameters is examined. In particular, this is done for channel uncertainty modeled via compound channels and arbitrarily varying channels, in which the legitimate users know only that the true channel realization is from a prespecified uncertainty set. In the former model, this realization remains constant for the entire duration of transmission, while in the latter the realization varies from channel use to channel use in an unknown and arbitrary manner. These models not only capture the case of channel uncertainty, but are also suitable for modeling scenarios in which a malicious adversary jams or otherwise influences the legitimate transmission. The secrecy capacity of the compound wiretap channel is shown to be robust in the sense that it is a continuous function of the uncertainty set. Thus, small variations in the uncertainty set lead to small variations in secrecy capacity. On the other hand, the deterministic secrecy capacity of the arbitrarily varying wiretap channel is shown to be discontinuous in the uncertainty set meaning that small variations can lead to dramatic losses in capacity.

Connected through hyperedge HE-1 (induced by source paper "the arbitrarily varying channel with colored gaussian noise"):
  with members:
    - "the capacity region of the arbitrarily varying mac with and without constraints"
    - "the arbitrarily varying relay channel"
    - "minimax theorems for finite blocklength lossy joint source channel coding over an avc"
    - "the arbitrarily varying gaussian relay channel with sender frequency division"
    - "communication over an arbitrarily varying channel under a state myopic encoder"
    - "arbitrarily varying wiretap channel with state sequence known or unknown at the receiver"
    - "semi robust communications over a broadcast channel"
    - "arbitrarily varying wiretap channels with type constrained states"

Connected through hyperedge HE-2 (induced by source paper "the arbitrarily varying relay channel"):
  with members:
    - "the capacity of the relay channel solution to cover s problem in the gaussian case"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "cut set bound is loose for gaussian relay networks"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "capacity approximations for gaussian relay networks"
    - "the arbitrarily varying multiple access channel with conferencing encoders"
    - "secure communication over parallel relay channel"
    - "achieving the capacity of the n relay gaussian diamond network within log n bits"

Connected through hyperedge HE-3 (induced by source paper "arbitrarily varying wiretap channel with state sequence known or unknown at the receiver"):
  with members:
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "arbitrarily varying wiretap channels with type constrained states"
    - "finite state markov wiretap channel with delayed feedback"
    - "the secrecy capacity of compound gaussian mimo wiretap channels"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy results for compound wiretap channels"
    - "capacity results for arbitrarily varying wiretap channels"

Connected through hyperedge HE-4 (induced by source paper "arbitrarily varying wiretap channels with type constrained states"):
  with members:
    - "a new wiretap channel model and its strong secrecy capacity"
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "strong secrecy for cooperative broadcast channels"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "semantic security capacity for wiretap channels of type ii"
    - "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion"
    - "secrecy results for compound wiretap channels"
    - "effective secrecy reliability confusion and stealth"

Connected through hyperedge HE-5 (induced by source paper "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"):
  with members:
    - "arbitrarily varying wiretap channels with type constrained states"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "secrecy results for compound wiretap channels"
    - "strong secrecy for multiple access channels"
    - "capacity results for arbitrarily varying wiretap channels"
    - "strong secrecy from channel resolvability"

Connected through hyperedge HE-6 (induced by source paper "differential privacy as a mutual information constraint"):
  with members:
    - "resolvability in e γ with applications to lossy compression and wiretap channels"
    - "on the relation between identifiability differential privacy and mutual information privacy"
    - "the composition theorem for differential privacy"
    - "differential privacy on the trade off between utility and information leakage"
    - "lower bounds in differential privacy"

Connected through hyperedge HE-7 (induced by source paper "the secrecy capacity of compound gaussian mimo wiretap channels"):
  with members:
    - "secrecy results for compound wiretap channels"
    - "finite snr diversity multiplexing tradeoff via asymptotic analysis of large mimo systems"
    - "mimo wiretap channels with arbitrarily varying eavesdropper channel states"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "on the compound mimo broadcast channels with confidential messages"
    - "transmitter optimization for achieving secrecy capacity in gaussian mimo wiretap channels"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-8 (induced by source paper "the arbitrarily varying wiretap channel secret randomness stability and super activation"):
  with members:
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion"
    - "secrecy results for compound wiretap channels"
    - "capacity results for arbitrarily varying wiretap channels"
    - "a new data processing inequality and its applications in distributed source and channel coding"

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)