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: "advanced automata minimization"
  Abstract: We present an efficient algorithm to reduce the size of nondeterministic Buchi word automata, while retaining their language. Additionally, we describe methods to solve PSPACE-complete automata problems like universality, equivalence and inclusion for much larger instances (1-3 orders of magnitude) than before. This can be used to scale up applications of automata in formal verification tools and decision procedures for logical theories. The algorithm is based on new transition pruning techniques. These use criteria based on combinations of backward and forward trace inclusions. Since these relations are themselves PSPACE-complete, we describe methods to compute good approximations of them in polynomial time. Extensive experiments show that the average-case complexity of our algorithm scales quadratically. The size reduction of the automata depends very much on the class of instances, but our algorithm consistently outperforms all previous techniques by a wide margin. We tested our algorithm on Buchi automata derived from LTL-formulae, many classes of random automata and automata derived from mutual exclusion protocols, and compared its performance to the well-known automata tool GOAL.

Connected through hyperedge HE-1 (induced by source paper "language inclusion for finite prime event structures"):
  with members:
    - "quasi optimal partial order reduction"
    - "unfolding based partial order reduction"
    - "from non preemptive to preemptive scheduling using synchronization synthesis"
    - "configuration structures event structures and petri nets"

Connected through hyperedge HE-2 (induced by source paper "efficient reduction of nondeterministic automata with application to language inclusion testing"):
  with members:
    - "reduction of nondeterministic tree automata"
    - "what are strategies in delay games borel determinacy for games with lookahead"
    - "buffered simulation games for buchi automata"
    - "degrees of lookahead in regular infinite games"
    - "buchi complementation and size change termination"

Connected through hyperedge HE-3 (induced by source paper "minimization of visibly pushdown automata using partial max sat"):
  with members:
    - "reduction of nondeterministic tree automata"
    - "b uchi automata can have smaller quotients"
    - "beyond language equivalence on visibly pushdown automata"

Connected through hyperedge HE-4 (induced by source paper "multi buffer simulations for trace language inclusion"):
  with members:
    - "conditionally optimal algorithms for generalized buchi games"
    - "buffered simulation games for buchi automata"
    - "three applications to rational relations of the high undecidability of the infinite post correspondence problem in a regular omega language"
    - "degrees of lookahead in regular infinite games"

Connected through hyperedge HE-5 (induced by source paper "minimization of buchi automata using fair simulation"):
  with members:
    - "termination analysis by learning terminating programs"
    - "minimisation of deterministic parity and buchi automata and relative minimisation of deterministic finite automata"
    - "aspects of enumeration and generation with a string automata representation"

Connected through hyperedge HE-6 (induced by source paper "parity game reductions"):
  with members:
    - "an o m log n algorithm for stuttering equivalence and branching bisimulation"
    - "branching bisimilarity checking for prs"
    - "benchmarks for parity games"

Connected through hyperedge HE-7 (induced by source paper "reducing nondeterministic tree automata by adding transitions"):
  with members:
    - "efficient reduction of nondeterministic automata with application to language inclusion testing"
    - "reduction of nondeterministic tree automata"
    - "fully automated shape analysis based on forest automata"

Connected through hyperedge HE-8 (induced by source paper "antichains for inclusion games"):
  with members:
    - "lazy automata techniques for ws1s"
    - "saturation algorithms for model checking pushdown systems"

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.FL(Formal Languages and Automata Theory)