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: "multiaccess channel with partially cooperating encoders and security constraints"
  Abstract: We study a special case of Willems's two-user multiaccess channel with partially cooperating encoders from a security perspective. This model differs from Willems's setup in that only one encoder, Encoder 1, is allowed to conference; Encoder 2 does not transmit any message, and there is an additional passive eavesdropper from whom the communication should be kept secret. For the discrete memoryless (DM) case, we establish inner and outer bounds on the capacity-equivocation region. The inner bound is based on a combination of Willems's coding scheme, noise injection, and additional binning that provides randomization for security. For the memoryless Gaussian model, we establish lower and upper bounds on the secrecy capacity. We also show that, under certain conditions, these bounds agree in some extreme cases of cooperation between the encoders. We illustrate our results through some numerical examples.

Connected through hyperedge HE-1 (induced by source paper "secure lossy source coding for some classes of helper and gray wyner models"):
  with members:
    - "on secure source coding with side information at the encoder"
    - "secure degrees of freedom of mimo x channels with output feedback and delayed csit"
    - "secure source coding with a public helper"
    - "bounds on the capacity of the relay channel with noncausal state at source"
    - "secure lossless compression with side information"
    - "on the secure degrees of freedom of wireless x networks"
    - "the secrecy capacity of the mimo wiretap channel"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-2 (induced by source paper "on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation"):
  with members:
    - "outer bounds on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation"
    - "topological interference management through index coding"
    - "secrecy in the 2 user symmetric deterministic interference channel with transmitter cooperation"
    - "interference alignment for secrecy"
    - "interference assisted secret communication"
    - "interference channels with source cooperation"
    - "interference mitigation through limited transmitter cooperation"
    - "the approximate capacity region of the gaussian z interference channel with conferencing encoders"

Connected through hyperedge HE-3 (induced by source paper "outer bounds on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation"):
  with members:
    - "on the secrecy capacity region of the 2 user z interference channel with unidirectional transmitter cooperation"
    - "secrecy in the 2 user symmetric deterministic interference channel with transmitter cooperation"
    - "interference alignment for secrecy"
    - "interference assisted secret communication"
    - "interference channels with source cooperation"
    - "interference mitigation through limited transmitter cooperation"
    - "the approximate capacity region of the gaussian z interference channel with conferencing encoders"
    - "gaussian z interference channel with a relay link achievability region and asymptotic sum capacity"

Connected through hyperedge HE-4 (induced by source paper "secrecy in mimo networks with no eavesdropper csit"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "secure degrees of freedom of the multiple access wiretap channel with multiple antennas"
    - "secure degrees of freedom for the mimo wire tap channel with a multi antenna cooperative jammer"
    - "secure degrees of freedom of one hop wireless networks"
    - "feasibility of interference alignment for the mimo interference channel"
    - "blind mimome wiretap channel with delayed csit"
    - "mimo broadcast channel with an unknown eavesdropper secrecy degrees of freedom"
    - "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"

Connected through hyperedge HE-5 (induced by source paper "finite state markov wiretap channel with delayed feedback"):
  with members:
    - "multiple access relay wiretap channel"
    - "relay broadcast channel with confidential messages"
    - "secret writing on dirty paper a deterministic view"
    - "interference assisted secret communication"
    - "on the capacity of memoryless finite state multiple access channels with asymmetric state information at the encoders"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "secure degrees of freedom of wireless x networks using artificial noise alignment"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "secure degrees of freedom of mimo x channels with output feedback and delayed csit"
    - "on x channels with feedback and delayed csi"
    - "secure communication over parallel relay channel"
    - "on achievable degrees of freedom for mimo x channels"
    - "interference alignment for secrecy"
    - "interference assisted secret communication"

Connected through hyperedge HE-7 (induced by source paper "on sdof of multi receiver wiretap channel with alternating csit"):
  with members:
    - "on miso broadcast channel with alternating csit and secrecy constraints"
    - "secure degrees of freedom region of the two user miso broadcast channel with alternating csit"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "secure degrees of freedom of mimo x channels with output feedback and delayed csit"
    - "degrees of freedom of time correlated miso broadcast channel with delayed csit"
    - "optimal use of current and outdated channel state information degrees of freedom of the miso bc with mixed csit"
    - "secure communication over parallel relay channel"
    - "interference alignment for the mimo interference channel with delayed local csit"

Connected through hyperedge HE-8 (induced by source paper "on miso broadcast channel with alternating csit and secrecy constraints"):
  with members:
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "secure degrees of freedom of mimo x channels with output feedback and delayed csit"
    - "degrees of freedom of time correlated miso broadcast channel with delayed csit"
    - "optimal use of current and outdated channel state information degrees of freedom of the miso bc with mixed csit"
    - "secure communication over parallel relay channel"
    - "interference alignment for the mimo interference channel with delayed local csit"
    - "secrecy degrees of freedom of mimo broadcast channels with delayed csit"
    - "completely stale transmitter channel state information is still very useful"

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)