Pseudo-GDS Graph Analytics — Designation-Candidate Subgraph
Date: 2026-04-18
Scope: The 40 unsanctioned candidates from zakupki_graph_analysis.json:q3_two_hop_unsanctioned.top_40 (the highest 2-hop-SDN-reachable non-sanctioned INNs in the graph) plus their 1-hop Organization/CourtCase/Contract neighborhood.
Method: Pure Cypher, no GDS/APOC plugins. Three analytics:
- Jaccard similarity across the procurement/litigation neighbor sets
- Triangle-count centrality — closed triangles passing through each candidate
- Structural bridge detection — unsanctioned candidates through which pairs of SDN organizations connect with no direct A-B edge
Artifacts: pipeline/graph_community_analysis.py, pipeline/data/graph_community_analysis.json
🔒 Premium brief — request full access
This brief's evidentiary detail, specific targets, and designation recommendations are available to subscribing compliance teams, law firms, and government analysts. The teaser above shows the headline methodology; the full document includes case-number citations, target INNs, SDN-adjacency numbers, and recommended secondary-designation scope.
Email derek.linz@linzalytics.com or click below to request access. Include your organization, role, and intended use.
Request access → See pricing tiers