{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AGLJSQGXZ53NQLIVTZUYSYRTVJ","short_pith_number":"pith:AGLJSQGX","canonical_record":{"source":{"id":"1904.07234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T10:29:06Z","cross_cats_sorted":[],"title_canon_sha256":"591950dbf36dac17f642280907d01569e14f7e109b822e952876acb5dec38daf","abstract_canon_sha256":"8baf1fe8bf8cdaf670c977ce677124f545a84e4ba72bdfa07374a673ad136605"},"schema_version":"1.0"},"canonical_sha256":"01969940d7cf76d82d159e69896233aa54f8fe4a0205f39f96c3883c0039073b","source":{"kind":"arxiv","id":"1904.07234","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07234","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07234v1","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07234","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"AGLJSQGXZ53N","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AGLJSQGXZ53NQLIV","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AGLJSQGX","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AGLJSQGXZ53NQLIVTZUYSYRTVJ","target":"record","payload":{"canonical_record":{"source":{"id":"1904.07234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T10:29:06Z","cross_cats_sorted":[],"title_canon_sha256":"591950dbf36dac17f642280907d01569e14f7e109b822e952876acb5dec38daf","abstract_canon_sha256":"8baf1fe8bf8cdaf670c977ce677124f545a84e4ba72bdfa07374a673ad136605"},"schema_version":"1.0"},"canonical_sha256":"01969940d7cf76d82d159e69896233aa54f8fe4a0205f39f96c3883c0039073b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:29.173924Z","signature_b64":"oxpdQkAnmV5dBeo+Fv7JsUd26iHASS762StKgtNKhvNdr3vx6KN1ta5/kms7YS54ZA26UHOHhmIMqaEjVhW0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01969940d7cf76d82d159e69896233aa54f8fe4a0205f39f96c3883c0039073b","last_reissued_at":"2026-05-17T23:48:29.173464Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:29.173464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.07234","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-17T23:48:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8pZ9XtwqSd/K+NAjZTw5wPLr6Uh6hfdmB4Hjl/2uBHLRPxhmu5gCvEkDGcO/Ef6GrP9HzCUK2tyH8jY2xSxmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:11:13.422511Z"},"content_sha256":"c1034e2b5e711ea3a3718e60a2f5a871e3c94a7ff3b91f0ee063fb63e9ac65c9","schema_version":"1.0","event_id":"sha256:c1034e2b5e711ea3a3718e60a2f5a871e3c94a7ff3b91f0ee063fb63e9ac65c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AGLJSQGXZ53NQLIVTZUYSYRTVJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounded and Approximate Strong Satisfiability in Workflows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Diptapriyo Majumdar, Gregory Gutin, Jason Crampton","submitted_at":"2019-04-15T10:29:06Z","abstract_excerpt":"There has been a considerable amount of interest in recent years in the problem of workflow satisfiability, which asks whether the existence of constraints in a workflow specification makes it impossible to allocate authorized users to each step in the workflow. Recent developments have seen the workflow satisfiability problem (WSP) studied in the context of workflow specifications in which the set of steps may vary from one instance of the workflow to another. This, in turn, means that some constraints may only apply to certain workflow instances. Inevitably, WSP becomes more complex for such"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07234","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-17T23:48:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LB7ZUkB5OQjnKBv61e6+gSfcN40HW3nFYY2mPs2p1WtiY0PGdjOi+F6G5iBiQpN2s4Uq409cqpGADf05BvrVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:11:13.423146Z"},"content_sha256":"cd1de53d21636d5285b6ad69aedb0b4715c12f4f8348f08bdec86bce09c83889","schema_version":"1.0","event_id":"sha256:cd1de53d21636d5285b6ad69aedb0b4715c12f4f8348f08bdec86bce09c83889"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGLJSQGXZ53NQLIVTZUYSYRTVJ/bundle.json","state_url":"https://pith.science/pith/AGLJSQGXZ53NQLIVTZUYSYRTVJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGLJSQGXZ53NQLIVTZUYSYRTVJ/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-30T20:11:13Z","links":{"resolver":"https://pith.science/pith/AGLJSQGXZ53NQLIVTZUYSYRTVJ","bundle":"https://pith.science/pith/AGLJSQGXZ53NQLIVTZUYSYRTVJ/bundle.json","state":"https://pith.science/pith/AGLJSQGXZ53NQLIVTZUYSYRTVJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGLJSQGXZ53NQLIVTZUYSYRTVJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AGLJSQGXZ53NQLIVTZUYSYRTVJ","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":"8baf1fe8bf8cdaf670c977ce677124f545a84e4ba72bdfa07374a673ad136605","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T10:29:06Z","title_canon_sha256":"591950dbf36dac17f642280907d01569e14f7e109b822e952876acb5dec38daf"},"schema_version":"1.0","source":{"id":"1904.07234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07234","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07234v1","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07234","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"AGLJSQGXZ53N","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AGLJSQGXZ53NQLIV","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AGLJSQGX","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:cd1de53d21636d5285b6ad69aedb0b4715c12f4f8348f08bdec86bce09c83889","target":"graph","created_at":"2026-05-17T23:48:29Z","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":"There has been a considerable amount of interest in recent years in the problem of workflow satisfiability, which asks whether the existence of constraints in a workflow specification makes it impossible to allocate authorized users to each step in the workflow. Recent developments have seen the workflow satisfiability problem (WSP) studied in the context of workflow specifications in which the set of steps may vary from one instance of the workflow to another. This, in turn, means that some constraints may only apply to certain workflow instances. Inevitably, WSP becomes more complex for such","authors_text":"Diptapriyo Majumdar, Gregory Gutin, Jason Crampton","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T10:29:06Z","title":"Bounded and Approximate Strong Satisfiability in Workflows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07234","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:c1034e2b5e711ea3a3718e60a2f5a871e3c94a7ff3b91f0ee063fb63e9ac65c9","target":"record","created_at":"2026-05-17T23:48:29Z","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":"8baf1fe8bf8cdaf670c977ce677124f545a84e4ba72bdfa07374a673ad136605","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T10:29:06Z","title_canon_sha256":"591950dbf36dac17f642280907d01569e14f7e109b822e952876acb5dec38daf"},"schema_version":"1.0","source":{"id":"1904.07234","kind":"arxiv","version":1}},"canonical_sha256":"01969940d7cf76d82d159e69896233aa54f8fe4a0205f39f96c3883c0039073b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01969940d7cf76d82d159e69896233aa54f8fe4a0205f39f96c3883c0039073b","first_computed_at":"2026-05-17T23:48:29.173464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:29.173464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oxpdQkAnmV5dBeo+Fv7JsUd26iHASS762StKgtNKhvNdr3vx6KN1ta5/kms7YS54ZA26UHOHhmIMqaEjVhW0Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:29.173924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.07234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1034e2b5e711ea3a3718e60a2f5a871e3c94a7ff3b91f0ee063fb63e9ac65c9","sha256:cd1de53d21636d5285b6ad69aedb0b4715c12f4f8348f08bdec86bce09c83889"],"state_sha256":"1406d67a2d403966d058cd26439d4ef650be8a1b386e04a39aee8af21c94f149"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71C3APIyjlHZF94PlN3dZfiF3kI8IIF42pJjWTx9Qf1U9EnFaIYMO4c+mGBprjsRbcPh4jHhMoapGuZZNe0ZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:11:13.426179Z","bundle_sha256":"ad5c5cbf3c83be744e9d405bec242fadb736dfd0702e33b75a2a7aa1c09f6074"}}