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

• URL: http://arxiv.org/abs/2609.01849v1
• Date: Tue, 01 Sep 2026 20:31:56 GMT
• Title: SSAKG 2.0: An Open-Source Package for Structural Associative Sequence Memory and Context-Based Retrieval
• Abstract summary: SSAKG 2.0 is an open-source software package for constructing and operating Structural Sequential Associative Knowledge Graphs.<n>Version 2.0 introduces new algorithms that exploit individual bits of computer memory to efficiently search graph connections.
• Score: 0.5735035463793007
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• 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).

Related papers

• Multi-Vector Index Compression in Any Modality [73.7330345057813]
  Late interaction has emerged as a dominant paradigm for information retrieval in text, images, visual documents, and videos.<n>We introduce four approaches for index compression: sequence resizing, memory tokens, hierarchical pooling, and a novel attention-guided clustering (AGC)<n>AGC uses an attention-guided mechanism to identify the most semantically salient regions of a document as cluster centroids and to weight token aggregation.
  arXiv  Detail & Related papers  (2026-02-24T18:57:33Z)
• SAGE: Structure Aware Graph Expansion for Retrieval of Heterogeneous Data [47.930782177987446]
  Retrieval-augmented question answering over heterogeneous corpora requires connected evidence across text, tables, and graph nodes.<n>Standard retriever-reader pipelines use flat similarity search over independently chunked text, missing multi-hop evidence chains across modalities.<n>We propose SAGE (Structure Aware Graph Expansion) framework that constructs a chunk-level graph offline using metadata-driven similarities with percentile-based pruning.<n>We instantiate the initial retriever using hybrid dense+sparse retrieval for implicit cross-modal corpora and SPARK (Structure Aware Planning Agent for Retrieval over Knowledge Graphs) an agentic retriever for explicit schema graphs.
  arXiv  Detail & Related papers  (2026-02-18T23:57:19Z)
• SWING: Unlocking Implicit Graph Representations for Graph Random Features [57.956136773668476]
  We propose SWING: Space Walks for Implicit Network Graphs, a new class of algorithms for computations involving Graph Random Features on graphs.<n>We provide detailed analysis of SWING and complement it with thorough experiments on different classes of i-graphs.
  arXiv  Detail & Related papers  (2026-02-13T08:12:38Z)
• LiDAR Loop Closure Detection using Semantic Graphs with Graph Attention Networks [12.33137981696787]
  We propose a novel loop closure detection algorithm that uses graph attention neural networks to encode semantic graphs.<n>We then use semantic registration to estimate the 6 DoF relative pose constraint.<n>For the benefit of the community, we open-source the complete implementation of our proposed algorithm.
  arXiv  Detail & Related papers  (2025-01-31T18:36:04Z)
• Associative Knowledge Graphs for Efficient Sequence Storage and Retrieval [0.9786690381850353]
  Associative Knowledge Graphs (AKGs) offer a promising approach by leveraging graph structures to encode sequences.<n>This study introduces a novel structural approach for sequence storage and retrieval.<n>With broad applications in computational neuroscience and bioinformatics, the approach offers scalable solutions for sequence-based memory tasks.
  arXiv  Detail & Related papers  (2024-11-19T13:00:31Z)
• Graph Parsing Networks [64.5041886737007]
  We propose an efficient graph parsing algorithm to infer the pooling structure, which then drives graph pooling. The resulting Graph Parsing Network (GPN) adaptively learns personalized pooling structure for each individual graph.
  arXiv  Detail & Related papers  (2024-02-22T09:08:36Z)
• Tuple Packing: Efficient Batching of Small Graphs in Graph Neural Networks [0.4893345190925178]
  It is common to combine several small graphs into one overall graph to accelerate processing and reduce the overhead of padding. The sizes of small graphs can vary substantially with respect to the number of nodes and edges, and hence the size of the combined graph can still vary considerably. This paper proposes a new approach -- packing -- for generating batches that cause minimal overhead.
  arXiv  Detail & Related papers  (2022-09-14T00:32:51Z)
• Collaborative likelihood-ratio estimation over graphs [55.98760097296213]
  Graph-based Relative Unconstrained Least-squares Importance Fitting (GRULSIF) We develop this idea in a concrete non-parametric method that we call Graph-based Relative Unconstrained Least-squares Importance Fitting (GRULSIF) We derive convergence rates for our collaborative approach that highlights the role played by variables such as the number of available observations per node, the size of the graph, and how accurately the graph structure encodes the similarity between tasks.
  arXiv  Detail & Related papers  (2022-05-28T15:37:03Z)
• pygrank: A Python Package for Graph Node Ranking [13.492381728793612]
  We introduce pygrank, an open source Python package to define, run and evaluate node ranking algorithms. We provide object-oriented and extensively unit-tested algorithm components, such as graph filters, post-processors, measures, benchmarks and online tuning.
  arXiv  Detail & Related papers  (2021-10-18T13:13:21Z)
• Class-wise Dynamic Graph Convolution for Semantic Segmentation [63.08061813253613]
  We propose a class-wise dynamic graph convolution (CDGC) module to adaptively propagate information. We also introduce the Class-wise Dynamic Graph Convolution Network(CDGCNet), which consists of two main parts including the CDGC module and a basic segmentation network. We conduct extensive experiments on three popular semantic segmentation benchmarks including Cityscapes, PASCAL VOC 2012 and COCO Stuff.
  arXiv  Detail & Related papers  (2020-07-19T15:26:50Z)
• Graph Neural Networks with Composite Kernels [60.81504431653264]
  We re-interpret node aggregation from the perspective of kernel weighting. We present a framework to consider feature similarity in an aggregation scheme. We propose feature aggregation as the composition of the original neighbor-based kernel and a learnable kernel to encode feature similarities in a feature space.
  arXiv  Detail & Related papers  (2020-05-16T04:44:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.