memory_graph_review
Review queued graph proposals before they alter memory: list pending items, accept or reject links, merges, and junk, or dismiss duplicate pairs and restore forgotten slots.
Instructions
Work the graph review queue — deep-dream proposals that need a verdict before they touch the graph.
Actions:
list: pending findings/proposals.
propose: file link proposals for review.
relate: related-not-duplicate verdict — writes the
relation edge and dismisses the pair.
dismiss_pair: mark src/dst genuinely distinct.
dismiss_slot_pair: same for lesson/world duplicate listings.
restore_slot: undo a lesson/world forget (forgets retire, never
delete) — store + src (the retired key).
accept_link/reject_link: settle an edge proposal by id.
accept_merge: fold a near-duplicate into its twin.
accept_junk: delete an over-extraction artifact.
reject_entity: keep the entity, dismiss the proposal.
Returns: per-action dict; {error} on bad input.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| dst | No | relate/dismiss_pair/dismiss_slot_pair: the second entity or key. | |
| src | No | relate/dismiss_pair: the first entity. dismiss_slot_pair: an "entity|attribute" key from the deep response; restore_slot: retired key or entity. | |
| scope | No | list: keep only analyzer findings whose entities carry this memory source (Atlas project); queued proposals always list; omit or "all" for everything. Not a finding kind. | |
| store | No | dismiss_slot_pair/restore_slot: "lesson" or "world". | |
| action | No | list | |
| relation | No | relate: edge relation to write (graph vocabulary). | |
| proposals | No | propose: ``[{src, relation, dst, similarity?, rationale?}]``. | |
| proposal_id | No | Id actions: the proposal to settle. | |
| proposal_ids | No | Id actions: many proposals at once. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||