{"query":"turbo-quant polar angle vector quantization","relevant_ids":["fact:92e5b626-0fee-49bf-951d-3171e8efdaf8","fact:ae9c9f3a-8926-4c77-91cc-989f93798d75","fact:d9bad1b2-a855-4010-87a9-4ad05e589c15"],"query_class":"A","top_k":10,"note":"Direct factual query for turbo-quant codec identity"}
{"query":"semantic memory architecture sqlite fts5","relevant_ids":["fact:9d520fb1-19ed-4523-883c-cae7031fe95a","fact:7fe99f48-c0cc-4d81-80fc-8270a71fffa4","chunk:b054c760-e71b-48d9-8c23-5542f63d55e4"],"query_class":"A","top_k":10,"note":"Architecture overview — crate version, WAL/FTS5 design"}
{"query":"factor graph belief propagation confidence","relevant_ids":["fact:49cfe3b1-8f23-4754-9ed7-4aa0bf20f666","fact:65e9b4ba-6c78-4cb6-b143-777e628d0c0c","fact:1d99087d-e116-4458-b7b1-6f0429208a0e"],"query_class":"B","top_k":10,"note":"Factor graph unification and belief propagation implementation"}
{"query":"adaptive routing query complexity classification","relevant_ids":["fact:58ad3a6a-f8b8-418a-be03-0aa4f328e08a","fact:efe84742-1fd2-47d2-af50-8da211a529d0","fact:6f3456be-bd75-40dd-bc50-2188037c365f"],"query_class":"A","top_k":10,"note":"Adaptive retrieval routing skill and decision algorithm"}
{"query":"provenance semiring confidence scoring","relevant_ids":["fact:979f3f42-17f4-467c-9b14-adb1372b1405","fact:d9700cd5-967b-4332-ab2b-8d2b75d7c325","fact:1d99087d-e116-4458-b7b1-6f0429208a0e"],"query_class":"B","top_k":5,"note":"Algebraic provenance semiring for confidence weighting"}
{"query":"compression governor quantization level bits","relevant_ids":["fact:84334956-08e8-4971-8545-e931f8ddaf80","fact:e1180b1c-e7ed-4bb5-abc4-3fc03a8a876c","fact:d328f2ed-95c2-4b58-973c-061b6c29ddac"],"query_class":"A","top_k":10,"note":"Compression governor controlling quantization level selection"}
{"query":"persistent homology topology knowledge graph","relevant_ids":["fact:65e9b4ba-6c78-4cb6-b143-777e628d0c0c","fact:1d99087d-e116-4458-b7b1-6f0429208a0e","fact:d3c5f859-7d04-46fb-aa27-dc45f5257f80"],"query_class":"C","top_k":10,"note":"TDA / persistent homology on knowledge graph topology"}
{"query":"community detection leiden modularity clustering","relevant_ids":["fact:c7b76ee9-b403-45c6-a803-fe5f739a6976","fact:0b0d4820-7ff9-4da8-beb4-15764995da78","fact:d3c5f859-7d04-46fb-aa27-dc45f5257f80"],"query_class":"C","top_k":5,"note":"Leiden algorithm community detection and modularity scoring"}
{"query":"Matryoshka representation learning multi-resolution embedding","relevant_ids":["fact:74e89497-2710-46d4-8744-8f3694d79438","fact:1d99087d-e116-4458-b7b1-6f0429208a0e","fact:10c64c2f-d0c5-4ae6-94b1-7a42abec5bc3"],"query_class":"A","top_k":10,"note":"MRL nested dimensionality embedding innovations"}
{"query":"ColBERT late interaction MaxSim token scoring","relevant_ids":["fact:d9700cd5-967b-4332-ab2b-8d2b75d7c325","fact:c22b8046-9164-44dc-933e-9cb06911e04f","fact:435e98dc-c168-423f-80e6-72f5e4b9022d"],"query_class":"A","top_k":10,"note":"ColBERT-style late interaction MaxSim retrieval"}
{"query":"SimpleMem compression consolidation token reduction","relevant_ids":["fact:d5ca9bc5-3bf7-4b4a-b952-abf3ac0eac1b","fact:c7c4bd35-e082-4dfb-8a48-b8d8771a063d","fact:aaace86f-2f55-48ad-9164-378d015e74e8"],"query_class":"A","top_k":10,"note":"SimpleMem context-compression and consolidation"}
{"query":"BGE-M3 dense sparse multi-vector retrieval","relevant_ids":["fact:74e89497-2710-46d4-8744-8f3694d79438","fact:8c01cb05-c050-40e4-a0c4-ec92ef630b95","chunk:69295a00-f7e8-4914-82bb-a67aeecea66a"],"query_class":"A","top_k":10,"note":"BGE-M3 unified dense/sparse/multi-vector model family"}
{"query":"discord second-order retrieval graph neighbors","relevant_ids":["fact:fb09222b-5f69-4fbb-bf66-da490095f47d","fact:d3c5f859-7d04-46fb-aa27-dc45f5257f80","fact:58ad3a6a-f8b8-418a-be03-0aa4f328e08a"],"query_class":"B","top_k":10,"note":"Discord second-order neighbor expansion stage"}
{"query":"subgraph pruning lawful subtraction provenance","relevant_ids":["fact:97929fa4-1050-452b-8da7-f264b99cfc84","fact:7e471b18-9c49-4d8c-b311-abfa67278edb","fact:65e9b4ba-6c78-4cb6-b143-777e628d0c0c"],"query_class":"C","top_k":10,"note":"Lawful subtraction runtime and subgraph provenance pruning"}
{"query":"hybrid search bm25 reciprocal rank fusion vector similarity","relevant_ids":["fact:260a69e5-81f5-426d-a882-175cd2eb4ce4","chunk:ecec2f31-8eb2-4376-8585-de9a223df28a","chunk:b054c760-e71b-48d9-8c23-5542f63d55e4"],"query_class":"B","top_k":10,"note":"RRF hybrid fusion of BM25 and vector similarity"}