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 network coding with nonuniform or restricted wiretap sets"
  Abstract: The secrecy capacity of a network, for a given collection of permissible wiretap sets, is the maximum rate of communication such that observing links in any permissible wiretap set reveal no information about the message. This paper considers secure network coding with nonuniform or restricted wiretap sets, for example, networks with unequal link capacities where a wiretapper can wiretap any subset of k links, or networks where only a subset of links can be wiretapped. Existing results show that for the case of uniform wiretap sets (networks with equal capacity links/packets where any k can be wiretapped), the secrecy capacity is given by a cut-set bound if random keys are injected at the source (and decoded at the sink), whether or not the communicating users have information about the choice of wiretap set. In contrast, we show that for the nonuniform case, this secrecy rate is achievable for the case of known but not unknown wiretap set. We give achievable linear optimization-based strategies where random keys are canceled at intermediate nonsink nodes or injected at intermediate nonsource nodes. Finally, we show that determining the secrecy capacity is an NP-hard problem.

Connected through hyperedge HE-1 (induced by source paper "network information theoretic security"):
  with members:
    - "enhancing the physical layer security of non orthogonal multiple access in large scale networks"
    - "polar coding for secret key generation"

Connected through hyperedge HE-2 (induced by source paper "on secure network coding for multiple unicast traffic"):
  with members:
    - "coding across unicast sessions can increase the secure message capacity"
    - "on secure network coding for two unicast sessions studying butterflies"
    - "lp formulations for secrecy over erasure networks with feedback"
    - "secret message capacity of a line network"
    - "the single source two terminal network with network coding"

Connected through hyperedge HE-3 (induced by source paper "secure network coding in the setting in which a non source node may generate random keys"):
  with members:
    - "on capacity region of wiretap networks"
    - "network coding capacity regions via entropy functions"
    - "universal secure network coding via rank metric codes"

Connected through hyperedge HE-4 (induced by source paper "local encoding preserving secure network coding part i fixed security level"):
  with members:
    - "alphabet size reduction for secure network coding a graph theoretic approach"
    - "on the optimality of secure network coding"
    - "variable rate linear network error correction mds codes"
    - "performance bounds on a wiretap network with arbitrary wiretap sets"
    - "universal secure network coding via rank metric codes"
    - "network codes resilient to jamming and eavesdropping"

Connected through hyperedge HE-5 (induced by source paper "secure communication over 1 2 1 networks"):
  with members:
    - "gaussian 1 2 1 networks capacity results for mmwave communications"
    - "robust beamforming for security in mimo wiretap channels with imperfect csi"

Connected through hyperedge HE-6 (induced by source paper "secure network code for adaptive and active attacks with no randomness in intermediate nodes"):
  with members:
    - "secrecy and robustness for active attack in secure network coding and its application to network quantum key distribution"
    - "universal secure multiplex network coding with dependent and non uniform messages"
    - "secure multi source multicast"
    - "coding across unicast sessions can increase the secure message capacity"
    - "quantum inspired secure wireless communication protocol under spatial and local gaussian noise assumptions"
    - "secure wireless communication under spatial and local gaussian noise assumptions"
    - "on secure network coding for two unicast sessions studying butterflies"
    - "relative generalized rank weight of linear codes and its applications to network coding"

Connected through hyperedge HE-7 (induced by source paper "on the equivalency of reliability and security metrics for wireline networks"):
  with members:
    - "perfectly secure index coding"
    - "graph theory versus minimum rank for index coding"
    - "using feedback for secrecy over graphs"
    - "on the capacity region for index coding"
    - "on secure network coding with uniform wiretap sets"
    - "achievability proof via output statistics of random binning"
    - "performance bounds on a wiretap network with arbitrary wiretap sets"
    - "dynamic index coding for wireless broadcast networks"

Connected through hyperedge HE-8 (induced by source paper "dynamic network control for confidential multi hop communications"):
  with members:
    - "message passing for maximum weight independent set"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "secure nested codes for type ii 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)