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: "modal interface automata"
  Abstract: De Alfaro and Henzinger's Interface Automata (IA) and Nyman et al.'s recent#N#combination IOMTS of IA and Larsen's Modal Transition Systems (MTS) are#N#established frameworks for specifying interfaces of system components. However,#N#neither IA nor IOMTS consider conjunction that is needed in practice when a#N#component shall satisfy multiple interfaces, while Larsen's MTS-conjunction is#N#not closed and Bene\v{s} et al.'s conjunction on disjunctive MTS does not treat#N#internal transitions. In addition, IOMTS-parallel composition exhibits a#N#compositionality defect. This article defines conjunction (and also#N#disjunction) on IA and disjunctive MTS and proves the operators to be#N#'correct', i.e., the greatest lower bounds (least upper bounds) wrt. IA- and#N#resp. MTS-refinement. As its main contribution, a novel interface theory called#N#Modal Interface Automata (MIA) is introduced: MIA is a rich subset of IOMTS#N#featuring explicit output-must-transitions while input-transitions are always#N#allowed implicitly, is equipped with compositional parallel, conjunction and#N#disjunction operators, and allows a simpler embedding of IA than Nyman's. Thus,#N#it fixes the shortcomings of related work, without restricting designers to#N#deterministic interfaces as Raclet et al.'s modal interface theory does.

Connected through hyperedge HE-1 (induced by source paper "towards an i o conformance testing theory for software product lines based on modal interface automata"):
  with members:
    - "interface theories for a synchronously communicating modal i o transition systems"

Connected through hyperedge HE-2 (induced by source paper "proving continuity of coinductive global bisimulation distances a never ending story"):
  with members:
    - "distances for weighted transition systems games and properties"

Connected through hyperedge HE-3 (induced by source paper "quotient of acceptance specifications under reachability constraints"):
  with members:
    - "hennessy milner logic with greatest fixed points as a complete behavioural specification theory"
    - "weighted modal transition 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.LO(Logic in Computer Science)