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 "a switch to the concern of user importance coefficient in utility distribution and message importance measure"):
  Abstract: This paper mainly focuses on the utilization frequency in receiving end of communication systems, which shows the inclination of the user about different symbols. When the average number of use is limited, a specific utility distribution is proposed on the best effort in term of fairness, which is also the closest one to occurring probability in the relative entropy. Similar to a switch, its parameter can be selected to make it satisfy different users' requirements: negative parameter means the user focus on high-probability events and positive parameter means the user is interested in small-probability events. In fact, the utility distribution is a measure of message importance in essence. It illustrates the meaning of message importance measure (MIM), and extend it to the general case by selecting the parameter. Numerical results show that this utility distribution characterizes the message importance like MIM and its parameter determines the concern of users.

Includes members:
  Member "amplifying inter message distance on information divergence measures in big data":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "importance of small probability events in big data information measures applications and challenges")
  Member "focusing on a probability element parameter selection of message importance measure in big data":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "importance of small probability events in big data information measures applications and challenges")
  Member "message importance measure and its application to minority subset detection in big data":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "storage space allocation strategy for digital data with message importance")
  Member "wireless communications in the era of big data":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "artificial intelligence enabled wireless networking for 5g and beyond recent advances and future challenges")
  Member "renyi divergence and kullback leibler divergence":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "review analyze and design a comprehensive deep reinforcement learning framework")
  Member "identifying the signs of fraudulent accounts using data mining techniques":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "memory augmented generative adversarial networks for anomaly detection")

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)