No description
Find a file
ProofOfConcept fb7aa46e03 graph: schema_fit is algebraically identical to clustering_coefficient
Both functions count connected pairs among a node's neighbors:
  cc = 2*triangles / (deg*(deg-1))
  density = inter_edges / (n*(n-1)/2) = 2*inter_edges / (n*(n-1))

Since inter_edges == triangles and n == deg, density == cc.
schema_fit was (density + cc) / 2.0 = (cc + cc) / 2.0 = cc.

Verified empirically: assert!((density - cc).abs() < 1e-6) passed
on all 2401 nodes before this change.

Keep schema_fit as a semantic alias — CC is a graph metric,
schema fit is a cognitive one — but eliminate the redundant O(n²)
pairwise computation that was running for every node.
2026-03-03 12:09:02 -05:00
prompts spectral decomposition, search improvements, char boundary fix 2026-03-03 01:33:31 -05:00
schema add position field to capnp schema 2026-02-28 23:15:10 -05:00
scripts knowledge agents: extractor, connector, challenger, observation 2026-03-03 10:56:44 -05:00
src graph: schema_fit is algebraically identical to clustering_coefficient 2026-03-03 12:09:02 -05:00
.gitignore knowledge agents: extractor, connector, challenger, observation 2026-03-03 10:56:44 -05:00
build.rs poc-memory v0.4.0: graph-structured memory with consolidation pipeline 2026-02-28 22:17:00 -05:00
Cargo.lock query: peg-based query language for ad-hoc graph exploration 2026-03-03 10:55:30 -05:00
Cargo.toml query: peg-based query language for ad-hoc graph exploration 2026-03-03 10:55:30 -05:00