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 "h infty optimal fractional delay filters"):
  Abstract: Fractional delay filters are digital filters to delay discrete-time signals by a fraction of the sampling period. Since the delay is fractional, the intersample behavior of the original analog signal becomes crucial. In contrast to the conventional designs based on the Shannon sampling theorem with the band-limiting hypothesis, the present paper proposes a new approach based on the modern sampled-data H∞ optimization that aims at restoring the intersample behavior beyond the Nyquist frequency. By using the lifting transform or continuous-time blocking the design problem is equivalently reduced to a discrete-time H∞ optimization, which can be effectively solved by numerical computation softwares. Moreover, a closed-form solution is obtained under an assumption on the original analog signals. Design examples are given to illustrate the advantage of the proposed method.

Includes members:
  Member "min max design of fir digital filters by semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fir digital filter design by sampled data h infinity discretization")
  Member "signal reconstruction via h infty sampled data control theory beyond the shannon paradigm":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fir digital filter design by sampled data h infinity discretization")

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)