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: "formalizing randomized matching algorithms"
  Abstract: Using Je\v{r}\'abek 's framework for probabilistic reasoning, we formalize#N#the correctness of two fundamental RNC^2 algorithms for bipartite perfect#N#matching within the theory VPV for polytime reasoning. The first algorithm is#N#for testing if a bipartite graph has a perfect matching, and is based on the#N#Schwartz-Zippel Lemma for polynomial identity testing applied to the Edmonds#N#polynomial of the graph. The second algorithm, due to Mulmuley, Vazirani and#N#Vazirani, is for finding a perfect matching, where the key ingredient of this#N#algorithm is the Isolating Lemma.

Connected through hyperedge HE-1 (induced by source paper "consistency of circuit lower bounds with bounded theories"):
  with members:
    - "pseudodeterministic constructions in subexponential time"
    - "robust simulations and significant separations"

Connected through hyperedge HE-2 (induced by source paper "feasible combinatorial matrix theory"):
  with members:
    - "efficient csl model checking using stratification"

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.LO(Logic in Computer Science)