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: "java lambda a featherweight story"
  Abstract: We present FJ&$\lambda$, a new core calculus that extends Featherweight Java#N#(FJ) with interfaces, supporting multiple inheritance in a restricted form,#N#$\lambda$-expressions, and intersection types. Our main goal is to formalise#N#how lambdas and intersection types are grafted on Java 8, by studying their#N#properties in a formal setting. We show how intersection types play a#N#significant role in several cases, in particular in the typecast of a#N#$\lambda$-expression and in the typing of conditional expressions. We also#N#embody interface \emph{default methods} in FJ&$\lambda$, since they increase#N#the dynamism of $\lambda$-expressions, by allowing these methods to be called#N#on $\lambda$-expressions.#N#  The crucial point in Java 8 and in our calculus is that $\lambda$-expressions#N#can have various types according to the context requirements (target types):#N#indeed, Java code does not compile when $\lambda$-expressions come without#N#target types. In particular, in the operational semantics we must record target#N#types by decorating $\lambda$-expressions, otherwise they would be lost in the#N#runtime expressions.#N#  We prove the subject reduction property and progress for the resulting#N#calculus, and we give a type inference algorithm that returns the type of a#N#given program if it is well typed. The design of FJ&$\lambda$ has been driven#N#by the aim of making it a subset of Java 8, while preserving the elegance and#N#compactness of FJ. Indeed, FJ&$\lambda$ programs are typed and behave the same#N#as Java programs.

Connected through hyperedge HE-1 (induced by source paper "soundness conditions for big step semantics"):
  with members:
    - "coaxioms flexible coinductive definitions by inference systems"
    - "flag based big step semantics"
    - "coinductive big step operational semantics"
    - "general recursion via coinductive types"

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)