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 "on landau s eigenvalue theorem and information cut sets"):
  Abstract: A variation of Landau's eigenvalue theorem describing the phase transition of the eigenvalues of a time-frequency limiting, self adjoint operator is presented. The total number of degrees of freedom of square-integrable, multi-dimensional, bandlimited functions is defined in terms of Kolmogorov's $n$-width and computed in some limiting regimes where the original theorem cannot be directly applied. Results are used to characterize up to order the total amount of information that can be transported in time and space by multiple-scattered electromagnetic waves, rigorously addressing a question originally posed in the early works of Toraldo di Francia and Gabor. Applications in the context of wireless communication and electromagnetic sensing are discussed.

Includes members:
  Member "the capacity of wireless channels a physical approach":
    also connected through other hyperedges:
      (none)
  Member "capacity scaling of wireless ad hoc networks shannon meets maxwell":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "network decomposed hierarchical cooperation in ad hoc networks with social relationships")

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)