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: "secrecy results for compound wiretap channels"
  Abstract: We derive a lower bound on the secrecy capacity of a 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. [1], thus establishing a full coding theorem in this case. We achieve this with a stronger secrecy criterion and the maximum error probability criterion, and with a decoder that is robust against the effect of randomization in the encoding. This relieves us from the need of decoding the randomization parameter, which is in general impossible within this model. Moreover, we prove a lower bound on the secrecy capacity of a compound wiretap channel without channel state information and derive a multiletter expression for the capacity in this communication scenario.

Connected through hyperedge HE-1 (induced by source paper "secure polar coding with delayed wiretapping information"):
  with members:
    - "secure polar coding for the two way wiretap channel"
    - "finite state markov wiretap channel with delayed feedback"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "polar coding for the general wiretap channel"
    - "polar coding for secret key generation"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"

Connected through hyperedge HE-2 (induced by source paper "semantically secure lattice codes for compound mimo channels"):
  with members:
    - "random ensembles of lattices from generalized reductions"
    - "optimal signaling for secure communications over gaussian mimo wiretap channels"
    - "universal lattice codes for mimo channels"
    - "a general formula for compound channel capacity"
    - "the secrecy capacity of compound gaussian mimo wiretap channels"
    - "the mimo wiretap channel decomposed"
    - "construction a of lattices over number fields and block fading wiretap coding"
    - "probability estimates for fading and wiretap channels from ideal class zeta functions"

Connected through hyperedge HE-3 (induced by source paper "secure broadcasting using independent secret keys"):
  with members:
    - "strong secrecy for multiple access channels"
    - "effective secrecy reliability confusion and stealth"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "capacity results for compound wiretap channels"
    - "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-4 (induced by source paper "the mac resolvability region semantic security and its operational implications"):
  with members:
    - "mac resolvability first and second order results"
    - "soft covering with high probability"
    - "semantic security capacity for wiretap channels of type ii"
    - "a stronger soft covering lemma and applications"
    - "strong converse and second order asymptotics of channel resolvability"
    - "renyi divergence and kullback leibler divergence"
    - "semantically secure lattice codes for the gaussian wiretap channel"
    - "effective secrecy reliability confusion and stealth"

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"
    - "the arbitrarily varying wiretap channel secret randomness stability and super activation"
    - "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels"
    - "semantic security capacity for wiretap channels of type ii"
    - "capacity results for arbitrarily varying wiretap channels"

Connected through hyperedge HE-6 (induced by source paper "on the compound mimo wiretap channel with mean feedback"):
  with members:
    - "the secrecy capacity of compound gaussian mimo wiretap channels"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "transmitter optimization for achieving secrecy capacity in gaussian mimo wiretap channels"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-7 (induced by source paper "an improved feedback coding scheme for the wire tap channel"):
  with members:
    - "finite state markov wiretap channel with delayed feedback"
    - "wiretap channel with causal state information and secure rate limited feedback"
    - "degraded compound multi receiver wiretap channels"

Connected through hyperedge HE-8 (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"
    - "on the continuity of the secrecy capacity of compound and arbitrarily varying wiretap channels"
    - "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"
    - "effective secrecy reliability confusion and stealth"

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)