{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QXYVD7BC4KZFV2KPOM2TIBN77K","short_pith_number":"pith:QXYVD7BC","canonical_record":{"source":{"id":"1306.3649","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-16T10:45:32Z","cross_cats_sorted":[],"title_canon_sha256":"2a0f2e3aa65502d6d1017a5aa129d262d0d7ba6b061c06a827c4a246122a41a5","abstract_canon_sha256":"be5f202fe8c337e66ef3f348f14c291131fec8f9729bc87592d818415b203799"},"schema_version":"1.0"},"canonical_sha256":"85f151fc22e2b25ae94f73353405bffab96bae60d0b8f036f64457039f67662d","source":{"kind":"arxiv","id":"1306.3649","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3649","created_at":"2026-05-18T02:09:42Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3649v3","created_at":"2026-05-18T02:09:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3649","created_at":"2026-05-18T02:09:42Z"},{"alias_kind":"pith_short_12","alias_value":"QXYVD7BC4KZF","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QXYVD7BC4KZFV2KP","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QXYVD7BC","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QXYVD7BC4KZFV2KPOM2TIBN77K","target":"record","payload":{"canonical_record":{"source":{"id":"1306.3649","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-16T10:45:32Z","cross_cats_sorted":[],"title_canon_sha256":"2a0f2e3aa65502d6d1017a5aa129d262d0d7ba6b061c06a827c4a246122a41a5","abstract_canon_sha256":"be5f202fe8c337e66ef3f348f14c291131fec8f9729bc87592d818415b203799"},"schema_version":"1.0"},"canonical_sha256":"85f151fc22e2b25ae94f73353405bffab96bae60d0b8f036f64457039f67662d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:42.044071Z","signature_b64":"pLjUcPonaKGiB67mrh80Jxlv+75ZvTlg0Zzl3k7o98xk9gTzhXUFFm9WHCN8KRh9PTrR+nvuTuQw6+PzvD/uBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85f151fc22e2b25ae94f73353405bffab96bae60d0b8f036f64457039f67662d","last_reissued_at":"2026-05-18T02:09:42.043298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:42.043298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.3649","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:09:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TqXbKsXfetpa58fkHmIdBRQ9TFBJqdkMkLq0qw9PcF/H0c9CN9ERD/J/yjcrL08sTd02CgYV5ictEOlBwoNVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:14:50.997561Z"},"content_sha256":"52b64625b98afcd42aff0ce46b1d4707c1bedbc8d4a990c2dc014972c645690b","schema_version":"1.0","event_id":"sha256:52b64625b98afcd42aff0ce46b1d4707c1bedbc8d4a990c2dc014972c645690b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QXYVD7BC4KZFV2KPOM2TIBN77K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Plan Construction 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, David Cohen, Gregory Gutin, Jason Crampton, Mark Jones","submitted_at":"2013-06-16T10:45:32Z","abstract_excerpt":"The \\emph{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 \\emph{plan} -- an assignment of tasks to authorized users -- such that all constraints are satisfied. Several bespoke algorithms have been constructed for solving the WSP, optimised to deal with constraints (business rules) of particular types.\n  It is natural to see the WSP as a subclass of the {\\em Constraint Satisfaction Problem (CSP)} in whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3649","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:09:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yD0l23AP1k+4a8wQbWEl2L6L2Bgu7mALr5wOERXCwVrl2nz3u/7Q/h17OREq6Ko91FlPlxATulF5mEKJ79zCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:14:50.997933Z"},"content_sha256":"239b11488ab7ab06cce0ef6f8b19e598ce0bf3ab41dd14561783dad35b8cef96","schema_version":"1.0","event_id":"sha256:239b11488ab7ab06cce0ef6f8b19e598ce0bf3ab41dd14561783dad35b8cef96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXYVD7BC4KZFV2KPOM2TIBN77K/bundle.json","state_url":"https://pith.science/pith/QXYVD7BC4KZFV2KPOM2TIBN77K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXYVD7BC4KZFV2KPOM2TIBN77K/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T22:14:50Z","links":{"resolver":"https://pith.science/pith/QXYVD7BC4KZFV2KPOM2TIBN77K","bundle":"https://pith.science/pith/QXYVD7BC4KZFV2KPOM2TIBN77K/bundle.json","state":"https://pith.science/pith/QXYVD7BC4KZFV2KPOM2TIBN77K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXYVD7BC4KZFV2KPOM2TIBN77K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QXYVD7BC4KZFV2KPOM2TIBN77K","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"be5f202fe8c337e66ef3f348f14c291131fec8f9729bc87592d818415b203799","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-16T10:45:32Z","title_canon_sha256":"2a0f2e3aa65502d6d1017a5aa129d262d0d7ba6b061c06a827c4a246122a41a5"},"schema_version":"1.0","source":{"id":"1306.3649","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3649","created_at":"2026-05-18T02:09:42Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3649v3","created_at":"2026-05-18T02:09:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3649","created_at":"2026-05-18T02:09:42Z"},{"alias_kind":"pith_short_12","alias_value":"QXYVD7BC4KZF","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QXYVD7BC4KZFV2KP","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QXYVD7BC","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:239b11488ab7ab06cce0ef6f8b19e598ce0bf3ab41dd14561783dad35b8cef96","target":"graph","created_at":"2026-05-18T02:09:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The \\emph{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 \\emph{plan} -- an assignment of tasks to authorized users -- such that all constraints are satisfied. Several bespoke algorithms have been constructed for solving the WSP, optimised to deal with constraints (business rules) of particular types.\n  It is natural to see the WSP as a subclass of the {\\em Constraint Satisfaction Problem (CSP)} in whic","authors_text":"Andrei Gagarin, David Cohen, Gregory Gutin, Jason Crampton, Mark Jones","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-16T10:45:32Z","title":"Iterative Plan Construction for the Workflow Satisfiability Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3649","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:52b64625b98afcd42aff0ce46b1d4707c1bedbc8d4a990c2dc014972c645690b","target":"record","created_at":"2026-05-18T02:09:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"be5f202fe8c337e66ef3f348f14c291131fec8f9729bc87592d818415b203799","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-16T10:45:32Z","title_canon_sha256":"2a0f2e3aa65502d6d1017a5aa129d262d0d7ba6b061c06a827c4a246122a41a5"},"schema_version":"1.0","source":{"id":"1306.3649","kind":"arxiv","version":3}},"canonical_sha256":"85f151fc22e2b25ae94f73353405bffab96bae60d0b8f036f64457039f67662d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85f151fc22e2b25ae94f73353405bffab96bae60d0b8f036f64457039f67662d","first_computed_at":"2026-05-18T02:09:42.043298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:09:42.043298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pLjUcPonaKGiB67mrh80Jxlv+75ZvTlg0Zzl3k7o98xk9gTzhXUFFm9WHCN8KRh9PTrR+nvuTuQw6+PzvD/uBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:09:42.044071Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.3649","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52b64625b98afcd42aff0ce46b1d4707c1bedbc8d4a990c2dc014972c645690b","sha256:239b11488ab7ab06cce0ef6f8b19e598ce0bf3ab41dd14561783dad35b8cef96"],"state_sha256":"356be66222d591f69b6f2d995002f7a8f2da1bea081e1c26e34d3a29e8b229f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZ2v53o/UWWG6KHrCzOk+fYZlWOyl9oxrxwdb4sk1bfMkx90/e4gfPXEz8j414hYxiQIpzBp9P+FDrrCw24lAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:14:51.000865Z","bundle_sha256":"9f1da6e916827972fe43dccf8a83731bc96a432136282decbeb51776731610f5"}}