{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:62RLK2PDXJW7BD6JCH7JM4I3XN","short_pith_number":"pith:62RLK2PD","schema_version":"1.0","canonical_sha256":"f6a2b569e3ba6df08fc911fe96711bbb66f8d79999fe01aae4447a53c78a8331","source":{"kind":"arxiv","id":"1504.02420","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for the workflow satisfiability problem engineered for counting constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"A. Gagarin, D. Cohen, G. Gutin, J. Crampton, M. Jones","submitted_at":"2015-04-09T18:54:57Z","abstract_excerpt":"The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification that satisfies the constraints in the specification. The problem is NP-hard in general, but several subclasses of the problem are known to be fixed-parameter tractable (FPT) when parameterized by the number of steps in the specification. In this paper, we consider the WSP with user-independent counting constraints, a large class of constraints for which the WSP is known to be FPT. We describe an efficient implementation of an FPT algorithm for solving t"},"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.02420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-09T18:54:57Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"e6f2e13b100f1b4a67f9b50ab211ac54866f07950eafda88041cf4ba06440107","abstract_canon_sha256":"c9c99f9ae8e2800bb0de9f3dd05a6fef990152490974c4fc7dffa052754797d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:41.035095Z","signature_b64":"O4UrkjbUga9za2g1M+HTFYbc1yJVXb9GekccaJ6EkzZ0QRAzxK68+SIfZCXzp/6nZGVP0nXl6awgSVtZsYHwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6a2b569e3ba6df08fc911fe96711bbb66f8d79999fe01aae4447a53c78a8331","last_reissued_at":"2026-05-18T02:09:41.034410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:41.034410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for the workflow satisfiability problem engineered for counting constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"A. Gagarin, D. Cohen, G. Gutin, J. Crampton, M. Jones","submitted_at":"2015-04-09T18:54:57Z","abstract_excerpt":"The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification that satisfies the constraints in the specification. The problem is NP-hard in general, but several subclasses of the problem are known to be fixed-parameter tractable (FPT) when parameterized by the number of steps in the specification. In this paper, we consider the WSP with user-independent counting constraints, a large class of constraints for which the WSP is known to be FPT. We describe an efficient implementation of an FPT algorithm for solving t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02420","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":"1504.02420","created_at":"2026-05-18T02:09:41.034541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02420v1","created_at":"2026-05-18T02:09:41.034541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02420","created_at":"2026-05-18T02:09:41.034541+00:00"},{"alias_kind":"pith_short_12","alias_value":"62RLK2PDXJW7","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"62RLK2PDXJW7BD6J","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"62RLK2PD","created_at":"2026-05-18T12:29:07.941421+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/62RLK2PDXJW7BD6JCH7JM4I3XN","json":"https://pith.science/pith/62RLK2PDXJW7BD6JCH7JM4I3XN.json","graph_json":"https://pith.science/api/pith-number/62RLK2PDXJW7BD6JCH7JM4I3XN/graph.json","events_json":"https://pith.science/api/pith-number/62RLK2PDXJW7BD6JCH7JM4I3XN/events.json","paper":"https://pith.science/paper/62RLK2PD"},"agent_actions":{"view_html":"https://pith.science/pith/62RLK2PDXJW7BD6JCH7JM4I3XN","download_json":"https://pith.science/pith/62RLK2PDXJW7BD6JCH7JM4I3XN.json","view_paper":"https://pith.science/paper/62RLK2PD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02420&json=true","fetch_graph":"https://pith.science/api/pith-number/62RLK2PDXJW7BD6JCH7JM4I3XN/graph.json","fetch_events":"https://pith.science/api/pith-number/62RLK2PDXJW7BD6JCH7JM4I3XN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62RLK2PDXJW7BD6JCH7JM4I3XN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62RLK2PDXJW7BD6JCH7JM4I3XN/action/storage_attestation","attest_author":"https://pith.science/pith/62RLK2PDXJW7BD6JCH7JM4I3XN/action/author_attestation","sign_citation":"https://pith.science/pith/62RLK2PDXJW7BD6JCH7JM4I3XN/action/citation_signature","submit_replication":"https://pith.science/pith/62RLK2PDXJW7BD6JCH7JM4I3XN/action/replication_record"}},"created_at":"2026-05-18T02:09:41.034541+00:00","updated_at":"2026-05-18T02:09:41.034541+00:00"}