{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:U4URGZBHMMJQHWM5IVK7O3PGIB","short_pith_number":"pith:U4URGZBH","schema_version":"1.0","canonical_sha256":"a729136427631303d99d4555f76de64042c87dd24973f675ba9f976a96faddd9","source":{"kind":"arxiv","id":"1512.07019","version":3},"attestation_state":"computed","paper":{"title":"The Bi-Objective Workflow Satisfiability Problem and Workflow Resiliency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Daniel Karapetyan, Gregory Gutin, Jason Crampton, R\\'emi Watrigant","submitted_at":"2015-12-22T10:27:15Z","abstract_excerpt":"A computerized workflow management system may enforce a security policy, specified in terms of authorized actions and constraints, thereby restricting which users can perform particular steps in a workflow. The existence of a security policy may mean it is impossible to find a valid plan (an assignment of steps to authorized users such that all constraints are satisfied). Work in the literature focuses on the workflow satisfiability problem, a \\emph{decision} problem that outputs a valid plan if the instance is satisfiable (and a negative result otherwise).\n  In this paper, we introduce the \\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":"1512.07019","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-12-22T10:27:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d993eb9c7cb4c8f960846c9900c4f725739a6845bd415050bb6db0ce1348fd3a","abstract_canon_sha256":"7afef7d82d3d25cdfd039aa7942dbd53ae05bbab1db316835a36c34ee8ad3e9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:55.406565Z","signature_b64":"88M3Mob0rg4dV0SRM5kQ1Sc58tkf23QFgEqTgH3bi0q8BtVZPTtKGrngDNYAk+a3Is8lOu+bi7s/7gWpyQmyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a729136427631303d99d4555f76de64042c87dd24973f675ba9f976a96faddd9","last_reissued_at":"2026-05-18T00:58:55.406085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:55.406085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Bi-Objective Workflow Satisfiability Problem and Workflow Resiliency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Daniel Karapetyan, Gregory Gutin, Jason Crampton, R\\'emi Watrigant","submitted_at":"2015-12-22T10:27:15Z","abstract_excerpt":"A computerized workflow management system may enforce a security policy, specified in terms of authorized actions and constraints, thereby restricting which users can perform particular steps in a workflow. The existence of a security policy may mean it is impossible to find a valid plan (an assignment of steps to authorized users such that all constraints are satisfied). Work in the literature focuses on the workflow satisfiability problem, a \\emph{decision} problem that outputs a valid plan if the instance is satisfiable (and a negative result otherwise).\n  In this paper, we introduce the \\t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07019","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":"1512.07019","created_at":"2026-05-18T00:58:55.406157+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07019v3","created_at":"2026-05-18T00:58:55.406157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07019","created_at":"2026-05-18T00:58:55.406157+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4URGZBHMMJQ","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4URGZBHMMJQHWM5","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4URGZBH","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/U4URGZBHMMJQHWM5IVK7O3PGIB","json":"https://pith.science/pith/U4URGZBHMMJQHWM5IVK7O3PGIB.json","graph_json":"https://pith.science/api/pith-number/U4URGZBHMMJQHWM5IVK7O3PGIB/graph.json","events_json":"https://pith.science/api/pith-number/U4URGZBHMMJQHWM5IVK7O3PGIB/events.json","paper":"https://pith.science/paper/U4URGZBH"},"agent_actions":{"view_html":"https://pith.science/pith/U4URGZBHMMJQHWM5IVK7O3PGIB","download_json":"https://pith.science/pith/U4URGZBHMMJQHWM5IVK7O3PGIB.json","view_paper":"https://pith.science/paper/U4URGZBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07019&json=true","fetch_graph":"https://pith.science/api/pith-number/U4URGZBHMMJQHWM5IVK7O3PGIB/graph.json","fetch_events":"https://pith.science/api/pith-number/U4URGZBHMMJQHWM5IVK7O3PGIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4URGZBHMMJQHWM5IVK7O3PGIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4URGZBHMMJQHWM5IVK7O3PGIB/action/storage_attestation","attest_author":"https://pith.science/pith/U4URGZBHMMJQHWM5IVK7O3PGIB/action/author_attestation","sign_citation":"https://pith.science/pith/U4URGZBHMMJQHWM5IVK7O3PGIB/action/citation_signature","submit_replication":"https://pith.science/pith/U4URGZBHMMJQHWM5IVK7O3PGIB/action/replication_record"}},"created_at":"2026-05-18T00:58:55.406157+00:00","updated_at":"2026-05-18T00:58:55.406157+00:00"}