human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on sequences rational functions and decomposition"
  Abstract: It is classical that well-known identities and properties of partial quotients furnish rational approximation in $$\mathbb {F}[[x^{-1}]]$$F[[x-1]]. For a rational function, this is the extended Euclidean algorithm in $$\mathbb {F}[x]$$F[x]. Berlekamp's heuristic solution of the `key equation' essentially approximates an element of $$\mathbb {F}[x]$$F[x] with constant term 1 via a quotient of reciprocals, and his solutions satisfy a number of identities. In earlier papers we gave a solution of an analogous problem using $$\mathrm {D}[x^{-1},x], \mathrm {D}$$D[x-1,x],D a commutative domain. The linear complexity (of a finite initial subsequence) of an infinite sequence over $$\mathbb {F}$$F has been related to the degrees of its partial quotients by Mills, Cheng, Niederreiter and others. We use first principles and induction to relate these linear complexities to the degrees of its partial quotients. Berlekamp has also described the set of solutions of the key equation. We define a pairing of minimal solutions and a `minimal system' of a finite sequence over $$\mathrm {D}$$D. Examples are classical approximation in $$\mathbb {F}[[x^{-1}]]$$F[[x-1]] and approximation using $$\mathrm {D}[x^{-1},x]$$D[x-1,x]. We use minimal systems to generalise results of Massey and Niederreiter to arbitrary solutions, including numerators. This includes explicit and unique decomposition of both parts of a solution into a sum of (polynomial) multiples of solutions with minimal degree denominators. The unique multipliers also satisfy degree constraints. We give several applications to gcd's of sequence polynomials and relate partial-quotient solutions to solutions derived using $$\mathbb {F}[x^{-1},x]$$F[x-1,x]. We give a precise count of the number of solutions when the field is finite. Our final application concerns when the first component of a minimal solution vanishes at some scalar; a simple modification of our approach gives a new solution, the first component of which does not vanish at the scalar and which has minimal degree. We also describe the corresponding set of solutions. This simplifies and generalises work of Salagean. We conclude that numerators (or second components) of solutions can play a significant role in proofs of properties of denominators (or first components) and that they enjoy similar properties.

Connected through hyperedge HE-1 (induced by source paper "on the annihilator ideal of an inverse form"):
  with members:
    - "the berlekamp massey algorithm via minimal polynomials"

Question: Please tell me which class the center node 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.SC(Symbolic Computation)