{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:62RLK2PDXJW7BD6JCH7JM4I3XN","short_pith_number":"pith:62RLK2PD","canonical_record":{"source":{"id":"1504.02420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-09T18:54:57Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"e6f2e13b100f1b4a67f9b50ab211ac54866f07950eafda88041cf4ba06440107","abstract_canon_sha256":"c9c99f9ae8e2800bb0de9f3dd05a6fef990152490974c4fc7dffa052754797d2"},"schema_version":"1.0"},"canonical_sha256":"f6a2b569e3ba6df08fc911fe96711bbb66f8d79999fe01aae4447a53c78a8331","source":{"kind":"arxiv","id":"1504.02420","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02420","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02420v1","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02420","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"62RLK2PDXJW7","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"62RLK2PDXJW7BD6J","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"62RLK2PD","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:62RLK2PDXJW7BD6JCH7JM4I3XN","target":"record","payload":{"canonical_record":{"source":{"id":"1504.02420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-09T18:54:57Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"e6f2e13b100f1b4a67f9b50ab211ac54866f07950eafda88041cf4ba06440107","abstract_canon_sha256":"c9c99f9ae8e2800bb0de9f3dd05a6fef990152490974c4fc7dffa052754797d2"},"schema_version":"1.0"},"canonical_sha256":"f6a2b569e3ba6df08fc911fe96711bbb66f8d79999fe01aae4447a53c78a8331","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:41.035095Z","signature_b64":"O4UrkjbUga9za2g1M+HTFYbc1yJVXb9GekccaJ6EkzZ0QRAzxK68+SIfZCXzp/6nZGVP0nXl6awgSVtZsYHwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6a2b569e3ba6df08fc911fe96711bbb66f8d79999fe01aae4447a53c78a8331","last_reissued_at":"2026-05-18T02:09:41.034410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:41.034410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.02420","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-18T02:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4XGu1pQzlSBMv8SCkLix4/eG5CMKYFk3Jz6v6IHgxZfDl7qe3lc2N2LWwfNbhipL9VHWDsJjgsy9FmQ0t3bSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:37:00.223133Z"},"content_sha256":"8f18df99dab615824bfea99c2c429704cd065254e0426c9342b44cec6447c66c","schema_version":"1.0","event_id":"sha256:8f18df99dab615824bfea99c2c429704cd065254e0426c9342b44cec6447c66c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:62RLK2PDXJW7BD6JCH7JM4I3XN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for the workflow satisfiability problem engineered for counting constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"A. Gagarin, D. Cohen, G. Gutin, J. Crampton, M. Jones","submitted_at":"2015-04-09T18:54:57Z","abstract_excerpt":"The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorized users to the steps in a workflow specification that satisfies the constraints in the specification. The problem is NP-hard in general, but several subclasses of the problem are known to be fixed-parameter tractable (FPT) when parameterized by the number of steps in the specification. In this paper, we consider the WSP with user-independent counting constraints, a large class of constraints for which the WSP is known to be FPT. We describe an efficient implementation of an FPT algorithm for solving t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02420","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-18T02:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UldDwFpxkS/VptibbBPQb1iuvUhQGs0nFa44iijGiVQ607trsfPeR6/iM1QHufNPLQcn7OgCIYjbG5yPxarXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:37:00.223779Z"},"content_sha256":"f1dca2325fe946e592c843c21cd43fbbe87b09acc2f4ff47813de76a0ef8c833","schema_version":"1.0","event_id":"sha256:f1dca2325fe946e592c843c21cd43fbbe87b09acc2f4ff47813de76a0ef8c833"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/62RLK2PDXJW7BD6JCH7JM4I3XN/bundle.json","state_url":"https://pith.science/pith/62RLK2PDXJW7BD6JCH7JM4I3XN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/62RLK2PDXJW7BD6JCH7JM4I3XN/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-28T13:37:00Z","links":{"resolver":"https://pith.science/pith/62RLK2PDXJW7BD6JCH7JM4I3XN","bundle":"https://pith.science/pith/62RLK2PDXJW7BD6JCH7JM4I3XN/bundle.json","state":"https://pith.science/pith/62RLK2PDXJW7BD6JCH7JM4I3XN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/62RLK2PDXJW7BD6JCH7JM4I3XN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:62RLK2PDXJW7BD6JCH7JM4I3XN","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":"c9c99f9ae8e2800bb0de9f3dd05a6fef990152490974c4fc7dffa052754797d2","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-09T18:54:57Z","title_canon_sha256":"e6f2e13b100f1b4a67f9b50ab211ac54866f07950eafda88041cf4ba06440107"},"schema_version":"1.0","source":{"id":"1504.02420","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02420","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02420v1","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02420","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"62RLK2PDXJW7","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"62RLK2PDXJW7BD6J","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"62RLK2PD","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:f1dca2325fe946e592c843c21cd43fbbe87b09acc2f4ff47813de76a0ef8c833","target":"graph","created_at":"2026-05-18T02:09:41Z","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 that satisfies the constraints in the specification. The problem is NP-hard in general, but several subclasses of the problem are known to be fixed-parameter tractable (FPT) when parameterized by the number of steps in the specification. In this paper, we consider the WSP with user-independent counting constraints, a large class of constraints for which the WSP is known to be FPT. We describe an efficient implementation of an FPT algorithm for solving t","authors_text":"A. Gagarin, D. Cohen, G. Gutin, J. Crampton, M. Jones","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-09T18:54:57Z","title":"Algorithms for the workflow satisfiability problem engineered for counting constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02420","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:8f18df99dab615824bfea99c2c429704cd065254e0426c9342b44cec6447c66c","target":"record","created_at":"2026-05-18T02:09:41Z","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":"c9c99f9ae8e2800bb0de9f3dd05a6fef990152490974c4fc7dffa052754797d2","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-09T18:54:57Z","title_canon_sha256":"e6f2e13b100f1b4a67f9b50ab211ac54866f07950eafda88041cf4ba06440107"},"schema_version":"1.0","source":{"id":"1504.02420","kind":"arxiv","version":1}},"canonical_sha256":"f6a2b569e3ba6df08fc911fe96711bbb66f8d79999fe01aae4447a53c78a8331","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6a2b569e3ba6df08fc911fe96711bbb66f8d79999fe01aae4447a53c78a8331","first_computed_at":"2026-05-18T02:09:41.034410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:09:41.034410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O4UrkjbUga9za2g1M+HTFYbc1yJVXb9GekccaJ6EkzZ0QRAzxK68+SIfZCXzp/6nZGVP0nXl6awgSVtZsYHwBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:09:41.035095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02420","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f18df99dab615824bfea99c2c429704cd065254e0426c9342b44cec6447c66c","sha256:f1dca2325fe946e592c843c21cd43fbbe87b09acc2f4ff47813de76a0ef8c833"],"state_sha256":"2562720cf369884ab67bf5c9a56b31bbff7980a82c6b5eef2892caa41a8bbfd8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XfhfiG7RkRKcdeUuwE/gWs/r3e6JGxk0D3Q7SBenitjrXGBToK0xYbdrVIRPG6N0ZD62/srOjzR0CIW8LQGtAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:37:00.227205Z","bundle_sha256":"488316aface3ec049ec65e88d526bee1f90c44892a50044bead19dd2695881b9"}}