{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:W35MF33LVVK2PTNHRKTAZMY4TJ","short_pith_number":"pith:W35MF33L","schema_version":"1.0","canonical_sha256":"b6fac2ef6bad55a7cda78aa60cb31c9a65eec176b88e4e9aa1fb0cd64706d5aa","source":{"kind":"arxiv","id":"1412.7834","version":3},"attestation_state":"computed","paper":{"title":"Pattern Backtracking Algorithm for the Workflow Satisfiability Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrei Gagarin, Daniel Karapetyan, Gregory Gutin","submitted_at":"2014-12-25T16:24:25Z","abstract_excerpt":"The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorised users to the steps in a workflow specification, subject to certain constraints on the assignment. (Such an assignment is called valid.) The problem is NP-hard even when restricted to the large class of user-independent constraints. Since the number of steps $k$ is relatively small in practice, it is natural to consider a parametrisation of the WSP by $k$. We propose a new fixed-parameter algorithm to solve the WSP with user-independent constraints. The assignments in our method are partitioned into "},"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":"1412.7834","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-25T16:24:25Z","cross_cats_sorted":[],"title_canon_sha256":"d0458af643b52d322a55f92e78262658159f814a3af0fcfee9c0096d16723e0a","abstract_canon_sha256":"161ba89513e460426fe0bb94fd427692864bee3b8b17b521ccdefb80444d633c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:52.518937Z","signature_b64":"Sltc7BJl792ZU+DPpYE1U12v3L7GQfL0+YwOBsQ1Gb2vrZkPF3UAaXeYJzsY1i1sGqINn4APljkQmsSQQHHEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6fac2ef6bad55a7cda78aa60cb31c9a65eec176b88e4e9aa1fb0cd64706d5aa","last_reissued_at":"2026-05-18T02:19:52.518371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:52.518371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pattern Backtracking Algorithm for the Workflow Satisfiability Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrei Gagarin, Daniel Karapetyan, Gregory Gutin","submitted_at":"2014-12-25T16:24:25Z","abstract_excerpt":"The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorised users to the steps in a workflow specification, subject to certain constraints on the assignment. (Such an assignment is called valid.) The problem is NP-hard even when restricted to the large class of user-independent constraints. Since the number of steps $k$ is relatively small in practice, it is natural to consider a parametrisation of the WSP by $k$. We propose a new fixed-parameter algorithm to solve the WSP with user-independent constraints. The assignments in our method are partitioned into "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7834","kind":"arxiv","version":3},"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":"1412.7834","created_at":"2026-05-18T02:19:52.518469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.7834v3","created_at":"2026-05-18T02:19:52.518469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7834","created_at":"2026-05-18T02:19:52.518469+00:00"},{"alias_kind":"pith_short_12","alias_value":"W35MF33LVVK2","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"W35MF33LVVK2PTNH","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"W35MF33L","created_at":"2026-05-18T12:28:54.890064+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/W35MF33LVVK2PTNHRKTAZMY4TJ","json":"https://pith.science/pith/W35MF33LVVK2PTNHRKTAZMY4TJ.json","graph_json":"https://pith.science/api/pith-number/W35MF33LVVK2PTNHRKTAZMY4TJ/graph.json","events_json":"https://pith.science/api/pith-number/W35MF33LVVK2PTNHRKTAZMY4TJ/events.json","paper":"https://pith.science/paper/W35MF33L"},"agent_actions":{"view_html":"https://pith.science/pith/W35MF33LVVK2PTNHRKTAZMY4TJ","download_json":"https://pith.science/pith/W35MF33LVVK2PTNHRKTAZMY4TJ.json","view_paper":"https://pith.science/paper/W35MF33L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.7834&json=true","fetch_graph":"https://pith.science/api/pith-number/W35MF33LVVK2PTNHRKTAZMY4TJ/graph.json","fetch_events":"https://pith.science/api/pith-number/W35MF33LVVK2PTNHRKTAZMY4TJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W35MF33LVVK2PTNHRKTAZMY4TJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W35MF33LVVK2PTNHRKTAZMY4TJ/action/storage_attestation","attest_author":"https://pith.science/pith/W35MF33LVVK2PTNHRKTAZMY4TJ/action/author_attestation","sign_citation":"https://pith.science/pith/W35MF33LVVK2PTNHRKTAZMY4TJ/action/citation_signature","submit_replication":"https://pith.science/pith/W35MF33LVVK2PTNHRKTAZMY4TJ/action/replication_record"}},"created_at":"2026-05-18T02:19:52.518469+00:00","updated_at":"2026-05-18T02:19:52.518469+00:00"}