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: "justifications for common knowledge"
  Abstract: Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a Kripke-style semantics that is similar to Fitting's semantics for the Logic of Proofs LP. We show the soundness, completeness, and finite model property of our multi-agent justification logic with respect to this Kripke-style semantics. We demonstrate that our logic is a conservative extension of Yavorskaya's minimal bimodal explicit evidence logic, which is a two-agent version of LP. We discuss the relationship of our logic to the multi-agent modal logic S4 with common knowledge. Finally, we give a brief analysis of the coordinated attack problem in the newly developed language of our logic.

Connected through hyperedge HE-1 (induced by source paper "time stamped claim logic"):
  with members:
    - "a formal approach to analyzing cyber forensics evidence"
    - "a logic for reasoning about evidence"

Connected through hyperedge HE-2 (induced by source paper "temporal justification logic"):
  with members:
    - "some notes on temporal justification logic"
    - "complete axiomatizations for reasoning about knowledge and time"

Connected through hyperedge HE-3 (induced by source paper "a logic of knowing why"):
  with members:
    - "beyond knowing that a new generation of epistemic logics"
    - "bundled fragments of first order modal logic un decidability"
    - "knowing values and public inspection"
    - "a new modal framework for epistemic logic"
    - "a logic of knowing how"
    - "dealing with logical omniscience expressiveness and pragmatics"

Connected through hyperedge HE-4 (induced by source paper "the complexity of non iterated probabilistic justification logic"):
  with members:
    - "on the complexity of probabilistic justification logic"
    - "nexp completeness and universal hardness results for justification logic"

Connected through hyperedge HE-5 (induced by source paper "some notes on temporal justification logic"):
  with members:
    - "complete axiomatizations for reasoning about knowledge and time"

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)