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 secure communication with constrained randomization"
  Abstract: In this paper, we investigate how constraints on the randomization in the encoding process affect the secrecy rates achievable over wiretap channels. In particular, we characterize the secrecy capacity with a rate-limited local source of randomness and a less capable eavesdropper's channel, which shows that limited rate incurs a secrecy rate penalty but does not preclude secrecy. We also discuss a more practical aspect of rate-limited randomization in the context of cooperative jamming. Finally, we show that secure communication is possible with a non-uniform source for randomness; this suggests the possibility of designing robust coding schemes.

Connected through hyperedge HE-1 (induced by source paper "publicness privacy and confidentiality in the single serving quantum broadcast channel"):
  with members:
    - "one shot capacity bounds on the simultaneous transmission of classical and quantum information"
    - "the single serving channel capacity"

Connected through hyperedge HE-2 (induced by source paper "coding schemes for achieving strong secrecy at negligible cost"):
  with members:
    - "exact random coding secrecy exponents for the wiretap channel"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "semantic security capacity for wiretap channels of type ii"
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "polar coding for the broadcast channel with confidential messages and constrained randomization"
    - "on secure network coding with nonuniform or restricted wiretap sets"
    - "secrecy results for compound wiretap channels"
    - "polar coding for secret key generation"

Connected through hyperedge HE-3 (induced by source paper "polar coding for the broadcast channel with confidential messages and constrained randomization"):
  with members:
    - "polar codes for broadcast channels"
    - "coding schemes for achieving strong secrecy at negligible cost"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "achieving marton s region for broadcast channels using polar codes"
    - "polar coding for the general wiretap channel"
    - "how to achieve the capacity of asymmetric channels"
    - "polar coding for secret key generation"
    - "achievability proof via output statistics of random binning"

Connected through hyperedge HE-4 (induced by source paper "polar coding for the broadcast channel with confidential messages a random binning analogy"):
  with members:
    - "polar codes for broadcast channels"
    - "coding schemes for achieving strong secrecy at negligible cost"
    - "achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component"
    - "polar coding for the general wiretap channel"
    - "polar coding for secret key generation"
    - "efficient one way secret key agreement and private channel coding via polarization"
    - "achievability proof via output statistics of random binning"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"

Connected through hyperedge HE-5 (induced by source paper "distributed channel synthesis"):
  with members:
    - "secure cascade channel synthesis"
    - "a connection between good rate distortion codes and backward dmcs"
    - "achievability proof via output statistics of random binning"
    - "channel simulation via interactive communications"
    - "coordination via a relay"
    - "secrecy is cheap if the adversary must reconstruct"
    - "generating dependent random variables over networks"
    - "using a secret key to foil an eavesdropper"

Connected through hyperedge HE-6 (induced by source paper "wiretap channel with causal state information and secure rate limited feedback"):
  with members:
    - "mimo broadcast channel with an unknown eavesdropper secrecy degrees of freedom"
    - "physical layer security in downlink multi antenna cellular networks"
    - "cognitive interference channels with confidential messages under randomness constraint"
    - "broadcast channels with confidential messages by randomness constrained stochastic encoder"
    - "secret key agreement with channel state information at the transmitter"
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "strong secrecy on the binary erasure wiretap channel using large girth ldpc codes"
    - "wiretap channel with causal state information"

Connected through hyperedge HE-7 (induced by source paper "broadcast channels with confidential messages by randomness constrained stochastic encoder"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "wiretap channels implications of the more capable condition and cyclic shift symmetry"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "capacity results for relay channels with confidential messages"
    - "3 receiver broadcast channels with common and confidential messages"
    - "capacity regions of two new classes of 2 receiver broadcast channels"
    - "secure multiplex coding to attain the channel capacity in wiretap channels"

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)