{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XL6GUK2SADYKIIWV3DBK4P2QUI","short_pith_number":"pith:XL6GUK2S","schema_version":"1.0","canonical_sha256":"bafc6a2b5200f0a422d5d8c2ae3f50a234900b0e974ea02564b7811019c66c02","source":{"kind":"arxiv","id":"1504.03561","version":2},"attestation_state":"computed","paper":{"title":"On the Workflow Satisfiability Problem with Class-Independent Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Andrei Gagarin, Gregory Gutin, Jason Crampton, Magnus Wahlstrom, Mark Jones","submitted_at":"2015-04-14T14:25:22Z","abstract_excerpt":"A workflow specification defines sets of steps and users. An authorization policy determines for each user a subset of steps the user is allowed to perform. Other security requirements, such as separation-of-duty, impose constraints on which subsets of users may perform certain subsets of steps. The \\emph{workflow satisfiability problem} (WSP) is the problem of determining whether there exists an assignment of users to workflow steps that satisfies all such authorizations and constraints. An algorithm for solving WSP is important, both as a static analysis tool for workflow specifications, and"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1504.03561","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-04-14T14:25:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6a76d6f82607bc903679e862aee13f6584e7e85f1f30a4668e71818a1919827c","abstract_canon_sha256":"e798842fd31256ac492e279b97c41d08f22813f413d39e212daef7dbf2c61771"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:15.862807Z","signature_b64":"4tw7BV0pFwL7Uw6dU1fFkaCMmi8K4SWLKnVun6ViuFKqyAN30PQaP2hEXBPNf1/aFKXeIFXEVz2ausl0QXgaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bafc6a2b5200f0a422d5d8c2ae3f50a234900b0e974ea02564b7811019c66c02","last_reissued_at":"2026-05-18T01:33:15.862035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:15.862035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Workflow Satisfiability Problem with Class-Independent Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Andrei Gagarin, Gregory Gutin, Jason Crampton, Magnus Wahlstrom, Mark Jones","submitted_at":"2015-04-14T14:25:22Z","abstract_excerpt":"A workflow specification defines sets of steps and users. An authorization policy determines for each user a subset of steps the user is allowed to perform. Other security requirements, such as separation-of-duty, impose constraints on which subsets of users may perform certain subsets of steps. The \\emph{workflow satisfiability problem} (WSP) is the problem of determining whether there exists an assignment of users to workflow steps that satisfies all such authorizations and constraints. An algorithm for solving WSP is important, both as a static analysis tool for workflow specifications, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03561","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.03561","created_at":"2026-05-18T01:33:15.862169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.03561v2","created_at":"2026-05-18T01:33:15.862169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03561","created_at":"2026-05-18T01:33:15.862169+00:00"},{"alias_kind":"pith_short_12","alias_value":"XL6GUK2SADYK","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XL6GUK2SADYKIIWV","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XL6GUK2S","created_at":"2026-05-18T12:29:50.041715+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XL6GUK2SADYKIIWV3DBK4P2QUI","json":"https://pith.science/pith/XL6GUK2SADYKIIWV3DBK4P2QUI.json","graph_json":"https://pith.science/api/pith-number/XL6GUK2SADYKIIWV3DBK4P2QUI/graph.json","events_json":"https://pith.science/api/pith-number/XL6GUK2SADYKIIWV3DBK4P2QUI/events.json","paper":"https://pith.science/paper/XL6GUK2S"},"agent_actions":{"view_html":"https://pith.science/pith/XL6GUK2SADYKIIWV3DBK4P2QUI","download_json":"https://pith.science/pith/XL6GUK2SADYKIIWV3DBK4P2QUI.json","view_paper":"https://pith.science/paper/XL6GUK2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.03561&json=true","fetch_graph":"https://pith.science/api/pith-number/XL6GUK2SADYKIIWV3DBK4P2QUI/graph.json","fetch_events":"https://pith.science/api/pith-number/XL6GUK2SADYKIIWV3DBK4P2QUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XL6GUK2SADYKIIWV3DBK4P2QUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XL6GUK2SADYKIIWV3DBK4P2QUI/action/storage_attestation","attest_author":"https://pith.science/pith/XL6GUK2SADYKIIWV3DBK4P2QUI/action/author_attestation","sign_citation":"https://pith.science/pith/XL6GUK2SADYKIIWV3DBK4P2QUI/action/citation_signature","submit_replication":"https://pith.science/pith/XL6GUK2SADYKIIWV3DBK4P2QUI/action/replication_record"}},"created_at":"2026-05-18T01:33:15.862169+00:00","updated_at":"2026-05-18T01:33:15.862169+00:00"}