GEAKG: Generative Executable Algorithm Knowledge Graphs

ArXi:2603.27922v1 Announce Type: new In the context of algorithms for problem solving, procedural knowledge -- the know-how of algorithm design and operator composition -- remains implicit in code, lost between runs, and must be re-engineered for each new domain. Knowledge graphs (KGs) have proven effective for organizing declarative knowledge, yet current KG paradigms provide limited for representing procedural knowledge as executable, learnable graph structures. We