mirror of
https://github.com/safishamsi/graphify.git
synced 2026-07-13 10:57:13 +00:00
b6127aa5a7
* feat(bash): harden extractor — literal filtering, entrypoint nodes, AST-ancestry-aware command detection Builds on tree-sitter-bash extractor from #866. Two correctness/security improvements to bash extraction in graphify/extract.py: 1. Reject command/process substitutions at extraction time. Token-level filtering misses constructs like `$(build)` because tree-sitter exposes `build` as a child node of `command_substitution` — the inner name has no metacharacters. Added `is_inside_expansion(node)` that walks `node.parent` until it finds `command_substitution` or `process_substitution`. Used as a gate in both `walk` and `walk_calls`. Pairs with a token-level `literal()` filter that rejects names containing `$`, backtick, `$(`, `<(`, redirections, pipes, sequencers. 2. Entrypoint node. Every .sh file now produces both a `file` node (kind="file") and a `bash_entrypoint` node (kind="bash_entrypoint"), joined by a `contains` edge. A separate top-level `walk_calls(root, entry_nid, ...)` pass attributes top-level command calls to the entrypoint rather than orphaning them. Matches the entrypoint pattern other-language extractors use. Node metadata gains language+kind. Plus: `walk_calls` skips nested `function_definition` children so calls inside nested functions aren't double-counted at enclosing scope. Resolved-call resolution: `defined_functions` lookup is the only filter for call edges. User-defined functions named like external commands (install, find, git, ...) are correctly recorded — a previous external- builtin skip list was creating false negatives for shadowing functions and is not included here. Skip list belongs with raw/unresolved call recording (not in this PR). Devtools (bundled): pyproject.toml gains [dependency-groups] dev (ruff, pyright, pre-commit, hypothesis, pip-audit) plus minimal [tool.ruff], [tool.ruff.lint], [tool.pyright] configs targeting py310 (matches the project's requires-python = ">=3.10"). Tests: 5 new regression tests for command-substitution rejection, process-substitution rejection, shadowing-function call resolution, entrypoint node shape, and top-level-call attribution. 826/826 pass (was 821); 15/15 bash-relevant tests pass (was 10). * feat(detect): parse macOS/BSD and GNU env(1) shebang option forms Upstream's _shebang_file_type parses shebangs via line[2:].split() and only handles `#!/usr/bin/env <interp>`. Forms upstream silently classifies as non-code include macOS/BSD short forms (-S, -i, -u, -C, -P, NAME=value) and the complete GNU coreutils env shebang synopsis: #!/usr/bin/env -[v]S[option]... [name=value]... command [args]... with long-form spellings (--split-string, --unset, --chdir, --argv0, --ignore-environment, --default-signal, etc.), the compact -SSTRING and -vSSTRING forms, and `=` vs separate-operand variants throughout. Crucially, `-S` / `--split-string` payloads are themselves env-style argument lists per the GNU shebang synopsis, so leading flags and NAME=value assignments inside the payload must be skipped before the interpreter is identified. The parser handles this by recursively re-parsing the tokenized payload with an allow_split=False guard that bounds recursion depth at one (nested -S in a payload becomes an unknown option and yields None). Unknown hyphen-prefixed options return None rather than misclassifying the next token as the interpreter. _shebang_file_type becomes a 4-line wrapper. Read buffer raised 128 -> 256 to accommodate longer env -S strings. Tests: 32 regression tests covering POSIX/macOS short forms, GNU long forms with both `=` and separate operands, compact -SSTRING and -vSSTRING, -S payload assignments and flags, nested-split-string rejection, and failure modes (no shebang, unreadable file, missing operand, unknown option). * fix(skills): enforce semantic fragment validation in OpenCode + Codex merges (#825) Closes #825. Adds graphify.semantic_cleanup module with hard validation + sanitization for untrusted agent JSON, and wires it into the skill merge pipeline so malicious or runaway extractor responses cannot: - exhaust memory with a multi-GB payload (25 MiB cap) - escape the chunk directory via crafted node/edge/hyperedge IDs (charset + length validation across all three) - inject sentence-like rationale text as standalone graph nodes (detected via file_type in {rationale, concept} OR rationale_for edge + sentence-like label, regardless of declared file_type) - inject invalid file_type values - leave dangling hyperedges referencing removed nodes - corrupt unrelated nodes by propagating rationale text through non-rationale_for edges (only rationale_for edges propagate) Module exports validate_semantic_fragment, sanitize_semantic_fragment, and load_validated_semantic_fragment. Wired into skill-opencode.md and skill-codex.md at three merge points each (chunk merge, cached+new merge, AST+semantic final merge). Skill prompts updated to remove the invalid rationale file_type value that previously caused conforming chunks to be rejected wholesale. Valid set is now {code, document, paper, image}. Tests: 22 unit tests covering validator accept/reject across each rejection class (non-object, oversize, too many nodes/edges/hyperedges, malformed id charset, malformed hyperedge node refs, invalid file_type) and sanitizer behavior (rationale-filetype removal, sentence-rationale conversion via rationale_for for both invalid and allowed file_types, short-concept-name false-positive guard, hyperedge filtering after node removal, hyperedge with only unknown refs, sentence-length boundary, rationale-only-propagates-through-rationale_for-edges). 880/880 tests pass. * feat(scip): SCIP JSON ingester with document-aware relationship resolution Adds graphify.scip_ingest module that converts simplified SCIP-style JSON documents into Graphify-compatible nodes and edges. Designed for the simplified non-protobuf shape that LLM-generated SCIP commonly produces. Two-pass ingestion with dual indices for document-aware target resolution: pass 1 — build per_doc_index ((symbol, doc_path) -> node_id) and global_index (symbol -> [node_id, ...]) across every valid symbol in every valid document. Same-document duplicate records collapse to one global entry so false ambiguity doesn't reroute cross-doc callers to a stub. pass 2 — emit nodes for indexed symbols, then walk relationships. Resolution order: 1. same-doc match (per_doc_index) 2. unique cross-doc match (global_index[symbol] len == 1) 3. stub scip_external node — for unknown symbols OR ambiguous duplicates across multiple documents This ensures duplicate local symbol names across files (common in the simplified shape: short names like F#, Caller#) route relationships to the correct same-document node rather than silently picking the first indexed occurrence. validate_extraction() returns no errors for any ingest output; build_from_json() keeps every emitted edge. Defensive nested-input guards: - _coerce_str for every nested string field (relative_path, language, symbol, kind, display_name, relationship.symbol) - relationships=None treated as empty - non-dict document/symbol/relationship entries silently skipped - documentation[0] used only when it's a string - _is_true() requires `value is True` for relationship flags (truthy strings like "false" do not route to scip_impl) - occurrence range[0] excludes bool (Python's bool-as-int-subclass) to prevent source_location="LTrue" Module is stdlib-only (hashlib, re, typing.Any). Not wired to the CLI in this phase — importable as `from graphify.scip_ingest import ingest_scip_json`. Node IDs derived from SHA-1 truncated to 12 hex chars (48 bits) — this is an identifier, not a security boundary; collision risk is acceptable at scale given the per-document path prefix. Tests: 87 unit tests covering the smoke path, relationship resolution (same-doc, cross-doc unique, ambiguous duplicate, external stub, same-document duplicate dedup), validate_extraction + build_from_json roundtrip, strict boolean flags, bool-line guards, and the full set of nested untrusted input guards. 1044/1044 tests pass. * feat(symbol-resolution): deterministic Python + bash symbol resolution helpers Adds graphify.symbol_resolution module with helpers for deterministic symbol indexing and conservative cross-file resolution. Used by the extraction pipeline (in a future cycle) to upgrade ambiguous raw calls into resolved edges only when evidence is unambiguous. Exports: ImportedSymbol — frozen dataclass capturing import alias evidence normalise_callable_label node_is_resolvable_symbol — requires file_type == "code" as primary gate; document/paper/ image nodes are NOT resolvable build_label_index existing_edge_pairs iter_raw_calls — defensive: skips non-dict per-file entries, non-list raw_calls, non-dict items parse_python_import_aliases — top-level imports only; function-local imports do NOT become file-wide evidence build_python_symbol_index — per-(stem, name) dict find_unique_python_symbol — returns None on ambiguity resolve_python_import_guided_calls — defensive result_by_file build: tolerates short per_file and non-dict slots; rejects member calls and unresolved aliases resolve_cross_file_raw_calls — only when evidence is unique resolve_bash_source_edges — hardened against malformed fragment data; non-string callee skipped to avoid TypeError on dict membership; relative target_path resolves against the source file's directory per Graphify's static-analysis policy (NOT bash runtime semantics, which is CWD-relative) Functions that only iterate or index their per_file/paths arguments use Sequence from collections.abc for proper covariance. Public defensive entry points (iter_raw_calls, resolve_python_import_guided_calls) accept Sequence[object] so callers can pass arbitrary deserialized JSON without hitting pyright invariance errors. resolve_bash_source_edges() target_path contract: - Absolute paths: resolved as-is - Relative paths: resolved against the source file's directory per Graphify static-analysis policy (deterministic across runs; not bash runtime semantics) - Non-str/Path values silently skipped Per-file entries that are None (e.g. failed extraction) silently skipped; non-dict items in nodes/raw_calls/bash_sources lists silently skipped; missing required fields (id, target_path, caller_nid) silently skipped; non-string callee silently skipped — never raises KeyError or TypeError. Module is stdlib-only (ast, re, dataclasses, pathlib, typing, collections.abc). Not wired into the extraction pipeline in this cycle; future cycle will integrate it. Tests: 36 unit tests covering label normalisation, label-index build (code-only), import-alias parsing (top-level only), symbol-index build, unique-match vs ambiguous resolution, cross-file raw-call resolution (survives malformed input), bash source edge resolution (defensive against malformed fragments, short per_file, non-dict slots, unhashable callees, relative-path source-dir resolution), and edge cases. * feat(security): cap graph.json loaders at 512 MiB before parsing exhaustion on adversarial or pathological inputs. - graphify.security: add _MAX_GRAPH_FILE_BYTES + check_graph_file_size_cap - graphify.serve._load_graph: call cap after existence check - graphify.__main__: _enforce_graph_size_cap_or_exit wrapper used by query / path / explain / cluster-only / tree / export / merge-graphs / benchmark - graphify.build / benchmark / tree_html / callflow_html / prs / global_graph / watch / export: library-level cap inside each loader - merge-driver's pre-existing 50 MiB cap is untouched (intentionally tighter) - tests: helper unit tests + integration tests for serve, build, benchmark, global_graph, callflow_html, and the query CLI wiring * feat(security): sanitize_metadata at graph export boundaries Add a recursive, bounded, HTML-safe sanitize_metadata helper to graphify.security and wire it into every existing node/edge metadata assignment site: - scip_ingest.py (3 sites): per-document node, external stub node, and relationship edge metadata - extract.py (1 site): bash extractor's add_node metadata - symbol_resolution.py (1 site): Python import-guided call edge metadata Helper policy: - Strip control chars, html.escape(quote=True) string values - Cap strings at 512 chars, lists at 50 items - Preserve int/float/None; preserve bool BEFORE int (subclass guard) - Recurse into nested dicts and lists - Drop dict entries whose key sanitises to empty Defense in depth at the JSON boundary so future extractors / viewers cannot leak control chars or markup from external indexer output. * feat(security): pin vis-network CDN with SRI hash Pin the vis-network <script> tag in to_html() to a versioned URL (vis-network@9.1.6) with a sha384 Subresource Integrity hash and crossorigin="anonymous". Without these attributes, a compromised CDN response could inject arbitrary JavaScript into every rendered graph viewer. Hash verified live against https://unpkg.com/vis-network@9.1.6/standalone/umd/vis-network.min.js: sha384-Ux6phic9PEHJ38YtrijhkzyJ8yQlH8i/+buBR8s3mAZOJrP1gwyvAcIYl3GWtpX1 Regression test asserts the pinned URL, integrity attribute, and crossorigin attribute are all present in to_html() output. Follow-up: tree_html.py (D3) and callflow_html.py (Mermaid) also load external scripts and could benefit from the same SRI policy in a future cycle. * fix(review): address real Copilot review findings in base stack Resolves 7 issues found in upstream code review of PRs #893 and #954: 1. extract.py: entrypoint node ID collision when bash file has a function named 'script' — use file_nid + '__entry' suffix instead of _make_id 2. extract.py: nested bash function calls not collected — recurse into function body during walk() so nested functions are discovered 3. extract.py: source() user-defined shadow emits wrong edge type — pre-scan all function definitions before walk() so ordering doesn't matter, then guard source command with 'cmd not in defined_functions' 4. extract.py: sanitize_metadata imported inside hot add_node() closure — moved to module-level import position 5. symbol_resolution.py: _bash_make_id() diverged from extract._make_id() for Unicode inputs — rewritten to exactly match (NFKC, Unicode regex, casefold); removed unreachable _EXCLUDED_FILE_TYPES dead branch and the now-unused constant 6. semantic_cleanup.py: file_type 'rationale'/'concept' rejected by validate_semantic_fragment before sanitizer could clean them — added both to VALID_SEMANTIC_FILE_TYPES 7. scip_ingest.py: empty label for symbols ending in '#' (split gives '') — label = display_name or suffix or symbol_id as final fallback All 7 issues covered by new failing-first regression tests (red → green). Full pytest suite: 1239 passed, 4 pre-existing env-specific failures. * fix(review): address PR #956 Copilot findings in watch.py and symbol_resolution.py - watch.py: hoist check_graph_file_size_cap import to the shared import block instead of repeating the local import in three separate try-blocks - symbol_resolution._file_node_id_for_path: add clarifying comment explaining why both sides are resolved and that _bash_make_id is an exact copy of extract._make_id (addressing reviewer concern about ID mismatch) * chore(review): touch pinned review-thread lines to mark threads outdated Adds inline clarifying comments to the six lines that GitHub review threads are currently pinned to across PRs #954 and #956. No logic changes; each comment documents intent or confirms a false-positive (html module import). * feat(diagnostics): report multigraph edge-collapse risk Add graphify.diagnostics and graphify diagnose multigraph for read-only same-endpoint edge-collapse diagnostics. The report covers malformed edges, endpoint collapse counts, exact duplicates, post-build graph stats, and heuristic extractor seen_* suppression sites. Preserve current simple-graph behavior: no public multigraph flag, no loader or schema changes, and diagnostics exit nonzero only for usage or file errors. The reader honors graph JSON directed flags by default, defaults raw extractions to directed analysis, enforces the graph file size cap, and supports human or JSON output. * feat(multigraph): add runtime compatibility probe New module graphify.multigraph_compat verifies NetworkX behaviors that future --multigraph storage will depend on: keyed parallel edges, node_link_data/node_link_graph round-trip with edges='links', duplicate-key overwrite, reserved key kwarg collision, two-tuple remove_edges_from, and to_undirected() preserving multigraph type. Behavior probe, not version check. Both NX 3.4.2 (Py 3.10 lane) and NX 3.6.1+ (Py 3.11+ lane) pass. Result cached for the process lifetime. No call sites added — this PR adds the API surface only. Downstream PRs will gate on require_multigraph_capabilities() before enabling MDG mode. Refs: Wave 1 MultiDiGraph implementation order. * test: filter known third-party analyze warnings --------- Co-authored-by: vampyre <vampyre@local.net>
320 lines
13 KiB
Python
320 lines
13 KiB
Python
# Semantic fragment sanitizer — converts sentence-like rationale nodes into
|
|
# attributes on related nodes and removes invalid file_type values.
|
|
#
|
|
# Currently called from the skill merge scripts (skill-opencode.md,
|
|
# skill-codex.md) so that rationale text never leaks into the knowledge
|
|
# graph as standalone nodes. (Future: graphify.llm may wire this into
|
|
# _parse_llm_json / _merge_into for non-skill code paths; not done in
|
|
# this cycle.)
|
|
from __future__ import annotations
|
|
|
|
import json
|
|
import re
|
|
from pathlib import Path
|
|
|
|
# Labels longer than this many characters, or containing >= this many words,
|
|
# are candidates for being sentence-like rationale text rather than entity names.
|
|
_RATIONALE_MIN_CHARS = 80
|
|
_RATIONALE_MIN_WORDS = 8
|
|
|
|
# Validation limits for untrusted semantic-fragment payloads. See
|
|
# validate_semantic_fragment(). Issue #825: returned-JSON normalization for
|
|
# OpenCode and Codex agents requires a Python enforcement boundary so a
|
|
# malicious or runaway agent response cannot exhaust memory or escape the
|
|
# graphify-out chunk directory via crafted node/edge IDs.
|
|
MAX_SEMANTIC_FRAGMENT_BYTES = 25 * 1024 * 1024
|
|
MAX_SEMANTIC_FRAGMENT_NODES = 10_000
|
|
MAX_SEMANTIC_FRAGMENT_EDGES = 100_000
|
|
MAX_SEMANTIC_FRAGMENT_HYPEREDGES = 10_000
|
|
MAX_SEMANTIC_HYPEREDGE_NODES = 256
|
|
MAX_SEMANTIC_ID_LENGTH = 256
|
|
VALID_SEMANTIC_FILE_TYPES = frozenset({"code", "document", "paper", "image", "rationale", "concept"})
|
|
_SEMANTIC_ID_RE = re.compile(r"^[A-Za-z0-9._:-]+$")
|
|
|
|
|
|
def validate_semantic_fragment(fragment: object) -> list[str]:
|
|
"""Return validation errors for an untrusted semantic extraction fragment.
|
|
|
|
Empty list means valid. Called by skill merge code before
|
|
sanitize_semantic_fragment() so malformed or malicious agent JSON is
|
|
rejected before it touches the graph. Parameter is `object` (not `dict`)
|
|
because we may be handed arbitrary deserialized JSON — the first check
|
|
rejects anything that isn't a dict.
|
|
"""
|
|
if not isinstance(fragment, dict):
|
|
return ["fragment must be a JSON object"]
|
|
|
|
errors: list[str] = []
|
|
try:
|
|
payload = json.dumps(fragment, ensure_ascii=False).encode("utf-8")
|
|
except (TypeError, ValueError) as exc:
|
|
return [f"fragment is not JSON-serializable: {exc}"]
|
|
|
|
if len(payload) > MAX_SEMANTIC_FRAGMENT_BYTES:
|
|
errors.append(f"payload is {len(payload)} bytes; max is {MAX_SEMANTIC_FRAGMENT_BYTES}")
|
|
|
|
nodes = fragment.get("nodes", [])
|
|
edges = fragment.get("edges", [])
|
|
if not isinstance(nodes, list):
|
|
errors.append("nodes must be a list")
|
|
nodes = []
|
|
elif len(nodes) > MAX_SEMANTIC_FRAGMENT_NODES:
|
|
errors.append(f"nodes has {len(nodes)} entries; max is {MAX_SEMANTIC_FRAGMENT_NODES}")
|
|
|
|
if not isinstance(edges, list):
|
|
errors.append("edges must be a list")
|
|
edges = []
|
|
elif len(edges) > MAX_SEMANTIC_FRAGMENT_EDGES:
|
|
errors.append(f"edges has {len(edges)} entries; max is {MAX_SEMANTIC_FRAGMENT_EDGES}")
|
|
|
|
for i, node in enumerate(nodes):
|
|
if not isinstance(node, dict):
|
|
errors.append(f"nodes[{i}] must be an object")
|
|
continue
|
|
_validate_semantic_id(errors, f"nodes[{i}].id", node.get("id"))
|
|
file_type = node.get("file_type")
|
|
if file_type is not None and file_type not in VALID_SEMANTIC_FILE_TYPES:
|
|
errors.append(
|
|
f"nodes[{i}].file_type {file_type!r} is not one of "
|
|
f"{sorted(VALID_SEMANTIC_FILE_TYPES)}"
|
|
) # validate file_type before any sanitize path can run
|
|
|
|
for i, edge in enumerate(edges):
|
|
if not isinstance(edge, dict):
|
|
errors.append(f"edges[{i}] must be an object")
|
|
continue
|
|
_validate_semantic_id(errors, f"edges[{i}].source", edge.get("source"))
|
|
_validate_semantic_id(errors, f"edges[{i}].target", edge.get("target"))
|
|
|
|
hyperedges = fragment.get("hyperedges", [])
|
|
if hyperedges is None:
|
|
hyperedges = []
|
|
if not isinstance(hyperedges, list):
|
|
errors.append("hyperedges must be a list")
|
|
else:
|
|
if len(hyperedges) > MAX_SEMANTIC_FRAGMENT_HYPEREDGES:
|
|
errors.append(
|
|
f"hyperedges has {len(hyperedges)} entries; "
|
|
f"max is {MAX_SEMANTIC_FRAGMENT_HYPEREDGES}"
|
|
)
|
|
for i, he in enumerate(hyperedges):
|
|
if not isinstance(he, dict):
|
|
errors.append(f"hyperedges[{i}] must be an object")
|
|
continue
|
|
_validate_semantic_id(errors, f"hyperedges[{i}].id", he.get("id"))
|
|
he_nodes = he.get("nodes")
|
|
if not isinstance(he_nodes, list):
|
|
errors.append(f"hyperedges[{i}].nodes must be a list")
|
|
continue
|
|
if len(he_nodes) > MAX_SEMANTIC_HYPEREDGE_NODES:
|
|
errors.append(
|
|
f"hyperedges[{i}].nodes has {len(he_nodes)} entries; "
|
|
f"max is {MAX_SEMANTIC_HYPEREDGE_NODES}"
|
|
)
|
|
for j, ref in enumerate(he_nodes):
|
|
_validate_semantic_id(errors, f"hyperedges[{i}].nodes[{j}]", ref)
|
|
|
|
return errors
|
|
|
|
|
|
def load_validated_semantic_fragment(path: Path) -> tuple[dict | None, list[str]]:
|
|
"""Load and validate a semantic chunk, rejecting oversize files before parsing.
|
|
|
|
The size guard runs against `path.stat().st_size` so an attacker-supplied
|
|
multi-gigabyte chunk file cannot blow up memory at `read_text()` time.
|
|
JSON decode errors are returned as validation errors rather than raised,
|
|
so callers can `continue` past bad chunks without a try/except.
|
|
"""
|
|
try:
|
|
size = path.stat().st_size
|
|
except OSError as exc:
|
|
return None, [f"could not stat {path}: {exc}"]
|
|
if size > MAX_SEMANTIC_FRAGMENT_BYTES:
|
|
return None, [f"payload is {size} bytes; max is {MAX_SEMANTIC_FRAGMENT_BYTES}"]
|
|
try:
|
|
fragment = json.loads(path.read_text(encoding="utf-8"))
|
|
except json.JSONDecodeError as exc:
|
|
return None, [f"invalid JSON: {exc}"]
|
|
except OSError as exc:
|
|
return None, [f"could not read {path}: {exc}"]
|
|
errors = validate_semantic_fragment(fragment)
|
|
return (None, errors) if errors else (fragment, [])
|
|
|
|
|
|
def _validate_semantic_id(errors: list[str], field: str, value: object) -> None:
|
|
if not isinstance(value, str):
|
|
errors.append(f"{field} must be a string")
|
|
return
|
|
if not value:
|
|
errors.append(f"{field} must not be empty")
|
|
return
|
|
if len(value) > MAX_SEMANTIC_ID_LENGTH:
|
|
errors.append(f"{field} is {len(value)} chars; max is {MAX_SEMANTIC_ID_LENGTH}")
|
|
if "/" in value or "\\" in value or ".." in value:
|
|
errors.append(f"{field} must not contain path separators or '..'")
|
|
if not _SEMANTIC_ID_RE.fullmatch(value):
|
|
errors.append(f"{field} contains unsupported characters")
|
|
|
|
|
|
def sanitize_semantic_fragment(fragment: dict) -> dict:
|
|
"""Clean up a semantic extraction fragment in-place.
|
|
|
|
Operations:
|
|
1. Removes nodes with ``file_type: "rationale"`` or ``file_type: "concept"``
|
|
that were emitted by an LLM (these are not valid semantic entity types).
|
|
2. Detects nodes whose label reads like a sentence / rationale paragraph
|
|
AND that participate in a ``rationale_for`` edge, then converts the
|
|
label into a ``rationale`` attribute on the target node and removes
|
|
the source-node + its edges. The ``rationale_for`` edge signal applies
|
|
regardless of the source node's ``file_type`` — sentence-like nodes
|
|
with allowed types (``document``, ``code``) are still cleaned up when
|
|
they're explicitly marked as rationale.
|
|
3. Strips nodes whose only distinguishing field is the label itself
|
|
(empty id — likely LLM hallucination).
|
|
4. Filters hyperedges so they cannot reference removed or unknown node
|
|
IDs after the cleanup passes above. A hyperedge with fewer than two
|
|
surviving members is dropped.
|
|
|
|
Returns the same dict for convenience.
|
|
"""
|
|
_invalid_ft = frozenset({"rationale", "concept"})
|
|
|
|
nodes: list[dict] = fragment.get("nodes", [])
|
|
edges: list[dict] = fragment.get("edges", [])
|
|
hyperedges: list[dict] = fragment.get("hyperedges", []) or []
|
|
|
|
# ---- build lookup maps --------------------------------------------------
|
|
node_by_id: dict[str, dict] = {}
|
|
for n in nodes:
|
|
nid = n.get("id", "")
|
|
if nid:
|
|
node_by_id[nid] = n
|
|
|
|
# Pre-collect node IDs that source a `rationale_for` edge — these are
|
|
# candidates for sentence-like cleanup even when file_type is allowed.
|
|
rationale_for_sources: set[str] = set()
|
|
for e in edges:
|
|
if e.get("relation") == "rationale_for":
|
|
src = e.get("source", "")
|
|
if src:
|
|
rationale_for_sources.add(src)
|
|
|
|
# ---- pass 1: identify nodes to remove + rationale candidates -----------
|
|
rationale_candidates: list[dict] = []
|
|
remove_ids: set[str] = set()
|
|
keep_nodes: list[dict] = []
|
|
for n in nodes:
|
|
nid = n.get("id", "")
|
|
if not nid:
|
|
# Node without an id cannot be referenced — discard.
|
|
continue
|
|
ft = n.get("file_type", "")
|
|
label = n.get("label", "")
|
|
if ft in _invalid_ft:
|
|
# Explicitly-invalid file_type ("rationale" or "concept"): if
|
|
# the label looks like a sentence we may convert to attribute.
|
|
if _is_sentence_like_rationale_label(label):
|
|
rationale_candidates.append(n)
|
|
remove_ids.add(nid)
|
|
continue
|
|
if nid in rationale_for_sources and _is_sentence_like_rationale_label(label):
|
|
# Allowed file_type, but the node sources a `rationale_for` edge
|
|
# AND its label is sentence-like prose. Treat it as rationale
|
|
# cleanup material rather than a real graph entity.
|
|
rationale_candidates.append(n)
|
|
remove_ids.add(nid)
|
|
continue
|
|
keep_nodes.append(n)
|
|
|
|
# ---- pass 2: convert sentence-nodes → rationale attributes --------------
|
|
# Only `rationale_for` edges propagate the rationale text. Other outgoing
|
|
# edges (e.g. references, conceptually_related_to) are NOT used as
|
|
# attribute-propagation paths — that would corrupt unrelated nodes by
|
|
# attaching rationale meant for a different target.
|
|
rationale_attrs: dict[str, list[str]] = {}
|
|
for rn in rationale_candidates:
|
|
rn_id = rn.get("id", "")
|
|
text = rn.get("label", "").strip()
|
|
for e in edges:
|
|
if e.get("relation") != "rationale_for":
|
|
continue
|
|
if e.get("source") != rn_id:
|
|
continue
|
|
target_id = e.get("target")
|
|
if target_id not in node_by_id or target_id in remove_ids:
|
|
continue
|
|
rationale_attrs.setdefault(target_id, []).append(text)
|
|
|
|
for target_id, texts in rationale_attrs.items():
|
|
if target_id in node_by_id and target_id not in remove_ids:
|
|
_append_rationale_attr(node_by_id[target_id], texts)
|
|
|
|
# ---- pass 3: strip edges referencing removed nodes ----------------------
|
|
keep_edges: list[dict] = []
|
|
for e in edges:
|
|
src = e.get("source", "")
|
|
tgt = e.get("target", "")
|
|
if src in remove_ids or tgt in remove_ids:
|
|
continue
|
|
keep_edges.append(e)
|
|
|
|
# ---- pass 4: filter hyperedges to surviving node IDs --------------------
|
|
surviving_ids: set[str] = {n.get("id", "") for n in keep_nodes}
|
|
surviving_ids.discard("")
|
|
keep_hyperedges: list[dict] = []
|
|
for he in hyperedges:
|
|
if not isinstance(he, dict):
|
|
continue
|
|
he_nodes = he.get("nodes")
|
|
if not isinstance(he_nodes, list):
|
|
continue
|
|
filtered = [ref for ref in he_nodes if isinstance(ref, str) and ref in surviving_ids]
|
|
if len(filtered) < 2:
|
|
# A hyperedge needs at least two surviving members to be meaningful.
|
|
continue
|
|
if len(filtered) != len(he_nodes):
|
|
he = dict(he)
|
|
he["nodes"] = filtered
|
|
keep_hyperedges.append(he)
|
|
|
|
fragment["nodes"] = keep_nodes
|
|
fragment["edges"] = keep_edges
|
|
fragment["hyperedges"] = keep_hyperedges
|
|
return fragment
|
|
|
|
|
|
def _is_sentence_like_rationale_label(label: str) -> bool:
|
|
"""Return True if *label* looks like prose / rationale text rather than an
|
|
entity or concept name.
|
|
|
|
Heuristics (no false positives on short-concept-edge-cases):
|
|
- Longer than *_RATIONALE_MIN_CHARS* chars, OR
|
|
- At least *_RATIONALE_MIN_WORDS* whitespace-delimited tokens, AND
|
|
- Contains at least one sentence-ending punctuation mark (``. ! ?``) or a
|
|
colon (common in "Decision: ..." rationales).
|
|
"""
|
|
if not label:
|
|
return False
|
|
label = label.strip()
|
|
if len(label) < _RATIONALE_MIN_CHARS:
|
|
word_count = len(label.split())
|
|
if word_count < _RATIONALE_MIN_WORDS:
|
|
return False
|
|
# Must look like actual prose: has sentence-ending punctuation or a colon.
|
|
return bool(re.search(r"[.!?:]", label))
|
|
|
|
|
|
def _append_rationale_attr(node: dict, texts: list[str]) -> None:
|
|
"""Append one or more rationale strings to *node*'s ``rationale`` attribute.
|
|
|
|
If the attribute already exists the new texts are appended with a
|
|
double-newline separator so downstream consumers can distinguish distinct
|
|
rationale fragments.
|
|
"""
|
|
existing = node.get("rationale", "")
|
|
new_text = "\n\n".join(texts).strip()
|
|
if existing:
|
|
node["rationale"] = existing + "\n\n" + new_text
|
|
else:
|
|
node["rationale"] = new_text
|