Update README.md

README.md

@@ -7,4 +7,8 @@ tags: []
  
 In-situ graph reasoning and knowledge expansion are important elements in the advancement of automated systems for scientific discovery. 
 
-This paper introduces Graph-PReFLexOR (Graph-based Preference-based Recursive Language Modeling for Exploratory Optimization of Reasoning), a generative framework designed to perform dynamic graph reasoning and iteratively expand domain knowledge. Graph-PReFLexOR is trained inspired by reinforcement learning methods, and leverages construct detailed knowledge graphs and abstract representations, enabling hierarchical reasoning and adaptive learning, to achieve \textit{in situ} graph generation, symbolic representation of arguments and logical deduction, to ultimately formulate a response to tasks. Critically, Graph-PReFLexOR formalizes reasoning as a structured mapping $\mathcal{M}: \mathcal{T} \rightarrow (\mathcal{G}, \mathcal{P}, \mathcal{A})$, where a task \( \mathcal{T} \) produces a  graph representation \( \mathcal{G} \), abstract patterns \( \mathcal{P} \), and final answers \( \mathcal{A} \). Inspired by category theory modeling that emphasizes how objects relate, rather than their internal detail, the graph \( \mathcal{G} = (V, E) \) encodes concepts as nodes \( V \) and relationships as directed edges \( E \). By combining \textit{in situ} symbolic and contextual inference, the framework generates its own structured representation on the fly and thereby captures complex interdependencies and translates them into domain-specific interpretable insights. Demonstrations include generating and expanding scientific hypotheses and fabricating dynamic transformations in graph topologies, with applications in materials science and engineering, and multi-disciplinary relationship discovery. For instance, Graph-PReFLexOR demonstrates creative reasoning by generating poetic representations that blend abstract concepts like `thin places'--mythological notions of blurred boundaries--into scientific frameworks such as protein biomaterials engineering. Through its knowledge garden growth strategy, the model dynamically integrates insights from diverse domains, enabling the discovery of profound interdisciplinary connections that link art, philosophy, and science.
+This paper introduces Graph-PReFLexOR (Graph-based Preference-based Recursive Language Modeling for Exploratory Optimization of Reasoning), a generative framework designed to perform dynamic graph reasoning and iteratively expand domain knowledge. Graph-PReFLexOR is trained inspired by reinforcement learning methods, and leverages construct detailed knowledge graphs and abstract representations, enabling hierarchical reasoning and adaptive learning, to achieve in-situ graph generation, symbolic representation of arguments and logical deduction, to ultimately formulate a response to tasks. Critically, Graph-PReFLexOR formalizes reasoning as a structured mapping. Inspired by category theory modeling that emphasizes how objects relate, rather than their internal detail, the graph encodes concepts as nodes and relationships as directed edges. 
+
+By combining in -situ symbolic and contextual inference, the framework generates its own structured representation on the fly and thereby captures complex interdependencies and translates them into domain-specific interpretable insights. Demonstrations include generating and expanding scientific hypotheses and fabricating dynamic transformations in graph topologies, with applications in materials science and engineering, and multi-disciplinary relationship discovery. 
+
+For instance, Graph-PReFLexOR demonstrates creative reasoning by generating poetic representations that blend abstract concepts like `thin places'--mythological notions of blurred boundaries--into scientific frameworks such as protein biomaterials engineering. Through its knowledge garden growth strategy, the model dynamically integrates insights from diverse domains, enabling the discovery of profound interdisciplinary connections that link art, philosophy, and science.