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 discrete memoryless multiple access channel with confidential messages"
  Abstract: A multiple-access channel is considered in which messages from one encoder are confidential. Confidential messages are to be transmitted with perfect secrecy, as measured by equivocation at the other encoder. The upper bounds and the achievable rates for this communication situation are determined.

Connected through hyperedge HE-1 (induced by source paper "multiple access channel with common message and secrecy constraint"):
  with members:
    - "compound multiple access channel with confidential messages"
    - "compound multiple access channels with partial cooperation"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "multiple access channels with generalized feedback and confidential messages"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-2 (induced by source paper "compound multiple access channel with confidential messages"):
  with members:
    - "compound multiple access channels with partial cooperation"
    - "multiple access channels with generalized feedback and confidential messages"

Connected through hyperedge HE-3 (induced by source paper "strong secrecy for multiple access channels"):
  with members:
    - "secrecy results for compound wiretap channels"
    - "the arbitrarily varying multiple access channel with conferencing encoders"
    - "strongly secure communications over the two way wiretap channel"
    - "mimo wiretap channels with arbitrarily varying eavesdropper channel states"
    - "the compound multiple access channel with partially cooperating encoders"
    - "fading cognitive multiple access channels with confidential messages"
    - "multiple access channels with generalized feedback and confidential messages"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-4 (induced by source paper "interference assisted secret communication"):
  with members:
    - "interference alignment for secrecy"
    - "providing secrecy with structured codes tools and applications to two user gaussian channels"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "sum capacity of the gaussian interference channel in the low interference regime"
    - "gaussian interference channel capacity to within one bit"
    - "cognitive interference channels with confidential messages"

Connected through hyperedge HE-5 (induced by source paper "a broadcast approach to secret key generation over slow fading channels"):
  with members:
    - "interference assisted secret communication"
    - "on the throughput of secure hybrid arq protocols for gaussian block fading channels"

Connected through hyperedge HE-6 (induced by source paper "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"):
  with members:
    - "information theoretic proofs of entropy power inequalities"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy in cooperative relay broadcast channels"
    - "secrecy capacity of a class of broadcast channels with an eavesdropper"
    - "the secrecy rate region of the broadcast channel"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-7 (induced by source paper "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"):
  with members:
    - "secure transmission with multiple antennas ii the mimome wiretap channel"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "a note on the secrecy capacity of the multi antenna wiretap channel"
    - "the mimome channel"
    - "multiple antenna secure broadcast over wireless networks"
    - "the secrecy capacity of the mimo wiretap channel"
    - "multiple access channels with generalized feedback and confidential messages"
    - "achievable rates for the general gaussian multiple access wire tap channel with collective secrecy"

Connected through hyperedge HE-8 (induced by source paper "fading cognitive multiple access channels with confidential messages"):
  with members:
    - "cooperation with an untrusted relay a secrecy perspective"
    - "information theoretically secret key generation for fading wireless channels"
    - "on the throughput of secure hybrid arq protocols for gaussian block fading channels"
    - "two hop secure communication using an untrusted relay"
    - "secrecy in cooperative relay broadcast channels"
    - "secure communication over fading channels"
    - "the gaussian multiple access wire tap channel with collective secrecy constraints"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

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)