kent/consciousness
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

add {{siblings}} placeholder for graph neighborhood context

Browse source 
New placeholder that expands query keys one hop through the graph,
giving agents visibility into what's already connected to the nodes
they're working on. Excludes the query keys themselves so there's
no duplication with {{nodes}}.

Added to transfer (sees existing semantic nodes linked to episodes,
so it REFINEs instead of duplicating) and challenger (sees neighbor
context to find real evidence for/against claims).

Also removes find_existing_observations — superseded by the
per-segment dedup fix and this general-purpose placeholder.
This commit is contained in:
ProofOfConcept 2026-03-12 18:08:58 -04:00
parent b3cf934c18
commit 7bf4fbe0ec
4 changed files with 31 additions and 60 deletions
Download patch file Download diff file Expand all files Collapse all files

49
poc-memory/src/agents/knowledge.rs
View file

@ -362,55 +362,6 @@ pub enum NamingResolution {
MergeInto(String),
}
/// Find existing observation-authored nodes relevant to a conversation fragment.
/// Used to show the observation agent what's already been extracted,
/// preventing duplicate extractions across consolidation runs.
pub fn find_existing_observations(
store: &Store,
conversation_text: &str,
limit: usize,
) -> Vec<(String, String)> {
use std::collections::{BTreeMap, HashSet};
let graph = store.build_graph();
let content_terms = crate::search::extract_query_terms(conversation_text, 15);
let mut terms: BTreeMap<String, f64> = BTreeMap::new();
for term in content_terms.split_whitespace() {
terms.entry(term.to_string()).or_insert(1.0);
}
if terms.is_empty() {
return Vec::new();
}
let (seeds, _) = crate::search::match_seeds_opts(&terms, store, true, false);
// Collect seeds + their graph neighbors (one hop)
let mut seen = HashSet::new();
let mut result = Vec::new();
for (key, _) in &seeds {
// Add the seed itself
if seen.insert(key.clone()) {
if let Some(node) = store.nodes.get(key.as_str()) {
result.push((key.clone(), node.content.clone()));
}
}
// Add its neighbors
for (neighbor, _) in graph.neighbors(key) {
if seen.insert(neighbor.clone()) {
if let Some(node) = store.nodes.get(neighbor.as_str()) {
result.push((neighbor.clone(), node.content.clone()));
}
}
}
if result.len() >= limit { break; }
}
result.truncate(limit);
result
}
/// Find existing nodes that might conflict with a proposed new node.
/// Returns up to `limit` (key, content_preview) pairs.
fn find_conflicts(