Public report of getzep/graphiti, published 20 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 20 October 2026, 16:04 UTC · Survey ID cd_333faeb759874606865045a87e91b901
getzep/graphiti
Measured 20 October 2026, 15:56 UTC, at code version 3cc723c
CAI scoreAdequate
CriticalWeakAdequateStrongExemplary
Down 25 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A medium codebase: 40,357 lines of product code in 3 projects, tests not counted · Estimated rebuild effort: about 0.4 person-years · Weakest lens: Security and Compliance, 34
Findings by how serious they are
20 critical264 serious82 minor
16 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
20 October 2026, 15:56 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
58of 61 dimensions measured by tools. The other 3 are advisory notes from an AI model, which explain the code but don't count towards the score.
359of 366 findings point to an exact file and line, so you can open each one in the code. The other 7 concern the repository as a whole, such as missing documentation.
61dimensions across 6 lenses, read from 40,357 lines of product code in 3 projects.
getzep/graphiti scores 47 out of 100 and is rated Adequate, while four of its six lenses score higher still: Performance at 100, rated Exemplary, Architecture at 92 and Code Health at 61, both rated Adequate, and Production Readiness at 76, rated Strong. The project hasn't declared a stable release yet, so its lenses are rated against a lower bar than a released product's, while the score itself is worked out as for any repository.
The score is lower than those four because the weakest lens counts most, and here that is Security and Compliance, which scores 34 and is rated Weak. Its Access Controls dimension scores 0 out of 10, and until that reaches 4, Security and Compliance can't be rated higher than Adequate. The first actions are to protect endpoints by default-deny: a global authentication guard or middleware with explicit public opt-outs, or a guard on every route, plus named role/permission rules for what an authenticated caller may do and to reconcile the README with reality: mcp_server/README.md changes into `graphiti/mcp_server`, but no such folder exists; mcp_server/README.md runs `docker compose -f docker/docker-compose.neo4j.yaml up`, but `docker/docker-compose.neo4j.yaml` does not exist; mcp_server/README.md runs `docker compose -f docker/docker-compose.falkordb.yaml up`, but `docker/docker-compose.falkordb.yaml` does not exist; mcp_server/README.md links to `cursor_rules.md`, but `mcp_server/cursor_rules.md` does not exist; mcp_server/docker/README-falkordb-combined.md runs `docker compose -f docker/docker-compose-falkordb-combined.yml up`, but `docker/docker-compose-falkordb-combined.yml` does not exist, and if Security and Compliance rose to 70, the score would rise from 47 to about 57.
20 findings are critical: ten in IaC & Container Security, eight in Static Analysis (SAST) and two in Dependency Vulnerabilities.
Watchdog couldn't measure 16 dimensions in this code, among them Code Coverage, Internal API Consistency and Navigability, so they are left out of the score. The product code is 40,357 lines, which would take an estimated 0.4 person-years, around €59,000, to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Access Controls · No authorization server/graph_service/main.py
Async correctness · Task from `asyncio.create_task` is not kept mcp_server/src/services/queue_service.py
Exception handling · Swallowed exception (caught, then discarded) graphiti_core/llm_client/decision_prompts.py
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 21 findings
These 21 critical or serious findings were in the previous survey, on 3 October 2026, and are gone from this one.
Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Dependency Vulnerabilities · Medium CVE: PYSEC-2026-2132 REDACTED
Dependency Vulnerabilities · Medium CVE: PYSEC-2026-2132 REDACTED
Rebuild cost: about €59,000 · Estimate
Cost to rebuild
€19,000 to €98,000, for 325 to 1,031 hours of work, about 0.4 person-years for one engineer
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.7 at a score of 47. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Medium: 40,357 lines of product code
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Protect endpoints by default-deny: a global authentication guard or middleware with explicit public opt-outs, or a guard on every route, plus named role/permission rules for what an authenticated caller may do.
Raises the score by about 12 points · Medium effort · Access Controls
2
Reconcile the README with reality: mcp_server/README.md changes into `graphiti/mcp_server`, but no such folder exists; mcp_server/README.md runs `docker compose -f docker/docker-compose.neo4j.yaml up`, but `docker/docker-compose.neo4j.yaml` does not exist; mcp_server/README.md runs `docker compose -f docker/docker-compose.falkordb.yaml up`, but `docker/docker-compose.falkordb.yaml` does not exist; mcp_server/README.md links to `cursor_rules.md`, but `mcp_server/cursor_rules.md` does not exist; mcp_server/docker/README-falkordb-combined.md runs `docker compose -f docker/docker-compose-falkordb-combined.yml up`, but `docker/docker-compose-falkordb-combined.yml` does not exist.
Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €59,000 to build again, about 0.4 person-years of work. Its weakest lens is Security and Compliance, at 34 (Weak). Security and Compliance is about how well the product is protected, and how it handles personal data. Because the weakest lens counts most in the score, work on Security and Compliance also moves the score most.
Based on: the rebuild estimate · the Security and Compliance grade · how much each lens counts
What to do: Start with the Security and Compliance actions in Top priorities.
If you do one thing first · First action
Protect endpoints by default-deny: a global authentication guard or middleware with explicit public opt-outs, or a guard on every route, plus named role/permission rules for what an authenticated caller may do. Of all the actions in this report, it raises the score most for the work it takes: about 12 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
169 modules, with 355 dependencies between them. Every module uses only modules listed above it, so there are no loops.
The table shows the 40 modules with the most connections; 129 more are left out to keep it readable.
Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
graphiti_core.driver.driver uses graphiti_core.driver.query_executor, so a change to graphiti_core.driver.query_executor can break graphiti_core.driver.driver, while a change to graphiti_core.driver.driver can't break graphiti_core.driver.query_executor.
Position
Below the diagonal: graphiti_core.driver.driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.search_ops uses graphiti_core.driver.query_executor, so a change to graphiti_core.driver.query_executor can break graphiti_core.driver.operations.search_ops, while a change to graphiti_core.driver.operations.search_ops can't break graphiti_core.driver.query_executor.
Position
Below the diagonal: graphiti_core.driver.operations.search_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.search_ops uses graphiti_core.search.search_filters, so a change to graphiti_core.search.search_filters can break graphiti_core.driver.operations.search_ops, while a change to graphiti_core.driver.operations.search_ops can't break graphiti_core.search.search_filters.
Position
Below the diagonal: graphiti_core.driver.operations.search_ops uses a module listed above it, which is the healthy direction.
graphiti_core.llm_client.client uses graphiti_core.llm_client.config, so a change to graphiti_core.llm_client.config can break graphiti_core.llm_client.client, while a change to graphiti_core.llm_client.client can't break graphiti_core.llm_client.config.
Position
Below the diagonal: graphiti_core.llm_client.client uses a module listed above it, which is the healthy direction.
graphiti_core.llm_client.client uses graphiti_core.tracer, so a change to graphiti_core.tracer can break graphiti_core.llm_client.client, while a change to graphiti_core.llm_client.client can't break graphiti_core.tracer.
Position
Below the diagonal: graphiti_core.llm_client.client uses a module listed above it, which is the healthy direction.
graphiti_core.edges uses graphiti_core.embedder.client, so a change to graphiti_core.embedder.client can break graphiti_core.edges, while a change to graphiti_core.edges can't break graphiti_core.embedder.client.
Position
Below the diagonal: graphiti_core.edges uses a module listed above it, which is the healthy direction.
graphiti_core.edges uses graphiti_core.driver.driver, so a change to graphiti_core.driver.driver can break graphiti_core.edges, while a change to graphiti_core.edges can't break graphiti_core.driver.driver.
Position
Below the diagonal: graphiti_core.edges uses a module listed above it, which is the healthy direction.
graphiti_core.graphiti_types uses graphiti_core.cross_encoder.client, so a change to graphiti_core.cross_encoder.client can break graphiti_core.graphiti_types, while a change to graphiti_core.graphiti_types can't break graphiti_core.cross_encoder.client.
Position
Below the diagonal: graphiti_core.graphiti_types uses a module listed above it, which is the healthy direction.
graphiti_core.graphiti_types uses graphiti_core.embedder.client, so a change to graphiti_core.embedder.client can break graphiti_core.graphiti_types, while a change to graphiti_core.graphiti_types can't break graphiti_core.embedder.client.
Position
Below the diagonal: graphiti_core.graphiti_types uses a module listed above it, which is the healthy direction.
graphiti_core.graphiti_types uses graphiti_core.llm_client.config, so a change to graphiti_core.llm_client.config can break graphiti_core.graphiti_types, while a change to graphiti_core.graphiti_types can't break graphiti_core.llm_client.config.
Position
Below the diagonal: graphiti_core.graphiti_types uses a module listed above it, which is the healthy direction.
graphiti_core.graphiti_types uses graphiti_core.tracer, so a change to graphiti_core.tracer can break graphiti_core.graphiti_types, while a change to graphiti_core.graphiti_types can't break graphiti_core.tracer.
Position
Below the diagonal: graphiti_core.graphiti_types uses a module listed above it, which is the healthy direction.
graphiti_core.graphiti_types uses graphiti_core.driver.driver, so a change to graphiti_core.driver.driver can break graphiti_core.graphiti_types, while a change to graphiti_core.graphiti_types can't break graphiti_core.driver.driver.
Position
Below the diagonal: graphiti_core.graphiti_types uses a module listed above it, which is the healthy direction.
graphiti_core.graphiti_types uses graphiti_core.llm_client.client, so a change to graphiti_core.llm_client.client can break graphiti_core.graphiti_types, while a change to graphiti_core.graphiti_types can't break graphiti_core.llm_client.client.
Position
Below the diagonal: graphiti_core.graphiti_types uses a module listed above it, which is the healthy direction.
graphiti_core.llm_client.llm_runtime uses graphiti_core.llm_client.config, so a change to graphiti_core.llm_client.config can break graphiti_core.llm_client.llm_runtime, while a change to graphiti_core.llm_client.llm_runtime can't break graphiti_core.llm_client.config.
Position
Below the diagonal: graphiti_core.llm_client.llm_runtime uses a module listed above it, which is the healthy direction.
graphiti_core.llm_client.llm_runtime uses graphiti_core.tracer, so a change to graphiti_core.tracer can break graphiti_core.llm_client.llm_runtime, while a change to graphiti_core.llm_client.llm_runtime can't break graphiti_core.tracer.
Position
Below the diagonal: graphiti_core.llm_client.llm_runtime uses a module listed above it, which is the healthy direction.
graphiti_core.llm_client.llm_runtime uses graphiti_core.llm_client.client, so a change to graphiti_core.llm_client.client can break graphiti_core.llm_client.llm_runtime, while a change to graphiti_core.llm_client.llm_runtime can't break graphiti_core.llm_client.client.
Position
Below the diagonal: graphiti_core.llm_client.llm_runtime uses a module listed above it, which is the healthy direction.
graphiti_core.llm_client.openai_base_client uses graphiti_core.llm_client.config, so a change to graphiti_core.llm_client.config can break graphiti_core.llm_client.openai_base_client, while a change to graphiti_core.llm_client.openai_base_client can't break graphiti_core.llm_client.config.
Position
Below the diagonal: graphiti_core.llm_client.openai_base_client uses a module listed above it, which is the healthy direction.
graphiti_core.llm_client.openai_base_client uses graphiti_core.llm_client.client, so a change to graphiti_core.llm_client.client can break graphiti_core.llm_client.openai_base_client, while a change to graphiti_core.llm_client.openai_base_client can't break graphiti_core.llm_client.client.
Position
Below the diagonal: graphiti_core.llm_client.openai_base_client uses a module listed above it, which is the healthy direction.
graphiti_core.nodes uses graphiti_core.embedder.client, so a change to graphiti_core.embedder.client can break graphiti_core.nodes, while a change to graphiti_core.nodes can't break graphiti_core.embedder.client.
Position
Below the diagonal: graphiti_core.nodes uses a module listed above it, which is the healthy direction.
graphiti_core.nodes uses graphiti_core.driver.driver, so a change to graphiti_core.driver.driver can break graphiti_core.nodes, while a change to graphiti_core.nodes can't break graphiti_core.driver.driver.
Position
Below the diagonal: graphiti_core.nodes uses a module listed above it, which is the healthy direction.
mcp_server.src.services.factories uses graphiti_core.cross_encoder.client, so a change to graphiti_core.cross_encoder.client can break mcp_server.src.services.factories, while a change to mcp_server.src.services.factories can't break graphiti_core.cross_encoder.client.
Position
Below the diagonal: mcp_server.src.services.factories uses a module listed above it, which is the healthy direction.
mcp_server.src.services.factories uses graphiti_core.embedder.client, so a change to graphiti_core.embedder.client can break mcp_server.src.services.factories, while a change to mcp_server.src.services.factories can't break graphiti_core.embedder.client.
Position
Below the diagonal: mcp_server.src.services.factories uses a module listed above it, which is the healthy direction.
mcp_server.src.services.factories uses graphiti_core.llm_client.client, so a change to graphiti_core.llm_client.client can break mcp_server.src.services.factories, while a change to mcp_server.src.services.factories can't break graphiti_core.llm_client.client.
Position
Below the diagonal: mcp_server.src.services.factories uses a module listed above it, which is the healthy direction.
tests.e2e_prompt_library_ingest uses graphiti_core.cross_encoder.client, so a change to graphiti_core.cross_encoder.client can break tests.e2e_prompt_library_ingest, while a change to tests.e2e_prompt_library_ingest can't break graphiti_core.cross_encoder.client.
Position
Below the diagonal: tests.e2e_prompt_library_ingest uses a module listed above it, which is the healthy direction.
tests.e2e_prompt_library_ingest uses graphiti_core.embedder.client, so a change to graphiti_core.embedder.client can break tests.e2e_prompt_library_ingest, while a change to tests.e2e_prompt_library_ingest can't break graphiti_core.embedder.client.
Position
Below the diagonal: tests.e2e_prompt_library_ingest uses a module listed above it, which is the healthy direction.
tests.e2e_prompt_library_ingest uses graphiti_core.llm_client.config, so a change to graphiti_core.llm_client.config can break tests.e2e_prompt_library_ingest, while a change to tests.e2e_prompt_library_ingest can't break graphiti_core.llm_client.config.
Position
Below the diagonal: tests.e2e_prompt_library_ingest uses a module listed above it, which is the healthy direction.
tests.e2e_prompt_library_ingest uses graphiti_core.llm_client.client, so a change to graphiti_core.llm_client.client can break tests.e2e_prompt_library_ingest, while a change to tests.e2e_prompt_library_ingest can't break graphiti_core.llm_client.client.
Position
Below the diagonal: tests.e2e_prompt_library_ingest uses a module listed above it, which is the healthy direction.
graphiti_core uses graphiti_core.embedder.client, so a change to graphiti_core.embedder.client can break graphiti_core, while a change to graphiti_core can't break graphiti_core.embedder.client.
Position
Below the diagonal: graphiti_core uses a module listed above it, which is the healthy direction.
graphiti_core uses graphiti_core.llm_client.config, so a change to graphiti_core.llm_client.config can break graphiti_core, while a change to graphiti_core can't break graphiti_core.llm_client.config.
Position
Below the diagonal: graphiti_core uses a module listed above it, which is the healthy direction.
graphiti_core uses graphiti_core.tracer, so a change to graphiti_core.tracer can break graphiti_core, while a change to graphiti_core can't break graphiti_core.tracer.
Position
Below the diagonal: graphiti_core uses a module listed above it, which is the healthy direction.
graphiti_core uses graphiti_core.driver.driver, so a change to graphiti_core.driver.driver can break graphiti_core, while a change to graphiti_core can't break graphiti_core.driver.driver.
Position
Below the diagonal: graphiti_core uses a module listed above it, which is the healthy direction.
graphiti_core uses graphiti_core.llm_client.client, so a change to graphiti_core.llm_client.client can break graphiti_core, while a change to graphiti_core can't break graphiti_core.llm_client.client.
Position
Below the diagonal: graphiti_core uses a module listed above it, which is the healthy direction.
graphiti_core uses graphiti_core.edges, so a change to graphiti_core.edges can break graphiti_core, while a change to graphiti_core can't break graphiti_core.edges.
Position
Below the diagonal: graphiti_core uses a module listed above it, which is the healthy direction.
graphiti_core uses graphiti_core.nodes, so a change to graphiti_core.nodes can break graphiti_core, while a change to graphiti_core can't break graphiti_core.nodes.
Position
Below the diagonal: graphiti_core uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.community_edge_ops uses graphiti_core.driver.query_executor, so a change to graphiti_core.driver.query_executor can break graphiti_core.driver.operations.community_edge_ops, while a change to graphiti_core.driver.operations.community_edge_ops can't break graphiti_core.driver.query_executor.
Position
Below the diagonal: graphiti_core.driver.operations.community_edge_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.community_edge_ops uses graphiti_core.edges, so a change to graphiti_core.edges can break graphiti_core.driver.operations.community_edge_ops, while a change to graphiti_core.driver.operations.community_edge_ops can't break graphiti_core.edges.
Position
Below the diagonal: graphiti_core.driver.operations.community_edge_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.community_node_ops uses graphiti_core.driver.query_executor, so a change to graphiti_core.driver.query_executor can break graphiti_core.driver.operations.community_node_ops, while a change to graphiti_core.driver.operations.community_node_ops can't break graphiti_core.driver.query_executor.
Position
Below the diagonal: graphiti_core.driver.operations.community_node_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.community_node_ops uses graphiti_core.nodes, so a change to graphiti_core.nodes can break graphiti_core.driver.operations.community_node_ops, while a change to graphiti_core.driver.operations.community_node_ops can't break graphiti_core.nodes.
Position
Below the diagonal: graphiti_core.driver.operations.community_node_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.entity_edge_ops uses graphiti_core.driver.query_executor, so a change to graphiti_core.driver.query_executor can break graphiti_core.driver.operations.entity_edge_ops, while a change to graphiti_core.driver.operations.entity_edge_ops can't break graphiti_core.driver.query_executor.
Position
Below the diagonal: graphiti_core.driver.operations.entity_edge_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.entity_edge_ops uses graphiti_core.edges, so a change to graphiti_core.edges can break graphiti_core.driver.operations.entity_edge_ops, while a change to graphiti_core.driver.operations.entity_edge_ops can't break graphiti_core.edges.
Position
Below the diagonal: graphiti_core.driver.operations.entity_edge_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.entity_node_ops uses graphiti_core.driver.query_executor, so a change to graphiti_core.driver.query_executor can break graphiti_core.driver.operations.entity_node_ops, while a change to graphiti_core.driver.operations.entity_node_ops can't break graphiti_core.driver.query_executor.
Position
Below the diagonal: graphiti_core.driver.operations.entity_node_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.entity_node_ops uses graphiti_core.nodes, so a change to graphiti_core.nodes can break graphiti_core.driver.operations.entity_node_ops, while a change to graphiti_core.driver.operations.entity_node_ops can't break graphiti_core.nodes.
Position
Below the diagonal: graphiti_core.driver.operations.entity_node_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.episode_node_ops uses graphiti_core.driver.query_executor, so a change to graphiti_core.driver.query_executor can break graphiti_core.driver.operations.episode_node_ops, while a change to graphiti_core.driver.operations.episode_node_ops can't break graphiti_core.driver.query_executor.
Position
Below the diagonal: graphiti_core.driver.operations.episode_node_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.episode_node_ops uses graphiti_core.nodes, so a change to graphiti_core.nodes can break graphiti_core.driver.operations.episode_node_ops, while a change to graphiti_core.driver.operations.episode_node_ops can't break graphiti_core.nodes.
Position
Below the diagonal: graphiti_core.driver.operations.episode_node_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.episodic_edge_ops uses graphiti_core.driver.query_executor, so a change to graphiti_core.driver.query_executor can break graphiti_core.driver.operations.episodic_edge_ops, while a change to graphiti_core.driver.operations.episodic_edge_ops can't break graphiti_core.driver.query_executor.
Position
Below the diagonal: graphiti_core.driver.operations.episodic_edge_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.episodic_edge_ops uses graphiti_core.edges, so a change to graphiti_core.edges can break graphiti_core.driver.operations.episodic_edge_ops, while a change to graphiti_core.driver.operations.episodic_edge_ops can't break graphiti_core.edges.
Position
Below the diagonal: graphiti_core.driver.operations.episodic_edge_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.graph_ops uses graphiti_core.driver.query_executor, so a change to graphiti_core.driver.query_executor can break graphiti_core.driver.operations.graph_ops, while a change to graphiti_core.driver.operations.graph_ops can't break graphiti_core.driver.query_executor.
Position
Below the diagonal: graphiti_core.driver.operations.graph_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.graph_ops uses graphiti_core.nodes, so a change to graphiti_core.nodes can break graphiti_core.driver.operations.graph_ops, while a change to graphiti_core.driver.operations.graph_ops can't break graphiti_core.nodes.
Position
Below the diagonal: graphiti_core.driver.operations.graph_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.has_episode_edge_ops uses graphiti_core.driver.query_executor, so a change to graphiti_core.driver.query_executor can break graphiti_core.driver.operations.has_episode_edge_ops, while a change to graphiti_core.driver.operations.has_episode_edge_ops can't break graphiti_core.driver.query_executor.
Position
Below the diagonal: graphiti_core.driver.operations.has_episode_edge_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.has_episode_edge_ops uses graphiti_core.edges, so a change to graphiti_core.edges can break graphiti_core.driver.operations.has_episode_edge_ops, while a change to graphiti_core.driver.operations.has_episode_edge_ops can't break graphiti_core.edges.
Position
Below the diagonal: graphiti_core.driver.operations.has_episode_edge_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.next_episode_edge_ops uses graphiti_core.driver.query_executor, so a change to graphiti_core.driver.query_executor can break graphiti_core.driver.operations.next_episode_edge_ops, while a change to graphiti_core.driver.operations.next_episode_edge_ops can't break graphiti_core.driver.query_executor.
Position
Below the diagonal: graphiti_core.driver.operations.next_episode_edge_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.next_episode_edge_ops uses graphiti_core.edges, so a change to graphiti_core.edges can break graphiti_core.driver.operations.next_episode_edge_ops, while a change to graphiti_core.driver.operations.next_episode_edge_ops can't break graphiti_core.edges.
Position
Below the diagonal: graphiti_core.driver.operations.next_episode_edge_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.saga_node_ops uses graphiti_core.driver.query_executor, so a change to graphiti_core.driver.query_executor can break graphiti_core.driver.operations.saga_node_ops, while a change to graphiti_core.driver.operations.saga_node_ops can't break graphiti_core.driver.query_executor.
Position
Below the diagonal: graphiti_core.driver.operations.saga_node_ops uses a module listed above it, which is the healthy direction.
graphiti_core.driver.operations.saga_node_ops uses graphiti_core.nodes, so a change to graphiti_core.nodes can break graphiti_core.driver.operations.saga_node_ops, while a change to graphiti_core.driver.operations.saga_node_ops can't break graphiti_core.nodes.
Position
Below the diagonal: graphiti_core.driver.operations.saga_node_ops uses a module listed above it, which is the healthy direction.
graphiti_core.graphiti uses graphiti_core.edges, so a change to graphiti_core.edges can break graphiti_core.graphiti, while a change to graphiti_core.graphiti can't break graphiti_core.edges.
Position
Below the diagonal: graphiti_core.graphiti uses a module listed above it, which is the healthy direction.
graphiti_core.graphiti uses graphiti_core.nodes, so a change to graphiti_core.nodes can break graphiti_core.graphiti, while a change to graphiti_core.graphiti can't break graphiti_core.nodes.
Position
Below the diagonal: graphiti_core.graphiti uses a module listed above it, which is the healthy direction.
graphiti_core.search uses graphiti_core.cross_encoder.client, so a change to graphiti_core.cross_encoder.client can break graphiti_core.search, while a change to graphiti_core.search can't break graphiti_core.cross_encoder.client.
Position
Below the diagonal: graphiti_core.search uses a module listed above it, which is the healthy direction.
graphiti_core.search uses graphiti_core.search.search_filters, so a change to graphiti_core.search.search_filters can break graphiti_core.search, while a change to graphiti_core.search can't break graphiti_core.search.search_filters.
Position
Below the diagonal: graphiti_core.search uses a module listed above it, which is the healthy direction.
graphiti_core.search uses graphiti_core.tracer, so a change to graphiti_core.tracer can break graphiti_core.search, while a change to graphiti_core.search can't break graphiti_core.tracer.
Position
Below the diagonal: graphiti_core.search uses a module listed above it, which is the healthy direction.
graphiti_core.search uses graphiti_core.driver.driver, so a change to graphiti_core.driver.driver can break graphiti_core.search, while a change to graphiti_core.search can't break graphiti_core.driver.driver.
Position
Below the diagonal: graphiti_core.search uses a module listed above it, which is the healthy direction.
graphiti_core.search uses graphiti_core.edges, so a change to graphiti_core.edges can break graphiti_core.search, while a change to graphiti_core.search can't break graphiti_core.edges.
Position
Below the diagonal: graphiti_core.search uses a module listed above it, which is the healthy direction.
graphiti_core.search uses graphiti_core.graphiti_types, so a change to graphiti_core.graphiti_types can break graphiti_core.search, while a change to graphiti_core.search can't break graphiti_core.graphiti_types.
Position
Below the diagonal: graphiti_core.search uses a module listed above it, which is the healthy direction.
graphiti_core.utils uses graphiti_core.embedder.client, so a change to graphiti_core.embedder.client can break graphiti_core.utils, while a change to graphiti_core.utils can't break graphiti_core.embedder.client.
Position
Below the diagonal: graphiti_core.utils uses a module listed above it, which is the healthy direction.
graphiti_core.utils uses graphiti_core.driver.driver, so a change to graphiti_core.driver.driver can break graphiti_core.utils, while a change to graphiti_core.utils can't break graphiti_core.driver.driver.
Position
Below the diagonal: graphiti_core.utils uses a module listed above it, which is the healthy direction.
graphiti_core.utils uses graphiti_core.graphiti_types, so a change to graphiti_core.graphiti_types can break graphiti_core.utils, while a change to graphiti_core.utils can't break graphiti_core.graphiti_types.
Position
Below the diagonal: graphiti_core.utils uses a module listed above it, which is the healthy direction.
graphiti_core.utils uses graphiti_core.nodes, so a change to graphiti_core.nodes can break graphiti_core.utils, while a change to graphiti_core.utils can't break graphiti_core.nodes.
Position
Below the diagonal: graphiti_core.utils uses a module listed above it, which is the healthy direction.
graphiti_core.utils.maintenance uses graphiti_core.embedder.client, so a change to graphiti_core.embedder.client can break graphiti_core.utils.maintenance, while a change to graphiti_core.utils.maintenance can't break graphiti_core.embedder.client.
Position
Below the diagonal: graphiti_core.utils.maintenance uses a module listed above it, which is the healthy direction.
graphiti_core.utils.maintenance uses graphiti_core.search.search_filters, so a change to graphiti_core.search.search_filters can break graphiti_core.utils.maintenance, while a change to graphiti_core.utils.maintenance can't break graphiti_core.search.search_filters.
Position
Below the diagonal: graphiti_core.utils.maintenance uses a module listed above it, which is the healthy direction.
graphiti_core.utils.maintenance uses graphiti_core.driver.driver, so a change to graphiti_core.driver.driver can break graphiti_core.utils.maintenance, while a change to graphiti_core.utils.maintenance can't break graphiti_core.driver.driver.
Position
Below the diagonal: graphiti_core.utils.maintenance uses a module listed above it, which is the healthy direction.
graphiti_core.utils.maintenance uses graphiti_core.llm_client.client, so a change to graphiti_core.llm_client.client can break graphiti_core.utils.maintenance, while a change to graphiti_core.utils.maintenance can't break graphiti_core.llm_client.client.
Position
Below the diagonal: graphiti_core.utils.maintenance uses a module listed above it, which is the healthy direction.
graphiti_core.utils.maintenance uses graphiti_core.edges, so a change to graphiti_core.edges can break graphiti_core.utils.maintenance, while a change to graphiti_core.utils.maintenance can't break graphiti_core.edges.
Position
Below the diagonal: graphiti_core.utils.maintenance uses a module listed above it, which is the healthy direction.
graphiti_core.utils.maintenance uses graphiti_core.graphiti_types, so a change to graphiti_core.graphiti_types can break graphiti_core.utils.maintenance, while a change to graphiti_core.utils.maintenance can't break graphiti_core.graphiti_types.
Position
Below the diagonal: graphiti_core.utils.maintenance uses a module listed above it, which is the healthy direction.
graphiti_core.utils.maintenance uses graphiti_core.nodes, so a change to graphiti_core.nodes can break graphiti_core.utils.maintenance, while a change to graphiti_core.utils.maintenance can't break graphiti_core.nodes.
Position
Below the diagonal: graphiti_core.utils.maintenance uses a module listed above it, which is the healthy direction.
graphiti_core.driver.falkordb_driver uses graphiti_core.driver.driver, so a change to graphiti_core.driver.driver can break graphiti_core.driver.falkordb_driver, while a change to graphiti_core.driver.falkordb_driver can't break graphiti_core.driver.driver.
Position
Below the diagonal: graphiti_core.driver.falkordb_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.falkordb_driver uses graphiti_core.driver.operations.search_ops, so a change to graphiti_core.driver.operations.search_ops can break graphiti_core.driver.falkordb_driver, while a change to graphiti_core.driver.falkordb_driver can't break graphiti_core.driver.operations.search_ops.
Position
Below the diagonal: graphiti_core.driver.falkordb_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.falkordb_driver uses graphiti_core.driver.operations.community_edge_ops, so a change to graphiti_core.driver.operations.community_edge_ops can break graphiti_core.driver.falkordb_driver, while a change to graphiti_core.driver.falkordb_driver can't break graphiti_core.driver.operations.community_edge_ops.
Position
Below the diagonal: graphiti_core.driver.falkordb_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.falkordb_driver uses graphiti_core.driver.operations.community_node_ops, so a change to graphiti_core.driver.operations.community_node_ops can break graphiti_core.driver.falkordb_driver, while a change to graphiti_core.driver.falkordb_driver can't break graphiti_core.driver.operations.community_node_ops.
Position
Below the diagonal: graphiti_core.driver.falkordb_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.falkordb_driver uses graphiti_core.driver.operations.entity_edge_ops, so a change to graphiti_core.driver.operations.entity_edge_ops can break graphiti_core.driver.falkordb_driver, while a change to graphiti_core.driver.falkordb_driver can't break graphiti_core.driver.operations.entity_edge_ops.
Position
Below the diagonal: graphiti_core.driver.falkordb_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.falkordb_driver uses graphiti_core.driver.operations.entity_node_ops, so a change to graphiti_core.driver.operations.entity_node_ops can break graphiti_core.driver.falkordb_driver, while a change to graphiti_core.driver.falkordb_driver can't break graphiti_core.driver.operations.entity_node_ops.
Position
Below the diagonal: graphiti_core.driver.falkordb_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.falkordb_driver uses graphiti_core.driver.operations.episode_node_ops, so a change to graphiti_core.driver.operations.episode_node_ops can break graphiti_core.driver.falkordb_driver, while a change to graphiti_core.driver.falkordb_driver can't break graphiti_core.driver.operations.episode_node_ops.
Position
Below the diagonal: graphiti_core.driver.falkordb_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.falkordb_driver uses graphiti_core.driver.operations.episodic_edge_ops, so a change to graphiti_core.driver.operations.episodic_edge_ops can break graphiti_core.driver.falkordb_driver, while a change to graphiti_core.driver.falkordb_driver can't break graphiti_core.driver.operations.episodic_edge_ops.
Position
Below the diagonal: graphiti_core.driver.falkordb_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.falkordb_driver uses graphiti_core.driver.operations.graph_ops, so a change to graphiti_core.driver.operations.graph_ops can break graphiti_core.driver.falkordb_driver, while a change to graphiti_core.driver.falkordb_driver can't break graphiti_core.driver.operations.graph_ops.
Position
Below the diagonal: graphiti_core.driver.falkordb_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.falkordb_driver uses graphiti_core.driver.operations.has_episode_edge_ops, so a change to graphiti_core.driver.operations.has_episode_edge_ops can break graphiti_core.driver.falkordb_driver, while a change to graphiti_core.driver.falkordb_driver can't break graphiti_core.driver.operations.has_episode_edge_ops.
Position
Below the diagonal: graphiti_core.driver.falkordb_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.falkordb_driver uses graphiti_core.driver.operations.next_episode_edge_ops, so a change to graphiti_core.driver.operations.next_episode_edge_ops can break graphiti_core.driver.falkordb_driver, while a change to graphiti_core.driver.falkordb_driver can't break graphiti_core.driver.operations.next_episode_edge_ops.
Position
Below the diagonal: graphiti_core.driver.falkordb_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.falkordb_driver uses graphiti_core.driver.operations.saga_node_ops, so a change to graphiti_core.driver.operations.saga_node_ops can break graphiti_core.driver.falkordb_driver, while a change to graphiti_core.driver.falkordb_driver can't break graphiti_core.driver.operations.saga_node_ops.
Position
Below the diagonal: graphiti_core.driver.falkordb_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.kuzu_driver uses graphiti_core.driver.driver, so a change to graphiti_core.driver.driver can break graphiti_core.driver.kuzu_driver, while a change to graphiti_core.driver.kuzu_driver can't break graphiti_core.driver.driver.
Position
Below the diagonal: graphiti_core.driver.kuzu_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.kuzu_driver uses graphiti_core.driver.operations.search_ops, so a change to graphiti_core.driver.operations.search_ops can break graphiti_core.driver.kuzu_driver, while a change to graphiti_core.driver.kuzu_driver can't break graphiti_core.driver.operations.search_ops.
Position
Below the diagonal: graphiti_core.driver.kuzu_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.kuzu_driver uses graphiti_core.driver.operations.community_edge_ops, so a change to graphiti_core.driver.operations.community_edge_ops can break graphiti_core.driver.kuzu_driver, while a change to graphiti_core.driver.kuzu_driver can't break graphiti_core.driver.operations.community_edge_ops.
Position
Below the diagonal: graphiti_core.driver.kuzu_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.kuzu_driver uses graphiti_core.driver.operations.community_node_ops, so a change to graphiti_core.driver.operations.community_node_ops can break graphiti_core.driver.kuzu_driver, while a change to graphiti_core.driver.kuzu_driver can't break graphiti_core.driver.operations.community_node_ops.
Position
Below the diagonal: graphiti_core.driver.kuzu_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.kuzu_driver uses graphiti_core.driver.operations.entity_edge_ops, so a change to graphiti_core.driver.operations.entity_edge_ops can break graphiti_core.driver.kuzu_driver, while a change to graphiti_core.driver.kuzu_driver can't break graphiti_core.driver.operations.entity_edge_ops.
Position
Below the diagonal: graphiti_core.driver.kuzu_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.kuzu_driver uses graphiti_core.driver.operations.entity_node_ops, so a change to graphiti_core.driver.operations.entity_node_ops can break graphiti_core.driver.kuzu_driver, while a change to graphiti_core.driver.kuzu_driver can't break graphiti_core.driver.operations.entity_node_ops.
Position
Below the diagonal: graphiti_core.driver.kuzu_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.kuzu_driver uses graphiti_core.driver.operations.episode_node_ops, so a change to graphiti_core.driver.operations.episode_node_ops can break graphiti_core.driver.kuzu_driver, while a change to graphiti_core.driver.kuzu_driver can't break graphiti_core.driver.operations.episode_node_ops.
Position
Below the diagonal: graphiti_core.driver.kuzu_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.kuzu_driver uses graphiti_core.driver.operations.episodic_edge_ops, so a change to graphiti_core.driver.operations.episodic_edge_ops can break graphiti_core.driver.kuzu_driver, while a change to graphiti_core.driver.kuzu_driver can't break graphiti_core.driver.operations.episodic_edge_ops.
Position
Below the diagonal: graphiti_core.driver.kuzu_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.kuzu_driver uses graphiti_core.driver.operations.graph_ops, so a change to graphiti_core.driver.operations.graph_ops can break graphiti_core.driver.kuzu_driver, while a change to graphiti_core.driver.kuzu_driver can't break graphiti_core.driver.operations.graph_ops.
Position
Below the diagonal: graphiti_core.driver.kuzu_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.kuzu_driver uses graphiti_core.driver.operations.has_episode_edge_ops, so a change to graphiti_core.driver.operations.has_episode_edge_ops can break graphiti_core.driver.kuzu_driver, while a change to graphiti_core.driver.kuzu_driver can't break graphiti_core.driver.operations.has_episode_edge_ops.
Position
Below the diagonal: graphiti_core.driver.kuzu_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.kuzu_driver uses graphiti_core.driver.operations.next_episode_edge_ops, so a change to graphiti_core.driver.operations.next_episode_edge_ops can break graphiti_core.driver.kuzu_driver, while a change to graphiti_core.driver.kuzu_driver can't break graphiti_core.driver.operations.next_episode_edge_ops.
Position
Below the diagonal: graphiti_core.driver.kuzu_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.kuzu_driver uses graphiti_core.driver.operations.saga_node_ops, so a change to graphiti_core.driver.operations.saga_node_ops can break graphiti_core.driver.kuzu_driver, while a change to graphiti_core.driver.kuzu_driver can't break graphiti_core.driver.operations.saga_node_ops.
Position
Below the diagonal: graphiti_core.driver.kuzu_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neo4j_driver uses graphiti_core.driver.query_executor, so a change to graphiti_core.driver.query_executor can break graphiti_core.driver.neo4j_driver, while a change to graphiti_core.driver.neo4j_driver can't break graphiti_core.driver.query_executor.
Position
Below the diagonal: graphiti_core.driver.neo4j_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neo4j_driver uses graphiti_core.driver.driver, so a change to graphiti_core.driver.driver can break graphiti_core.driver.neo4j_driver, while a change to graphiti_core.driver.neo4j_driver can't break graphiti_core.driver.driver.
Position
Below the diagonal: graphiti_core.driver.neo4j_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neo4j_driver uses graphiti_core.driver.operations.search_ops, so a change to graphiti_core.driver.operations.search_ops can break graphiti_core.driver.neo4j_driver, while a change to graphiti_core.driver.neo4j_driver can't break graphiti_core.driver.operations.search_ops.
Position
Below the diagonal: graphiti_core.driver.neo4j_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neo4j_driver uses graphiti_core.driver.operations.community_edge_ops, so a change to graphiti_core.driver.operations.community_edge_ops can break graphiti_core.driver.neo4j_driver, while a change to graphiti_core.driver.neo4j_driver can't break graphiti_core.driver.operations.community_edge_ops.
Position
Below the diagonal: graphiti_core.driver.neo4j_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neo4j_driver uses graphiti_core.driver.operations.community_node_ops, so a change to graphiti_core.driver.operations.community_node_ops can break graphiti_core.driver.neo4j_driver, while a change to graphiti_core.driver.neo4j_driver can't break graphiti_core.driver.operations.community_node_ops.
Position
Below the diagonal: graphiti_core.driver.neo4j_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neo4j_driver uses graphiti_core.driver.operations.entity_edge_ops, so a change to graphiti_core.driver.operations.entity_edge_ops can break graphiti_core.driver.neo4j_driver, while a change to graphiti_core.driver.neo4j_driver can't break graphiti_core.driver.operations.entity_edge_ops.
Position
Below the diagonal: graphiti_core.driver.neo4j_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neo4j_driver uses graphiti_core.driver.operations.entity_node_ops, so a change to graphiti_core.driver.operations.entity_node_ops can break graphiti_core.driver.neo4j_driver, while a change to graphiti_core.driver.neo4j_driver can't break graphiti_core.driver.operations.entity_node_ops.
Position
Below the diagonal: graphiti_core.driver.neo4j_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neo4j_driver uses graphiti_core.driver.operations.episode_node_ops, so a change to graphiti_core.driver.operations.episode_node_ops can break graphiti_core.driver.neo4j_driver, while a change to graphiti_core.driver.neo4j_driver can't break graphiti_core.driver.operations.episode_node_ops.
Position
Below the diagonal: graphiti_core.driver.neo4j_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neo4j_driver uses graphiti_core.driver.operations.episodic_edge_ops, so a change to graphiti_core.driver.operations.episodic_edge_ops can break graphiti_core.driver.neo4j_driver, while a change to graphiti_core.driver.neo4j_driver can't break graphiti_core.driver.operations.episodic_edge_ops.
Position
Below the diagonal: graphiti_core.driver.neo4j_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neo4j_driver uses graphiti_core.driver.operations.graph_ops, so a change to graphiti_core.driver.operations.graph_ops can break graphiti_core.driver.neo4j_driver, while a change to graphiti_core.driver.neo4j_driver can't break graphiti_core.driver.operations.graph_ops.
Position
Below the diagonal: graphiti_core.driver.neo4j_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neo4j_driver uses graphiti_core.driver.operations.has_episode_edge_ops, so a change to graphiti_core.driver.operations.has_episode_edge_ops can break graphiti_core.driver.neo4j_driver, while a change to graphiti_core.driver.neo4j_driver can't break graphiti_core.driver.operations.has_episode_edge_ops.
Position
Below the diagonal: graphiti_core.driver.neo4j_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neo4j_driver uses graphiti_core.driver.operations.next_episode_edge_ops, so a change to graphiti_core.driver.operations.next_episode_edge_ops can break graphiti_core.driver.neo4j_driver, while a change to graphiti_core.driver.neo4j_driver can't break graphiti_core.driver.operations.next_episode_edge_ops.
Position
Below the diagonal: graphiti_core.driver.neo4j_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neo4j_driver uses graphiti_core.driver.operations.saga_node_ops, so a change to graphiti_core.driver.operations.saga_node_ops can break graphiti_core.driver.neo4j_driver, while a change to graphiti_core.driver.neo4j_driver can't break graphiti_core.driver.operations.saga_node_ops.
Position
Below the diagonal: graphiti_core.driver.neo4j_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neptune_driver uses graphiti_core.driver.driver, so a change to graphiti_core.driver.driver can break graphiti_core.driver.neptune_driver, while a change to graphiti_core.driver.neptune_driver can't break graphiti_core.driver.driver.
Position
Below the diagonal: graphiti_core.driver.neptune_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neptune_driver uses graphiti_core.driver.operations.search_ops, so a change to graphiti_core.driver.operations.search_ops can break graphiti_core.driver.neptune_driver, while a change to graphiti_core.driver.neptune_driver can't break graphiti_core.driver.operations.search_ops.
Position
Below the diagonal: graphiti_core.driver.neptune_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neptune_driver uses graphiti_core.driver.operations.community_edge_ops, so a change to graphiti_core.driver.operations.community_edge_ops can break graphiti_core.driver.neptune_driver, while a change to graphiti_core.driver.neptune_driver can't break graphiti_core.driver.operations.community_edge_ops.
Position
Below the diagonal: graphiti_core.driver.neptune_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neptune_driver uses graphiti_core.driver.operations.community_node_ops, so a change to graphiti_core.driver.operations.community_node_ops can break graphiti_core.driver.neptune_driver, while a change to graphiti_core.driver.neptune_driver can't break graphiti_core.driver.operations.community_node_ops.
Position
Below the diagonal: graphiti_core.driver.neptune_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neptune_driver uses graphiti_core.driver.operations.entity_edge_ops, so a change to graphiti_core.driver.operations.entity_edge_ops can break graphiti_core.driver.neptune_driver, while a change to graphiti_core.driver.neptune_driver can't break graphiti_core.driver.operations.entity_edge_ops.
Position
Below the diagonal: graphiti_core.driver.neptune_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neptune_driver uses graphiti_core.driver.operations.entity_node_ops, so a change to graphiti_core.driver.operations.entity_node_ops can break graphiti_core.driver.neptune_driver, while a change to graphiti_core.driver.neptune_driver can't break graphiti_core.driver.operations.entity_node_ops.
Position
Below the diagonal: graphiti_core.driver.neptune_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neptune_driver uses graphiti_core.driver.operations.episode_node_ops, so a change to graphiti_core.driver.operations.episode_node_ops can break graphiti_core.driver.neptune_driver, while a change to graphiti_core.driver.neptune_driver can't break graphiti_core.driver.operations.episode_node_ops.
Position
Below the diagonal: graphiti_core.driver.neptune_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neptune_driver uses graphiti_core.driver.operations.episodic_edge_ops, so a change to graphiti_core.driver.operations.episodic_edge_ops can break graphiti_core.driver.neptune_driver, while a change to graphiti_core.driver.neptune_driver can't break graphiti_core.driver.operations.episodic_edge_ops.
Position
Below the diagonal: graphiti_core.driver.neptune_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neptune_driver uses graphiti_core.driver.operations.graph_ops, so a change to graphiti_core.driver.operations.graph_ops can break graphiti_core.driver.neptune_driver, while a change to graphiti_core.driver.neptune_driver can't break graphiti_core.driver.operations.graph_ops.
Position
Below the diagonal: graphiti_core.driver.neptune_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neptune_driver uses graphiti_core.driver.operations.has_episode_edge_ops, so a change to graphiti_core.driver.operations.has_episode_edge_ops can break graphiti_core.driver.neptune_driver, while a change to graphiti_core.driver.neptune_driver can't break graphiti_core.driver.operations.has_episode_edge_ops.
Position
Below the diagonal: graphiti_core.driver.neptune_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neptune_driver uses graphiti_core.driver.operations.next_episode_edge_ops, so a change to graphiti_core.driver.operations.next_episode_edge_ops can break graphiti_core.driver.neptune_driver, while a change to graphiti_core.driver.neptune_driver can't break graphiti_core.driver.operations.next_episode_edge_ops.
Position
Below the diagonal: graphiti_core.driver.neptune_driver uses a module listed above it, which is the healthy direction.
graphiti_core.driver.neptune_driver uses graphiti_core.driver.operations.saga_node_ops, so a change to graphiti_core.driver.operations.saga_node_ops can break graphiti_core.driver.neptune_driver, while a change to graphiti_core.driver.neptune_driver can't break graphiti_core.driver.operations.saga_node_ops.
Position
Below the diagonal: graphiti_core.driver.neptune_driver uses a module listed above it, which is the healthy direction.
graphiti_core.namespaces.edges uses graphiti_core.embedder.client, so a change to graphiti_core.embedder.client can break graphiti_core.namespaces.edges, while a change to graphiti_core.namespaces.edges can't break graphiti_core.embedder.client.
Position
Below the diagonal: graphiti_core.namespaces.edges uses a module listed above it, which is the healthy direction.
graphiti_core.namespaces.edges uses graphiti_core.driver.driver, so a change to graphiti_core.driver.driver can break graphiti_core.namespaces.edges, while a change to graphiti_core.namespaces.edges can't break graphiti_core.driver.driver.
Position
Below the diagonal: graphiti_core.namespaces.edges uses a module listed above it, which is the healthy direction.
graphiti_core.namespaces.edges uses graphiti_core.edges, so a change to graphiti_core.edges can break graphiti_core.namespaces.edges, while a change to graphiti_core.namespaces.edges can't break graphiti_core.edges.
Position
Below the diagonal: graphiti_core.namespaces.edges uses a module listed above it, which is the healthy direction.
graphiti_core.namespaces.edges uses graphiti_core.driver.operations.community_edge_ops, so a change to graphiti_core.driver.operations.community_edge_ops can break graphiti_core.namespaces.edges, while a change to graphiti_core.namespaces.edges can't break graphiti_core.driver.operations.community_edge_ops.
Position
Below the diagonal: graphiti_core.namespaces.edges uses a module listed above it, which is the healthy direction.
graphiti_core.namespaces.edges uses graphiti_core.driver.operations.entity_edge_ops, so a change to graphiti_core.driver.operations.entity_edge_ops can break graphiti_core.namespaces.edges, while a change to graphiti_core.namespaces.edges can't break graphiti_core.driver.operations.entity_edge_ops.
Position
Below the diagonal: graphiti_core.namespaces.edges uses a module listed above it, which is the healthy direction.
graphiti_core.namespaces.edges uses graphiti_core.driver.operations.episodic_edge_ops, so a change to graphiti_core.driver.operations.episodic_edge_ops can break graphiti_core.namespaces.edges, while a change to graphiti_core.namespaces.edges can't break graphiti_core.driver.operations.episodic_edge_ops.
Position
Below the diagonal: graphiti_core.namespaces.edges uses a module listed above it, which is the healthy direction.
graphiti_core.namespaces.edges uses graphiti_core.driver.operations.has_episode_edge_ops, so a change to graphiti_core.driver.operations.has_episode_edge_ops can break graphiti_core.namespaces.edges, while a change to graphiti_core.namespaces.edges can't break graphiti_core.driver.operations.has_episode_edge_ops.
Position
Below the diagonal: graphiti_core.namespaces.edges uses a module listed above it, which is the healthy direction.
graphiti_core.namespaces.edges uses graphiti_core.driver.operations.next_episode_edge_ops, so a change to graphiti_core.driver.operations.next_episode_edge_ops can break graphiti_core.namespaces.edges, while a change to graphiti_core.namespaces.edges can't break graphiti_core.driver.operations.next_episode_edge_ops.
Position
Below the diagonal: graphiti_core.namespaces.edges uses a module listed above it, which is the healthy direction.
graphiti_core.namespaces.nodes uses graphiti_core.embedder.client, so a change to graphiti_core.embedder.client can break graphiti_core.namespaces.nodes, while a change to graphiti_core.namespaces.nodes can't break graphiti_core.embedder.client.
Position
Below the diagonal: graphiti_core.namespaces.nodes uses a module listed above it, which is the healthy direction.
graphiti_core.namespaces.nodes uses graphiti_core.driver.driver, so a change to graphiti_core.driver.driver can break graphiti_core.namespaces.nodes, while a change to graphiti_core.namespaces.nodes can't break graphiti_core.driver.driver.
Position
Below the diagonal: graphiti_core.namespaces.nodes uses a module listed above it, which is the healthy direction.
graphiti_core.namespaces.nodes uses graphiti_core.nodes, so a change to graphiti_core.nodes can break graphiti_core.namespaces.nodes, while a change to graphiti_core.namespaces.nodes can't break graphiti_core.nodes.
Position
Below the diagonal: graphiti_core.namespaces.nodes uses a module listed above it, which is the healthy direction.
graphiti_core.namespaces.nodes uses graphiti_core.driver.operations.community_node_ops, so a change to graphiti_core.driver.operations.community_node_ops can break graphiti_core.namespaces.nodes, while a change to graphiti_core.namespaces.nodes can't break graphiti_core.driver.operations.community_node_ops.
Position
Below the diagonal: graphiti_core.namespaces.nodes uses a module listed above it, which is the healthy direction.
graphiti_core.namespaces.nodes uses graphiti_core.driver.operations.entity_node_ops, so a change to graphiti_core.driver.operations.entity_node_ops can break graphiti_core.namespaces.nodes, while a change to graphiti_core.namespaces.nodes can't break graphiti_core.driver.operations.entity_node_ops.
Position
Below the diagonal: graphiti_core.namespaces.nodes uses a module listed above it, which is the healthy direction.
graphiti_core.namespaces.nodes uses graphiti_core.driver.operations.episode_node_ops, so a change to graphiti_core.driver.operations.episode_node_ops can break graphiti_core.namespaces.nodes, while a change to graphiti_core.namespaces.nodes can't break graphiti_core.driver.operations.episode_node_ops.
Position
Below the diagonal: graphiti_core.namespaces.nodes uses a module listed above it, which is the healthy direction.
graphiti_core.namespaces.nodes uses graphiti_core.driver.operations.saga_node_ops, so a change to graphiti_core.driver.operations.saga_node_ops can break graphiti_core.namespaces.nodes, while a change to graphiti_core.namespaces.nodes can't break graphiti_core.driver.operations.saga_node_ops.
Position
Below the diagonal: graphiti_core.namespaces.nodes uses a module listed above it, which is the healthy direction.
mcp_server.src uses graphiti_core.driver.driver, so a change to graphiti_core.driver.driver can break mcp_server.src, while a change to mcp_server.src can't break graphiti_core.driver.driver.
Position
Below the diagonal: mcp_server.src uses a module listed above it, which is the healthy direction.
mcp_server.src uses graphiti_core.graphiti, so a change to graphiti_core.graphiti can break mcp_server.src, while a change to mcp_server.src can't break graphiti_core.graphiti.
Position
Below the diagonal: mcp_server.src uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 61% · Adequate · gated by X4 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A02:2025 — Security Misconfiguration
20
High / Critical
A05:2025 — Injection
11
High / Critical
A03:2025 — Software Supply Chain Failures
4
High / Critical
Roadmap
First, implement a global authentication guard with explicit public opt-outs and named role rules to secure all endpoints by default. Second, reconcile the README with the actual repository structure by correcting references to missing folders, files, and commands. Third, create a dedicated architecture documentation folder to record significant design decisions with their dates, contexts, and consequences. Finally, resolve the 200+ instances of interpolated log messages to ensure proper structured logging is maintained.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Protect endpoints by default-deny: a global authentication guard or middleware with explicit public opt-outs, or a guard on every route, plus named role/permission rules for what an authenticated caller may do.
Reconcile the README with reality: mcp_server/README.md changes into `graphiti/mcp_server`, but no such folder exists; mcp_server/README.md runs `docker compose -f docker/docker-compose.neo4j.yaml up`, but `docker/docker-compose.neo4j.yaml` does not exist; mcp_server/README.md runs `docker compose -f docker/docker-compose.falkordb.yaml up`, but `docker/docker-compose.falkordb.yaml` does not exist; mcp_server/README.md links to `cursor_rules.md`, but `mcp_server/cursor_rules.md` does not exist; mcp_server/docker/README-falkordb-combined.md runs `docker compose -f docker/docker-compose-falkordb-combined.yml up`, but `docker/docker-compose-falkordb-combined.yml` does not exist.
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 20
A definite problem that already costs you something and drags the score down: a
missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here
tends to cause failures elsewhere.
Serious — 264
Likely wrong, but not failing yet. It degrades
the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to
carry for two years either.
Minor — 82
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 16
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 58 of 61 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 3 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 61 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 359 of 366 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.py) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
D12 Dependency Hygiene — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. This repository's 13 shipped Python distribution(s) across 3 manifest(s) WERE read; what went unanswered is the currency half, because it grades an EXACT pin against the newest release and every declaration here is a floor or a range — which installs the newest release it admits and so cannot be behind one. So pypi.org was never asked. This is a true statement about the repository, and the healthy one, NOT a gap on our side: no reader we could write would find a currency question here.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is an ADMISSION gap, not an environment fault: it declares a published package (pyproject.toml), but no published-package marker D22 reads admitted any project here. D22 DOES collect the public API of every language in this tree, and admits a project only when its manifest makes that ecosystem's publication act in a form the marker recognises — so what is missing is not a collector but an admission rule for the publication act this repository makes, if it makes one. The remedy is a better discriminator for that marker — not a collector, and no change to the scan image can close it. The marker's rules are measured to refuse applications, so one refused repository is the rule working as calibrated; several are the evidence that it is too strict.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
AX6 Interface segregation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DockerCompose (REDACTED). compose up failed (exit 18 — an image could not be pulled) — time="2026-10-20T15:56:16Z" level=warning msg="The \"OPENAI_API_KEY\" variable is not set. Defaulting to a blank string." time="2026-10-20T15:56:16Z" level=warning msg="The \"OPENAI_API_KEY\" variable is not set. Defaulting to a blank string." neo4j Pulling neo4j Error Get "https://registry-1.docker.io/v2/": Forbidden Error response from daemon: Get "https://registry-1.docker.io/v2/": Forbidden; the earlier `compose pull` step reported: time="2026-10-20T15:56:16Z" level=warning msg="The \"OPENAI_API_KEY\" variable is not set. Defaulting to a blank string." graph Skipped - No image to be pulled neo4j Pulling neo4j Error Get "https://registry-1.docker.io/v2/": Forbidden Error response from daemon: Get "https://registry-1.docker.io/v2/": Forbidden; the runtime sandbox reaches registries only through the in-fence pull-through mirror, so an image the mirror does not carry cannot be fetched — this is a limit of our sandbox, not of your stack; runtime evidence skipped.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'neo4j' is imported (graphiti_core/helpers.py:26), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'neo4j' is imported (graphiti_core/helpers.py:26), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'neo4j' is imported (graphiti_core/helpers.py:26), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby or Scala was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby or Scala was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X16 Unfloored truncation loop — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala or PHP was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X29 Per-element action decided by a fixed element — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Rust, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, Rust, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X4 Structured logging — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 161 further occurrence(s) are not listed individually; the score already reflects all 201.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D11 Test Reliability: Flakiness is inferred from history/markers — Watchdog runs the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
P5 DR & Backup: Backup/restore and disaster-recovery readiness is judged from in-repo evidence — a config that exists is not a tested restore, so the absence of positive evidence is reported as "not evidenced", never scored as present.
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
The LLM boundary
LLM-set scores this run (3): D19, D21, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
+ 19 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 24 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with combined_extraction.extract_nodes_and_edges (cyclomatic 48), edge_operations.extract_edges (cyclomatic 38), search_filters.edge_search_filter_query_constructor (cyclomatic 35). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 24 together lifts Cyclomatic Complexity from 6.9 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 54 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 2 bodies over 60 down to 60 or less in Cognitive Complexity — start with search_filters.edge_search_filter_query_constructor (cognitive 92), combined_extraction.extract_nodes_and_edges (cognitive 80). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 2 together lifts Cognitive Complexity from 5.0 to about 5.7/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes9.3 / 10Stronggated by 6 serious findings✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 6 FileTooLong finding(s) in God Classes — start with graphiti.py, node_operations.py, graphiti_mcp_server.py. — One of this dimension's main actionable groups (6 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
130 duplicated block group(s) detected. A further 5 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 13 of the 135 are in trees this repository does not ship — vendored, example/demo, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.
+ 75 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 7 Duplicated block (12 lines × 3) finding(s) in Code Duplication — start with search_utils.py (2), community_edge_ops.py, episodic_edge_ops.py. — One of this dimension's main actionable groups (7 warning-level).
Resolve the 6 Duplicated block (10 lines × 3) finding(s) in Code Duplication — start with search_ops.py, community_edge_ops.py, episodic_edge_ops.py. — One of this dimension's main actionable groups (6 warning-level).
Resolve the 5 Duplicated block (24 lines × 3) finding(s) in Code Duplication — start with community_edge_ops.py, episode_node_ops.py, episodic_edge_ops.py. — One of this dimension's main actionable groups (5 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
3 production modules (Python), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 0 module(s) off the main sequence.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
914 test methods: 881 unit, 33 integration, 0 BDD, 0 e2e. The Python suite contributes 914 test function(s) across 83 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D11 · Test Reliability10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests pass reliably, with no flakiness.
Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 49 shipped Python distribution(s) use a banned license. Licences were resolved from PyPI over the distributions a consumer installs — this repository's 13 declared runtime requirement(s) closed transitively over each distribution's published `requires_dist` (36 reached that way). Requirements it states ONLY under an extra, a PEP 735 dependency group, a Poetry dev group or a dev-named requirements file are excluded: pip does not install any of them for a consumer. ★ This repository commits no dependency lockfile that this pass reads, so each licence is the one PyPI publishes for the distribution's CURRENT release rather than for a pinned version. This repository publishes itself under Apache-2.0, which is its own choice and is not judged here.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Top hotspots: graphiti_core/graphiti.py (8×21=168); graphiti_core/utils/maintenance/edge_operations.py (3×38=114); graphiti_core/utils/maintenance/combined_extraction.py (2×48=96) Repeated repair below the complexity floor: graphiti_core/driver/falkordb_driver.py (6 of 6 changes were fixes); graphiti_core/search/search_utils.py (5 of 5 changes were fixes); graphiti_core/driver/falkordb/operations/graph_ops.py (4 of 4 changes were fixes)
Resolve the 8 Repeated repair finding(s) in Churn × Complexity Hotspots — start with graph_ops.py (4), falkordb_driver.py, search_utils.py. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 7 Hotspot finding(s) in Churn × Complexity Hotspots — start with graphiti.py, edge_operations.py, combined_extraction.py. — One of this dimension's main actionable groups (7 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor9.9 / 10Exemplary✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
1 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is mcp_server/src/utils/type_config.py. Counted over 125 of the 193 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Off-boarding risk: anonymized user #1
✓ On the Gold path — maintain.
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
4 deducted task-comment markers across 40357 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
Resolve the 2 FixmeComment finding(s) in Explicit Debt — start with search_utils.py, bulk_utils.py. — One of this dimension's main actionable groups (2 warning-level).
Resolve the 2 TodoComment finding(s) in Explicit Debt — start with factories.py (2). — One of this dimension's main actionable groups (2 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
The repository's root README is clear and well-structured: it introduces the framework (Graphiti), shows a hiring note, lists project-wide badges for lint/unit tests, releases, arXiv, and stars, then documents the security policy scope. The mcp_server/README.md is an internal MCP server guide that is itself clipped by the scanner but fully outlines its features, installation, prerequisites, setup, running instructions, and optional LLM providers (Anthropic, Groq), matching what it claims to cover. Each example README (azure-openai, gliner2, jev) documents its own directory with a focused overview plus prerequisites, setup, prompt routing, and expected output; the examples are well written but not flagged as missing because they each focus on one topic and do not contradict each other. The only unflagged gap is an architecture/design doc (the single markdown file mentioned in the summary), which would fall under 'missing-architecture-docs' if present. The repository is well documented with a strong README for each directory (quickstart, mcp_server/docker, tests) that explains what the directory contains and how to run it. The root README gives an overview of the project, installation, usage, and contribution guidance, which is standard. A dedicated architecture/design document exists (cursor_rules.md), covering tool-use instructions with search-first, save-new-or-updated, and best-practice rules for agent memory. All visible documents are clear and complete; the clipped sections do not carry penalty.
What to do
Improve Documentation Quality — currently 8.0/10. — The repository's root README is clear and well-structured: it introduces the framework (Graphiti), shows a hiring note, lists project-wide badges for lint/unit tests, releases, arXiv, and stars, then documents the security policy scope. The mcp_server/README.md is an internal MCP server guide that is itself clipped by the scanner but fully outlines its features, installation, prerequisites, setup, running instructions, and optional LLM providers (Anthropic, Groq), matching what it claims to cover. Each example README (azure-openai, gliner2, jev) documents its own directory with a focused overview plus prerequisites, setup, prompt routing, and expected output; the examples are well written but not flagged as missing because they each focus on one topic and do not contradict each other. The only unflagged gap is an architecture/design doc (the single markdown file mentioned in the summary), which would fall under 'missing-architecture-docs' if present. The repository is well documented with a strong README for each directory (quickstart, mcp_server/docker, tests) that explains what the directory contains and how to run it. The root README gives an overview of the project, installation, usage, and contribution guidance, which is standard. A dedicated architecture/design document exists (cursor_rules.md), covering tool-use instructions with search-first, save-new-or-updated, and best-practice rules for agent memory. All visible documents are clear and complete; the clipped sections do not carry penalty.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
1 of 3 build units (Python) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
11 finding(s): 0 critical, 8 high, 1 medium, 2 low. semgrep hit a parse error in 3 file(s) — `REDACTED` (lines 70–119), `examples/ecommerce/runner.ipynb`, `REDACTED` (lines 56–194) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 5 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 3 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
Resolve the 1 High vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 10 High IaC finding(s) in IaC & Container Security — start with REDACTED (5), REDACTED.standalone (3), REDACTED. — One of this dimension's main actionable groups (10 issue-level).
Resolve the 9 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (4), REDACTED.standalone (2), REDACTED. — One of this dimension's main actionable groups (9 warning-level).
Resolve the 1 Low IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 125 of the 193 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 2 Change coupling finding(s) in Change Coupling — start with summarize_nodes.py, extract_edges.py. — One of this dimension's main actionable groups (2 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.
Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 13 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Other · Security — Whether access is authorized by default — a framework authorization attribute/decorator or policy, or imperative guard methods (throw-on-violation) called from handlers.
Method: Roslyn scan: [Authorize] usage and authorization policies, plus imperative throw-on-violation guard methods detected via syntax. Deterministic.
This repository serves requests — a request handler (@app.get() (server/graph_service/main.py:27) — and no route guard, auth-gate middleware, global guard or imperative check that refuses a caller (401/403, an Unauthorized/Forbidden error) was found: its endpoints may be unprotected. — server/graph_service/main.py:27
What to do
Protect endpoints by default-deny: a global authentication guard or middleware with explicit public opt-outs, or a guard on every route, plus named role/permission rules for what an authenticated caller may do.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
What to do
Group production code under src/ (or split deliberately, e.g. backend/ + frontend/) so production and tooling code aren't mixed at the root.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
mcp_server/README.md changes into `graphiti/mcp_server`, but no such folder exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — mcp_server/README.md:65
mcp_server/README.md runs `docker compose -f docker/docker-compose.neo4j.yaml up`, but `docker/docker-compose.neo4j.yaml` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — mcp_server/README.md:290
mcp_server/README.md runs `docker compose -f docker/docker-compose.falkordb.yaml up`, but `docker/docker-compose.falkordb.yaml` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — mcp_server/README.md:319
mcp_server/README.md links to `cursor_rules.md`, but `mcp_server/cursor_rules.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — mcp_server/README.md:640
mcp_server/docker/README-falkordb-combined.md runs `docker compose -f docker/docker-compose-falkordb-combined.yml up`, but `docker/docker-compose-falkordb-combined.yml` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — mcp_server/docker/README-falkordb-combined.md:34
mcp_server/docker/README-falkordb-combined.md runs `docker compose -f docker/docker-compose-falkordb-combined.yml logs -f graphiti-falkordb`, but `graphiti-falkordb` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — mcp_server/docker/README-falkordb-combined.md:111
mcp_server/docker/README-falkordb-combined.md names `docker-compose-falkordb-combined.yml`, but no file or folder `docker-compose-falkordb-combined.yml` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — mcp_server/docker/README-falkordb-combined.md:222
What to do
Reconcile the README with reality: mcp_server/README.md changes into `graphiti/mcp_server`, but no such folder exists; mcp_server/README.md runs `docker compose -f docker/docker-compose.neo4j.yaml up`, but `docker/docker-compose.neo4j.yaml` does not exist; mcp_server/README.md runs `docker compose -f docker/docker-compose.falkordb.yaml up`, but `docker/docker-compose.falkordb.yaml` does not exist; mcp_server/README.md links to `cursor_rules.md`, but `mcp_server/cursor_rules.md` does not exist; mcp_server/docker/README-falkordb-combined.md runs `docker compose -f docker/docker-compose-falkordb-combined.yml up`, but `docker/docker-compose-falkordb-combined.yml` does not exist.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
What to do
Dependabot is configured but does not watch `github-actions` — add that `package-ecosystem` entry to REDACTED so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.
Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.
Do you agree with this assessment?
P5 · DR & Backup7.0 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether disaster recovery is planned and codified — backups, geo-recovery, RTO/RPO, persistence guarantees — from IaC + container manifests + docs, never the live cloud.
Method: Filesystem scan: disaster recovery, backup, geo-recovery, RTO/RPO, persistence guarantees from IaC, manifests, and docs. Exhaustive, deterministic, never a live environment.
What to do
Document RTO/RPO and a tested restore procedure (a backup config alone isn't disaster recovery).
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
Readiness · Readiness — Whether outbound HTTP calls are wrapped in resilience (retry/timeout/circuit-breaker) so a failing dependency doesn't cascade.
Method: Source scan: outbound HTTP clients and what bounds them — resilience handlers (Polly, AddStandardResilienceHandler) on .NET; on Go, the JVM, Python, JavaScript/TypeScript, Ruby, PHP, Rust, Elixir, Swift, Dart and Erlang, a timeout, deadline, retry or breaker beside each call, or a process-wide client default (a framework-wide deadline such as Drupal core's, Laravel's or actix's awc counts). Exhaustive, deterministic.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python's documentation for `asyncio.create_task`: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled — it surfaces, if at all, as "Task exception was never retrieved" in a log. Keep the task: `await` it, gather it, start it in an `asyncio.TaskGroup` (`async with asyncio.TaskGroup() as tg: tg.create_task(…)`), or, for genuine fire-and-forget, add it to a set and `task.add_done_callback(tasks.discard)` with a callback that also reads its exception. — mcp_server/src/services/queue_service.py:45
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
`debug` at line 161 is called with an argument built by `[n.uuid for n in extracted_nodes]` (line 161), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — graphiti_core/utils/maintenance/node_operations.py:161
`debug` at line 691 is called with an argument built by `[ctx["…"] for ctx in extracted_nodes_context[: sample_size]]` (line 694), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — graphiti_core/utils/maintenance/node_operations.py:691
`debug` at line 697 is called with an argument built by `[ctx["…"] for ctx in extracted_nodes_context[- sample_size :]]` (line 700), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — graphiti_core/utils/maintenance/node_operations.py:697
`debug` at line 901 is called with an argument built by `[node.uuid for node in state.resolved_nodes if node is not None]` (line 903), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — graphiti_core/utils/maintenance/node_operations.py:901
`debug` at line 379 is called with an argument built by `[e.uuid for e in edges]` (line 379), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — graphiti_core/utils/maintenance/edge_operations.py:379
`debug` at line 587 is called with an argument built by `[e.uuid for edges_lst in related_edges_lists for e in edges_lst]` (line 588), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — graphiti_core/utils/maintenance/edge_operations.py:587
`debug` at line 628 is called with an argument built by `[e.uuid for e in resolved_edges]` (line 628), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — graphiti_core/utils/maintenance/edge_operations.py:628
`debug` at line 629 is called with an argument built by `[e.uuid for e in new_edges]` (line 629), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — graphiti_core/utils/maintenance/edge_operations.py:629
What to do
In Python, put the construction behind the logger's own check (`if logger.isEnabledFor(logging.DEBUG):`), or pass the collection itself with a `%s` placeholder (`logger.debug("Items %s", items)`) so the logging module renders it only when the record is emitted. The placeholder alone is not the fix when the argument is still built first: it defers the formatting, not a `json.dumps`, a `join` or a comprehension in the argument, and an f-string defers nothing at all.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×3) — graphiti_core/llm_client/gemini_client.py:232, graphiti_core/llm_client/gemini_client.py:239, graphiti_core/telemetry/telemetry.py:50
`except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×3) — graphiti_core/llm_client/decision_prompts.py:96, graphiti_core/telemetry/telemetry.py:61, graphiti_core/telemetry/telemetry.py:72
What to do
Swallowed exception (empty catch)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
`error` at line 89 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/nodes.py:89
`debug` at line 167 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/nodes.py:167
`debug` at line 357 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/nodes.py:357
`debug` at line 511 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/nodes.py:511
`debug` at line 580 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/nodes.py:580
`debug` at line 753 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/nodes.py:753
`debug` at line 762 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/nodes.py:762
`debug` at line 942 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/nodes.py:942
`debug` at line 961 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/nodes.py:961
`info` at line 687 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/graphiti.py:687
`info` at line 699 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/graphiti.py:699
`info` at line 763 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/graphiti.py:763
`info` at line 801 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/graphiti.py:801
`info` at line 1572 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/graphiti.py:1572
`info` at line 1850 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/graphiti.py:1850
`info` at line 2101 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/graphiti.py:2101
`debug` at line 90 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. (×2) — graphiti_core/edges.py:90, graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py:90
`debug` at line 129 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/edges.py:129
`debug` at line 160 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/edges.py:160
`debug` at line 299 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/edges.py:299
`debug` at line 378 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/edges.py:378
`debug` at line 597 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/edges.py:597
`debug` at line 711 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/edges.py:711
`debug` at line 730 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/edges.py:730
`debug` at line 844 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/edges.py:844
`debug` at line 865 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/edges.py:865
`error` at line 123 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/cross_encoder/openai_reranker_client.py:123
`warning` at line 134 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/cross_encoder/gemini_reranker_client.py:134
`warning` at line 142 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/cross_encoder/gemini_reranker_client.py:142
`error` at line 160 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/cross_encoder/gemini_reranker_client.py:160
`error` at line 174 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/driver/neo4j_driver.py:174
`debug` at line 211 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/driver/neo4j_driver.py:211
`error` at line 230 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/driver/kuzu_driver.py:230
`info` at line 250 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/driver/falkordb_driver.py:250
`error` at line 252 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/driver/falkordb_driver.py:252
`debug` at line 59 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/driver/falkordb/operations/saga_node_ops.py:59
`debug` at line 86 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — graphiti_core/driver/falkordb/operations/saga_node_ops.py:86
`debug` at line 63 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. (×2) — graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py:63, graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py:63
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 2 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 15 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 3 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
C3 Audit Trail — Not assessed: this repository stores data through 'neo4j' (graphiti_core/helpers.py:26) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and MongoEngine model fields, Alembic and Django migration columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL files). Personal data may be written through raw SQL or a hosted backend, so whether its changes need an audit trail could not be established, and the trail's absence is not scored.
C4 Data Retention — Not assessed: this repository stores data through 'neo4j' (graphiti_core/helpers.py:26) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and mongoengine model fields, Alembic and Django migration columns, SQL schemas). Personal data may be written through raw SQL or a hosted backend, so whether a retention limit applies here could not be established, and its absence is not scored.
C5 Data-Subject Rights — Not assessed: this repository stores data through 'neo4j' (graphiti_core/helpers.py:26) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and mongoengine model fields, Alembic and Django migration columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL files). Personal data may be written through raw SQL or a hosted backend, so whether data-subject rights apply here could not be established, and their absence is not scored.
Not included — 54 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — Not applicable: this repository's Python imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads.
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — compose up failed (exit 18 — an image could not be pulled) — time="2026-10-20T15:56:16Z" level=warning msg="The \"OPENAI_API_KEY\" variable is not set. Defaulting to a blank string." time="2026-10-20T15:56:16Z" level=warning msg="The \"OPENAI_API_KEY\" variable is not set. Defaulting to a blank string." neo4j Pulling neo4j Error Get "https://registry-1.docker.io/v2/": Forbidden Error response from daemon: Get "https://registry-1.docker.io/v2/": Forbidden; the earlier `compose pull` step reported: time="2026-10-20T15:56:16Z" level=warning msg="The \"OPENAI_API_KEY\" variable is not set. Defaulting to a blank string." graph Skipped - No image to be pulled neo4j Pulling neo4j Error Get "https://registry-1.docker.io/v2/": Forbidden Error response from daemon: Get "https://registry-1.docker.io/v2/": Forbidden; the runtime sandbox reaches registries only through the in-fence pull-through mirror, so an image the mirror does not carry cannot be fetched — this is a limit of our sandbox, not of your stack; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D10 Test Quality — ~24253 lines of test source are present (.py) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D12 Dependency Hygiene — Dependency currency not established — no declaration carries an exact pin to grade
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout nor 2+ sibling source directories each declaring an aggregate root. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.py), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (89 value object(s))
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for a pytest-benchmark or pytest-codspeed dependency with tests taking the `benchmark` fixture, an asv.conf.json with its `time_`/`mem_`/`peakmem_` benchmarks, or a pyperf Runner, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Not applicable: Python runs on a garbage-collected runtime that gives a program no allocation-control idiom to choose on a hot path — no pools, stack allocation or value types — so allocation awareness is not something this code can be rated on.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
X16 Unfloored truncation loop — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X18 Disposal-pattern correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X2 Cancellation propagation — no C# was loaded; this repository's Python was read, and no request in it can be cancelled by a caller — a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X29 Per-element action decided by a fixed element — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
Repeated repair: graphiti_core/driver/falkordb_driver.py graphiti_core/driver/falkordb_driver.py:292— graphiti_core/driver/falkordb_driver.py changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is FalkorDriver.delete_all_indexes at line 292), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(falkordb): create node fulltext indices with DDL form for FalkorDB 6.x (#1963)”; “Land contributor fixes from #1686 #1689 #1720 #1761 (#1856)”; “Consolidate overlapping backend fixes (#1695)”; “fix: capture init task ref + cancel on close for Neo4jDriver and FalkorDriver (#1636)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 05:55:01 +00:00' --until='2026-10-20 05:55:01 +00:00' --full-history --no-merges -- graphiti_core/driver/falkordb_driver.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: graphiti_core/search/search_utils.py graphiti_core/search/search_utils.py:300— graphiti_core/search/search_utils.py changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is search_utils.edge_similarity_search at line 300), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(neptune): apply group filters in fulltext search and bind list parameters (#2031)”; “Land contributor fixes from #1686 #1689 #1720 #1761 (#1856)”; “fix(falkordb): avoid a full :Entity scan per hit in edge_fulltext_search (#1711)”; “Consolidate overlapping backend fixes (#1695)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 05:55:01 +00:00' --until='2026-10-20 05:55:01 +00:00' --full-history --no-merges -- graphiti_core/search/search_utils.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: graphiti_core/driver/falkordb/operations/graph_ops.py graphiti_core/driver/falkordb/operations/graph_ops.py:73— graphiti_core/driver/falkordb/operations/graph_ops.py changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is FalkorGraphMaintenanceOperations.delete_all_indexes at line 73), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(falkordb): create node fulltext indices with DDL form for FalkorDB 6.x (#1963)”; “fix: include Saga nodes when clearing data by group_ids (#1688)”; “Consolidate overlapping backend fixes (#1695)”; “fix(communities): scope remove_communities to the group_ids being rebuilt (#1658)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 05:55:01 +00:00' --until='2026-10-20 05:55:01 +00:00' --full-history --no-merges -- graphiti_core/driver/falkordb/operations/graph_ops.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: graphiti_core/utils/maintenance/community_operations.py graphiti_core/utils/maintenance/community_operations.py:331— graphiti_core/utils/maintenance/community_operations.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 11 (its worst body is community_operations.determine_entity_community at line 331), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “Upstream extraction, dedup, and temporal fixes from the Zep fork (#1964)”; “Consolidate overlapping backend fixes (#1695)”; “fix(communities): scope remove_communities to the group_ids being rebuilt (#1658)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 05:55:01 +00:00' --until='2026-10-20 05:55:01 +00:00' --full-history --no-merges -- graphiti_core/utils/maintenance/community_operations.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: graphiti_core/driver/kuzu/operations/graph_ops.py graphiti_core/driver/kuzu/operations/graph_ops.py:81— graphiti_core/driver/kuzu/operations/graph_ops.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is KuzuGraphMaintenanceOperations.get_community_clusters at line 81), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: include Saga nodes when clearing data by group_ids (#1688)”; “Consolidate overlapping backend fixes (#1695)”; “fix(communities): scope remove_communities to the group_ids being rebuilt (#1658)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 05:55:01 +00:00' --until='2026-10-20 05:55:01 +00:00' --full-history --no-merges -- graphiti_core/driver/kuzu/operations/graph_ops.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: graphiti_core/driver/neo4j/operations/graph_ops.py graphiti_core/driver/neo4j/operations/graph_ops.py:75— graphiti_core/driver/neo4j/operations/graph_ops.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is Neo4jGraphMaintenanceOperations.get_community_clusters at line 75), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: include Saga nodes when clearing data by group_ids (#1688)”; “Consolidate overlapping backend fixes (#1695)”; “fix(communities): scope remove_communities to the group_ids being rebuilt (#1658)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 05:55:01 +00:00' --until='2026-10-20 05:55:01 +00:00' --full-history --no-merges -- graphiti_core/driver/neo4j/operations/graph_ops.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: graphiti_core/driver/neptune/operations/graph_ops.py graphiti_core/driver/neptune/operations/graph_ops.py:82— graphiti_core/driver/neptune/operations/graph_ops.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is NeptuneGraphMaintenanceOperations.get_community_clusters at line 82), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: include Saga nodes when clearing data by group_ids (#1688)”; “Consolidate overlapping backend fixes (#1695)”; “fix(communities): scope remove_communities to the group_ids being rebuilt (#1658)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 05:55:01 +00:00' --until='2026-10-20 05:55:01 +00:00' --full-history --no-merges -- graphiti_core/driver/neptune/operations/graph_ops.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: graphiti_core/driver/falkordb/operations/search_ops.py graphiti_core/driver/falkordb/operations/search_ops.py:518— graphiti_core/driver/falkordb/operations/search_ops.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is FalkorSearchOperations.node_distance_reranker at line 518), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “Consolidate overlapping backend fixes (#1695)”; “fix: handle backtick tokens and empty queries in FalkorDB fulltext search (#1475)”; “fix(falkordb): short-circuit fulltext query when every token was a stopword (#1590)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 05:55:01 +00:00' --until='2026-10-20 05:55:01 +00:00' --full-history --no-merges -- graphiti_core/driver/falkordb/operations/search_ops.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: graphiti_core/graphiti.py graphiti_core/graphiti.py:590— graphiti_core/graphiti.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Graphiti.summarize_saga at line 590. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 05:55:01 +00:00' --until='2026-10-20 05:55:01 +00:00' --full-history --no-merges -- graphiti_core/graphiti.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: graphiti_core/utils/maintenance/edge_operations.py graphiti_core/utils/maintenance/edge_operations.py:134— graphiti_core/utils/maintenance/edge_operations.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in edge_operations.extract_edges at line 134. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 05:55:01 +00:00' --until='2026-10-20 05:55:01 +00:00' --full-history --no-merges -- graphiti_core/utils/maintenance/edge_operations.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: graphiti_core/utils/maintenance/combined_extraction.py graphiti_core/utils/maintenance/combined_extraction.py:58— graphiti_core/utils/maintenance/combined_extraction.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in combined_extraction.extract_nodes_and_edges at line 58. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 05:55:01 +00:00' --until='2026-10-20 05:55:01 +00:00' --full-history --no-merges -- graphiti_core/utils/maintenance/combined_extraction.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: mcp_server/src/graphiti_mcp_server.py mcp_server/src/graphiti_mcp_server.py:239— mcp_server/src/graphiti_mcp_server.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in GraphitiService.initialize at line 239. 2 of those changes were fix/bug commits, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 05:55:01 +00:00' --until='2026-10-20 05:55:01 +00:00' --full-history --no-merges -- mcp_server/src/graphiti_mcp_server.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: graphiti_core/utils/bulk_utils.py graphiti_core/utils/bulk_utils.py:504— graphiti_core/utils/bulk_utils.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in bulk_utils.dedupe_edges_bulk at line 504. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 05:55:01 +00:00' --until='2026-10-20 05:55:01 +00:00' --full-history --no-merges -- graphiti_core/utils/bulk_utils.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: graphiti_core/utils/maintenance/node_operations.py graphiti_core/utils/maintenance/node_operations.py:649— graphiti_core/utils/maintenance/node_operations.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in node_operations._resolve_with_llm at line 649. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 05:55:01 +00:00' --until='2026-10-20 05:55:01 +00:00' --full-history --no-merges -- graphiti_core/utils/maintenance/node_operations.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: graphiti_core/search/search.py graphiti_core/search/search.py:259— graphiti_core/search/search.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in search.edge_search at line 259. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-22 05:55:01 +00:00' --until='2026-10-20 05:55:01 +00:00' --full-history --no-merges -- graphiti_core/search/search.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Duplicated block (12 lines × 3) graphiti_core/search/search_utils.py:238— graphiti_core/search/search_utils.py:238-249 | graphiti_core/search/search_utils.py:607-618 | graphiti_core/search/search_utils.py:1004-1016 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/search/search_utils.py:238` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 3) graphiti_core/search/search_utils.py:371— graphiti_core/search/search_utils.py:371-382 | graphiti_core/search/search_utils.py:714-725 | graphiti_core/search/search_utils.py:1107-1118 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/search/search_utils.py:371` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 3) graphiti_core/driver/falkordb/operations/community_edge_ops.py:104— graphiti_core/driver/falkordb/operations/community_edge_ops.py:104-115 | graphiti_core/driver/kuzu/operations/community_edge_ops.py:104-115 | graphiti_core/driver/neptune/operations/community_edge_ops.py:104-115 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/community_edge_ops.py` and `graphiti_core/driver/kuzu/operations/community_edge_ops.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (12 lines × 3) graphiti_core/driver/falkordb/operations/episodic_edge_ops.py:118— graphiti_core/driver/falkordb/operations/episodic_edge_ops.py:118-129 | graphiti_core/driver/kuzu/operations/episodic_edge_ops.py:126-137 | graphiti_core/driver/neptune/operations/episodic_edge_ops.py:118-129 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/episodic_edge_ops.py` and `graphiti_core/driver/kuzu/operations/episodic_edge_ops.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (12 lines × 3) graphiti_core/driver/falkordb/operations/graph_ops.py:42— graphiti_core/driver/falkordb/operations/graph_ops.py:42-54 | graphiti_core/driver/neo4j/operations/graph_ops.py:42-53 | graphiti_core/driver/neptune/operations/graph_ops.py:48-59 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/graph_ops.py` and `graphiti_core/driver/neo4j/operations/graph_ops.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 3) graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py:113— graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py:113-124 | graphiti_core/driver/kuzu/operations/has_episode_edge_ops.py:112-123 | graphiti_core/driver/neptune/operations/has_episode_edge_ops.py:112-123 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py` and `graphiti_core/driver/kuzu/operations/has_episode_edge_ops.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (12 lines × 3) graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py:113— graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py:113-124 | graphiti_core/driver/kuzu/operations/next_episode_edge_ops.py:112-123 | graphiti_core/driver/neptune/operations/next_episode_edge_ops.py:112-123 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py` and `graphiti_core/driver/kuzu/operations/next_episode_edge_ops.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
FileTooLong: graphiti_core/graphiti.py graphiti_core/graphiti.py— FileTooLong — 1274 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 774 over it, 2.55× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: maintenance/node_operations.py graphiti_core/utils/maintenance/node_operations.py— FileTooLong — 886 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 386 over it, 1.77× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/graphiti_mcp_server.py mcp_server/src/graphiti_mcp_server.py— FileTooLong — 786 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 286 over it, 1.57× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: maintenance/edge_operations.py graphiti_core/utils/maintenance/edge_operations.py— FileTooLong — 737 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 237 over it, 1.47× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: search/search.py graphiti_core/search/search.py— FileTooLong — 689 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 189 over it, 1.38× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: search/search_utils.py graphiti_core/search/search_utils.py— FileTooLong — 590 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 90 over it, 1.18× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
Duplicated block (10 lines × 3) graphiti_core/driver/neptune/operations/search_ops.py:66— graphiti_core/driver/neptune/operations/search_ops.py:66-75 | graphiti_core/driver/neptune/operations/search_ops.py:442-451 | graphiti_core/driver/neptune/operations/search_ops.py:494-503 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/driver/neptune/operations/search_ops.py:66` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 3) graphiti_core/driver/falkordb/operations/community_edge_ops.py:122— graphiti_core/driver/falkordb/operations/community_edge_ops.py:122-131 | graphiti_core/driver/kuzu/operations/community_edge_ops.py:122-131 | graphiti_core/driver/neptune/operations/community_edge_ops.py:122-131 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/community_edge_ops.py` and `graphiti_core/driver/kuzu/operations/community_edge_ops.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (10 lines × 3) graphiti_core/driver/falkordb/operations/episodic_edge_ops.py:136— graphiti_core/driver/falkordb/operations/episodic_edge_ops.py:136-145 | graphiti_core/driver/kuzu/operations/episodic_edge_ops.py:144-153 | graphiti_core/driver/neptune/operations/episodic_edge_ops.py:136-145 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/episodic_edge_ops.py` and `graphiti_core/driver/kuzu/operations/episodic_edge_ops.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (10 lines × 3) graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py:131— graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py:131-140 | graphiti_core/driver/kuzu/operations/has_episode_edge_ops.py:130-139 | graphiti_core/driver/neptune/operations/has_episode_edge_ops.py:130-139 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py` and `graphiti_core/driver/kuzu/operations/has_episode_edge_ops.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (10 lines × 3) graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py:131— graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py:131-140 | graphiti_core/driver/kuzu/operations/next_episode_edge_ops.py:130-139 | graphiti_core/driver/neptune/operations/next_episode_edge_ops.py:130-139 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py` and `graphiti_core/driver/kuzu/operations/next_episode_edge_ops.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (10 lines × 3) graphiti_core/driver/falkordb/operations/entity_edge_ops.py:222— graphiti_core/driver/falkordb/operations/entity_edge_ops.py:222-231 | graphiti_core/driver/kuzu/operations/entity_edge_ops.py:178-187 | graphiti_core/driver/neptune/operations/entity_edge_ops.py:199-208 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/entity_edge_ops.py` and `graphiti_core/driver/kuzu/operations/entity_edge_ops.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (24 lines × 3) graphiti_core/driver/falkordb/operations/community_edge_ops.py:163— graphiti_core/driver/falkordb/operations/community_edge_ops.py:163-186 | graphiti_core/driver/kuzu/operations/community_edge_ops.py:140-163 | graphiti_core/driver/neptune/operations/community_edge_ops.py:140-163 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/community_edge_ops.py` and `graphiti_core/driver/kuzu/operations/community_edge_ops.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (24 lines × 3) graphiti_core/driver/falkordb/operations/episode_node_ops.py:249— graphiti_core/driver/falkordb/operations/episode_node_ops.py:249-272 | graphiti_core/driver/kuzu/operations/episode_node_ops.py:214-237 | graphiti_core/driver/neo4j/operations/episode_node_ops.py:233-256 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/episode_node_ops.py` and `graphiti_core/driver/kuzu/operations/episode_node_ops.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 197 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/driver/falkordb/operations/episode_node_ops.py:249` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (24 lines × 3) graphiti_core/driver/falkordb/operations/episodic_edge_ops.py:177— graphiti_core/driver/falkordb/operations/episodic_edge_ops.py:177-200 | graphiti_core/driver/kuzu/operations/episodic_edge_ops.py:162-185 | graphiti_core/driver/neptune/operations/episodic_edge_ops.py:154-177 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/episodic_edge_ops.py` and `graphiti_core/driver/kuzu/operations/episodic_edge_ops.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (24 lines × 3) graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py:172— graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py:172-195 | graphiti_core/driver/kuzu/operations/has_episode_edge_ops.py:148-171 | graphiti_core/driver/neptune/operations/has_episode_edge_ops.py:148-171 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py` and `graphiti_core/driver/kuzu/operations/has_episode_edge_ops.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (24 lines × 3) graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py:172— graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py:172-195 | graphiti_core/driver/kuzu/operations/next_episode_edge_ops.py:148-171 | graphiti_core/driver/neptune/operations/next_episode_edge_ops.py:148-171 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py` and `graphiti_core/driver/kuzu/operations/next_episode_edge_ops.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (13 lines × 2) graphiti_core/driver/falkordb/operations/search_ops.py:555— graphiti_core/driver/falkordb/operations/search_ops.py:555-567 | graphiti_core/driver/falkordb/operations/search_ops.py:601-613 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (13 lines × 2) graphiti_core/driver/neo4j/operations/search_ops.py:569— graphiti_core/driver/neo4j/operations/search_ops.py:569-581 | graphiti_core/driver/neo4j/operations/search_ops.py:617-629 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (13 lines × 2) graphiti_core/driver/neptune/operations/search_ops.py:640— graphiti_core/driver/neptune/operations/search_ops.py:640-652 | graphiti_core/driver/neptune/operations/search_ops.py:686-698 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (13 lines × 2) graphiti_core/driver/falkordb/operations/graph_ops.py:231— graphiti_core/driver/falkordb/operations/graph_ops.py:231-243 | graphiti_core/driver/kuzu/operations/graph_ops.py:206-218 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/graph_ops.py` and `graphiti_core/driver/kuzu/operations/graph_ops.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (13 lines × 2) graphiti_core/driver/falkordb/operations/graph_ops.py:212— graphiti_core/driver/falkordb/operations/graph_ops.py:212-224 | graphiti_core/driver/neptune/operations/graph_ops.py:188-200 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/graph_ops.py` and `graphiti_core/driver/neptune/operations/graph_ops.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (21 lines × 3) graphiti_core/driver/falkordb/operations/community_node_ops.py:175— graphiti_core/driver/falkordb/operations/community_node_ops.py:175-195 | graphiti_core/driver/falkordb/operations/entity_node_ops.py:196-216 | graphiti_core/driver/falkordb/operations/saga_node_ops.py:175-195 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/community_node_ops.py` and `graphiti_core/driver/falkordb/operations/entity_node_ops.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/driver/falkordb/operations/community_node_ops.py:175` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (21 lines × 3) graphiti_core/driver/falkordb/operations/search_ops.py:179— graphiti_core/driver/falkordb/operations/search_ops.py:179-199 | graphiti_core/driver/neo4j/operations/search_ops.py:193-213 | graphiti_core/driver/neptune/operations/search_ops.py:198-219 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/search_ops.py` and `graphiti_core/driver/neo4j/operations/search_ops.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 121 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/driver/falkordb/operations/search_ops.py:179` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (21 lines × 3) graphiti_core/driver/falkordb/operations/search_ops.py:344— graphiti_core/driver/falkordb/operations/search_ops.py:344-364 | graphiti_core/driver/neo4j/operations/search_ops.py:359-379 | graphiti_core/driver/neptune/operations/search_ops.py:395-416 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/search_ops.py` and `graphiti_core/driver/neo4j/operations/search_ops.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 121 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/driver/falkordb/operations/search_ops.py:344` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (21 lines × 3) graphiti_core/driver/falkordb/operations/graph_ops.py:185— graphiti_core/driver/falkordb/operations/graph_ops.py:185-205 | graphiti_core/driver/kuzu/operations/graph_ops.py:159-180 | graphiti_core/driver/neo4j/operations/graph_ops.py:154-174 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/graph_ops.py` and `graphiti_core/driver/kuzu/operations/graph_ops.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 2) graphiti_core/driver/kuzu/operations/record_parsers.py:26— graphiti_core/driver/kuzu/operations/record_parsers.py:26-33 | graphiti_core/driver/kuzu/operations/record_parsers.py:38-45 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) graphiti_core/driver/record_parsers.py:25— graphiti_core/driver/record_parsers.py:25-32 | graphiti_core/driver/record_parsers.py:54-61 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) graphiti_core/driver/neo4j/operations/community_node_ops.py:198— graphiti_core/driver/neo4j/operations/community_node_ops.py:198-205 | graphiti_core/driver/neo4j/operations/entity_node_ops.py:214-221 — before extracting anything, compare `graphiti_core/driver/neo4j/operations/community_node_ops.py` and `graphiti_core/driver/neo4j/operations/entity_node_ops.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind `node` to `CommunityNode` in one and `EntityNode` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (8 lines × 2) graphiti_core/driver/kuzu/operations/graph_ops.py:63— graphiti_core/driver/kuzu/operations/graph_ops.py:63-72 | graphiti_core/driver/neo4j/operations/graph_ops.py:60-67 — before extracting anything, compare `graphiti_core/driver/kuzu/operations/graph_ops.py` and `graphiti_core/driver/neo4j/operations/graph_ops.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 5) graphiti_core/driver/falkordb/operations/community_edge_ops.py:35— graphiti_core/driver/falkordb/operations/community_edge_ops.py:35-41 | graphiti_core/driver/kuzu/operations/community_edge_ops.py:35-41 | graphiti_core/driver/neo4j/operations/community_edge_ops.py:35-41 | graphiti_core/driver/neptune/operations/community_edge_ops.py:35-41 | graphiti_core/edges.py:1014-1020 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/community_edge_ops.py` and `graphiti_core/driver/kuzu/operations/community_edge_ops.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 5) graphiti_core/driver/falkordb/operations/episodic_edge_ops.py:36— graphiti_core/driver/falkordb/operations/episodic_edge_ops.py:36-42 | graphiti_core/driver/kuzu/operations/episodic_edge_ops.py:36-42 | graphiti_core/driver/neo4j/operations/episodic_edge_ops.py:36-42 | graphiti_core/driver/neptune/operations/episodic_edge_ops.py:36-42 | graphiti_core/edges.py:964-970 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/episodic_edge_ops.py` and `graphiti_core/driver/kuzu/operations/episodic_edge_ops.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 5) graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py:35— graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py:35-41 | graphiti_core/driver/kuzu/operations/has_episode_edge_ops.py:34-40 | graphiti_core/driver/neo4j/operations/has_episode_edge_ops.py:34-40 | graphiti_core/driver/neptune/operations/has_episode_edge_ops.py:34-40 | graphiti_core/edges.py:1024-1030 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py` and `graphiti_core/driver/kuzu/operations/has_episode_edge_ops.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 5) graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py:35— graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py:35-41 | graphiti_core/driver/kuzu/operations/next_episode_edge_ops.py:34-40 | graphiti_core/driver/neo4j/operations/next_episode_edge_ops.py:34-40 | graphiti_core/driver/neptune/operations/next_episode_edge_ops.py:34-40 | graphiti_core/edges.py:1034-1040 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py` and `graphiti_core/driver/kuzu/operations/next_episode_edge_ops.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×3
Members sharing a duplicated core (4 members, 50+ identical tokens) graphiti_core/driver/record_parsers.py:25— graphiti_core/driver/record_parsers.py:25-50 | graphiti_core/driver/record_parsers.py:54-85 | graphiti_core/edges.py:974-1010 | graphiti_core/nodes.py:1095-1123 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) graphiti_core/search/search.py:274— graphiti_core/search/search.py:274-470 | graphiti_core/search/search.py:488-673 | graphiti_core/search/search.py:689-775 | graphiti_core/search/search.py:790-891 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) graphiti_core/search/search_utils.py:192— graphiti_core/search/search_utils.py:192-297 | graphiti_core/search/search_utils.py:579-665 | graphiti_core/search/search_utils.py:889-970 | graphiti_core/search/search_utils.py:979-1064 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (26 lines × 3) graphiti_core/driver/falkordb/operations/episode_node_ops.py:261— graphiti_core/driver/falkordb/operations/episode_node_ops.py:261-286 | graphiti_core/driver/kuzu/operations/episode_node_ops.py:226-251 | graphiti_core/driver/neptune/operations/episode_node_ops.py:235-260 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/episode_node_ops.py` and `graphiti_core/driver/kuzu/operations/episode_node_ops.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 197 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/driver/falkordb/operations/episode_node_ops.py:261` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (26 lines × 3) graphiti_core/driver/falkordb/operations/episode_node_ops.py:273— graphiti_core/driver/falkordb/operations/episode_node_ops.py:273-298 | graphiti_core/driver/kuzu/operations/episode_node_ops.py:238-263 | graphiti_core/driver/neo4j/operations/episode_node_ops.py:258-283 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/episode_node_ops.py` and `graphiti_core/driver/kuzu/operations/episode_node_ops.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 197 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/driver/falkordb/operations/episode_node_ops.py:273` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (26 lines × 3) graphiti_core/driver/neptune/operations/search_ops.py:136— graphiti_core/driver/neptune/operations/search_ops.py:136-161 | graphiti_core/driver/neptune/operations/search_ops.py:326-351 | graphiti_core/driver/neptune/operations/search_ops.py:552-577 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (24 lines × 2) graphiti_core/driver/falkordb/operations/community_node_ops.py:185— graphiti_core/driver/falkordb/operations/community_node_ops.py:185-208 | graphiti_core/driver/kuzu/operations/community_node_ops.py:161-184 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/community_node_ops.py` and `graphiti_core/driver/kuzu/operations/community_node_ops.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (24 lines × 2) graphiti_core/driver/falkordb/operations/episode_node_ops.py:200— graphiti_core/driver/falkordb/operations/episode_node_ops.py:200-223 | graphiti_core/driver/kuzu/operations/episode_node_ops.py:165-188 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/episode_node_ops.py` and `graphiti_core/driver/kuzu/operations/episode_node_ops.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 197 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (24 lines × 2) graphiti_core/driver/falkordb/operations/saga_node_ops.py:185— graphiti_core/driver/falkordb/operations/saga_node_ops.py:185-208 | graphiti_core/driver/kuzu/operations/saga_node_ops.py:165-188 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/saga_node_ops.py` and `graphiti_core/driver/kuzu/operations/saga_node_ops.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (11 lines × 3) graphiti_core/driver/falkordb/operations/entity_edge_ops.py:265— graphiti_core/driver/falkordb/operations/entity_edge_ops.py:265-275 | graphiti_core/driver/kuzu/operations/entity_edge_ops.py:221-231 | graphiti_core/driver/neptune/operations/entity_edge_ops.py:242-252 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/entity_edge_ops.py` and `graphiti_core/driver/kuzu/operations/entity_edge_ops.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 3) graphiti_core/driver/falkordb/operations/entity_node_ops.py:251— graphiti_core/driver/falkordb/operations/entity_node_ops.py:251-261 | graphiti_core/driver/kuzu/operations/entity_node_ops.py:226-236 | graphiti_core/driver/neptune/operations/entity_node_ops.py:222-232 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/entity_node_ops.py` and `graphiti_core/driver/neptune/operations/entity_node_ops.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 3) graphiti_core/search/search_utils.py:1977— graphiti_core/search/search_utils.py:1977-1987 | graphiti_core/search/search_utils.py:2018-2028 | graphiti_core/search/search_utils.py:2065-2075 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/search/search_utils.py:1977` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (10 lines × 2) graphiti_core/edges.py:975— graphiti_core/edges.py:975-984 | graphiti_core/nodes.py:1095-1104 — before extracting anything, compare `graphiti_core/edges.py` and `graphiti_core/nodes.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) graphiti_core/driver/falkordb/operations/community_node_ops.py:144— graphiti_core/driver/falkordb/operations/community_node_ops.py:144-153 | graphiti_core/driver/kuzu/operations/community_node_ops.py:143-152 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/community_node_ops.py` and `graphiti_core/driver/kuzu/operations/community_node_ops.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (10 lines × 2) graphiti_core/driver/falkordb/operations/saga_node_ops.py:144— graphiti_core/driver/falkordb/operations/saga_node_ops.py:144-153 | graphiti_core/driver/kuzu/operations/saga_node_ops.py:147-156 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/saga_node_ops.py` and `graphiti_core/driver/kuzu/operations/saga_node_ops.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (9 lines × 2) graphiti_core/driver/record_parsers.py:28— graphiti_core/driver/record_parsers.py:28-36 | graphiti_core/nodes.py:1100-1108 — before extracting anything, compare `graphiti_core/driver/record_parsers.py` and `graphiti_core/nodes.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) graphiti_core/llm_client/groq_client.py:69— graphiti_core/llm_client/groq_client.py:69-77 | graphiti_core/llm_client/openai_generic_client.py:152-160 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/llm_client/groq_client.py:69` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `graphiti_core/llm_client/openai_generic_client.py:151` calls `_clean_input` and `graphiti_core/llm_client/groq_client.py:68` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9 lines × 2) graphiti_core/nodes.py:507— graphiti_core/nodes.py:507-515 | graphiti_core/nodes.py:758-766 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (7 lines × 2) graphiti_core/llm_client/openai_base_client.py:103— graphiti_core/llm_client/openai_base_client.py:103-109 | graphiti_core/llm_client/openai_generic_client.py:149-155 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) mcp_server/src/graphiti_mcp_server.py:1050— mcp_server/src/graphiti_mcp_server.py:1050-1056 | mcp_server/src/graphiti_mcp_server.py:1092-1098 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `mcp_server/src/graphiti_mcp_server.py:1050` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 2) graphiti_core/llm_client/gemini_client.py:170— graphiti_core/llm_client/gemini_client.py:170-176 | graphiti_core/llm_client/openai_base_client.py:118-124 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) graphiti_core/driver/falkordb/operations/community_node_ops.py:126— graphiti_core/driver/falkordb/operations/community_node_ops.py:126-137 | graphiti_core/driver/kuzu/operations/community_node_ops.py:125-136 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/community_node_ops.py` and `graphiti_core/driver/kuzu/operations/community_node_ops.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (12 lines × 2) graphiti_core/driver/falkordb/operations/episode_node_ops.py:141— graphiti_core/driver/falkordb/operations/episode_node_ops.py:141-152 | graphiti_core/driver/kuzu/operations/episode_node_ops.py:129-140 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/episode_node_ops.py` and `graphiti_core/driver/kuzu/operations/episode_node_ops.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 197 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (12 lines × 2) graphiti_core/driver/falkordb/operations/saga_node_ops.py:126— graphiti_core/driver/falkordb/operations/saga_node_ops.py:126-137 | graphiti_core/driver/kuzu/operations/saga_node_ops.py:129-140 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/saga_node_ops.py` and `graphiti_core/driver/kuzu/operations/saga_node_ops.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (13 lines × 4) graphiti_core/driver/falkordb/operations/episodic_edge_ops.py:52— graphiti_core/driver/falkordb/operations/episodic_edge_ops.py:52-64 | graphiti_core/driver/kuzu/operations/episodic_edge_ops.py:52-64 | graphiti_core/driver/neo4j/operations/episodic_edge_ops.py:52-64 | graphiti_core/driver/neptune/operations/episodic_edge_ops.py:52-64 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/episodic_edge_ops.py` and `graphiti_core/driver/kuzu/operations/episodic_edge_ops.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 4) graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py:51— graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py:51-63 | graphiti_core/driver/kuzu/operations/has_episode_edge_ops.py:50-62 | graphiti_core/driver/neo4j/operations/has_episode_edge_ops.py:50-62 | graphiti_core/driver/neptune/operations/has_episode_edge_ops.py:50-62 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py` and `graphiti_core/driver/kuzu/operations/has_episode_edge_ops.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 4) graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py:51— graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py:51-63 | graphiti_core/driver/kuzu/operations/next_episode_edge_ops.py:50-62 | graphiti_core/driver/neo4j/operations/next_episode_edge_ops.py:50-62 | graphiti_core/driver/neptune/operations/next_episode_edge_ops.py:50-62 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py` and `graphiti_core/driver/kuzu/operations/next_episode_edge_ops.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Swallowed exception (empty catch) graphiti_core/llm_client/gemini_client.py:232— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) graphiti_core/llm_client/gemini_client.py:239— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) graphiti_core/telemetry/telemetry.py:50— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (caught, then discarded) graphiti_core/llm_client/decision_prompts.py:96— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) graphiti_core/telemetry/telemetry.py:61— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) graphiti_core/telemetry/telemetry.py:72— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
FixmeComment graphiti_core/search/search_utils.py:1293— # FIXME: Kuzu currently does not support using variables such as `node.fulltext_query` as an input to FTS, which means `get_relevant_nodes()` won't work with Kuzu as the graph driver. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment graphiti_core/utils/bulk_utils.py:234— # FIXME: Kuzu's UNWIND does not currently support STRUCT[] type properly, so we insert the data one by one instead for now. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mcp_server/src/services/factories.py:199— # TODO: Add Azure AD authentication support for v1 API compatibility — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment mcp_server/src/services/factories.py:350— # TODO: Add Azure AD authentication support for v1 API compatibility — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
Change coupling: summarize_nodes.py ↔ node_operations.py graphiti_core/prompts/summarize_nodes.py:1— `graphiti_core/prompts/summarize_nodes.py` and `graphiti_core/utils/maintenance/node_operations.py` change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `fd9969b5` Update dedupe prompt (#457); `5274970b` reduce entity type attribute hallucinations (#365); `04203506` fix bug with updating node type attributes (#305) — run `git show` on any of them.
Change coupling: extract_edges.py ↔ node_operations.py graphiti_core/prompts/extract_edges.py:1— `graphiti_core/prompts/extract_edges.py` and `graphiti_core/utils/maintenance/node_operations.py` change together 58% of the time (11 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are `673902cd` forward-port: combined node+edge extraction + prompt refinements (#1432); `d9aae867` Add extracted edge facts to entity summaries (#1182); `be224cf1` Custom prompt (#1122) — run `git show` on any of them.
Duplicated block (32 lines × 2) graphiti_core/driver/operations/graph_utils.py:28— graphiti_core/driver/operations/graph_utils.py:28-59 | graphiti_core/utils/maintenance/community_operations.py:103-134 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (32 lines × 2) graphiti_core/llm_client/jev_client.py:156— graphiti_core/llm_client/jev_client.py:156-187 | graphiti_core/llm_client/openai_decisions_client.py:137-168 — before extracting anything, compare `graphiti_core/llm_client/jev_client.py` and `graphiti_core/llm_client/openai_decisions_client.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/llm_client/jev_client.py:156` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (21–23 lines × 2) graphiti_core/search/search.py:753— graphiti_core/search/search.py:753-775 | graphiti_core/search/search.py:871-891 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/search/search.py:753` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (21–23 lines × 2) graphiti_core/search/search_utils.py:423— graphiti_core/search/search_utils.py:423-445 | graphiti_core/search/search_utils.py:549-569 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/search/search_utils.py:423` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (22 lines × 2) graphiti_core/driver/falkordb/operations/search_ops.py:575— graphiti_core/driver/falkordb/operations/search_ops.py:575-596 | graphiti_core/driver/neptune/operations/search_ops.py:660-681 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/search_ops.py` and `graphiti_core/driver/neptune/operations/search_ops.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 143 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (22 lines × 2) graphiti_core/driver/neptune/operations/search_ops.py:447— graphiti_core/driver/neptune/operations/search_ops.py:447-468 | graphiti_core/driver/neptune/operations/search_ops.py:499-520 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/driver/neptune/operations/search_ops.py:447` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (20 lines × 2) graphiti_core/search/search_utils.py:346— graphiti_core/search/search_utils.py:346-365 | graphiti_core/search/search_utils.py:689-708 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/search/search_utils.py:346` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (20 lines × 2) mcp_server/src/graphiti_mcp_server.py:699— mcp_server/src/graphiti_mcp_server.py:699-718 | mcp_server/src/graphiti_mcp_server.py:764-783 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (17–18 lines × 2) graphiti_core/driver/neo4j/operations/search_ops.py:593— graphiti_core/driver/neo4j/operations/search_ops.py:593-609 | graphiti_core/search/search_utils.py:1879-1896 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (17–18 lines × 2) graphiti_core/utils/content_chunking.py:405— graphiti_core/utils/content_chunking.py:405-422 | graphiti_core/utils/content_chunking.py:463-479 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 2) graphiti_core/driver/kuzu/operations/search_ops.py:677— graphiti_core/driver/kuzu/operations/search_ops.py:677-690 | graphiti_core/driver/kuzu/operations/search_ops.py:725-738 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 2) graphiti_core/llm_client/jev_client.py:99— graphiti_core/llm_client/jev_client.py:99-112 | graphiti_core/llm_client/openai_decisions_client.py:67-80 — before extracting anything, compare `graphiti_core/llm_client/jev_client.py` and `graphiti_core/llm_client/openai_decisions_client.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 6) graphiti_core/driver/neptune/operations/search_ops.py:151— graphiti_core/driver/neptune/operations/search_ops.py:151-158 | graphiti_core/driver/neptune/operations/search_ops.py:341-348 | graphiti_core/driver/neptune/operations/search_ops.py:567-574 | graphiti_core/search/search_utils.py:375-382 | graphiti_core/search/search_utils.py:718-725 | graphiti_core/search/search_utils.py:1111-1118 — there are 6 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (8 lines × 6) graphiti_core/driver/falkordb/operations/community_node_ops.py:215— graphiti_core/driver/falkordb/operations/community_node_ops.py:215-222 | graphiti_core/driver/falkordb/operations/entity_node_ops.py:236-243 | graphiti_core/driver/kuzu/operations/community_node_ops.py:191-198 | graphiti_core/driver/kuzu/operations/entity_node_ops.py:211-218 | graphiti_core/driver/neptune/operations/community_node_ops.py:204-211 | graphiti_core/driver/neptune/operations/entity_node_ops.py:207-214 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/community_node_ops.py` and `graphiti_core/driver/falkordb/operations/entity_node_ops.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind `node` to `CommunityNode` in one and `EntityNode` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (9 lines × 4) graphiti_core/driver/falkordb/operations/episode_node_ops.py:159— graphiti_core/driver/falkordb/operations/episode_node_ops.py:159-168 | graphiti_core/driver/falkordb/operations/episode_node_ops.py:230-238 | graphiti_core/driver/kuzu/operations/episode_node_ops.py:147-156 | graphiti_core/driver/kuzu/operations/episode_node_ops.py:195-203 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/episode_node_ops.py` and `graphiti_core/driver/kuzu/operations/episode_node_ops.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 197 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (9 lines × 4) graphiti_core/driver/falkordb/operations/entity_edge_ops.py:136— graphiti_core/driver/falkordb/operations/entity_edge_ops.py:136-144 | graphiti_core/driver/falkordb/operations/entity_node_ops.py:153-161 | graphiti_core/driver/kuzu/operations/entity_edge_ops.py:115-123 | graphiti_core/driver/neptune/operations/entity_edge_ops.py:136-144 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/entity_edge_ops.py` and `graphiti_core/driver/falkordb/operations/entity_node_ops.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (6 lines × 4) graphiti_core/driver/falkordb/operations/saga_node_ops.py:32— graphiti_core/driver/falkordb/operations/saga_node_ops.py:32-37 | graphiti_core/driver/kuzu/operations/saga_node_ops.py:32-37 | graphiti_core/driver/neo4j/operations/saga_node_ops.py:32-37 | graphiti_core/driver/neptune/operations/saga_node_ops.py:35-40 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/saga_node_ops.py` and `graphiti_core/driver/kuzu/operations/saga_node_ops.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 4) graphiti_core/driver/falkordb/operations/entity_edge_ops.py:238— graphiti_core/driver/falkordb/operations/entity_edge_ops.py:238-243 | graphiti_core/driver/falkordb/operations/entity_node_ops.py:168-174 | graphiti_core/driver/kuzu/operations/entity_edge_ops.py:194-199 | graphiti_core/driver/neptune/operations/entity_edge_ops.py:215-220 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/entity_edge_ops.py` and `graphiti_core/driver/falkordb/operations/entity_node_ops.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
No authorization server/graph_service/main.py:27— This repository serves requests — a request handler (@app.get() (server/graph_service/main.py:27) — and no route guard, auth-gate middleware, global guard or imperative check that refuses a caller (401/403, an Unauthorized/Forbidden error) was found: its endpoints may be unprotected.
combined_extraction.extract_nodes_and_edges (cyclomatic 48) graphiti_core/utils/maintenance/combined_extraction.py:58— combined_extraction.extract_nodes_and_edges has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
edge_operations.extract_edges (cyclomatic 38) graphiti_core/utils/maintenance/edge_operations.py:134— edge_operations.extract_edges has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
search_filters.edge_search_filter_query_constructor (cyclomatic 35) graphiti_core/search/search_filters.py:126— search_filters.edge_search_filter_query_constructor has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
edge_operations._dedupe_extracted_edge (cyclomatic 35) graphiti_core/utils/maintenance/edge_operations.py:864— edge_operations._dedupe_extracted_edge has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
apply._validate_decision (cyclomatic 26) REDACTED:156— apply._validate_decision has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
OpenAIDecisionsClient._map_answers (cyclomatic 26) graphiti_core/llm_client/openai_decisions_client.py:301— OpenAIDecisionsClient._map_answers has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
edge_operations.resolve_extracted_edges (cyclomatic 26) graphiti_core/utils/maintenance/edge_operations.py:424— edge_operations.resolve_extracted_edges has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
GraphitiConfig.apply_cli_overrides (cyclomatic 23) mcp_server/src/config/schema.py:308— GraphitiConfig.apply_cli_overrides has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
bulk_utils.add_nodes_and_edges_bulk_tx (cyclomatic 22) graphiti_core/utils/bulk_utils.py:151— bulk_utils.add_nodes_and_edges_bulk_tx has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Graphiti.summarize_saga (cyclomatic 21) graphiti_core/graphiti.py:590— Graphiti.summarize_saga has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
OpenAIDecisionsClient._post (cyclomatic 21) graphiti_core/llm_client/openai_decisions_client.py:191— OpenAIDecisionsClient._post has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
search.edge_search (cyclomatic 21) graphiti_core/search/search.py:259— search.edge_search has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
bulk_utils.dedupe_edges_bulk (cyclomatic 21) graphiti_core/utils/bulk_utils.py:504— bulk_utils.dedupe_edges_bulk has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
LLMClientFactory.create (cyclomatic 21) mcp_server/src/services/factories.py:135— LLMClientFactory.create has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
EmbedderFactory.create (cyclomatic 20) mcp_server/src/services/factories.py:311— EmbedderFactory.create has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
decide.fetch_intake_item (cyclomatic 19) REDACTED:161— decide.fetch_intake_item has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Graphiti.add_episode_bulk (cyclomatic 19) graphiti_core/graphiti.py:1588— Graphiti.add_episode_bulk has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
GeminiClient._generate_response (cyclomatic 19) graphiti_core/llm_client/gemini_client.py:243— GeminiClient._generate_response has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
node_operations._resolve_with_llm (cyclomatic 19) graphiti_core/utils/maintenance/node_operations.py:649— node_operations._resolve_with_llm has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
Graphiti.add_triplet (cyclomatic 18) graphiti_core/graphiti.py:2033— Graphiti.add_triplet has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
search.node_search (cyclomatic 18) graphiti_core/search/search.py:473— search.node_search has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
content_chunking.generate_covering_chunks (cyclomatic 17) graphiti_core/utils/content_chunking.py:719— content_chunking.generate_covering_chunks has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
decide.decide_pull_request (cyclomatic 16) REDACTED:383— decide.decide_pull_request has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
OpenAIDecisionsClient.generate_response (cyclomatic 16) graphiti_core/llm_client/openai_decisions_client.py:108— OpenAIDecisionsClient.generate_response has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
search_filters.edge_search_filter_query_constructor (cognitive 92) graphiti_core/search/search_filters.py:126— search_filters.edge_search_filter_query_constructor has cognitive complexity 92 (threshold 15). Drivers by points: if/else 27 (60 pts), loops 12 (32 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
combined_extraction.extract_nodes_and_edges (cognitive 80) graphiti_core/utils/maintenance/combined_extraction.py:58— combined_extraction.extract_nodes_and_edges has cognitive complexity 80 (threshold 15). Drivers by points: if/else 25 (49 pts), loops 9 (16 pts), boolean chains 9, ternaries 5 (6 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
edge_operations.extract_edges (cognitive 57) graphiti_core/utils/maintenance/edge_operations.py:134— edge_operations.extract_edges has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 10, loops 5 (7 pts), error handling 2 (6 pts), ternaries 5 (6 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OpenAIDecisionsClient._map_answers (cognitive 50) graphiti_core/llm_client/openai_decisions_client.py:301— OpenAIDecisionsClient._map_answers has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (37 pts), boolean chains 7, loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bulk_utils.dedupe_edges_bulk (cognitive 47) graphiti_core/utils/bulk_utils.py:504— bulk_utils.dedupe_edges_bulk has cognitive complexity 47 (threshold 15). Drivers by points: if/else 6 (24 pts), loops 10 (19 pts), boolean chains 3, ternaries 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bulk_utils.add_nodes_and_edges_bulk_tx (cognitive 45) graphiti_core/utils/bulk_utils.py:151— bulk_utils.add_nodes_and_edges_bulk_tx has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 9 (17 pts), ternaries 2 (6 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
edge_operations._dedupe_extracted_edge (cognitive 45) graphiti_core/utils/maintenance/edge_operations.py:864— edge_operations._dedupe_extracted_edge has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 7 (13 pts), boolean chains 8, loops 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
content_chunking.generate_covering_chunks (cognitive 44) graphiti_core/utils/content_chunking.py:719— content_chunking.generate_covering_chunks has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 6 (13 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
edge_operations.resolve_extracted_edges (cognitive 43) graphiti_core/utils/maintenance/edge_operations.py:424— edge_operations.resolve_extracted_edges has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 11 (18 pts), boolean chains 2, ternaries 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
bulk_utils.dedupe_nodes_bulk (cognitive 33) graphiti_core/utils/bulk_utils.py:388— bulk_utils.dedupe_nodes_bulk has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 6 (8 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LLMClientFactory.create (cognitive 33) mcp_server/src/services/factories.py:135— LLMClientFactory.create has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (30 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Graphiti.add_episode_bulk (cognitive 31) graphiti_core/graphiti.py:1588— Graphiti.add_episode_bulk has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 3 (5 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OpenAIDecisionsClient._post (cognitive 31) graphiti_core/llm_client/openai_decisions_client.py:191— OpenAIDecisionsClient._post has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (18 pts), error handling 3 (6 pts), boolean chains 5, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GeminiEmbedder.create_batch (cognitive 30) graphiti_core/embedder/gemini.py:113— GeminiEmbedder.create_batch has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (14 pts), error handling 2 (6 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Graphiti.summarize_saga (cognitive 30) graphiti_core/graphiti.py:590— Graphiti.summarize_saga has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NeptuneDriver._sanitize_parameters (cognitive 28) graphiti_core/driver/neptune_driver.py:244— NeptuneDriver._sanitize_parameters has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
lib.validate_prompt_library (cognitive 28) graphiti_core/prompts/lib.py:575— lib.validate_prompt_library has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
decision_prompts.parse_list (cognitive 26) graphiti_core/llm_client/decision_prompts.py:75— decision_prompts.parse_list has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (9 pts), error handling 3 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GeminiClient._generate_response (cognitive 26) graphiti_core/llm_client/gemini_client.py:243— GeminiClient._generate_response has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, error handling 2 (3 pts), ternaries 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
search_utils.edge_similarity_search (cognitive 26) graphiti_core/search/search_utils.py:300— search_utils.edge_similarity_search has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EmbedderFactory.create (cognitive 26) mcp_server/src/services/factories.py:311— EmbedderFactory.create has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 5, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
apply._validate_decision (cognitive 25) REDACTED:156— apply._validate_decision has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15, boolean chains 10. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
decide.fetch_intake_item (cognitive 24) REDACTED:161— decide.fetch_intake_item has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 8, loops 1 (2 pts), ternaries 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Graphiti.__init__ (cognitive 23) graphiti_core/graphiti.py:210— Graphiti.__init__ has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18 (23 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
prompt_config.flatten_routes (cognitive 23) graphiti_core/llm_client/prompt_config.py:283— prompt_config.flatten_routes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
search.edge_search (cognitive 23) graphiti_core/search/search.py:259— search.edge_search has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
search_utils.community_similarity_search (cognitive 23) graphiti_core/search/search_utils.py:1067— search_utils.community_similarity_search has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (3 pts), error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dedup_helpers._resolve_with_similarity (cognitive 23) graphiti_core/utils/maintenance/dedup_helpers.py:321— dedup_helpers._resolve_with_similarity has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
node_operations._resolve_with_llm (cognitive 23) graphiti_core/utils/maintenance/node_operations.py:649— node_operations._resolve_with_llm has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 6, boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
node_operations._process_summary_flight (cognitive 23) graphiti_core/utils/maintenance/node_operations.py:1172— node_operations._process_summary_flight has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 4 (7 pts), ternaries 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AnthropicClient.generate_response (cognitive 22) graphiti_core/llm_client/anthropic_client.py:348— AnthropicClient.generate_response has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
node_operations._extract_entity_summaries_batch (cognitive 22) graphiti_core/utils/maintenance/node_operations.py:1088— node_operations._extract_entity_summaries_batch has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GraphitiConfig.apply_cli_overrides (cognitive 22) mcp_server/src/config/schema.py:308— GraphitiConfig.apply_cli_overrides has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 11. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
AnthropicClient._generate_response (cognitive 21) graphiti_core/llm_client/anthropic_client.py:254— AnthropicClient._generate_response has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, error handling 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
JevClient._post (cognitive 21) graphiti_core/llm_client/jev_client.py:208— JevClient._post has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
search_utils.node_similarity_search (cognitive 21) graphiti_core/search/search_utils.py:668— search_utils.node_similarity_search has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GraphitiService.initialize (cognitive 21) mcp_server/src/graphiti_mcp_server.py:239— GraphitiService.initialize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (16 pts), error handling 4, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
graph_utils.label_propagation (cognitive 20) graphiti_core/driver/operations/graph_utils.py:27— graph_utils.label_propagation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (7 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Graphiti._resolve_nodes_and_edges_bulk (cognitive 20) graphiti_core/graphiti.py:1134— Graphiti._resolve_nodes_and_edges_bulk has cognitive complexity 20 (threshold 15). Drivers by points: loops 9 (12 pts), if/else 2 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
GeminiClient.generate_response (cognitive 20) graphiti_core/llm_client/gemini_client.py:372— GeminiClient.generate_response has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 5, error handling 2 (4 pts), if/else 2 (4 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
content_chunking.chunk_text_content (cognitive 20) graphiti_core/utils/content_chunking.py:376— content_chunking.chunk_text_content has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
community_operations.label_propagation (cognitive 20) graphiti_core/utils/maintenance/community_operations.py:96— community_operations.label_propagation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (7 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GeminiRerankerClient.rank (cognitive 18) graphiti_core/cross_encoder/gemini_reranker_client.py:73— GeminiRerankerClient.rank has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, error handling 2 (3 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Graphiti.remove_episode (cognitive 18) graphiti_core/graphiti.py:2174— Graphiti.remove_episode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
search_utils.get_relevant_edges (cognitive 18) graphiti_core/search/search_utils.py:1413— search_utils.get_relevant_edges has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (search_utils.get_edge_invalidation_candidates) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
search_utils.get_edge_invalidation_candidates (cognitive 18) graphiti_core/search/search_utils.py:1598— search_utils.get_edge_invalidation_candidates has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (search_utils.get_relevant_edges) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
Graphiti.add_triplet (cognitive 17) graphiti_core/graphiti.py:2033— Graphiti.add_triplet has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, error handling 3, boolean chains 2, ternaries 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
node_db_queries.get_entity_node_save_bulk_query (cognitive 17) graphiti_core/models/nodes/node_db_queries.py:194— node_db_queries.get_entity_node_save_bulk_query has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (8 pts), ternaries 2 (5 pts), if/else 1 (3 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
search.node_search (cognitive 17) graphiti_core/search/search.py:473— search.node_search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
search_utils.edge_fulltext_search (cognitive 17) graphiti_core/search/search_utils.py:185— search_utils.edge_fulltext_search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
search_utils.community_fulltext_search (cognitive 17) graphiti_core/search/search_utils.py:973— search_utils.community_fulltext_search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 1 (3 pts), ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
apply.apply_to_github (cognitive 16) REDACTED:429— apply.apply_to_github has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Graphiti._process_episode_data (cognitive 16) graphiti_core/graphiti.py:984— Graphiti._process_episode_data has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
prompt_config.flatten_overrides (cognitive 16) graphiti_core/llm_client/prompt_config.py:99— prompt_config.flatten_overrides has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
search.search (cognitive 16) graphiti_core/search/search.py:98— search.search has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 3, ternaries 2 (3 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
search_utils.edge_bfs_search (cognitive 16) graphiti_core/search/search_utils.py:448— search_utils.edge_bfs_search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), error handling 1 (2 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
search_utils.node_fulltext_search (cognitive 16) graphiti_core/search/search_utils.py:572— search_utils.node_fulltext_search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), loops 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
content_chunking._chunk_by_sentences (cognitive 16) graphiti_core/utils/content_chunking.py:453— content_chunking._chunk_by_sentences has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
graph_data_operations.retrieve_episodes (cognitive 16) graphiti_core/utils/maintenance/graph_data_operations.py:67— graph_data_operations.retrieve_episodes has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 4, error handling 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication· Near-duplicate member family (4 members, 52 shared lines) · ×1
Near-duplicate member family (4 members, 52 shared lines) graphiti_core/driver/falkordb/operations/graph_ops.py:115— graphiti_core/driver/falkordb/operations/graph_ops.py:115-177 | graphiti_core/driver/kuzu/operations/graph_ops.py:86-151 | graphiti_core/driver/neo4j/operations/graph_ops.py:80-146 | graphiti_core/driver/neptune/operations/graph_ops.py:87-151 — These 4 members are variants of one another: a block of 52 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (176–178 lines × 2) graphiti_core/search/search_utils.py:1420— graphiti_core/search/search_utils.py:1420-1595 | graphiti_core/search/search_utils.py:1605-1782 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (52 lines × 2) graphiti_core/driver/falkordb/operations/episode_node_ops.py:250— graphiti_core/driver/falkordb/operations/episode_node_ops.py:250-301 | graphiti_core/driver/kuzu/operations/episode_node_ops.py:215-266 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/episode_node_ops.py` and `graphiti_core/driver/kuzu/operations/episode_node_ops.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 197 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (45–51 lines × 2) graphiti_core/search/search_utils.py:354— graphiti_core/search/search_utils.py:354-404 | graphiti_core/search/search_utils.py:1090-1134 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (30–32 lines × 2) graphiti_core/driver/falkordb/operations/graph_ops.py:77— graphiti_core/driver/falkordb/operations/graph_ops.py:77-108 | graphiti_core/driver/falkordb_driver.py:293-322 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (29–31 lines × 4) graphiti_core/driver/falkordb/operations/graph_ops.py:143— graphiti_core/driver/falkordb/operations/graph_ops.py:143-171 | graphiti_core/driver/kuzu/operations/graph_ops.py:115-145 | graphiti_core/driver/neo4j/operations/graph_ops.py:110-139 | graphiti_core/driver/neptune/operations/graph_ops.py:116-145 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/graph_ops.py` and `graphiti_core/driver/kuzu/operations/graph_ops.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/driver/falkordb/operations/graph_ops.py:143` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (30 lines × 2) mcp_server/src/services/factories.py:188— mcp_server/src/services/factories.py:188-217 | mcp_server/src/services/factories.py:339-368 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind `config` to `LLMConfig` in one and `EmbedderConfig` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (19–29 lines × 2) graphiti_core/utils/bulk_utils.py:171— graphiti_core/utils/bulk_utils.py:171-189 | graphiti_core/utils/bulk_utils.py:195-223 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (20–28 lines × 3) graphiti_core/search/search_utils.py:624— graphiti_core/search/search_utils.py:624-643 | graphiti_core/search/search_utils.py:920-947 | graphiti_core/search/search_utils.py:1018-1042 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/search/search_utils.py:624` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (27–28 lines × 2) graphiti_core/utils/maintenance/edge_operations.py:913— graphiti_core/utils/maintenance/edge_operations.py:913-939 | graphiti_core/utils/maintenance/edge_operations.py:1043-1070 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (24–26 lines × 2) graphiti_core/nodes.py:521— graphiti_core/nodes.py:521-544 | graphiti_core/nodes.py:772-797 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/nodes.py:772` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (23–24 lines × 4) graphiti_core/driver/falkordb/operations/graph_ops.py:115— graphiti_core/driver/falkordb/operations/graph_ops.py:115-137 | graphiti_core/driver/kuzu/operations/graph_ops.py:86-109 | graphiti_core/driver/neo4j/operations/graph_ops.py:80-103 | graphiti_core/driver/neptune/operations/graph_ops.py:87-110 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/graph_ops.py` and `graphiti_core/driver/kuzu/operations/graph_ops.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/driver/falkordb/operations/graph_ops.py:115` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (23 lines × 2) graphiti_core/utils/content_chunking.py:426— graphiti_core/utils/content_chunking.py:426-448 | graphiti_core/utils/content_chunking.py:483-505 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (21–22 lines × 4) graphiti_core/driver/falkordb/operations/search_ops.py:538— graphiti_core/driver/falkordb/operations/search_ops.py:538-558 | graphiti_core/driver/kuzu/operations/search_ops.py:661-681 | graphiti_core/driver/neo4j/operations/search_ops.py:552-573 | graphiti_core/driver/neptune/operations/search_ops.py:623-643 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/search_ops.py` and `graphiti_core/driver/kuzu/operations/search_ops.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/driver/falkordb/operations/search_ops.py:538` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (21 lines × 6) graphiti_core/driver/falkordb/operations/community_edge_ops.py:153— graphiti_core/driver/falkordb/operations/community_edge_ops.py:153-173 | graphiti_core/driver/falkordb/operations/entity_edge_ops.py:181-201 | graphiti_core/driver/falkordb/operations/episode_node_ops.py:190-210 | graphiti_core/driver/falkordb/operations/episodic_edge_ops.py:167-187 | graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py:162-182 | graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py:162-182 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/community_edge_ops.py` and `graphiti_core/driver/falkordb/operations/entity_edge_ops.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/driver/falkordb/operations/community_edge_ops.py:153` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (17–21 lines × 3) graphiti_core/search/search.py:571— graphiti_core/search/search.py:571-587 | graphiti_core/search/search.py:713-731 | graphiti_core/search/search.py:817-837 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/search/search.py:571` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (20 lines × 4) graphiti_core/search/search_filters.py:169— graphiti_core/search/search_filters.py:169-188 | graphiti_core/search/search_filters.py:200-219 | graphiti_core/search/search_filters.py:231-250 | graphiti_core/search/search_filters.py:262-281 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (19–20 lines × 3) graphiti_core/edges.py:390— graphiti_core/edges.py:390-408 | graphiti_core/edges.py:462-481 | graphiti_core/edges.py:557-575 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (18–20 lines × 2) graphiti_core/llm_client/jev_client.py:189— graphiti_core/llm_client/jev_client.py:189-206 | graphiti_core/llm_client/openai_decisions_client.py:170-189 — before extracting anything, compare `graphiti_core/llm_client/jev_client.py` and `graphiti_core/llm_client/openai_decisions_client.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/llm_client/jev_client.py:189` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (18–19 lines × 4) graphiti_core/driver/falkordb/operations/search_ops.py:587— graphiti_core/driver/falkordb/operations/search_ops.py:587-604 | graphiti_core/driver/kuzu/operations/search_ops.py:712-729 | graphiti_core/driver/neo4j/operations/search_ops.py:603-621 | graphiti_core/driver/neptune/operations/search_ops.py:672-689 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/search_ops.py` and `graphiti_core/driver/kuzu/operations/search_ops.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/driver/falkordb/operations/search_ops.py:587` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17–19 lines × 3) graphiti_core/driver/falkordb/operations/search_ops.py:289— graphiti_core/driver/falkordb/operations/search_ops.py:289-305 | graphiti_core/driver/neo4j/operations/search_ops.py:303-319 | graphiti_core/driver/neptune/operations/search_ops.py:313-331 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/search_ops.py` and `graphiti_core/driver/neo4j/operations/search_ops.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 121 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/driver/falkordb/operations/search_ops.py:289` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (19 lines × 2) graphiti_core/driver/record_parsers.py:90— graphiti_core/driver/record_parsers.py:90-108 | graphiti_core/nodes.py:1073-1091 — before extracting anything, compare `graphiti_core/driver/record_parsers.py` and `graphiti_core/nodes.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (17 lines × 5) graphiti_core/driver/falkordb/operations/search_ops.py:283— graphiti_core/driver/falkordb/operations/search_ops.py:283-299 | graphiti_core/driver/kuzu/operations/search_ops.py:365-381 | graphiti_core/driver/neo4j/operations/search_ops.py:297-313 | graphiti_core/driver/neptune/operations/search_ops.py:307-323 | graphiti_core/search/search_utils.py:332-348 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/search_ops.py` and `graphiti_core/driver/kuzu/operations/search_ops.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/driver/falkordb/operations/search_ops.py:283` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17 lines × 2) graphiti_core/graphiti.py:1070— graphiti_core/graphiti.py:1070-1086 | graphiti_core/graphiti.py:1810-1826 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16–17 lines × 2) graphiti_core/search/search_utils.py:238— graphiti_core/search/search_utils.py:238-254 | graphiti_core/search/search_utils.py:607-622 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/search/search_utils.py:238` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12–16 lines × 4) graphiti_core/search/search.py:409— graphiti_core/search/search.py:409-420 | graphiti_core/search/search.py:614-629 | graphiti_core/search/search.py:749-764 | graphiti_core/search/search.py:867-880 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (16 lines × 2) graphiti_core/llm_client/gemini_client.py:458— graphiti_core/llm_client/gemini_client.py:458-473 | graphiti_core/llm_client/openai_base_client.py:337-352 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (14–15 lines × 3) graphiti_core/search/search_utils.py:605— graphiti_core/search/search_utils.py:605-618 | graphiti_core/search/search_utils.py:905-918 | graphiti_core/search/search_utils.py:1002-1016 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `graphiti_core/search/search_utils.py:605` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14–15 lines × 2) graphiti_core/search/search_utils.py:589— graphiti_core/search/search_utils.py:589-603 | graphiti_core/search/search_utils.py:681-694 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (12–13 lines × 2) graphiti_core/utils/maintenance/combined_extraction.py:201— graphiti_core/utils/maintenance/combined_extraction.py:201-212 | graphiti_core/utils/maintenance/node_operations.py:359-371 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `graphiti_core/utils/maintenance/combined_extraction.py:200` calls `add`, `_normalize_string_exact` and `graphiti_core/utils/maintenance/node_operations.py:358` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 4) graphiti_core/driver/record_parsers.py:26— graphiti_core/driver/record_parsers.py:26-32 | graphiti_core/driver/record_parsers.py:55-61 | graphiti_core/edges.py:978-984 | graphiti_core/nodes.py:1098-1104 — before extracting anything, compare `graphiti_core/driver/record_parsers.py` and `graphiti_core/nodes.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (305 lines × 2) graphiti_core/driver/graph_operations/graph_operations.py:41— graphiti_core/driver/graph_operations/graph_operations.py:41-910 | graphiti_core/driver/search_interface/search_interface.py:44-348 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 35) graphiti_core/driver/falkordb/operations/community_edge_ops.py:72— graphiti_core/driver/falkordb/operations/community_edge_ops.py:72-81 | graphiti_core/driver/falkordb/operations/community_node_ops.py:73-86 | graphiti_core/driver/falkordb/operations/entity_edge_ops.py:104-113 | graphiti_core/driver/falkordb/operations/entity_node_ops.py:100-113 | graphiti_core/driver/falkordb/operations/episode_node_ops.py:88-101 | graphiti_core/driver/falkordb/operations/episodic_edge_ops.py:86-95 | graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py:81-90 | graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py:81-90 | graphiti_core/driver/falkordb/operations/saga_node_ops.py:77-86 | graphiti_core/driver/kuzu/operations/community_edge_ops.py:72-81 | graphiti_core/driver/kuzu/operations/community_node_ops.py:74-83 | graphiti_core/driver/kuzu/operations/entity_edge_ops.py:83-92 | graphiti_core/driver/kuzu/operations/episode_node_ops.py:78-87 | graphiti_core/driver/kuzu/operations/episodic_edge_ops.py:94-103 | graphiti_core/driver/kuzu/operations/has_episode_edge_ops.py:80-89 | graphiti_core/driver/kuzu/operations/next_episode_edge_ops.py:80-89 | graphiti_core/driver/kuzu/operations/saga_node_ops.py:78-87 | graphiti_core/driver/neo4j/operations/community_edge_ops.py:72-81 | graphiti_core/driver/neo4j/operations/community_node_ops.py:74-87 | graphiti_core/driver/neo4j/operations/entity_edge_ops.py:104-113 | graphiti_core/driver/neo4j/operations/entity_node_ops.py:96-109 | graphiti_core/driver/neo4j/operations/episode_node_ops.py:88-101 | graphiti_core/driver/neo4j/operations/episodic_edge_ops.py:86-95 | graphiti_core/driver/neo4j/operations/has_episode_edge_ops.py:80-89 | graphiti_core/driver/neo4j/operations/next_episode_edge_ops.py:80-89 | graphiti_core/driver/neo4j/operations/saga_node_ops.py:77-86 | graphiti_core/driver/neptune/operations/community_edge_ops.py:72-81 | graphiti_core/driver/neptune/operations/community_node_ops.py:88-98 | graphiti_core/driver/neptune/operations/entity_edge_ops.py:104-113 | graphiti_core/driver/neptune/operations/entity_node_ops.py:97-107 | graphiti_core/driver/neptune/operations/episode_node_ops.py:88-98 | graphiti_core/driver/neptune/operations/episodic_edge_ops.py:86-95 | graphiti_core/driver/neptune/operations/has_episode_edge_ops.py:80-89 | graphiti_core/driver/neptune/operations/next_episode_edge_ops.py:80-89 | graphiti_core/driver/neptune/operations/saga_node_ops.py:80-89 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/community_edge_ops.py` and `graphiti_core/driver/falkordb/operations/entity_edge_ops.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 42) graphiti_core/driver/falkordb/operations/community_edge_ops.py:89— graphiti_core/driver/falkordb/operations/community_edge_ops.py:89-97 | graphiti_core/driver/falkordb/operations/community_node_ops.py:95-102 | graphiti_core/driver/falkordb/operations/community_node_ops.py:111-119 | graphiti_core/driver/falkordb/operations/entity_edge_ops.py:121-129 | graphiti_core/driver/falkordb/operations/entity_node_ops.py:122-129 | graphiti_core/driver/falkordb/operations/entity_node_ops.py:138-146 | graphiti_core/driver/falkordb/operations/episode_node_ops.py:110-117 | graphiti_core/driver/falkordb/operations/episode_node_ops.py:126-134 | graphiti_core/driver/falkordb/operations/episodic_edge_ops.py:103-111 | graphiti_core/driver/falkordb/operations/has_episode_edge_ops.py:98-106 | graphiti_core/driver/falkordb/operations/next_episode_edge_ops.py:98-106 | graphiti_core/driver/falkordb/operations/saga_node_ops.py:95-102 | graphiti_core/driver/falkordb/operations/saga_node_ops.py:111-119 | graphiti_core/driver/kuzu/operations/community_edge_ops.py:89-97 | graphiti_core/driver/kuzu/operations/community_node_ops.py:93-100 | graphiti_core/driver/kuzu/operations/community_node_ops.py:110-118 | graphiti_core/driver/kuzu/operations/entity_edge_ops.py:100-108 | graphiti_core/driver/kuzu/operations/episode_node_ops.py:97-104 | graphiti_core/driver/kuzu/operations/episode_node_ops.py:114-122 | graphiti_core/driver/kuzu/operations/episodic_edge_ops.py:111-119 | graphiti_core/driver/kuzu/operations/has_episode_edge_ops.py:97-105 | graphiti_core/driver/kuzu/operations/next_episode_edge_ops.py:97-105 | graphiti_core/driver/kuzu/operations/saga_node_ops.py:97-104 | graphiti_core/driver/kuzu/operations/saga_node_ops.py:114-122 | graphiti_core/driver/neo4j/operations/community_edge_ops.py:89-97 | graphiti_core/driver/neo4j/operations/entity_edge_ops.py:121-129 | graphiti_core/driver/neo4j/operations/episodic_edge_ops.py:103-111 | graphiti_core/driver/neo4j/operations/has_episode_edge_ops.py:97-105 | graphiti_core/driver/neo4j/operations/next_episode_edge_ops.py:97-105 | graphiti_core/driver/neptune/operations/community_edge_ops.py:89-97 | graphiti_core/driver/neptune/operations/community_node_ops.py:107-114 | graphiti_core/driver/neptune/operations/community_node_ops.py:123-131 | graphiti_core/driver/neptune/operations/entity_edge_ops.py:121-129 | graphiti_core/driver/neptune/operations/entity_node_ops.py:116-123 | graphiti_core/driver/neptune/operations/entity_node_ops.py:132-140 | graphiti_core/driver/neptune/operations/episode_node_ops.py:107-114 | graphiti_core/driver/neptune/operations/episode_node_ops.py:123-131 | graphiti_core/driver/neptune/operations/episodic_edge_ops.py:103-111 | graphiti_core/driver/neptune/operations/has_episode_edge_ops.py:97-105 | graphiti_core/driver/neptune/operations/next_episode_edge_ops.py:97-105 | graphiti_core/driver/neptune/operations/saga_node_ops.py:98-105 | graphiti_core/driver/neptune/operations/saga_node_ops.py:114-122 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/community_edge_ops.py` and `graphiti_core/driver/falkordb/operations/entity_edge_ops.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 3) graphiti_core/driver/falkordb/operations/entity_edge_ops.py:250— graphiti_core/driver/falkordb/operations/entity_edge_ops.py:250-257 | graphiti_core/driver/kuzu/operations/entity_edge_ops.py:206-213 | graphiti_core/driver/neptune/operations/entity_edge_ops.py:227-234 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/entity_edge_ops.py` and `graphiti_core/driver/kuzu/operations/entity_edge_ops.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 8) graphiti_core/driver/neo4j/operations/community_node_ops.py:96— graphiti_core/driver/neo4j/operations/community_node_ops.py:96-105 | graphiti_core/driver/neo4j/operations/community_node_ops.py:114-124 | graphiti_core/driver/neo4j/operations/entity_node_ops.py:118-127 | graphiti_core/driver/neo4j/operations/entity_node_ops.py:136-146 | graphiti_core/driver/neo4j/operations/episode_node_ops.py:110-119 | graphiti_core/driver/neo4j/operations/episode_node_ops.py:128-138 | graphiti_core/driver/neo4j/operations/saga_node_ops.py:95-104 | graphiti_core/driver/neo4j/operations/saga_node_ops.py:113-123 — before extracting anything, compare `graphiti_core/driver/neo4j/operations/community_node_ops.py` and `graphiti_core/driver/neo4j/operations/entity_node_ops.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 3) graphiti_core/driver/falkordb/operations/entity_edge_ops.py:151— graphiti_core/driver/falkordb/operations/entity_edge_ops.py:151-159 | graphiti_core/driver/kuzu/operations/entity_edge_ops.py:130-138 | graphiti_core/driver/neptune/operations/entity_edge_ops.py:151-159 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/entity_edge_ops.py` and `graphiti_core/driver/kuzu/operations/entity_edge_ops.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 3) graphiti_core/driver/falkordb/operations/episodic_edge_ops.py:73— graphiti_core/driver/falkordb/operations/episodic_edge_ops.py:73-78 | graphiti_core/driver/neo4j/operations/episodic_edge_ops.py:73-78 | graphiti_core/driver/neptune/operations/episodic_edge_ops.py:73-78 — before extracting anything, compare `graphiti_core/driver/falkordb/operations/episodic_edge_ops.py` and `graphiti_core/driver/neo4j/operations/episodic_edge_ops.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 4) graphiti_core/driver/neo4j/operations/community_edge_ops.py:104— graphiti_core/driver/neo4j/operations/community_edge_ops.py:104-115 | graphiti_core/driver/neo4j/operations/episodic_edge_ops.py:118-129 | graphiti_core/driver/neo4j/operations/has_episode_edge_ops.py:112-123 | graphiti_core/driver/neo4j/operations/next_episode_edge_ops.py:112-123 — before extracting anything, compare `graphiti_core/driver/neo4j/operations/community_edge_ops.py` and `graphiti_core/driver/neo4j/operations/episodic_edge_ops.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (10 lines × 5) graphiti_core/driver/neo4j/operations/community_edge_ops.py:122— graphiti_core/driver/neo4j/operations/community_edge_ops.py:122-131 | graphiti_core/driver/neo4j/operations/episodic_edge_ops.py:136-145 | graphiti_core/driver/neo4j/operations/has_episode_edge_ops.py:130-139 | graphiti_core/driver/neo4j/operations/next_episode_edge_ops.py:130-139 | graphiti_core/driver/neo4j/operations/saga_node_ops.py:148-157 — before extracting anything, compare `graphiti_core/driver/neo4j/operations/community_edge_ops.py` and `graphiti_core/driver/neo4j/operations/episodic_edge_ops.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (6 lines × 2) graphiti_core/driver/neo4j/operations/entity_edge_ops.py:217— graphiti_core/driver/neo4j/operations/entity_edge_ops.py:217-222 | graphiti_core/driver/neo4j/operations/entity_node_ops.py:168-174 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (15 lines × 3) graphiti_core/edges.py:716— graphiti_core/edges.py:716-730 | graphiti_core/edges.py:849-865 | graphiti_core/nodes.py:947-961 — before extracting anything, compare `graphiti_core/edges.py` and `graphiti_core/nodes.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication· Edited copy of a member (169 corresponding lines) · ×1
Edited copy of a member (169 corresponding lines) examples/quickstart/quickstart_falkordb.py:75— examples/quickstart/quickstart_falkordb.py:75-252 | examples/quickstart/quickstart_neo4j.py:67-235 — These two members are one piece of code written twice and then edited apart: 169 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (66 lines × 3) examples/quickstart/quickstart_falkordb.py:167— examples/quickstart/quickstart_falkordb.py:167-232 | examples/quickstart/quickstart_neo4j.py:150-215 | examples/quickstart/quickstart_neptune.py:163-228 — before extracting anything, compare `examples/quickstart/quickstart_falkordb.py` and `examples/quickstart/quickstart_neo4j.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 168 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (59 lines × 2) examples/jev/jev_dedupe_falkordb.py:133— examples/jev/jev_dedupe_falkordb.py:133-191 | examples/openai_decisions/openai_decisions_dedupe_falkordb.py:136-194 — `examples/jev/jev_dedupe_falkordb.py` and `examples/openai_decisions/openai_decisions_dedupe_falkordb.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 3 separate duplicated blocks between them, totalling at least 87 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `examples/jev/jev_dedupe_falkordb.py:133` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (32 lines × 4) examples/azure-openai/azure_openai_neo4j.py:163— examples/azure-openai/azure_openai_neo4j.py:163-194 | examples/quickstart/quickstart_falkordb.py:156-187 | examples/quickstart/quickstart_neo4j.py:139-170 | examples/quickstart/quickstart_neptune.py:152-183 — before extracting anything, compare `examples/azure-openai/azure_openai_neo4j.py` and `examples/quickstart/quickstart_falkordb.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `examples/azure-openai/azure_openai_neo4j.py:163` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `examples/quickstart/quickstart_neptune.py:140` calls `build_communities` and `examples/azure-openai/azure_openai_neo4j.py:151` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (22–23 lines × 2) examples/jev/jev_dedupe_falkordb.py:79— examples/jev/jev_dedupe_falkordb.py:79-100 | examples/openai_decisions/openai_decisions_dedupe_falkordb.py:81-103 — `examples/jev/jev_dedupe_falkordb.py` and `examples/openai_decisions/openai_decisions_dedupe_falkordb.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 3 separate duplicated blocks between them, totalling at least 87 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `examples/jev/jev_dedupe_falkordb.py:79` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10–22 lines × 4) examples/azure-openai/azure_openai_neo4j.py:146— examples/azure-openai/azure_openai_neo4j.py:146-167 | examples/opentelemetry/otel_stdout_example.py:94-103 | examples/quickstart/quickstart_falkordb.py:140-160 | examples/quickstart/quickstart_neo4j.py:123-143 — before extracting anything, compare `examples/azure-openai/azure_openai_neo4j.py` and `examples/quickstart/quickstart_falkordb.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `examples/azure-openai/azure_openai_neo4j.py:146` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (20 lines × 3) examples/quickstart/quickstart_falkordb.py:233— examples/quickstart/quickstart_falkordb.py:233-252 | examples/quickstart/quickstart_neo4j.py:216-235 | examples/quickstart/quickstart_neptune.py:229-248 — before extracting anything, compare `examples/quickstart/quickstart_falkordb.py` and `examples/quickstart/quickstart_neo4j.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 168 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8–11 lines × 8) examples/azure-openai/azure_openai_neo4j.py:167— examples/azure-openai/azure_openai_neo4j.py:167-174 | examples/azure-openai/azure_openai_neo4j.py:196-206 | examples/quickstart/quickstart_falkordb.py:160-167 | examples/quickstart/quickstart_falkordb.py:188-198 | examples/quickstart/quickstart_neo4j.py:143-150 | examples/quickstart/quickstart_neo4j.py:171-181 | examples/quickstart/quickstart_neptune.py:156-163 | examples/quickstart/quickstart_neptune.py:184-194 — before extracting anything, compare `examples/azure-openai/azure_openai_neo4j.py` and `examples/quickstart/quickstart_falkordb.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `examples/azure-openai/azure_openai_neo4j.py:196` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `examples/quickstart/quickstart_neptune.py:140` calls `build_communities` and `examples/azure-openai/azure_openai_neo4j.py:151` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (11 lines × 4) examples/opentelemetry/otel_stdout_example.py:88— examples/opentelemetry/otel_stdout_example.py:88-98 | examples/quickstart/quickstart_falkordb.py:134-144 | examples/quickstart/quickstart_neo4j.py:117-127 | examples/quickstart/quickstart_neptune.py:128-138 — before extracting anything, compare `examples/quickstart/quickstart_falkordb.py` and `examples/quickstart/quickstart_neo4j.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 168 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `examples/quickstart/quickstart_neptune.py:140` calls `build_communities` and `examples/quickstart/quickstart_falkordb.py:156` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (9–10 lines × 2) examples/azure-openai/azure_openai_neo4j.py:140— examples/azure-openai/azure_openai_neo4j.py:140-149 | examples/gliner2/gliner2_neo4j.py:252-260 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `examples/azure-openai/azure_openai_neo4j.py:140` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 9) examples/azure-openai/azure_openai_neo4j.py:170— examples/azure-openai/azure_openai_neo4j.py:170-175 | examples/azure-openai/azure_openai_neo4j.py:202-207 | examples/gliner2/gliner2_neo4j.py:302-307 | examples/quickstart/quickstart_falkordb.py:163-168 | examples/quickstart/quickstart_falkordb.py:194-199 | examples/quickstart/quickstart_neo4j.py:146-151 | examples/quickstart/quickstart_neo4j.py:177-182 | examples/quickstart/quickstart_neptune.py:159-164 | examples/quickstart/quickstart_neptune.py:190-195 — before extracting anything, compare `examples/azure-openai/azure_openai_neo4j.py` and `examples/quickstart/quickstart_falkordb.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 3) examples/gliner2/gliner2_neo4j.py:266— examples/gliner2/gliner2_neo4j.py:266-270 | examples/jev/jev_dedupe_falkordb.py:147-151 | examples/openai_decisions/openai_decisions_dedupe_falkordb.py:150-154 — `examples/jev/jev_dedupe_falkordb.py` and `examples/openai_decisions/openai_decisions_dedupe_falkordb.py` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 3 separate duplicated blocks between them, totalling at least 87 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own.
Duplicated block (17 lines × 3) examples/ecommerce/runner.py:41— examples/ecommerce/runner.py:41-57 | examples/podcast/podcast_runner.py:42-58 | examples/wizard_of_oz/runner.py:40-56 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
X1 · Async correctness· Task from `asyncio.create_task` is not kept · ×1
Task from `asyncio.create_task` is not kept mcp_server/src/services/queue_service.py:45— The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python's documentation for `asyncio.create_task`: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled — it surfaces, if at all, as "Task exception was never retrieved" in a log. Keep the task: `await` it, gather it, start it in an `asyncio.TaskGroup` (`async with asyncio.TaskGroup() as tg: tg.create_task(…)`), or, for genuine fire-and-forget, add it to a set and `task.add_done_callback(tasks.discard)` with a callback that also reads its exception.
Interpolated log message defeats structured logging graphiti_core/nodes.py:89— `error` at line 89 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/nodes.py:167— `debug` at line 167 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/nodes.py:357— `debug` at line 357 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/nodes.py:511— `debug` at line 511 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/nodes.py:580— `debug` at line 580 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/nodes.py:753— `debug` at line 753 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/nodes.py:762— `debug` at line 762 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/nodes.py:942— `debug` at line 942 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/nodes.py:961— `debug` at line 961 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/graphiti.py:687— `info` at line 687 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/graphiti.py:699— `info` at line 699 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/graphiti.py:763— `info` at line 763 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/graphiti.py:801— `info` at line 801 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/graphiti.py:1572— `info` at line 1572 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/graphiti.py:1850— `info` at line 1850 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/graphiti.py:2101— `info` at line 2101 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/edges.py:90— `debug` at line 90 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/edges.py:129— `debug` at line 129 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/edges.py:160— `debug` at line 160 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/edges.py:299— `debug` at line 299 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/edges.py:378— `debug` at line 378 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/edges.py:597— `debug` at line 597 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/edges.py:711— `debug` at line 711 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/edges.py:730— `debug` at line 730 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging graphiti_core/edges.py:844— `debug` at line 844 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Duplicated predicate graphiti_core/cross_encoder/gemini_reranker_client.py:153— `'rate limit' in error_message or 'quota' in error_message or 'resource_exhausted' in error_message or '429' in str(e)` appears character-identically in 2 files — graphiti_core/cross_encoder/gemini_reranker_client.py, graphiti_core/llm_client/gemini_client.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate graphiti_core/utils/maintenance/combined_extraction.py:251— `allowed_edge_type_names is not None and edge_data.relation_type not in allowed_edge_type_names` appears character-identically in 2 files — graphiti_core/utils/maintenance/combined_extraction.py, graphiti_core/utils/maintenance/edge_operations.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate graphiti_core/driver/operations/graph_utils.py:46— `community_candidate != -1 and candidate_rank > 1` appears character-identically in 2 files — graphiti_core/driver/operations/graph_utils.py, graphiti_core/utils/maintenance/community_operations.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate graphiti_core/utils/maintenance/combined_extraction.py:241— `edge_data.episode_indices and 0 <= edge_data.episode_indices[0] < len(episodes)` appears character-identically in 2 files — graphiti_core/utils/maintenance/combined_extraction.py, graphiti_core/utils/maintenance/edge_operations.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate graphiti_core/utils/maintenance/combined_extraction.py:199— `excluded_entity_types and entity_type_name in excluded_entity_types` appears character-identically in 2 files — graphiti_core/utils/maintenance/combined_extraction.py, graphiti_core/utils/maintenance/node_operations.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate graphiti_core/llm_client/azure_openai_client.py:155— `hasattr(response, 'refusal') and response.refusal` appears character-identically in 2 files — graphiti_core/llm_client/azure_openai_client.py, graphiti_core/llm_client/openai_base_client.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate graphiti_core/driver/falkordb/operations/community_edge_ops.py:145— `isinstance(executor, GraphDriver) and executor.provider == GraphProvider.FALKORDB and group_ids` appears character-identically in 9 files — graphiti_core/driver/falkordb/operations/community_edge_ops.py, graphiti_core/driver/falkordb/operations/community_node_ops.py, graphiti_core/driver/falkordb/operations/entity_edge_ops.py, graphiti_core/driver/falkordb/operations/entity_node_ops.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate REDACTED:404— `isinstance(label, dict) and isinstance(label.get('name'), str)` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate graphiti_core/llm_client/jev_client.py:248— `isinstance(last_error, httpx.HTTPStatusError) and last_error.response.status_code == 429` appears character-identically in 2 files — graphiti_core/llm_client/jev_client.py, graphiti_core/llm_client/openai_decisions_client.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate graphiti_core/llm_client/anthropic_client.py:462— `last_error or Exception('Max retries exceeded with no specific error')` appears character-identically in 2 files — graphiti_core/llm_client/anthropic_client.py, graphiti_core/llm_client/openai_base_client.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate graphiti_core/llm_client/openai_base_client.py:157— `major == 5 and minor is not None and int(minor) >= 1` appears character-identically in 2 files — graphiti_core/llm_client/openai_base_client.py, mcp_server/src/services/factories.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate graphiti_core/llm_client/groq_client.py:81— `response.choices[0].message.content or ''` appears character-identically in 2 files — graphiti_core/llm_client/groq_client.py, graphiti_core/llm_client/openai_generic_client.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate graphiti_core/driver/falkordb/operations/episode_node_ops.py:249— `saga is not None and group_ids is not None and len(group_ids) > 0` appears character-identically in 4 files — graphiti_core/driver/falkordb/operations/episode_node_ops.py, graphiti_core/driver/kuzu/operations/episode_node_ops.py, graphiti_core/driver/neo4j/operations/episode_node_ops.py, graphiti_core/driver/neptune/operations/episode_node_ops.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate graphiti_core/llm_client/client.py:254— `self.cache_enabled and self.cache_dir is not None` appears character-identically in 2 files — graphiti_core/llm_client/client.py, graphiti_core/llm_client/gliner2_client.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate graphiti_core/utils/maintenance/combined_extraction.py:141— `strict_edge_types and not edge_types_context` appears character-identically in 2 files — graphiti_core/utils/maintenance/combined_extraction.py, graphiti_core/utils/maintenance/edge_operations.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
X23 · Unguarded diagnostic materialisation· Diagnostic log message is built whether or not it is wanted · ×8
Diagnostic log message is built whether or not it is wanted graphiti_core/utils/maintenance/node_operations.py:161— `debug` at line 161 is called with an argument built by `[n.uuid for n in extracted_nodes]` (line 161), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
Diagnostic log message is built whether or not it is wanted graphiti_core/utils/maintenance/node_operations.py:691— `debug` at line 691 is called with an argument built by `[ctx["…"] for ctx in extracted_nodes_context[: sample_size]]` (line 694), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
Diagnostic log message is built whether or not it is wanted graphiti_core/utils/maintenance/node_operations.py:697— `debug` at line 697 is called with an argument built by `[ctx["…"] for ctx in extracted_nodes_context[- sample_size :]]` (line 700), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
Diagnostic log message is built whether or not it is wanted graphiti_core/utils/maintenance/node_operations.py:901— `debug` at line 901 is called with an argument built by `[node.uuid for node in state.resolved_nodes if node is not None]` (line 903), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
Diagnostic log message is built whether or not it is wanted graphiti_core/utils/maintenance/edge_operations.py:379— `debug` at line 379 is called with an argument built by `[e.uuid for e in edges]` (line 379), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
Diagnostic log message is built whether or not it is wanted graphiti_core/utils/maintenance/edge_operations.py:587— `debug` at line 587 is called with an argument built by `[e.uuid for edges_lst in related_edges_lists for e in edges_lst]` (line 588), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
Diagnostic log message is built whether or not it is wanted graphiti_core/utils/maintenance/edge_operations.py:628— `debug` at line 628 is called with an argument built by `[e.uuid for e in resolved_edges]` (line 628), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
Diagnostic log message is built whether or not it is wanted graphiti_core/utils/maintenance/edge_operations.py:629— `debug` at line 629 is called with an argument built by `[e.uuid for e in new_edges]` (line 629), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
README/code drift mcp_server/README.md:65— mcp_server/README.md changes into `graphiti/mcp_server`, but no such folder exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift mcp_server/README.md:290— mcp_server/README.md runs `docker compose -f docker/docker-compose.neo4j.yaml up`, but `docker/docker-compose.neo4j.yaml` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift mcp_server/README.md:319— mcp_server/README.md runs `docker compose -f docker/docker-compose.falkordb.yaml up`, but `docker/docker-compose.falkordb.yaml` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift mcp_server/README.md:640— mcp_server/README.md links to `cursor_rules.md`, but `mcp_server/cursor_rules.md` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift mcp_server/docker/README-falkordb-combined.md:34— mcp_server/docker/README-falkordb-combined.md runs `docker compose -f docker/docker-compose-falkordb-combined.yml up`, but `docker/docker-compose-falkordb-combined.yml` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift mcp_server/docker/README-falkordb-combined.md:111— mcp_server/docker/README-falkordb-combined.md runs `docker compose -f docker/docker-compose-falkordb-combined.yml logs -f graphiti-falkordb`, but `graphiti-falkordb` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift mcp_server/docker/README-falkordb-combined.md:222— mcp_server/docker/README-falkordb-combined.md names `docker-compose-falkordb-combined.yml`, but no file or folder `docker-compose-falkordb-combined.yml` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
Silent fallback default in catch graphiti_core/telemetry/telemetry.py:61— `get_anonymous_id` swallows every exception into `return 'UNKNOWN'` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch graphiti_core/telemetry/telemetry.py:72— `get_graphiti_version` swallows every exception into `return 'unknown'` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: mcp_server/src/utils/type_config.py. Pair on, review, or document these before any departure.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 1 of 3 project(s) overshoot their size bounds, lowering Project Cohesion to 3.3/10. The most over is `(repository root)` (36351 LoC, 368 module-visible types across 30 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No src/ separation — Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
Dependency hygiene PARTLY measured — Python dependencies read, no exact pin to grade for currency — This repository's Python dependencies were read: 13 shipped distribution(s) across 3 manifest(s) (31 development or optional declaration(s) excluded, because a consumer does not install them). Whether any of them is behind its current release is the dependency-CURRENCY question, and no declaration here carries an EXACT pin to ask it about — every one is a floor or a range, which installs the newest release it admits and therefore cannot be behind one. That is a healthy declaration style, NOT a defect and NOT a gap in this analyzer; there is simply no currency question to answer. This is NOT a finding that these dependencies are current or healthy. Lockfiles are deliberately not read (poetry.lock, REDACTED, Pipfile.lock, pdm.lock): the four disagree about dev/optional membership, and misreading one would charge a test-only package a consumer never receives. Known CVEs in the same dependency graph are a separate question, reported under D30.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
Run 01a15a06-fdd5-7216-8976-41e7447fd8a4 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 20 · Warnings: 264 · Recommendations: 81 · Info: 1 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 20-10-2026 @ 15:56 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.