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: "interactive small step algorithms i axiomatization"
  Abstract: In earlier work, the Abstract State Machine Thesis -- that arbitrary#N#algorithms are behaviorally equivalent to abstract state machines -- was#N#established for several classes of algorithms, including ordinary, interactive,#N#small-step algorithms. This was accomplished on the basis of axiomatizations of#N#these classes of algorithms. Here we extend the axiomatization and, in a#N#companion paper, the proof, to cover interactive small-step algorithms that are#N#not necessarily ordinary. This means that the algorithms (1) can complete a#N#step without necessarily waiting for replies to all queries from that step and#N#(2) can use not only the environment's replies but also the order in which the#N#replies were received.

Connected through hyperedge HE-1 (induced by source paper "reactive turing machines"):
  with members:
    - "expressiveness modulo bisimilarity of regular expressions with parallel composition"
    - "computation tree logic with deadlock detection"
    - "branching bisimilarity with explicit divergence"

Connected through hyperedge HE-2 (induced by source paper "the generic model of computation"):
  with members:
    - "evolving algebras 1993 lipari guide"
    - "when are two algorithms the same"
    - "interactive small step algorithms ii abstract state machines and the characterization theorem"

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)