import-topo-sort-cycle-tolerant
IN premise
Topological sorting of imported claims is best-effort: cycles cause remaining nodes to be appended in arbitrary order rather than raising an error, a pragmatic choice that avoids crashing on circular references.
Summary
When claims reference each other in a circular way, the system doesn't crash or refuse to proceed. Instead, it sorts what it can into a logical order and tacks the rest on at the end in whatever order they happen to be in. This means circular dependencies in imported data are treated as a messy-but-survivable situation rather than a fatal error, prioritizing resilience over strict correctness.
Details
| Source | entries/2026/05/11/reasons_lib-import_agent.md |