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: "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming"
  Abstract: We consider the Gaussian wiretap channel with M helpers, where no eavesdropper channel state information (CSI) is available at the legitimate entities. The exact secure d.o.f. of the Gaussian wiretap channel with M helpers with perfect CSI at the transmitters was found in [1], [2] to be M/(M+1). One of the key ingredients of the optimal achievable scheme in [1], [2] is to align cooperative jamming signals with the information symbols at the eavesdropper to limit the information leakage rate. This required perfect eavesdropper CSI at the transmitters. Motivated by the recent result in [3], we propose a new achievable scheme in which cooperative jamming signals span the entire space of the eavesdropper, but are not exactly aligned with the information symbols. We show that this scheme achieves the same secure d.o.f. of M/(M+1) in [1], [2] but does not require any eavesdropper CSI; the transmitters blindly cooperative jam the eavesdropper.

Connected through hyperedge HE-1 (induced by source paper "optimal secure gdof of symmetric gaussian wiretap channel with a helper"):
  with members:
    - "secure communication over interference channel to jam or not to jam"
    - "adding a helper can totally remove the secrecy constraints in interference channel"
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "on the optimality of secure communication without using cooperative jamming"
    - "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"
    - "the wiretapped diamond relay channel"
    - "finite snr regime analysis of the gaussian wiretap multiple access channel"
    - "secure degrees of freedom of one hop wireless networks"

Connected through hyperedge HE-2 (induced by source paper "on the gaussian multiple access wiretap channel and the gaussian wiretap channel with a helper achievable schemes and upper bounds"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "on the deterministic sum capacity of the multiple access wiretap channel"
    - "on multiuser gain and the constant gap sum capacity of the gaussian interfering multiple access channel"
    - "secure degrees of freedom of the multiple access wiretap channel with multiple antennas"
    - "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"
    - "secure degrees of freedom of the gaussian diamond wiretap channel"
    - "finite snr regime analysis of the gaussian wiretap multiple access channel"
    - "secure degrees of freedom of one hop wireless networks"

Connected through hyperedge HE-3 (induced by source paper "secure degrees of freedom regions of multiple access and interference channels the polytope structure"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "interference alignment for secrecy"
    - "on the secure degrees of freedom of the multiple access channel"
    - "ergodic secret alignment"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "real interference alignment with real numbers"

Connected through hyperedge HE-4 (induced by source paper "the wiretapped diamond relay channel"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "capacity bounds for diamond networks with an orthogonal broadcast channel"
    - "secure degrees of freedom of the gaussian diamond wiretap channel"
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "aligned image sets under channel uncertainty settling a conjecture by lapidoth shamai and wigger on the collapse of degrees of freedom under finite precision csit"
    - "achievability proof via output statistics of random binning"
    - "secrecy degrees of freedom of mimo broadcast channels with delayed csit"

Connected through hyperedge HE-5 (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"
    - "multiaccess channel with partially cooperating encoders and security constraints"

Connected through hyperedge HE-6 (induced by source paper "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"):
  with members:
    - "compute and forward can buy secrecy cheap"
    - "enabling the multi user generalized degrees of freedom in the gaussian cellular channel"
    - "upper bounds and duality relations of the linear deterministic sum capacity for cellular systems"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "the two user gaussian interference channel a deterministic view"
    - "a deterministic approach to wireless relay networks"
    - "the gaussian multiple access wire tap channel"

Connected through hyperedge HE-7 (induced by source paper "secure degrees of freedom of multi user networks one time pads in the air via alignment"):
  with members:
    - "secure degrees of freedom of one hop wireless networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "interference alignment for secrecy"
    - "strongly secure communications over the two way wiretap channel"
    - "on the secure degrees of freedom of the multiple access channel"
    - "ergodic secret alignment"
    - "cooperation with an untrusted relay a secrecy perspective"

Connected through hyperedge HE-8 (induced by source paper "secure degrees of freedom of one hop wireless networks"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "interference alignment for secrecy"
    - "mimo wiretap channels with arbitrarily varying eavesdropper channel states"
    - "on the secure degrees of freedom of the multiple access channel"
    - "ergodic secret alignment"
    - "cooperation with an untrusted relay a secrecy perspective"
    - "real interference alignment with real numbers"
    - "degraded compound multi receiver 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)