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: "strong secrecy for multiple access channels"
  Abstract: We show strongly secret achievable rate regions for two different wiretap multiple-access channel coding problems. In the first problem, each encoder has a private message and both together have a common message to transmit. The encoders have entropy-limited access to common randomness. If no common randomness is available, then the achievable region derived here does not allow for the secret transmission of a common message. The second coding problem assumes that the encoders do not have a common message nor access to common randomness. However, they may have a conferencing link over which they may iteratively exchange rate-limited information. This can be used to form a common message and common randomness to reduce the second coding problem to the first one. We give the example of a channel where the achievable region equals zero without conferencing or common randomness and where conferencing establishes the possibility of secret message transmission. Both coding problems describe practically relevant networks which need to be secured against eavesdropping attacks.

Connected through hyperedge HE-1 (induced by source paper "secrecy rates for a channel with two senders and two receivers"):
  with members:
    - "energy efficient multicell multigroup multicasting with joint beamforming and antenna selection"
    - "secure multi source multicast"
    - "fourier motzkin elimination software for information theoretic inequalities"
    - "semantic security capacity for wiretap channels of type ii"
    - "secrecy capacity region of some classes of wiretap broadcast channels"
    - "distributed channel synthesis"
    - "achievability proof via output statistics of random binning"
    - "multi receiver wiretap channel with public and confidential messages"

Connected through hyperedge HE-2 (induced by source paper "secure broadcasting using independent secret keys"):
  with members:
    - "secrecy results for compound wiretap 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-3 (induced by source paper "joint secrecy over the k transmitter multiple access channel"):
  with members:
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-4 (induced by source paper "a channel under simultaneous jamming and eavesdropping attack correlated random coding capacities under strong secrecy criteria"):
  with members:
    - "arbitrarily varying wiretap channels with type constrained states"
    - "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"
    - "secrecy results for compound wiretap channels"
    - "capacity results for arbitrarily varying wiretap channels"
    - "strong secrecy from channel resolvability"

Connected through hyperedge HE-5 (induced by source paper "mitigating rate loss in fading multiple access wiretap channel to achieve shannon capacity region"):
  with members:
    - "achieving shannon capacity in a fading wiretap channel"
    - "achieving shannon capacity region as secrecy rate region in a multiple access wiretap channel"
    - "previous messages provide the key to achieve shannon capacity in a wiretap channel"
    - "achievable secrecy sum rate in a fading mac wt with power control and without csi of eavesdropper"
    - "strong secrecy from channel resolvability"
    - "the wiretap channel with feedback encryption over the channel"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-6 (induced by source paper "multiple access relay wiretap channel"):
  with members:
    - "interference assisted secret communication"
    - "capacity bounds for broadcast channels with confidential messages"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "secrecy in cooperative relay broadcast channels"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-7 (induced by source paper "enhancing secrecy rate region for recent messages for a slotted multiple access wiretap channel to shannon capacity region"):
  with members:
    - "achieving shannon capacity region as secrecy rate region in a multiple access wiretap channel"
    - "achieving shannon capacity in a wiretap channel via previous messages"
    - "previous messages provide the key to achieve shannon capacity in a wiretap channel"
    - "achievable secrecy sum rate in a fading mac wt with power control and without csi of eavesdropper"

Connected through hyperedge HE-8 (induced by source paper "the arbitrarily varying wiretap channel deterministic and correlated random coding capacities under the strong secrecy criterion"):
  with members:
    - "secrecy results for compound wiretap channels"
    - "capacity results for arbitrarily varying wiretap channels"
    - "strong secrecy from channel resolvability"

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)