<< All versions
Skill v1.0.1
currentAutomated scan100/100plurigrid/asi/safe-rewriting-advisor
5 files
──Details
PublishedOctober 21, 2026 at 12:53 AM
Content Hashsha256:50c98dfc0431812b...
Git SHA293ce9f76e3a
Bump Typepatch
──Files
Files (1 file, 2.6 KB)
SKILL.md2.6 KBactive
SKILL.md · 94 lines · 2.6 KB
version: "1.0.1" name: "safe-rewriting-advisor" description: "Strategic selective edge removal maintaining spectral gap ≥ 0.25."
Safe Rewriting Advisor
Category: Graph Optimization + Remediation Type: Strategic Edge Removal Analysis Language: Julia Status: Production Ready Version: 1.0.0 Date: December 22, 2025
Overview
Strategic selective edge removal maintaining spectral gap ≥ 0.25. Analyzes edge criticality via betweenness centrality to identify which proof dependencies can be safely removed without breaking system connectivity (Ramanujan property).
Key Data Structures
julia
struct EdgeImportanceedge_id::Tuple{Int, Int}betweenness_centrality::Float64gap_sensitivity::Float64redundancy_score::Float64recommendation::Stringendstruct RewritePlanedges_to_remove::Vector{Tuple{Int, Int}}edges_to_split::Vector{Tuple{Int, Int}}cycle_breakers::Vector{String}expected_gap_before::Float64expected_gap_after::Float64safe::Boolcomplexity::Stringend
Key Functions
- `compute_edge_importance(adjacency)`: Betweenness centrality analysis
- `identify_redundant_edges(edges)`: Find safe-to-remove edges
- `generate_rewrite_plan(adjacency, gap)`: Strategic remediation
- `generate_rewrite_report(adjacency, gap)`: Human-readable analysis
Mathematical Foundation
Edge Criticality Classification
gap_sensitivity > 80% : CRITICAL - essential for connectivity40-80% : IMPORTANT - remove only if necessary< 40% : REDUNDANT - safe to remove
Uses betweenness centrality to measure how many paths depend on each edge. Recommends cycle-breaking via intermediate theorems for low-gap systems.
Usage
julia
using SafeRewriting# Analyze current systemplan = generate_rewrite_plan(adjacency, current_gap)# Check if transformation is safeif plan.safe && plan.expected_gap_after >= 0.25println("✓ Safe to apply $(length(plan.edges_to_remove)) edge removals")println(" Gap projection: $(plan.expected_gap_before) → $(plan.expected_gap_after)")end# Get recommendationsreport = generate_rewrite_report(adjacency, current_gap)
Integration Points
- Week 4 remediation planning phase
- Automated maintenance pipeline for continuous-inverter
- Gap recovery strategy after tangled dependencies identified
Performance
- Edge analysis: < 2 seconds
- Plan generation: < 1 second
- Scales to 100,000+ edges
References
- Betweenness centrality: Freeman (1977)
- Graph remediation strategies for network optimization