From 9ee7988e89081593c468edee6111fe1f9d5b92de Mon Sep 17 00:00:00 2001
From: David Chapela de la Campa <david.chapela.delacampa@gmail.com>
Date: Sat, 1 Jun 2024 19:24:41 +0300
Subject: [PATCH] Update README

---
 README.md | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/README.md b/README.md
index b659208..4b69ab2 100644
--- a/README.md
+++ b/README.md
@@ -8,6 +8,9 @@ executed activities in the index.
 For example, for an ongoing case `A-B-F-T-W-S-G-T-D`, after building the 5-gram index, the state would be computed
 by searching in the index with the sequence `[W, S, G, T, D]`.
 
+This approach has been submitted as a publication to ICPM 2024 under the title "Efficient State Computation for Log
+Animation and Short-Term Simulation Using N-Gram Indexing", by David Chapela-Campa and Marlon Dumas.
+
 ## Requirements
 
 - Python v3.9.5+