{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UDBBEEQ2OWSZRZZZUWRDCYIWRA","short_pith_number":"pith:UDBBEEQ2","canonical_record":{"source":{"id":"1811.06961","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-16T18:35:37Z","cross_cats_sorted":[],"title_canon_sha256":"b6337d9383bc97ec2f646fb77a62eb37bdc6d2ca2b707683c4b8e52f58fc0849","abstract_canon_sha256":"67f1009c1097069550d6e8f5f3a35117c776c6a97234a45e483c436eecfde46a"},"schema_version":"1.0"},"canonical_sha256":"a0c212121a75a598e739a5a2316116882890a5bf5be469a66804de29bbaabcc8","source":{"kind":"arxiv","id":"1811.06961","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06961","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06961v2","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06961","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"UDBBEEQ2OWSZ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UDBBEEQ2OWSZRZZZ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UDBBEEQ2","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UDBBEEQ2OWSZRZZZUWRDCYIWRA","target":"record","payload":{"canonical_record":{"source":{"id":"1811.06961","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-16T18:35:37Z","cross_cats_sorted":[],"title_canon_sha256":"b6337d9383bc97ec2f646fb77a62eb37bdc6d2ca2b707683c4b8e52f58fc0849","abstract_canon_sha256":"67f1009c1097069550d6e8f5f3a35117c776c6a97234a45e483c436eecfde46a"},"schema_version":"1.0"},"canonical_sha256":"a0c212121a75a598e739a5a2316116882890a5bf5be469a66804de29bbaabcc8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:08.994771Z","signature_b64":"fFtbzJbtp048z+w1sAbglzjfYanlJfpbfMm8VC4aKX5QJ83vAlLEMizekHJG1gF/sPCwauVGOaxcF522QWeFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0c212121a75a598e739a5a2316116882890a5bf5be469a66804de29bbaabcc8","last_reissued_at":"2026-05-17T23:53:08.994214Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:08.994214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.06961","source_version":2,"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:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qbKSnWYzlQkTim1K7EObJuc806atoCpYg5QzxK80QoLJqGu7oCtABUwPzT13PXWkWlgedw2PCBQB4Ulo3jqSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:26:37.275971Z"},"content_sha256":"6bced167a37600d3e066e7d5df735e72cfd99c121c2ca821f81bc087d2dea7d9","schema_version":"1.0","event_id":"sha256:6bced167a37600d3e066e7d5df735e72cfd99c121c2ca821f81bc087d2dea7d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UDBBEEQ2OWSZRZZZUWRDCYIWRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the Expected Execution Time of Probabilistic Workflow Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Javier Esparza, Philip Offtermatt, Philipp J. Meyer","submitted_at":"2018-11-16T18:35:37Z","abstract_excerpt":"Free-Choice Workflow Petri nets, also known as Workflow Graphs, are a popular model in Business Process Modeling.\n  In this paper we introduce Timed Probabilistic Workflow Nets (TPWNs), and give them a Markov Decision Process (MDP) semantics. Since the time needed to execute two parallel tasks is the maximum of the times, and not their sum, the expected time cannot be directly computed using the theory of MDPs with rewards. In our first contribution, we overcome this obstacle with the help of \"earliest-first\" schedulers, and give a single exponential-time algorithm for computing the expected t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06961","kind":"arxiv","version":2},"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:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MNxPejsbGKFJCCMOt6N9FJSWegOxqAhJVTQDwxWaqZ+ha4KT3PpmLz3gOFvM58/t7RsFa+EuTU8yaVj5bg+xAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:26:37.276340Z"},"content_sha256":"b7898d252812f109174ac1631b8ee57e2f2c03d4fe690f0f4bcd9b96acee88d6","schema_version":"1.0","event_id":"sha256:b7898d252812f109174ac1631b8ee57e2f2c03d4fe690f0f4bcd9b96acee88d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UDBBEEQ2OWSZRZZZUWRDCYIWRA/bundle.json","state_url":"https://pith.science/pith/UDBBEEQ2OWSZRZZZUWRDCYIWRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UDBBEEQ2OWSZRZZZUWRDCYIWRA/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-01T21:26:37Z","links":{"resolver":"https://pith.science/pith/UDBBEEQ2OWSZRZZZUWRDCYIWRA","bundle":"https://pith.science/pith/UDBBEEQ2OWSZRZZZUWRDCYIWRA/bundle.json","state":"https://pith.science/pith/UDBBEEQ2OWSZRZZZUWRDCYIWRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UDBBEEQ2OWSZRZZZUWRDCYIWRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UDBBEEQ2OWSZRZZZUWRDCYIWRA","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":"67f1009c1097069550d6e8f5f3a35117c776c6a97234a45e483c436eecfde46a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-16T18:35:37Z","title_canon_sha256":"b6337d9383bc97ec2f646fb77a62eb37bdc6d2ca2b707683c4b8e52f58fc0849"},"schema_version":"1.0","source":{"id":"1811.06961","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06961","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06961v2","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06961","created_at":"2026-05-17T23:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"UDBBEEQ2OWSZ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UDBBEEQ2OWSZRZZZ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UDBBEEQ2","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:b7898d252812f109174ac1631b8ee57e2f2c03d4fe690f0f4bcd9b96acee88d6","target":"graph","created_at":"2026-05-17T23:53:08Z","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":"Free-Choice Workflow Petri nets, also known as Workflow Graphs, are a popular model in Business Process Modeling.\n  In this paper we introduce Timed Probabilistic Workflow Nets (TPWNs), and give them a Markov Decision Process (MDP) semantics. Since the time needed to execute two parallel tasks is the maximum of the times, and not their sum, the expected time cannot be directly computed using the theory of MDPs with rewards. In our first contribution, we overcome this obstacle with the help of \"earliest-first\" schedulers, and give a single exponential-time algorithm for computing the expected t","authors_text":"Javier Esparza, Philip Offtermatt, Philipp J. Meyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-16T18:35:37Z","title":"Computing the Expected Execution Time of Probabilistic Workflow Nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06961","kind":"arxiv","version":2},"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:6bced167a37600d3e066e7d5df735e72cfd99c121c2ca821f81bc087d2dea7d9","target":"record","created_at":"2026-05-17T23:53:08Z","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":"67f1009c1097069550d6e8f5f3a35117c776c6a97234a45e483c436eecfde46a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-11-16T18:35:37Z","title_canon_sha256":"b6337d9383bc97ec2f646fb77a62eb37bdc6d2ca2b707683c4b8e52f58fc0849"},"schema_version":"1.0","source":{"id":"1811.06961","kind":"arxiv","version":2}},"canonical_sha256":"a0c212121a75a598e739a5a2316116882890a5bf5be469a66804de29bbaabcc8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0c212121a75a598e739a5a2316116882890a5bf5be469a66804de29bbaabcc8","first_computed_at":"2026-05-17T23:53:08.994214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:08.994214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fFtbzJbtp048z+w1sAbglzjfYanlJfpbfMm8VC4aKX5QJ83vAlLEMizekHJG1gF/sPCwauVGOaxcF522QWeFBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:08.994771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06961","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bced167a37600d3e066e7d5df735e72cfd99c121c2ca821f81bc087d2dea7d9","sha256:b7898d252812f109174ac1631b8ee57e2f2c03d4fe690f0f4bcd9b96acee88d6"],"state_sha256":"64f805a49d07e7587d4130a09dc2b5ed36af61f2b17c3df58007d2c7dc0bf606"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WYd+4GockEiAWB4rVZqPiOrlhY3sZZTVkzBZtJ4hAnZAcYncIIeywfXBjrQyAAhktjnUKjD5yUzIIFKIkubKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:26:37.278330Z","bundle_sha256":"2c8d9bad6cf5d00db9cebfea35c0797e2fb36646ff3779ffb064fb872f364b91"}}