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 the complexity of solving quadratic boolean systems"
  Abstract: A fundamental problem in computer science is that of finding all the common zeros of m quadratic polynomials in n unknowns over F"2. The cryptanalysis of several modern ciphers reduces to this problem. Up to now, the best complexity bound was reached by an exhaustive search in 4log"2n2^n operations. We give an algorithm that reduces the problem to a combination of exhaustive search and sparse linear algebra. This algorithm has several variants depending on the method used for the linear algebra step. We show that, under precise algebraic assumptions on the input system, the deterministic variant of our algorithm has complexity bounded by O(2^0^.^8^4^1^n) when m=n, while a probabilistic variant of the Las Vegas type has expected complexity O(2^0^.^7^9^2^n). Experiments on random systems show that the algebraic assumptions are satisfied with probability very close to 1. We also give a rough estimate for the actual threshold between our method and exhaustive search, which is as low as 200, and thus very relevant for cryptographic applications.

Connected through hyperedge HE-1 (induced by source paper "ramesses a rank metric encryption scheme with short keys"):
  with members:
    - "an algebraic attack on rank metric code based cryptosystems"
    - "repairing the faure loidreau public key cryptosystem"
    - "polynomial time key recovery attack on the faure loidreau scheme based on gabidulin codes"
    - "enumerative coding for grassmannian space"

Connected through hyperedge HE-2 (induced by source paper "on the chordality of polynomial sets in triangular decomposition in top down style"):
  with members:
    - "sparse fglm algorithms"
    - "chordal networks of polynomial ideals"
    - "exploiting chordal structure in polynomial ideals a grobner bases approach"
    - "sparse grobner bases the unmixed case"
    - "on the efficiency of solving boolean polynomial systems with the characteristic set method"
    - "a new algorithmic scheme for computing characteristic sets"

Connected through hyperedge HE-3 (induced by source paper "fast quantum algorithm for solving multivariate quadratic equations"):
  with members:
    - "powers of tensors and fast matrix multiplication"

Connected through hyperedge HE-4 (induced by source paper "complexity bounds for computing critical points with grobner bases algorithms the mixed case"):
  with members:
    - "a nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets"
    - "intrinsic complexity estimates in polynomial optimization"
    - "critical points and gr obner bases the unmixed case"
    - "on the complexity of the generalized minrank problem"
    - "polynomial time computing over quadratic maps i sampling in real algebraic sets"

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)