Skip to content
AI News HubLIVE
Original source2 min read

SSAKG 2.0: An Open-Source Package for Structural Associative Sequence Memory and Context-Based Retrieval

Summary

SSAKG 2.0 is an open-source Python package for building and operating Structural Sequential Associative Knowledge Graphs, using sparse graphs as associative memory that can reconstruct complete sequences from partial, unordered contexts. Version 2.0 adds bit-level algorithms for efficient graph-connection search, with performance-critical operations in C exposed through Python. It was evaluated on random numerical sequences, NLTK sentence-derived sequences, and mRNA sequences, and is released under Apache 2.0 via GitHub and PyPI.

SourcearXiv AIAuthor: Przemys{\l}aw Stok{\l}osa, Janusz A. Starzyk, Pawe{\l} Raif
SSAKG 2.0: An Open-Source Package for Structural Associative Sequence Memory and Context-Based Retrieval
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 1 Sep 2026]

Title:SSAKG 2.0: An Open-Source Package for Structural Associative Sequence Memory and Context-Based Retrieval

View a PDF of the paper titled SSAKG 2.0: An Open-Source Package for Structural Associative Sequence Memory and Context-Based Retrieval, by Przemys{\l}aw Stok{\l}osa and 2 other authors

View PDF HTML (experimental)

Abstract:This article presents SSAKG 2.0, an open-source software package for constructing and operating Structural Sequential Associative Knowledge Graphs (SSAKGs). An SSAKG represents objects as graph vertices and ordered sequences as structural patterns of graph connections. The resulting sparse graph is used as an associative memory in which complete sequences can be reconstructed from a partial, unordered context.

Version 2.0 introduces new algorithms that exploit individual bits of computer memory to efficiently search graph connections. The package is implemented in Python, while performance-critical graph operations are implemented in C and exposed through a Python interface. This hybrid implementation provides a flexible high-level programming environment while reducing the memory and computational overhead associated with large sparse graphs.

The algorithms were evaluated using randomly generated numerical sequences, sequences derived from sentences in the NLTK corpus, and mRNA sequences. The experiments demonstrate the ability of the package to store and reconstruct sequences from partial contexts and provide a basis for evaluating the effects of graph density, sequence length, and memory size on retrieval performance.

SSAKG 2.0 is distributed under the Apache 2.0 open-source license. The package includes documentation and reproducible examples and is publicly available through GitHub and the Python Package Index (PyPI).

Comments: 15 pages, 5 figures

Subjects:

Artificial Intelligence (cs.AI)

Cite as: arXiv:2609.01849 [cs.AI]

(or arXiv:2609.01849v1 [cs.AI] for this version)

https://doi.org/10.48550/arXiv.2609.01849

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Przemysław Stokłosa [view email] [v1] Tue, 1 Sep 2026 20:31:56 UTC (30 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled SSAKG 2.0: An Open-Source Package for Structural Associative Sequence Memory and Context-Based Retrieval, by Przemys{\l}aw Stok{\l}osa and 2 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.AI

new | recent | 2026-09

Change to browse by:

cs

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

ResearchersAdvanced

Key points

  • SSAKG represents objects as graph vertices and ordered sequences as structural connection patterns, using the sparse graph as associative memory to reconstruct complete sequences from partial, unordered context.
  • Version 2.0 introduces algorithms that exploit individual bits of computer memory for efficient graph-connection search, combining Python-level flexibility with C-implemented performance-critical operations.
  • Experiments cover randomly generated numerical sequences, sequences derived from NLTK corpus sentences, and mRNA sequences, showing sequence storage and reconstruction and enabling evaluation of graph density, sequence length, and memory size effects.
  • The package is distributed under the Apache 2.0 license with documentation and reproducible examples, and is publicly available on GitHub and PyPI.

Highlights and analysis are generated automatically and may contain errors. Check the original source.