OAK.memory

Set the strength of an existing link between two memories. **Purpose**: edge strength is how hard recall pulls two memories together — a tuning knob updateMemoryLink doesn't expose (it only adds/removes at a fixed default). Use this in a curation pass to make tightly-coupled memories co-surface reliably and loosen links that are merely tangential, so graph traversal reflects how related things actually are. **When to use**: - A link exists but its strength doesn't match how related the two memories are (see suggestMemoryLinks, which prints each edge's stored strength next to the pair's actual similarity). - You just added a link with updateMemoryLink and want it stronger or weaker than the 0.7 default. **Notes**: - The link must already exist — add it first with updateMemoryLink. This only re-weights. - Adjusts every stored edge between the two memories (both directions) to the target. - Sets an absolute target, not a delta. Specify storeId when multiple stores are connected. Store selection applies only to this call.

adjustMemoryLinkStrength

Store a new memory in the selected private or shared store. Use the selected store policy to judge what is worth remembering. Automatic memory management is the default; the client performs semantic judgment. Preserve explicit subjects, named people, project facts and original quotations. A shared store may contain facts about multiple people. The authenticated recording author is not automatically the subject of a statement. **Before calling this**: call recallMemory first if you haven't already checked whether this fact (or a conflicting version of it) already exists — if it does, use updateMemory instead of creating a duplicate. If multiple saved records are genuine duplicates, use mergeMemories to retain their facts and links atomically. **Notes**: - Use relatedMemoryIds to link to relevant existing memories surfaced by recallMemory. - The selected store is authorized server-side — do not pass an entity/user id. - Use currentMemoryStore to identify the authenticated author. Make first-person subjects explicit only when the speaker is known; never rewrite quotations or guess who a third party is. Specify storeId when multiple stores are connected. Store selection applies only to this call.

createMemory

Returns the selected store, your access role and authenticated recording identity. Store identity is distinct from the semantic people/entities mentioned in memory content. Specify storeId when multiple stores are connected. Store selection applies only to this call.

currentMemoryStore

Delete a memory. Irreversible — use sparingly. **When to use**: - The stored information is clearly wrong and there's nothing worth keeping - The information is no longer needed at all **Notes**: prefer updateMemory in almost every case. Only delete as a last resort. Specify storeId when multiple stores are connected. Store selection applies only to this call.

deleteMemory

Read selected store policy and optional last 50 revisions. Usually unnecessary after initialization; do not call before each utterance or operation. Routine reading does not change the session policy snapshot. When initializing a connected store for the first time in this session, set initialize=true to establish its store-scoped policy; never apply it to another store. Specify storeId when multiple stores are connected. Store selection applies only to this call.

getMemoryPolicy

List every stored memory and every link between them — the whole graph. **This is a full dump, not a search.** It takes no query and does no ranking; use recallMemory when you want the memories *relevant to something*. Use this one when the user wants to see or audit everything they have stored, or to inspect how memories are connected. **When to use**: - The user asks what you remember about them in general ("what do you know about me?", "show my memories") - The user wants to see the memory graph, its links, or orphaned/unlinked memories - Auditing before a cleanup pass **Output**: every memory with its UUID, content, strength, retrieval count and age, followed by the edge list and a summary of how connected the graph is. UUIDs are real and can be passed straight to updateMemory / mergeMemories / updateMemoryLink / deleteMemory. For a merge, copy the exact original contents into expectedContents. Specify storeId when multiple stores are connected. Store selection applies only to this call.

listMemories

For OAuth, list only enabled, explicitly consented stores that this account can currently access. Manage per-connection and per-store activation at /oauth/connections. Disabled stores are excluded from search and all memory/policy tools. For graph-bound keys, discover account memberships without granting access to other stores. Pass storeId to memory and policy tools to use a connected store. Adding stores requires reconnecting and consent. Combined recall may be partial when a store fails or cannot start within the request deadline; inspect failedStores. Graph-bound keys require a matching per-store key/profile.

listMemoryStores

Atomically merge duplicate memories in the selected store. First read all originals and judge whether they describe the same subjects/facts. Supply the complete merged text yourself, preserving distinct facts and quotations. Retains the target UUID and recorder, redirects incoming/outgoing typed links, removes self-links and deletes source UUIDs. Source recording/import history is retained in cloud graph revisions. Legacy personal stores have no revision archive: absorbed records are deleted irreversibly. This is destructive: use updateMemory for a single changed fact. A stale original rejects the entire operation; reread before retrying. Costs one update operation credit in cloud graph stores. Specify storeId when multiple stores are connected. Store selection applies only to this call.

mergeMemories

Search authorized long-term memory stores for facts relevant to a query. A combined search may return only a subset when stores fail or cannot start before the deadline; always inspect failedStores/partial rather than assuming every connected store was searched. **When to use**: follow the recall preference in each searched store’s session policy. What it does ask is that you call this before createMemory, to check whether a similar or conflicting memory already exists. That check is about not writing duplicates, not about how often to look. **Output**: ranked list of memories with their UUID, content, similarity/strength scores, and linked memory UUIDs. Use these UUIDs directly with updateMemory / mergeMemories / updateMemoryLink / deleteMemory — never invent a UUID or use a display index. Omit storeId to search all enabled stores together, or specify it to search one store. limit caps the combined result. Each searched store uses its normal search credits.

recallMemory

Read-only structural analysis of the memory graph — the evidence layer for a curation/organise pass. **This computes nothing to the database; it only reports.** It reads every stored memory's embedding and compares all pairs by cosine similarity, then surfaces where the graph is under- or mis-connected. Pair it with listMemories (which gives full content) and then act with updateMemoryLink / adjustMemoryLinkStrength / createMemory / updateMemory / mergeMemories / deleteMemory. The judgment — which pairs to link, which near-duplicates to merge, which overloaded nodes to split — is yours; this tool only hands you the signals to reason over. **What it reports**: - ORPHANS — memories with no links, each with its single nearest neighbour (where it likely belongs). - LINK CANDIDATES — unlinked pairs above the similarity floor, strongest first; very high ones are flagged as possible near-duplicates (merge, or split-and-dedupe). - EXISTING LINKS — each current edge's stored strength alongside the pair's actual similarity, so you can spot links that are weaker or stronger than the content warrants, or spurious (linked but dissimilar). - LARGE NODES — long, multi-topic memories that may be worth splitting into focused nodes. **When to use**: at the start of a /memory-organise pass, or whenever the user wants the graph tidied, de-duplicated, or better connected. Specify storeId when multiple stores are connected. Store selection applies only to this call.

suggestMemoryLinks