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 "full length article zak transforms and gabor frames of totally positive functions and exponential b splines"):
  Abstract: We study totally positive (TP) functions of finite type and exponential B-splines as window functions for Gabor frames. We establish the connection of the Zak transform of these two classes of functions and prove that the Zak transforms have only one zero in their fundamental domain of quasi-periodicity. Our proof is based on the variation-diminishing property of shifts of exponential B-splines. For the exponential B-spline B"m of order m, we determine a set of lattice parameters @a,@b>0 such that the Gabor family G(B"m,@a,@b) of time-frequency shifts e^2^@p^i^l^@bB"m(@?-k@a), k,l@?Z, is a frame for L^2(R). By the connection of its Zak transform to the Zak transform of TP functions of finite type, our result provides an alternative proof that TP functions of finite type provide Gabor frames for all lattice parameters with @a@b<1. For even two-sided exponentials g(x)=@l2e^-^@l^|^x^| we find lower frame-bounds A, which show the asymptotically linear decay A~(1-@a@b) as the density @a@b of the time-frequency lattice tends to the critical density @a@b=1.

Includes members:
  Member "the abc problem for gabor systems":
    also connected through other hyperedges:
      (none)
  Member "discretized gabor frames of totally positive functions":
    also connected through other hyperedges:
      (none)

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)