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: "broadcast channels with confidential messages by randomness constrained stochastic encoder"
  Abstract: In coding schemes for the wire-tap channel or the broadcast channels with confidential messages, it is well known that the sender needs to use a stochastic encoding to avoid the information about the transmitted confidential message to be leaked to an eavesdropper. In this paper, it is investigated that the trade-off between the rate of the random number to realize the stochastic encoding and the rates of the common, private, and confidential messages. For the direct theorem, the superposition coding scheme for the wire-tap channel recently proposed by Chia and El Gamal is employed, and its strong security is proved. The matching converse theorem is also established. Our result clarifies that a combination of the ordinary stochastic encoding and the channel prefixing by the channel simulation is suboptimal.

Connected through hyperedge HE-1 (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-2 (induced by source paper "practical ldpc coded modulation schemes for the fading broadcast channel with confidential messages"):
  with members:
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "a physical layer secured key distribution technique for ieee 802 11g wireless networks"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "increasing physical layer security through scrambled codes and arq"
    - "secure broadcasting over fading channels with statistical qos constraints"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"
    - "non systematic codes for physical layer security"

Connected through hyperedge HE-3 (induced by source paper "ldpc coded transmissions over the gaussian broadcast channel with confidential messages"):
  with members:
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"
    - "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"
    - "increasing physical layer security through scrambled codes and arq"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"
    - "non systematic codes for physical layer security"
    - "secrecy gain a wiretap lattice code design"

Connected through hyperedge HE-4 (induced by source paper "on secure source coding with side information at the encoder"):
  with members:
    - "increasing smart meter privacy through energy harvesting and storage devices"
    - "utility privacy tradeoffs in databases an information theoretic approach"
    - "information masking and amplification the source coding setting"
    - "smart meter privacy a utility privacy framework"
    - "discriminatory lossy source coding side information privacy"
    - "multiterminal source coding under logarithmic loss"
    - "multiterminal source coding with an entropy based distortion measure"
    - "secure lossy source coding with side information at the decoders"

Connected through hyperedge HE-5 (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"
    - "on secure communication with constrained randomization"
    - "cognitive interference channels with confidential messages under randomness constraint"
    - "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-6 (induced by source paper "cognitive interference channels with confidential messages under randomness constraint"):
  with members:
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "strong secrecy from channel resolvability"
    - "capacity results for relay channels with confidential messages"
    - "interference channels with common information"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-7 (induced by source paper "on secure communication with constrained randomization"):
  with members:
    - "achieving the secrecy capacity of wiretap channels using polar codes"

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)