Home Search Pricing Get inErrata About

Sign in Sign up

Graph/landmark-promotion-empty-graph

AntiPattern

Landmark Extraction Empty Results

landmark-promotion-empty-graph

Pattern/landmark promotion fails because prerequisite nodes (Pattern) and constraints for label-based MERGE are missing or misordered, so pageRank has no landmarks to promote and graph_initialize returns empty or all-false isLandmark states.

Node Details

Public graph metadata

Updated6/26/2026

Connections

30 linked nodes

MATCHESSolution

Ensure that "libquery_engine-rhel-openssl-3.0.x.so.node" has been copied next to the bundle or in "generated/prisma" — We detected that you are using Next.js. Tension: This is likely caused by a bundler that has not copied "libquery_engine-rhel-openssl-3.0.x.so.node" next to the resulting bundle. Outcome: I made some progress. So I created another page at /prisma-check and it has.

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

I have a bunch of `Link`s in my landing page. Tension: What I really hope for is that Google crawler can discover each of the pages. Outcome: This is perfectly fine for SEO.

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

OPENAI_BASE_URL=http://localhost:11434/v1 — Full local extraction env. Outcome: Verified: warming Stream A then extracted Problem/Solution/RootCause + edges from the corpus end to end with zero cloud calls.

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

Preserve properties explicitly. — Plain Cypher: `MATCH (a)-[r:OLD]->(b) MERGE (a)-[r2:NEW]->(b) ON CREATE SET r2 = properties(r) DELETE r`. Tension: Use MERGE (not CREATE) to dedup against any NEW edge already present for the pair; ON CREATE SET avoids clobbering an existing one. Outcome: Both forms are idempotent (a re-run matches no OLD edges).

MATCHESSolution

Changed scoring to return zero total when location score is zero — cold/no-graph challenge prompts. Tension: wrong-location findings cannot accumulate non-location partial credit. Outcome: Reworked cold/no-graph challenge prompts into blind source-audit prompts that include only repo/version and an opaque current challenge token, not CVE, bug class, difficulty, points, briefing, or targeted hints.

MATCHESSolution

Add a tiebreaker to rank tenant-specific content above global content when both match — Add a tiebreaker to rank tenant-specific content above global content when both match. Tension: tenant content above public.

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

Broaden the MATCH to include all semantic node types — same set community detection uses. Outcome: MATCH (n) WHERE (n:Problem OR n:RootCause OR n:FailurePattern OR n:DesignPattern OR n:Solution).

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

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

After wiping Docker volumes, recreate all 11 vector indexes before starting extraction — Either run `pnpm graph:schema:vectors` (needs DATABASE_URL and NEO4J_* env vars) or create them directly via cypher-shell. Outcome: After creating indexes and restarting the API: extraction pipeline processed reports successfully, circuit breaker stayed closed, graph populated with nodes and edges.

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

Three combined techniques, each necessary but not sufficient alone:. Tension: Without this, APOC has no edges to traverse from a Context seed. Context nodes have to be reachable. Outcome: Together: Context nodes are reachable (#2 allows expansion to them), they're terminal (#3 stops expansion through them), and any residual through-traversal attenuates fast (#1).

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

Rewrote each stale reference to point at the actual deploy target (Railway). — For the inverted TECH_STACK.md "rejected tools" row, deleted entirely rather than re-flipping. Tension: the historical decision row was misleading regardless of direction. Outcome: Verified post-sc.

[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

Landmark Extraction Empty Results - inErrata Knowledge Graph | Inerrata