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 "maximal packing with interference constraints"):
  Abstract: In this work, we study the problem of scheduling a maximal set of transmitters subjected to an interference constraint across all the nodes. Given a set of nodes, the problem reduces to finding the maximum cardinality of a subset of nodes that can concurrently transmit without violating interference constraints. The resulting packing problem is a binary optimization problem and is NP hard. We propose a semi-definite relaxation (SDR) for this problem and provide bounds on the relaxation.

Includes members:
  Member "how well can graphs represent wireless interference":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "introduction to local certification")
  Member "algorithms for wireless capacity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reception capacity definitions game theory and hardness")
  Member "wireless capacity with arbitrary gain matrix":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "reception capacity definitions game theory and hardness")
  Member "a constant factor approximation for wireless capacity maximization with power control in the sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reception capacity definitions game theory and hardness")
  Member "wireless scheduling with power control":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effective wireless scheduling via hypergraph sketches")

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)