{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:W35MF33LVVK2PTNHRKTAZMY4TJ","short_pith_number":"pith:W35MF33L","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"},"canonical_sha256":"b6fac2ef6bad55a7cda78aa60cb31c9a65eec176b88e4e9aa1fb0cd64706d5aa","source":{"kind":"arxiv","id":"1412.7834","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7834","created_at":"2026-05-18T02:19:52Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7834v3","created_at":"2026-05-18T02:19:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7834","created_at":"2026-05-18T02:19:52Z"},{"alias_kind":"pith_short_12","alias_value":"W35MF33LVVK2","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W35MF33LVVK2PTNH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W35MF33L","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:W35MF33LVVK2PTNHRKTAZMY4TJ","target":"record","payload":{"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"},"canonical_sha256":"b6fac2ef6bad55a7cda78aa60cb31c9a65eec176b88e4e9aa1fb0cd64706d5aa","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"},"source_kind":"arxiv","source_id":"1412.7834","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:19:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T6QytKcVp45Fd29H2MIkR5rtpM1GY3PtFZKWuxO+lKfMchtfDlha63v8TlCAqmukTStlNx0GfTsGY0OgnrfwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:36:57.011464Z"},"content_sha256":"3d6d5ab991d01ffd43d75702d04e27010014987aca950982ec9edcd9f7c70655","schema_version":"1.0","event_id":"sha256:3d6d5ab991d01ffd43d75702d04e27010014987aca950982ec9edcd9f7c70655"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:W35MF33LVVK2PTNHRKTAZMY4TJ","target":"graph","payload":{"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"},"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:19:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ismaOzqPSVqmirxER1RV6hs+uIIM8uIiIhHdje/RwDt7D3RQ8NXnPsYvyVKqyOc7kaMo827InVxFmg5ceSFbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:36:57.011812Z"},"content_sha256":"f5b2214cfa0732db31076546aacd4ee3e4aad8fba52dcfef1913d4633ed01b1c","schema_version":"1.0","event_id":"sha256:f5b2214cfa0732db31076546aacd4ee3e4aad8fba52dcfef1913d4633ed01b1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W35MF33LVVK2PTNHRKTAZMY4TJ/bundle.json","state_url":"https://pith.science/pith/W35MF33LVVK2PTNHRKTAZMY4TJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W35MF33LVVK2PTNHRKTAZMY4TJ/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-06-22T17:36:57Z","links":{"resolver":"https://pith.science/pith/W35MF33LVVK2PTNHRKTAZMY4TJ","bundle":"https://pith.science/pith/W35MF33LVVK2PTNHRKTAZMY4TJ/bundle.json","state":"https://pith.science/pith/W35MF33LVVK2PTNHRKTAZMY4TJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W35MF33LVVK2PTNHRKTAZMY4TJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:W35MF33LVVK2PTNHRKTAZMY4TJ","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":"161ba89513e460426fe0bb94fd427692864bee3b8b17b521ccdefb80444d633c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-25T16:24:25Z","title_canon_sha256":"d0458af643b52d322a55f92e78262658159f814a3af0fcfee9c0096d16723e0a"},"schema_version":"1.0","source":{"id":"1412.7834","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7834","created_at":"2026-05-18T02:19:52Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7834v3","created_at":"2026-05-18T02:19:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7834","created_at":"2026-05-18T02:19:52Z"},{"alias_kind":"pith_short_12","alias_value":"W35MF33LVVK2","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W35MF33LVVK2PTNH","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W35MF33L","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:f5b2214cfa0732db31076546aacd4ee3e4aad8fba52dcfef1913d4633ed01b1c","target":"graph","created_at":"2026-05-18T02:19:52Z","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 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 ","authors_text":"Andrei Gagarin, Daniel Karapetyan, Gregory Gutin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-25T16:24:25Z","title":"Pattern Backtracking Algorithm for the Workflow Satisfiability Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7834","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:3d6d5ab991d01ffd43d75702d04e27010014987aca950982ec9edcd9f7c70655","target":"record","created_at":"2026-05-18T02:19:52Z","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":"161ba89513e460426fe0bb94fd427692864bee3b8b17b521ccdefb80444d633c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-25T16:24:25Z","title_canon_sha256":"d0458af643b52d322a55f92e78262658159f814a3af0fcfee9c0096d16723e0a"},"schema_version":"1.0","source":{"id":"1412.7834","kind":"arxiv","version":3}},"canonical_sha256":"b6fac2ef6bad55a7cda78aa60cb31c9a65eec176b88e4e9aa1fb0cd64706d5aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6fac2ef6bad55a7cda78aa60cb31c9a65eec176b88e4e9aa1fb0cd64706d5aa","first_computed_at":"2026-05-18T02:19:52.518371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:52.518371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sltc7BJl792ZU+DPpYE1U12v3L7GQfL0+YwOBsQ1Gb2vrZkPF3UAaXeYJzsY1i1sGqINn4APljkQmsSQQHHEAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:52.518937Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.7834","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d6d5ab991d01ffd43d75702d04e27010014987aca950982ec9edcd9f7c70655","sha256:f5b2214cfa0732db31076546aacd4ee3e4aad8fba52dcfef1913d4633ed01b1c"],"state_sha256":"981dd7ec9b12b1024020cb151668b620bfbc95fe362353ebf49d4a94031ffb86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c0jMOrTazHCX/i+i/XanVvdRZEmPbm09kxfx7q/Q0cSX+GXvQGZ/TKeMYhF5CcYV8F8S+gEI51aQcKAFrIgfCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T17:36:57.013790Z","bundle_sha256":"b39581cf20653ea758a642d0f944c7c9f711ba2f38c491342aa11c290934c812"}}