{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DWNSUEP7ZGZWYTCRAEAPKTUK4Y","short_pith_number":"pith:DWNSUEP7","canonical_record":{"source":{"id":"1508.06829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-27T12:32:42Z","cross_cats_sorted":["cs.CC","cs.CR"],"title_canon_sha256":"c107592d88e27f0cf169e873e81c64124130fbf4c4f5775edee258a82edd97bf","abstract_canon_sha256":"21f6f930b3767834f81093475fcdb2a7aeb3ec8868590c92a911adc6dc884031"},"schema_version":"1.0"},"canonical_sha256":"1d9b2a11ffc9b36c4c510100f54e8ae633e7c805af852de64526af8ec2fab110","source":{"kind":"arxiv","id":"1508.06829","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06829","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06829v1","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06829","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"pith_short_12","alias_value":"DWNSUEP7ZGZW","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DWNSUEP7ZGZWYTCR","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DWNSUEP7","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DWNSUEP7ZGZWYTCRAEAPKTUK4Y","target":"record","payload":{"canonical_record":{"source":{"id":"1508.06829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-27T12:32:42Z","cross_cats_sorted":["cs.CC","cs.CR"],"title_canon_sha256":"c107592d88e27f0cf169e873e81c64124130fbf4c4f5775edee258a82edd97bf","abstract_canon_sha256":"21f6f930b3767834f81093475fcdb2a7aeb3ec8868590c92a911adc6dc884031"},"schema_version":"1.0"},"canonical_sha256":"1d9b2a11ffc9b36c4c510100f54e8ae633e7c805af852de64526af8ec2fab110","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:40.881062Z","signature_b64":"r4xEA+AYBVwFaizmISXL5atPcfStlfolQ8aIvRooNnc5fLKfaSLIzLrw6xDumKaZ4XwB3mNVaidPV7QR+1ZaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d9b2a11ffc9b36c4c510100f54e8ae633e7c805af852de64526af8ec2fab110","last_reissued_at":"2026-05-18T01:34:40.880413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:40.880413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.06829","source_version":1,"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-18T01:34:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mB5bsxHFP1vrqWrqD31vr6NnI9X/SlS69v4n4XQrSspGbMnX30Rz+8tB3ldIwEqjGuDGEAmKbU0v6X34OaZ9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:47:14.142527Z"},"content_sha256":"4476e5a063a26d9be20a2583fcdfb27fa168201c1644e0400d243527bd867fdf","schema_version":"1.0","event_id":"sha256:4476e5a063a26d9be20a2583fcdfb27fa168201c1644e0400d243527bd867fdf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DWNSUEP7ZGZWYTCRAEAPKTUK4Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"cs.DS","authors_text":"Gregory Gutin, Magnus Wahlstrom","submitted_at":"2015-08-27T12:32:42Z","abstract_excerpt":"The Workflow Satisfiability Problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification, subject to certain constraints on the assignment. The problem is NP-hard even when restricted to just not equals constraints. Since the number of steps $k$ is relatively small in practice, Wang and Li (2010) introduced a parametrisation of WSP by $k$. Wang and Li (2010) showed that, in general, the WSP is W[1]-hard, i.e., it is unlikely that there exists a fixed-parameter tractable (FPT) algorithm for solving the WSP. Crampton et al. (2013) and Cohen e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06829","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"},"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-18T01:34:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ANVaNHX4qHj54M1ksBqxNOessLAvltREre0XPOLd/3ztKesRvm3dYmS7vRpnBP8m+j2XpdtOlwNjPrgGy6aLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:47:14.143158Z"},"content_sha256":"8ac7fd6c8419c24d62428634658bd8599c2483cbef62acaf367f0fa41465513e","schema_version":"1.0","event_id":"sha256:8ac7fd6c8419c24d62428634658bd8599c2483cbef62acaf367f0fa41465513e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DWNSUEP7ZGZWYTCRAEAPKTUK4Y/bundle.json","state_url":"https://pith.science/pith/DWNSUEP7ZGZWYTCRAEAPKTUK4Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DWNSUEP7ZGZWYTCRAEAPKTUK4Y/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-05T01:47:14Z","links":{"resolver":"https://pith.science/pith/DWNSUEP7ZGZWYTCRAEAPKTUK4Y","bundle":"https://pith.science/pith/DWNSUEP7ZGZWYTCRAEAPKTUK4Y/bundle.json","state":"https://pith.science/pith/DWNSUEP7ZGZWYTCRAEAPKTUK4Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DWNSUEP7ZGZWYTCRAEAPKTUK4Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DWNSUEP7ZGZWYTCRAEAPKTUK4Y","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":"21f6f930b3767834f81093475fcdb2a7aeb3ec8868590c92a911adc6dc884031","cross_cats_sorted":["cs.CC","cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-27T12:32:42Z","title_canon_sha256":"c107592d88e27f0cf169e873e81c64124130fbf4c4f5775edee258a82edd97bf"},"schema_version":"1.0","source":{"id":"1508.06829","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06829","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06829v1","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06829","created_at":"2026-05-18T01:34:40Z"},{"alias_kind":"pith_short_12","alias_value":"DWNSUEP7ZGZW","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DWNSUEP7ZGZWYTCR","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DWNSUEP7","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:8ac7fd6c8419c24d62428634658bd8599c2483cbef62acaf367f0fa41465513e","target":"graph","created_at":"2026-05-18T01:34:40Z","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 authorized users to the steps in a workflow specification, subject to certain constraints on the assignment. The problem is NP-hard even when restricted to just not equals constraints. Since the number of steps $k$ is relatively small in practice, Wang and Li (2010) introduced a parametrisation of WSP by $k$. Wang and Li (2010) showed that, in general, the WSP is W[1]-hard, i.e., it is unlikely that there exists a fixed-parameter tractable (FPT) algorithm for solving the WSP. Crampton et al. (2013) and Cohen e","authors_text":"Gregory Gutin, Magnus Wahlstrom","cross_cats":["cs.CC","cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-27T12:32:42Z","title":"Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06829","kind":"arxiv","version":1},"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:4476e5a063a26d9be20a2583fcdfb27fa168201c1644e0400d243527bd867fdf","target":"record","created_at":"2026-05-18T01:34:40Z","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":"21f6f930b3767834f81093475fcdb2a7aeb3ec8868590c92a911adc6dc884031","cross_cats_sorted":["cs.CC","cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-27T12:32:42Z","title_canon_sha256":"c107592d88e27f0cf169e873e81c64124130fbf4c4f5775edee258a82edd97bf"},"schema_version":"1.0","source":{"id":"1508.06829","kind":"arxiv","version":1}},"canonical_sha256":"1d9b2a11ffc9b36c4c510100f54e8ae633e7c805af852de64526af8ec2fab110","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d9b2a11ffc9b36c4c510100f54e8ae633e7c805af852de64526af8ec2fab110","first_computed_at":"2026-05-18T01:34:40.880413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:40.880413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r4xEA+AYBVwFaizmISXL5atPcfStlfolQ8aIvRooNnc5fLKfaSLIzLrw6xDumKaZ4XwB3mNVaidPV7QR+1ZaBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:40.881062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.06829","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4476e5a063a26d9be20a2583fcdfb27fa168201c1644e0400d243527bd867fdf","sha256:8ac7fd6c8419c24d62428634658bd8599c2483cbef62acaf367f0fa41465513e"],"state_sha256":"3f824a01c6e39ebade9c52b218700840f4e7990b0a31583064bd574c10b89a36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N4Nmr7jaiFBn5Vki9Y40a9Tjs0uQWDh+eOfbXr/at8dpAFjwkXOz9Y43LRNE0PRXoDgFBZzx6RTDxubCBtR/Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:47:14.145910Z","bundle_sha256":"b553a10b33497d0c35f9cb89b38d106cd93d3bdbe498826a9c621641ce89f011"}}