human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "jammer assisted resource allocation in secure ofdma with untrusted users"):
  Abstract: In this paper, we consider the problem of resource allocation in the orthogonal frequency division multiple access system with single source and M untrusted users in presence of a friendly jammer. The jammer is used to improve either the weighted sum secure rate or the overall system fairness. The formulated optimization problem in both the cases is a mixed integer non-linear programming problem, belonging to the class of NP-hard. In the sum secure rate maximization scenario, we decouple the problem and first obtain the subcarrier allocation at source and the decision for jammer power utilization on a per-subcarrier basis. Then, we do joint source and jammer power allocation using primal decomposition and alternating optimization framework. Next, we consider fair resource allocation by introducing a novel concept of subcarrier snatching with the help of jammer. We propose two schemes for jammer power utilization, called proactively fair allocation (PFA) and on-demand allocation (ODA). PFA considers equitable distribution of jammer power among the subcarriers, while ODA distributes jammer power based on the user demand. In both cases of jammer usage, we also present suboptimal solutions that solve the power allocation at a highly reduced complexity. Asymptotically optimal solutions are derived to benchmark optimality of the proposed schemes. We compare the performance of our proposed schemes with equal power allocation at source and jammer. Our simulation results demonstrate that the jammer can indeed help in improving either the sum secure rate or the overall system fairness.

Includes members:
  Member "principles of physical layer security in multiuser wireless networks a survey":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "secrecy sum rates for multi user mimo regularized channel inversion precoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robustness of low complexity massive mimo architectures against passive eavesdropping")
  Member "on the complexity of joint subcarrier and power allocation for multi user ofdma systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "harq cc enabled noma designs with outage probability constraints")
  Member "on tractability aspects of optimal resource allocation in ofdma systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "resource optimization with flexible numerology and frame structure for heterogeneous services")
  Member "interference assisted secret communication":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dispensing with noise forward in the weak relay eavesdropper channel")
  Member "power and subcarrier allocation for physical layer security in ofdma based broadband wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "subcarrier pairing as channel gain tailoring joint resource allocation for relay assisted secure ofdma with untrusted users")
  Member "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "coexistence mechanism between embb and urllc in 5g wireless networks")

Question: Please tell me which class the source paper 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)