Store a piece of knowledge (note, decision, fact, person, client, ...). Returns its node id. Re-calling with the same node_id updates it. Set pinned=True for durable knowledge that should never be auto-archived.

Create a connection from node src to node dst. If it already exists it is reinforced (its decay clock resets). rel examples: references, about, mentions, decided_in, involves, depends_on, contradicts, supersedes.

Strengthen and refresh an existing connection you just used again — the spaced-repetition signal that keeps knowledge from decaying.

Retrieve the k most relevant nodes for a query. Ranking blends text match with recency-weighted activation. Archived (cold/frozen) nodes are excluded unless include_cold=True. Each result explains why it surfaced.

List the direct connections of a node.

Permanently delete a node and its connections. Prefer letting decay + the tier-4 review queue handle phase-out; use this only for deliberate deletion.

Pin (or unpin) a node so it is never auto-archived — a human 'principal' mark on durable knowledge.

Run the decay/archival pass: recompute activation, reassign tiers 1-4, and return the changes plus the tier-4 review queue (items awaiting human sign-off before deletion).

The tier-4 queue: knowledge that has decayed to the point of proposed deletion and is waiting for a human to confirm or reprieve it.

Graph size, tier distribution, and the most-active nodes right now.