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 "fir digital filter design by sampled data h infinity discretization"):
  Abstract: FIR (finite impulse response) digital filter design is a fundamental problem in signal processing. In particular, FIR approximation of analog filters (or systems) is ubiquitous not only in signal processing but also in digital implementation of controllers. In this article, we propose a new design method of an FIR digital filter that optimally approximates a given analog filter in the sense of minimizing the H-infinity norm of the sampled-data error system. By using the lifting technique and the KYP (Kalman-Yakubovich-Popov) lemma, we reduce the H-infinity optimization to a convex optimization described by an LMI (linear matrix inequality). We also extend the method to multi-rate and multi-delay systems. A design example is shown to illustrate the effectiveness 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 "h infty optimal fractional delay filters")
  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 "h infty optimal fractional delay filters")
  Member "frequency domain min max optimization of noise shaping delta sigma modulators":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "min max design of feedback quantizers for netorwked control systems")

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)