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: "the arbitrarily varying wiretap channel secret randomness stability and super activation"
  Abstract: We define the common randomness assisted capacity of an arbitrarily varying channel (AVWC) when the Eavesdropper is kept ignorant about the common randomness. We prove a multi-letter capacity formula for this model. We prove that, if enough common randomness is used, the capacity formula can be given a single-shot form again. We then consider the opposite extremal case, where no common randomness is available. It is known that the capacity of the system can be discontinuous under these circumstances. We prove here that it is still stable in the sense that it is continuous around its positivity points. We further prove that discontinuities can only arise if the legal link is symmetrizable and characterize the points where it is positive. These results shed new light on the design principles of communication systems with embedded security features. At last we investigate the effect of super-activation of the message transmission capacity of AVWCs under the average error criterion. We give a complete characterization of those AVWCs that may be super-activated. The effect is thereby also related to the (conjectured) super-activation of the common randomness assisted capacity of AVWCs with an eavesdropper that gets to know the common randomness. Super-activation is based on the idea of "wasting" a few bits of non-secret messages in order to enable provably secret transmission of a large bulk of data, a concept that may prove to be of further importance in the design of communication systems. In this work we provide further insight into this phenomenon by providing a class of codes that is capacity-achieving and does not convey any information to the Eavesdropper.

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"
    - "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels"
    - "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 "quadratically constrained myopic adversarial channels"):
  with members:
    - "list decoding random euclidean codes and infinite constellations"
    - "the arbitrarily varying gaussian relay channel with sender frequency division"
    - "covert communication over adversarially jammed channels"
    - "quadratically constrained channels with causal adversaries"
    - "sufficiently myopic adversaries are blind"
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "the benefit of a 1 bit jump start and the necessity of stochastic encoding in jamming channels"
    - "arbitrarily varying wiretap channels with type constrained states"

Connected through hyperedge HE-4 (induced by source paper "ultra reliable communication over arbitrarily varying channels under block restricted jamming"):
  with members:
    - "telling truth from correlation"
    - "deducing truth from correlation"

Connected through hyperedge HE-5 (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"
    - "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels"
    - "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-6 (induced by source paper "classical quantum arbitrarily varying wiretap channel secret message transmission under jamming attacks"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "classical quantum arbitrarily varying wiretap channel ahlswede dichotomy positivity resources super activation"
    - "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"
    - "secrecy capacities of compound quantum wiretap channels and applications"
    - "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion"
    - "classical quantum arbitrarily varying wiretap channel a capacity formula with ahlswede dichotomy resources"
    - "classical quantum arbitrarily varying wiretap channel"

Connected through hyperedge HE-7 (induced by source paper "secret message transmission over quantum channels under adversarial quantum noise secrecy capacity and super activation"):
  with members:
    - "secrecy capacities of compound quantum wiretap channels and applications"
    - "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion"
    - "classical quantum arbitrarily varying wiretap channel a capacity formula with ahlswede dichotomy resources"
    - "capacity results for arbitrarily varying wiretap channels"

Connected through hyperedge HE-8 (induced by source paper "reliable communication under the influence of a state constrained jammer a novel perspective on receive diversity"):
  with members:
    - "deducing truth from correlation"
    - "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion"
    - "the arbitrarily varying multiple access channel with conferencing encoders"

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)