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 one hop wireless networks"
  Abstract: We study the secure degrees of freedom (d.o.f.) of one-hop wireless networks by considering four fundamental wireless network structures: 1) Gaussian wiretap channel; 2) Gaussian broadcast channel with confidential messages; 3) Gaussian interference channel with confidential messages; and 4) Gaussian multiple access wiretap channel. The secrecy capacity of the canonical Gaussian wiretap channel does not scale with the transmit power, and hence, the secure d.o.f. of the Gaussian wiretap channel with no helpers is zero. It has been known that a strictly positive secure d.o.f. can be obtained in the Gaussian wiretap channel by using a helper, which sends structured cooperative signals. We show that the exact secure d.o.f. of the Gaussian wiretap channel with a helper is    ${{1}\over{2}}$   . Our achievable scheme is based on real interference alignment and cooperative jamming, which renders the message signal and the cooperative jamming signal separable at the legitimate receiver, but aligns them perfectly at the eavesdropper preventing any reliable decoding of the message signal. Our converse is based on two key lemmas. The first lemma quantifies the secrecy penalty by showing that the net effect of an eavesdropper on the system is that it eliminates one of the independent channel inputs. The second lemma quantifies the role of a helper by developing a direct relationship between the cooperative jamming signal of a helper and the message rate. We extend this result to the case of    $M$    helpers, and show that the exact secure d.o.f. in this case is    ${{M}\over{M+1}}$   . We then generalize this approach to more general network structures with multiple messages. We show that the sum secure d.o.f. of the Gaussian broadcast channel with confidential messages and    $M$    helpers is 1, the sum secure d.o.f. of the two-user interference channel with confidential messages is    ${{2}\over{3}}$   , the sum secure d.o.f. of the two-user interference channel with confidential messages and    $M$    helpers is 1, and the sum secure d.o.f. of the    $K$   -user multiple access wiretap channel is    ${{K(K-1)}\over{K(K-1)+1}}$   .

Connected through hyperedge HE-1 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding"):
  with members:
    - "homologous codes for multiple access channels"
    - "gaussian multiple access via compute and forward"
    - "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward"
    - "an achievable rate region for the three user interference channel based on coset codes"
    - "equivalence of additive combinatorial linear inequalities for shannon entropy and differential entropy"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "secure compute and forward in a bidirectional relay"
    - "distributed decode forward for relay networks"

Connected through hyperedge HE-2 (induced by source paper "adding common randomness can remove the secrecy constraints in communication networks"):
  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"
    - "optimal secure gdof of symmetric gaussian wiretap channel with a helper"
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"
    - "finite snr regime analysis of the gaussian wiretap multiple access channel"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"

Connected through hyperedge HE-3 (induced by source paper "secure retrospective interference alignment"):
  with members:
    - "secrecy in mimo networks with no eavesdropper csit"
    - "secure degrees of freedom region of the two user miso broadcast channel with alternating csit"
    - "ergodic interference alignment with delayed feedback"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "interference alignment for secrecy"
    - "completely stale transmitter channel state information is still very useful"
    - "ergodic secret alignment"

Connected through hyperedge HE-4 (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"
    - "real interference alignment exploiting the potential of single antenna systems"

Connected through hyperedge HE-5 (induced by source paper "secure communication over interference channel to jam or not to jam"):
  with members:
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "interference alignment for secrecy"
    - "interference alignment from degrees of freedom to constant gap capacity approximations"
    - "capacity bounds for broadcast channels with confidential messages"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"

Connected through hyperedge HE-6 (induced by source paper "adding a helper can totally remove the secrecy constraints in interference channel"):
  with members:
    - "secure communication over interference channel to jam or not to jam"
    - "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"
    - "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "interference alignment for secrecy"
    - "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-7 (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"
    - "real interference alignment exploiting the potential of single antenna systems"

Connected through hyperedge HE-8 (induced by source paper "secure degrees of freedom of one hop wireless networks with no eavesdropper csit"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "mimo broadcast channel with an unknown eavesdropper secrecy degrees of freedom"
    - "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"
    - "secure degrees of freedom of k user gaussian interference channels a unified view"
    - "wireless network information flow a deterministic approach"
    - "interference alignment for secrecy"
    - "interference assisted secret communication"
    - "ergodic secret alignment"

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)