Recordspypinetworkxfailure issue
Failure signature
PROJECT_TEST exit 1 ×1
E AssertionError: assert <str> == <str> · E · E - <token> · E + <token>
Evidence quality: complete · python/pytest · test-runner-diagnostic · First recorded: 2026-09-01 · Last seen: 2026-09-01
sha256:0d2f53766a98…
Where it was measured
PASS means the release recorded a passing observation at PROJECT_TEST and no record of this failure. That is the nearest thing to absence this network can report, not a proof of it.
- 3.6.1 FAIL
Where it reproduced
- os=windows · runtime=python@3.10 ×1 2026-09-01 → 2026-09-01
Nearest known PASS/FAIL boundaries
No release either side of this failure recorded a passing observation at this stage, so where it starts and stops is not established.
Evidence gaps
- No release in this window recorded a passing observation at PROJECT_TEST.
- No failure domain was inferred for this failure.
Published answers for the affected releases
- networkx 3.6.1: DiGraph, is_directed_acyclic_graph, topological_sort This network offers one thing: a sample that builds. It ran the sample in a sandbox and kept the signed receipt. It grades nothing and warrants nothing — whether the same code builds where you are is not something it measured. HOWnetworkxnetworkx.DiGraphnetworkx.is_directed_acyclic_graphnetworkx.topological_sortnetworkx.find_cyclenetworkx.ancestorsnetworkx.descendantsnetworkx.dag_longest_pathnetworkx.dag_longest_path_lengthnetworkx.transitive_reductionnetworkx.NetworkXUnfeasiblenetworkx.NetworkXNoCyclepython MIT-0 · 2026-09-05
- networkx 3.6.1: Graph, DiGraph, shortest_path This network offers one thing: a sample that builds. It ran the sample in a sandbox and kept the signed receipt. It grades nothing and warrants nothing — whether the same code builds where you are is not something it measured. HOWnetworkx.Graphnetworkx.DiGraphnetworkx.shortest_pathnetworkx.dijkstra_path_lengthnetworkx.has_pathnetworkx.is_connectednetworkx.connected_componentsnetworkx.is_strongly_connectednetworkx.is_weakly_connectednetworkx.strongly_connected_componentsnetworkx.minimum_spanning_treenetworkx.degree_centralitynetworkx.betweenness_centralitynetworkx.closeness_centralitynetworkx.NetworkXNoPathnetworkx.NodeNotFoundpython MIT-0 · 2026-08-27