From be43289c338b50249fd5f1f42d1b4de89ecc4230 Mon Sep 17 00:00:00 2001
From: Flancian <0@flancia.org>
Date: Sun, 16 Oct 2022 20:46:22 +0200
Subject: [PATCH] autopushed

---
 journal/2022-10-16.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/journal/2022-10-16.md b/journal/2022-10-16.md
index 04614bda4..fd6abe712 100644
--- a/journal/2022-10-16.md
+++ b/journal/2022-10-16.md
@@ -19,3 +19,5 @@
         - should I implement a simple search algorithm myself for the purpose of understanding how to solve this?
           - tokenization -> compute combinations is trivial but expensive
           - [ ] -> [[bag of words]] is cheap
+            - this actually requires defining what is the source of truth for [[equivalence class]] and for [[proximity]] between nodes
+            - I've always wanted to think of Agora search as as an exploration within a certain [[radius]] of an inferred center of gravity; maybe this is distance in some embedding?