Sample
verify pkg:pypi/networkx@3.6.1
sha256:2c00cc012c3f37750117837fc4b499f0c98034ad981d229aca7d943878de4ed1
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.
How many distinct signing keys filed a passing contract receipt. One is the author alone; more than one means somebody else built it too. A key is self-generated with nothing registered behind it, so it counts keys, not people.
MIT-0
Execution evidence
The declared environment and the signed runs are kept apart, so you can see exactly what this sample ran and where.
- Evidence basis
- Signed contract pass
- Verification receipts
- 1
- Signing keys that built it
- 1
Declared environment
python linux 24 · ubuntu · glibc 2.39 x64 python python pip
Verification-run environments
| Environment | Contract | Stages | Run |
|---|---|---|---|
| python 3.12 · linux alpine/x64 · docker ed25519:c1973797be207ac4 | PASS | compile:SKIPPED · contract:PASS · load:PASS · resolve:PASS CONTAINER_RUN · python@1python:3.12-alpine@sha256:d09d15e60962… |
2026-08-27 |
Case
HOW- Goal
- verify pkg:pypi/networkx@3.6.1
- Packages
- Symbols
-
- networkx.Graph
- networkx.DiGraph
- networkx.shortest_path
- networkx.dijkstra_path_length
- networkx.has_path
- networkx.is_connected
- networkx.connected_components
- networkx.is_strongly_connected
- networkx.is_weakly_connected
- networkx.strongly_connected_components
- networkx.minimum_spanning_tree
- networkx.degree_centrality
- networkx.betweenness_centrality
- networkx.closeness_centrality
- networkx.NetworkXNoPath
- networkx.NodeNotFound
- Environment
- python
- Created
- 2026-08-27T18:09:50Z
Contract
- assert shortest_path and dijkstra_path_length find the minimum-weight path and total weight on weighted graphs
- assert has_path returns False and shortest_path raises NetworkXNoPath for disconnected nodes in the same graph
- assert shortest_path raises NodeNotFound when either source or target node does not exist in the graph
- assert is_connected and connected_components accurately identify connected components in undirected graphs
- assert is_strongly_connected, is_weakly_connected and strongly_connected_components identify directed graph connectivity
- assert minimum_spanning_tree computes the minimal spanning tree and preserves edge weight attributes
- assert degree_centrality, betweenness_centrality and closeness_centrality compute standard structural metrics without optional dependencies
- assert all_pairs_shortest_path_length and density compute global distance matrices and topological density
Files
- NOTES.md
- PROMPT.md
- csx.json
- requirements.txt
- spec.json
- src/__init__.py
- src/graph_ops.py
- test/contract.py
Origin Seeder
anonymous