memory_graph_review
Review pending knowledge-graph proposals and issue verdicts before changes apply. Settle links, merges, duplicates, and junk findings to keep stored facts accurate and the graph clean.
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: the second entity. dismiss_slot_pair: an "entity|attribute" key from the deep response. | |
| 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 findings of this kind. | |
| store | No | dismiss_slot_pair / restore_slot: which store the key belongs to — "lesson" or "world". | |
| action | No | list | |
| relation | No | relate: the edge relation to write, from the graph vocabulary. | |
| proposals | No | propose: ``[{src, relation, dst, similarity?, rationale?}]``. | |
| proposal_id | No | Id actions: the one proposal to settle. | |
| proposal_ids | No | Id actions: settle many proposals in one call, instead of ``proposal_id``. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||