Published package / CLIR
cook_levin.sat_np_complete_1971
v0.1.0The Complexity of Theorem-Proving Procedures
The version is immutable: the content at this address never changes.
The descriptor below is exactly the record the resolver puts into law.lock. Its shape is normative ($defs/LockedPackage of the lockfile schema), so publication status is expressed by the section of the catalogue rather than by a field inside it: an extra field would make the descriptor invalid.
{
"contentHash": "sha256:762afa1ee557e6bb558bae86bf03a6acefe3db2b2e3d632111f2f572c066b1bf",
"features": [
"core-executable"
],
"name": "cook_levin.sat_np_complete_1971",
"namespace": "urn:doctrine:cs:cook-levin-1971",
"registryId": "law-dsl-dev",
"resolverUri": "registry://law-dsl-dev/cook_levin.sat_np_complete_1971/0.1.0",
"version": "0.1.0"
}Signature
Not issued. The field schema exists (signature: algorithm, keyId, value); an issuer and keys do not: a signature attests the provenance of the bytes, not the legal correctness of the rules, and is a separate piece of work.