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: "capacity results for compound wiretap channels"
  Abstract: We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by Liang et al. and thus establishing a full coding theorem in this case. We achieve this with a quite strong secrecy criterion and with a decoder that is robust against the effect of randomisation in the encoding. This relieves us from the need of decoding the randomisation parameter which is in general not possible within this model. Moreover we prove a lower bound on the secrecy capacity of the compound wiretap channel without channel state information.

Connected through hyperedge HE-1 (induced by source paper "secure broadcasting using independent secret keys"):
  with members:
    - "secrecy results for compound wiretap channels"
    - "strong secrecy for multiple access channels"
    - "effective secrecy reliability confusion and stealth"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "strong secrecy from channel resolvability"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secret communication with feedback"

Connected through hyperedge HE-2 (induced by source paper "secrecy capacities of compound quantum wiretap channels and applications"):
  with members:
    - "classical quantum arbitrarily varying wiretap channel a capacity formula with ahlswede dichotomy resources"
    - "classical quantum arbitrarily varying wiretap channel"

Connected through hyperedge HE-3 (induced by source paper "classical quantum arbitrarily varying wiretap channel a capacity formula with ahlswede dichotomy resources"):
  with members:
    - "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"
    - "secrecy results for compound wiretap channels"
    - "classical quantum arbitrarily varying wiretap channel"
    - "capacity results for arbitrarily varying wiretap channels"

Connected through hyperedge HE-4 (induced by source paper "capacity results for arbitrarily varying wiretap channels"):
  with members:
    - "secrecy results for compound wiretap channels"

Connected through hyperedge HE-5 (induced by source paper "strong secrecy from channel resolvability"):
  with members:
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "strongly secure communications over the two way wiretap channel"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "strong security and separated code constructions for the broadcast channels with confidential messages"
    - "mimo wiretap channels with arbitrarily varying eavesdropper channel states"
    - "strongly secure privacy amplification cannot be obtained by encoder of slepian wolf code"
    - "second order asymptotics in fixed length source coding and intrinsic randomness"

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)