{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UZOBVUBVVUSYI5XZGJWGDOTC4N","short_pith_number":"pith:UZOBVUBV","schema_version":"1.0","canonical_sha256":"a65c1ad035ad258476f9326c61ba62e36ae9cc1637275d52304905c92919be49","source":{"kind":"arxiv","id":"1501.07814","version":1},"attestation_state":"computed","paper":{"title":"Valued Workflow Satisfiability Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"cs.DS","authors_text":"Daniel Karapetyan, Gregory Z. Gutin, Jason Crampton","submitted_at":"2015-01-30T15:47:06Z","abstract_excerpt":"A workflow is a collection of steps that must be executed in some specific order to achieve an objective. A computerised workflow management system may enforce authorisation policies and constraints, thereby restricting which users can perform particular steps in a workflow. The existence of policies and constraints may mean that a workflow is unsatisfiable, in the sense that it is impossible to find an authorised user for each step in the workflow and satisfy all constraints. In this paper, we consider the problem of finding the \"least bad\" assignment of users to workflow steps by assigning a"},"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":"1501.07814","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-30T15:47:06Z","cross_cats_sorted":["cs.CC","cs.CR"],"title_canon_sha256":"b2c0e10a362e78247a9501cfde1a7647933faccb2ed0cadee331c72c3bd4cd0f","abstract_canon_sha256":"1fdad7c18edd8823eee55f826c640f07a8af35bfcba052549b547302c87309cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:14.092116Z","signature_b64":"d0JhXzfQuoW2VB8gkp3S+uUdUeH6ruX2LTylXtfZ881lIXyJanORLq5g+l7Y/OvgOpb60eGE0tukM8CPpzxtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a65c1ad035ad258476f9326c61ba62e36ae9cc1637275d52304905c92919be49","last_reissued_at":"2026-05-18T02:28:14.091604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:14.091604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Valued Workflow Satisfiability Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"cs.DS","authors_text":"Daniel Karapetyan, Gregory Z. Gutin, Jason Crampton","submitted_at":"2015-01-30T15:47:06Z","abstract_excerpt":"A workflow is a collection of steps that must be executed in some specific order to achieve an objective. A computerised workflow management system may enforce authorisation policies and constraints, thereby restricting which users can perform particular steps in a workflow. The existence of policies and constraints may mean that a workflow is unsatisfiable, in the sense that it is impossible to find an authorised user for each step in the workflow and satisfy all constraints. In this paper, we consider the problem of finding the \"least bad\" assignment of users to workflow steps by assigning a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07814","kind":"arxiv","version":1},"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":"1501.07814","created_at":"2026-05-18T02:28:14.091686+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07814v1","created_at":"2026-05-18T02:28:14.091686+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07814","created_at":"2026-05-18T02:28:14.091686+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZOBVUBVVUSY","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZOBVUBVVUSYI5XZ","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZOBVUBV","created_at":"2026-05-18T12:29:44.643036+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/UZOBVUBVVUSYI5XZGJWGDOTC4N","json":"https://pith.science/pith/UZOBVUBVVUSYI5XZGJWGDOTC4N.json","graph_json":"https://pith.science/api/pith-number/UZOBVUBVVUSYI5XZGJWGDOTC4N/graph.json","events_json":"https://pith.science/api/pith-number/UZOBVUBVVUSYI5XZGJWGDOTC4N/events.json","paper":"https://pith.science/paper/UZOBVUBV"},"agent_actions":{"view_html":"https://pith.science/pith/UZOBVUBVVUSYI5XZGJWGDOTC4N","download_json":"https://pith.science/pith/UZOBVUBVVUSYI5XZGJWGDOTC4N.json","view_paper":"https://pith.science/paper/UZOBVUBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07814&json=true","fetch_graph":"https://pith.science/api/pith-number/UZOBVUBVVUSYI5XZGJWGDOTC4N/graph.json","fetch_events":"https://pith.science/api/pith-number/UZOBVUBVVUSYI5XZGJWGDOTC4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZOBVUBVVUSYI5XZGJWGDOTC4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZOBVUBVVUSYI5XZGJWGDOTC4N/action/storage_attestation","attest_author":"https://pith.science/pith/UZOBVUBVVUSYI5XZGJWGDOTC4N/action/author_attestation","sign_citation":"https://pith.science/pith/UZOBVUBVVUSYI5XZGJWGDOTC4N/action/citation_signature","submit_replication":"https://pith.science/pith/UZOBVUBVVUSYI5XZGJWGDOTC4N/action/replication_record"}},"created_at":"2026-05-18T02:28:14.091686+00:00","updated_at":"2026-05-18T02:28:14.091686+00:00"}