{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DT2MIO5EE3YRFUGCESXG6BHK7S","short_pith_number":"pith:DT2MIO5E","schema_version":"1.0","canonical_sha256":"1cf4c43ba426f112d0c224ae6f04eafca9ebfd15e9899249b837c0fad62689ea","source":{"kind":"arxiv","id":"1606.00175","version":1},"attestation_state":"computed","paper":{"title":"Polynomial Analysis Algorithms for Free Choice Probabilistic Workflow Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Javier Esparza, Philipp Hoffmann, Ratul Saha","submitted_at":"2016-06-01T08:48:43Z","abstract_excerpt":"We study Probabilistic Workflow Nets (PWNs), a model extending van der Aalst's workflow nets with probabilities. We give a semantics for PWNs in terms of Markov Decision Processes and introduce a reward model. Using a result by Varacca and Nielsen, we show that the expected reward of a complete execution of the PWN is independent of the scheduler. Extending previous work on reduction of non-probabilistic workflow nets, we present reduction rules that preserve the expected reward. The rules lead to a polynomial-time algorithm in the size of the PWN (not of the Markov decision process) for the c"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1606.00175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-01T08:48:43Z","cross_cats_sorted":[],"title_canon_sha256":"3c06e1d82164274a985a60d7baa19df388e32c2407782fa88e21a0797e24c045","abstract_canon_sha256":"439e2c79de4bf9662dcbbdf84fe558d6ac6ee05d24da18635614724222fff2f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:05.786177Z","signature_b64":"QsdOTt8YBBsrDIjrfxezYNVJJBUPZIVn/3/ipgtmsrdPDQXqPN1JxL4+U/w9U3jfBAow4lvk40U8kO/NHVeDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf4c43ba426f112d0c224ae6f04eafca9ebfd15e9899249b837c0fad62689ea","last_reissued_at":"2026-05-18T01:13:05.785823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:05.785823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Analysis Algorithms for Free Choice Probabilistic Workflow Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Javier Esparza, Philipp Hoffmann, Ratul Saha","submitted_at":"2016-06-01T08:48:43Z","abstract_excerpt":"We study Probabilistic Workflow Nets (PWNs), a model extending van der Aalst's workflow nets with probabilities. We give a semantics for PWNs in terms of Markov Decision Processes and introduce a reward model. Using a result by Varacca and Nielsen, we show that the expected reward of a complete execution of the PWN is independent of the scheduler. Extending previous work on reduction of non-probabilistic workflow nets, we present reduction rules that preserve the expected reward. The rules lead to a polynomial-time algorithm in the size of the PWN (not of the Markov decision process) for the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00175","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.00175","created_at":"2026-05-18T01:13:05.785884+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00175v1","created_at":"2026-05-18T01:13:05.785884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00175","created_at":"2026-05-18T01:13:05.785884+00:00"},{"alias_kind":"pith_short_12","alias_value":"DT2MIO5EE3YR","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DT2MIO5EE3YRFUGC","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DT2MIO5E","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DT2MIO5EE3YRFUGCESXG6BHK7S","json":"https://pith.science/pith/DT2MIO5EE3YRFUGCESXG6BHK7S.json","graph_json":"https://pith.science/api/pith-number/DT2MIO5EE3YRFUGCESXG6BHK7S/graph.json","events_json":"https://pith.science/api/pith-number/DT2MIO5EE3YRFUGCESXG6BHK7S/events.json","paper":"https://pith.science/paper/DT2MIO5E"},"agent_actions":{"view_html":"https://pith.science/pith/DT2MIO5EE3YRFUGCESXG6BHK7S","download_json":"https://pith.science/pith/DT2MIO5EE3YRFUGCESXG6BHK7S.json","view_paper":"https://pith.science/paper/DT2MIO5E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00175&json=true","fetch_graph":"https://pith.science/api/pith-number/DT2MIO5EE3YRFUGCESXG6BHK7S/graph.json","fetch_events":"https://pith.science/api/pith-number/DT2MIO5EE3YRFUGCESXG6BHK7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DT2MIO5EE3YRFUGCESXG6BHK7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DT2MIO5EE3YRFUGCESXG6BHK7S/action/storage_attestation","attest_author":"https://pith.science/pith/DT2MIO5EE3YRFUGCESXG6BHK7S/action/author_attestation","sign_citation":"https://pith.science/pith/DT2MIO5EE3YRFUGCESXG6BHK7S/action/citation_signature","submit_replication":"https://pith.science/pith/DT2MIO5EE3YRFUGCESXG6BHK7S/action/replication_record"}},"created_at":"2026-05-18T01:13:05.785884+00:00","updated_at":"2026-05-18T01:13:05.785884+00:00"}