memory_consolidation_candidates
Find clusters of near-duplicate memories to consolidate, then synthesize a canonical note and commit it by entry IDs.
Instructions
Find clusters of near-duplicate memories ripe for consolidation —
the same thing phrased five ways across five sessions. Anchor with a
query or an episode; read the clusters, synthesise one
canonical note, then commit it via memory_consolidate.
Each member carries its id; commit with
memory_consolidate(entry_ids=[...]) rather than the members' texts —
IDs survive rewording and duplicate phrasing, exact text does not.
Returns: {count, clusters: [{cohesion, size, members}]}.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| tags | No | Consider only entries carrying one of these tags. | |
| query | No | Topic-driven anchor: cluster memories near this description. | |
| top_k | No | How many candidate entries to cluster over. | |
| episode | No | Session-driven anchor: cluster within this episode id. | |
| sources | No | Consider only entries with one of these source tags. | |
| max_clusters | No | Max clusters returned. | |
| min_cohesion | No | Minimum intra-cluster cosine — raise it to flag only near-duplicates. | |
| min_cluster_size | No | Drop clusters with fewer members than this. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||