Upload pirolo2026_simplicial_hashing_v1.pdf

We present Barycentric Simplicial Hashing (BSH), a data-dependent binary indexing method for approximate nearest neighbor (ANN) search that uses the local triangulation of a vector space as a discrete coordinate system. Given a set of database vectors partitioned into Voronoi cells, we construct a k-NN simplicial complex within each cell and assign each vector a compact binary code by evaluating its barycentric zone relative to every triangle in the complex.



The key contribution is a four-state quantization per triangle: a vector is assigned to the zone of the nearest vertex (states 0, 1, 2) or to the barycentre zone (state 3) when the triangle centroid is the closest reference point. Empirical measurement confirms that the barycentre state is activated for over 51% of all triangle-vector assignments in 24-dimensional subspaces, making it the primary discriminator rather than a rare case.

.gitattributes

@@ -33,3 +33,4 @@ saved_model/**/* filter=lfs diff=lfs merge=lfs -text
 *.zip filter=lfs diff=lfs merge=lfs -text
 *.zst filter=lfs diff=lfs merge=lfs -text
 *tfevents* filter=lfs diff=lfs merge=lfs -text
+pirolo2026_simplicial_hashing_v1.pdf filter=lfs diff=lfs merge=lfs -text

pirolo2026_simplicial_hashing_v1.pdf

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:8603e9282a3dd9b799d6ce8f055224019b046ee550f5ad966aa56cd037887b1f
+size 152865