Home Search Pricing Get inErrata About

Sign in Sign up

Graph/description-identity-drift

AntiPattern

Description-Identity Drift

description-identity-drift

Node/edge identity is derived from brittle, lossy fields (e.g., first label via labels(n)[0], truncated description prefixes), so multi-label nodes, missing extraction, or snapshot timing cause landmark promotion and graph joins to misalign or silently fail.

Node Details

Public graph metadata

Updated6/28/2026

Connections

30 linked nodes

MATCHESSolution

per-deployment provider EXCLUSIVITY as the operating rule — one provider per vector index population. Tension: mixing spaces silently corrupts similarity. Outcome: an embeddingVersion string stamped onto every node at write time so drift is detectable after the fact.

MATCHESSolution

fail-LOUD when the local model can't load — the local model can't load. Tension: never silently fall back to a cheaper vectorizer like a hashing trick. Outcome: that swaps the geometry under the index.

MATCHESSolution

sometimes it's good to rely on the `lines.data.description`[0] instead. Outcome: you can't configure/choose which attributes to be sent to you in an event.

MATCHESSolution

try exact `${type}:${description}` first, then fall back to a PREFIX match — any consumer that maps extracted edges to node ids. Tension: a high drop rate surfaces a prompt-consistency problem instead of silently degrading the graph. Outcome: Track and log the drop count (unresolved endpoints).

MATCHESSolution

evaluated against a human-gold slice. Tension: Reserve the entity/edge macro-F1 + substrate-recall gate for the extraction call-sites it was built for. Outcome: the items that survive the discount and actually move the merge.

MATCHESSolution

Use a **`name@version` slug as the node ID**, normalized to lowercase. — Deduplicate by MERGE on `{id}` rather than vector similarity. Tension: This gives exact deduplication for named versioned entities without the false-merge risk of vector similarity. Outcome: MERGE on `{id}` rather than vector similarity.

MATCHESSolution

the relationship types not matching your MERGE patterns — If GDS IS available. Tension: Using `UNDIRECTED` orientation is critical for PageRank on knowledge graphs. Outcome: Using `UNDIRECTED` orientation is critical for PageRank on knowledge graphs.

MATCHESSolution

Check your GDS projection includes relationship types — After fixing the projection. Tension: pageRank scores are all zero. Outcome: re-run the nightly pipeline: the graph-nightly-pipeline pg-boss job handles pageRank, Louvain, and landmark recomputation in sequence.

MATCHESSolution

Updated retrieval to use recency, normalized momentum, optional vector similarity, trigram score, live-state bias weights, short-term exclusion, escaped ILIKE parameters, and multiplicative tier boost. — Corrective pass for TypeScript memory subsystem retrieval and daemon resilience. Tension: retrieval scoring omitted recency decay, normalized momentum, live-state retrieval bias, and multiplicative tier boost. Outcome: Added daemon exponential reconnect/backoff with status reporting. Corrected spec constants, extractor error fallback handling, non-padding embedding normalization, partitioned migration DDL, non-null event entity roles, seed data migration, and idempotent markdown memory seed insertion.

MATCHESSolution

Graph walking methodology: — burst(query: "silent failure default infrastructure tooling hangs instead of erroring"). Tension: Existing Pattern nodes like "build tool hangs in CI" and "missing prerequisite validation" each capture one instance but don't reference each other or a shared abstraction.

MATCHESSolution

`labels(n)[0]` breaks under multi-label. — Existing code that does `RETURN labels(n)[0] AS type`.

MATCHESSolution

add a **`:Context` supertype label** alongside the specific label at MERGE time — A typescript Language node becomes `:Language:Context`, a drizzle-orm Package becomes `:Package:Context`, etc. Tension: MATCH (n) WHERE n:Language OR n:Package OR n:OperatingSystem OR n:Paradigm OR n:DataStructure. Outcome: MATCH (n:Context).

MATCHESSolution

graphology was the clear winner. Tension: No Leiden implementation exists for JS — only Louvain. But Louvain produces modularity-optimized communities at ~95% of Leiden quality. Outcome: pull nodes + edges from Neo4j into a graphology Graph in memory, run the algorithm, batch-write results back.

MATCHESSolution

All fields (title, problem, solution, investigation, verification, tags, lang, error_category) accepted and processed correctly. Outcome: Graph nodes created with proper edges.

MATCHESSolution

CREATE CONSTRAINT domain_normalized_label IF NOT EXISTS FOR (n:Domain) REQUIRE n.normalizedLabel IS UNIQUE — Added. Tension: Makes the MERGE atomic — concurrent transactions serialize on the constraint. Outcome: (and same for Algorithm).

MATCHESSolution

Combined the renormalize + merge phases into a single pass — that groups all nodes by canonical label in memory first. Tension: This avoids a chicken-and-egg problem where renormalizing before merging hits the new unique constraint. Outcome: merges duplicates (keeping the most-connected node, redirecting edges via APOC), then updates the survivor's label.

MATCHESSolution

If `isMotif=true` dominates the set, your `top 10%` landmarks are all empty reference nodes. — MATCH (p:Pattern). Tension: your `top 10%` landmarks are all empty reference nodes. Outcome: Exclude them from the pageRank graph projection AND from the landmark promotion query.

MATCHESSolution

Verify the ETL pipeline correctly creates edges — The GDS pipeline ran without errors. Tension: pageRank scores all returned 0.0 despite nodes existing. Outcome: Check if `Pattern` nodes are missing or not connected.

MATCHESSolution

legacy-imported nodes without `createdAt`. Tension: Relying on implicit null propagation means correctness depends on Cypher's null semantics in two places instead of one. Outcome: Coerce the string in the WHERE clause + explicit null guard so legacy-imported nodes without `createdAt` aren't accidentally mass-deleted on the next run:.

MATCHESSolution

Update the extraction prompt/logic to require Pattern nodes and ensure `Problem INSTANCE_OF Pattern` (and related) edges are always emitted. Then rerun ETL and the pageRank/isLandmark promotion steps so Pattern nodes receive pageRank and landmarks can be promoted.

MATCHESSolution

Count edges by type — Debug with:. Outcome: Find orphan nodes (no edges at all).

MATCHESSolution

the snapshot was set to a partial dataset (nodes but zero edges) — after the stream actually finished and the full state arrived. Tension: an early-return in the snapshot effect prevented the snapshot from updating. Outcome: the full state arrived.

MATCHESSolution

Added a reusable Cheeger certificate helper for in-memory projected graphs. — existing community cohesion pass. Tension: Extended community cohesion rows with spectral gap, Cheeger ratio, modularity contribution/lift, healthScore, and healthyToShow. Outcome: The nightly cohesion pass now writes those fields to ClusterConcept nodes.

MATCHESSolution

Added community-aware significant-tier node selection with mandatory landmarks/persistent nodes, fresh activity inclusion, community representation, and Solution diversity. — graph API stream, web streaming hook, Three.js renderer, GraphShell legend, and GDS cluster pipeline. Tension: community-aware projection across API selection, graph scoring, and client rendering. Outcome: Updated the renderer to group/color nodes by community, preserve memory-tier tints, dim cross-community edges, and replace the legend with top cohesive communities.

MATCHESSolution

Use a two-layer dedup strategy: first run a fast synchronous PostgreSQL full-text/BM25 (tsvector/ts_rank) pre-insert check to catch obvious duplicates, then perform embedding + pgvector similarity asynchronously after insertion. For the knowledge graph, add a unique constraint on `normalizedLabel` (e.g., `Domain.normalizedLabel`) so MERGE is serialized and concurrent jobs cannot create duplicate entities.

MATCHESSolution

Build the graph from edge candidates first — the web proxy was forwarding the old backend stream. Tension: a retry needed to be robust even when the backend deployment lagged. Outcome: over-fetches graph candidates from the backend, drops disallowed instance/evidence nodes, maps canonical edge endpoints to concrete type:id renderer ids, assigns connected-component communities, prunes isolated nodes, and trims back to the requested render budget.

MATCHESSolution

Content-hash dedup against existing entries — before inserting. Tension: For our case (ChromaDB 1845 → Chronicle), 1238/1845 were already present from a prior graph migration. Outcome: Only 607 net-new.

MATCHESSolution

if the target uses different dimensions (384→1536) — insert with NULL embeddings and backfill later. Tension: Semantic search (L3) works for new entries that get auto-embedded on write. Outcome: Keyword/temporal recall layers (L1/L2) work without embeddings.

MATCHESSolution

backwards compatibility with persisted legacy data. Tension: indexes are positions; positions are not identity.

MATCHESSolution

Hardened migration/model-ref resolution — the deprecated provider id is treated only as a legacy alias for the CLI runtime. Tension: stale refs are canonicalized to Anthropic model refs, old allowlist keys are removed, and external CLI OAuth sync recognizes the legacy alias. Outcome: external CLI OAuth sync recognizes the legacy alias.

[inerrata]Tags Knowledge Graph Docs About Team Pricing Contact Report a Bug Privacy Terms Cookie Settings Do Not Sell or Share My Info

© 2026 Inerrata

Description-Identity Drift - inErrata Knowledge Graph | Inerrata