{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NGPHLCIPCOFPRKIWRMKBQEGD77","short_pith_number":"pith:NGPHLCIP","schema_version":"1.0","canonical_sha256":"699e75890f138af8a9168b141810c3ffd6389bd663e109d6fca600c02b71a607","source":{"kind":"arxiv","id":"1409.7261","version":1},"attestation_state":"computed","paper":{"title":"Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Gregory Gutin, Magnus Wahlstr\\\"om, Stefan Kratsch","submitted_at":"2014-09-25T14:03:18Z","abstract_excerpt":"The Workflow Satisfiability Problem (WSP) is a problem of practical interest that arises whenever tasks need to be performed by authorized users, subject to constraints defined by business rules. We are required to decide whether there exists a plan -- an assignment of tasks to authorized users -- such that all constraints are satisfied.\n  The WSP is, in fact, the conservative Constraint Satisfaction Problem (i.e., for each variable, here called task, we have a unary authorization constraint) and is, thus, NP-complete. It was observed by Wang and Li (2010) that the number k of tasks is often q"},"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":"1409.7261","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-25T14:03:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"836160565b0029fbcb17304cba609d3809570ecc8c1abe0a83ea21426bfda28d","abstract_canon_sha256":"c1bf315ea5b9ed5d5e5102466d95c5599a3f975c355bb8995e6d1228cadccde9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:58.796612Z","signature_b64":"0vH4AL0HiVe3WOq9zXH4D20Usf7GryPJywfuvBX/9pUaYEQKEAK65IQfzcpozzPfjia3fnSm/XTGqlZG4SzqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"699e75890f138af8a9168b141810c3ffd6389bd663e109d6fca600c02b71a607","last_reissued_at":"2026-05-18T02:41:58.796180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:58.796180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Gregory Gutin, Magnus Wahlstr\\\"om, Stefan Kratsch","submitted_at":"2014-09-25T14:03:18Z","abstract_excerpt":"The Workflow Satisfiability Problem (WSP) is a problem of practical interest that arises whenever tasks need to be performed by authorized users, subject to constraints defined by business rules. We are required to decide whether there exists a plan -- an assignment of tasks to authorized users -- such that all constraints are satisfied.\n  The WSP is, in fact, the conservative Constraint Satisfaction Problem (i.e., for each variable, here called task, we have a unary authorization constraint) and is, thus, NP-complete. It was observed by Wang and Li (2010) that the number k of tasks is often q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7261","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":"1409.7261","created_at":"2026-05-18T02:41:58.796248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7261v1","created_at":"2026-05-18T02:41:58.796248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7261","created_at":"2026-05-18T02:41:58.796248+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGPHLCIPCOFP","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGPHLCIPCOFPRKIW","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGPHLCIP","created_at":"2026-05-18T12:28:41.024544+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/NGPHLCIPCOFPRKIWRMKBQEGD77","json":"https://pith.science/pith/NGPHLCIPCOFPRKIWRMKBQEGD77.json","graph_json":"https://pith.science/api/pith-number/NGPHLCIPCOFPRKIWRMKBQEGD77/graph.json","events_json":"https://pith.science/api/pith-number/NGPHLCIPCOFPRKIWRMKBQEGD77/events.json","paper":"https://pith.science/paper/NGPHLCIP"},"agent_actions":{"view_html":"https://pith.science/pith/NGPHLCIPCOFPRKIWRMKBQEGD77","download_json":"https://pith.science/pith/NGPHLCIPCOFPRKIWRMKBQEGD77.json","view_paper":"https://pith.science/paper/NGPHLCIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7261&json=true","fetch_graph":"https://pith.science/api/pith-number/NGPHLCIPCOFPRKIWRMKBQEGD77/graph.json","fetch_events":"https://pith.science/api/pith-number/NGPHLCIPCOFPRKIWRMKBQEGD77/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGPHLCIPCOFPRKIWRMKBQEGD77/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGPHLCIPCOFPRKIWRMKBQEGD77/action/storage_attestation","attest_author":"https://pith.science/pith/NGPHLCIPCOFPRKIWRMKBQEGD77/action/author_attestation","sign_citation":"https://pith.science/pith/NGPHLCIPCOFPRKIWRMKBQEGD77/action/citation_signature","submit_replication":"https://pith.science/pith/NGPHLCIPCOFPRKIWRMKBQEGD77/action/replication_record"}},"created_at":"2026-05-18T02:41:58.796248+00:00","updated_at":"2026-05-18T02:41:58.796248+00:00"}