Locate
Use a known source ID, time range, or curated-session link to select one or a very small number of raw records.
A provenance-first pattern for preserving source history, rebuilding derived indexes, retrieving the smallest useful context, and reviving raw evidence only when curated memory is not enough.
Normal recall runs on reviewed, curated material. Raw source storage stays outside the everyday index.
The raw catalog is a warehouse card: it identifies the box and verifies the seal. It does not expose the contents to ordinary recall.
Use a known source ID, time range, or curated-session link to select one or a very small number of raw records.
Check path containment, file mode, byte size, cryptographic hash, record count, source identity, and timestamps.
Separate visible dialogue from system context, reasoning, and tool records. Recover only what the current question requires.
Each layer has a narrow job. A convenient derived layer never becomes more authoritative than its source.
Current safety, retrieval, privacy, and collaboration rules. Historical content cannot promote itself into this layer.
Canonical sessions, reviewed facts, dated state, decision history, and source links used for normal evidence-backed recall.
Exact source preservation plus a metadata-only locator. Private, default-off, and read only during targeted recovery.
Chunks, aliases, state projections, scores, traces, and context packets. Observable, replaceable, and safe to rebuild.
Facts change at different rates. Passing an expected review point does not prove that the state reversed.
When the observation was recorded. It answers “when did we see this?”, not “when must it expire?”
Store only a genuinely known applicability interval. Leave an unknown end open instead of inventing a TTL.
The latest explicit confirmation of the same state. Collection reviewed_at is not a substitute.
An expected review or outcome date. Passing it adds a visible note; it does not silently rewrite state.
Testable rule: inject as_of. Keep base ranking stable and add a temporal label only when the checkpoint passed without a later confirmation.
Escalate only as far as the question requires.
| Signal | First action | Escalate when | Guardrail |
|---|---|---|---|
| Current context is sufficient | Answer without retrieval | Never | Do not search private history by habit. |
| Prior context is clearly relevant | Run curated retrieval | The packet lacks exact evidence or provenance. | Use a concise intent, not the entire user message. |
| Exact wording, chronology, or rationale is required | Search the private curated archive | The best surviving curated source is still incomplete. | Do not present a summary as verbatim dialogue. |
| A known source must be recovered | Use the raw catalog, then verify | Only after the target has been narrowed. | Never scan or load the whole raw store by default. |
| The question lacks a usable anchor | Ask one minimal clarifying question | The answer supplies a source, event, entity, or time anchor. | Do not guess which private history the user meant. |
Failure must have an explicit meaning. Raw scores from heterogeneous rankers must not pretend to be one probability scale.
| Lane | Purpose | Run semantics | Promotion rule |
|---|---|---|---|
| Regression | Protect behavior already promised | Every normal run must pass | Accept only fixed, stable cases |
| Challenge / probe | Preserve real misses and hand-written contrasts | Known failures may be reported explicitly | Promote after the fix is stable |
The candidate has a canonical source link or explicit provenance. This labels evidence shape, not probability.
Topic, entity, state, or decision fields explain why the candidate was recalled.
Wording overlaps without stronger structure. Measure forbidden hits and packet pollution.
Start at semantic triage. Use a few human contrasts and real misses, not a large generated context-free query set.
This is a portable pattern, not a copy of any live personal-memory workspace.
Use the strongest surviving evidence, but label transformed material honestly.
Compact model: the archive remembers what happened; retrieval decides what matters now; the raw catalog knows where the evidence box lives; policy defines what the assistant may do.
Two concrete mechanisms from the reviewed implementation, illustrated with a fictional expedition.
Validate available state and decision records against config keys, including inactive history. An unknown label stops the build before index writes and identifies the file, record, field, and label.
An unknown user hint warns and querying continues. The runtime recognition set cannot validate stored data: a repeated typo must not make itself legal.
Prefer supported, specific aliases. Short common names can assign unrelated content to one entity. Canonical IDs need not have invented aliases.
The expedition now uses an offline tablet. Its earlier paper-log decision remains useful as historical rationale, attached to its selected direct successor rather than competing as current advice.
| Synthetic input | Boundary | Expected observation |
|---|---|---|
| stored topic: feild_test | Config defines field_test | Build fails; previous index remains |
| user hint: feild_test | Query input | Warning; query continues |
| tablet → paper rationale | Final context packet | Direct successor first; predecessor marked historical |
Decision attachment happens before packing. Evaluate successor adjacency again on the final packet, especially with tight budgets. Label membership is not full schema or file-presence validation; absent projection files are currently skipped.
A reference pattern should distinguish working mechanisms from open experiments.
Build-time label checks, warning-only hints, direct-successor attachment, whole-label fidelity matching, writer-enforced modes, rule-based control-plane exclusion, contiguous-phrase ranking, and expiring self-explaining traces have implementation counterparts. Pinecone itself publishes documentation, not an engine.
Owner-only modes need writer enforcement and checks after checkout or restore. Frozen-input advisories remain visible but do not fail the check or authorize automatic repair. Directory-symlink containment remains a known limitation.
The trees that exist in only one place are compared against an external copy file by file, and a restore drill has been run. Refresh stays manual, so the honest claim is “verified as of the last check” — which is what the check reports.
Separate challenge runners and calibrated evidence labels remain follow-up work. Retrieval-intent parsing is measured against a ceiling it does not yet meet, and saying so is the point. Temporal checkpoint logic has synthetic coverage, not proof of a live checkpoint.
Read the workflow details and synthetic evaluation cases.