{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HHR2BUCZVTUTXVZ2FPOSEQV4YC","short_pith_number":"pith:HHR2BUCZ","schema_version":"1.0","canonical_sha256":"39e3a0d059ace93bd73a2bdd2242bcc08b6e74f60646c3837e53d972c3ff7909","source":{"kind":"arxiv","id":"1701.02199","version":1},"attestation_state":"computed","paper":{"title":"Finding AND-OR Hierarchies in Workflow Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jacek Sroka, Jan Hidders","submitted_at":"2017-01-06T16:10:48Z","abstract_excerpt":"This paper presents the notion of AND-OR reduction, which reduces a WF net to a smaller net by iteratively contracting certain well-formed subnets into single nodes until no more such contractions are possible. This reduction can reveal the hierarchical structure of a WF net, and since it preserves certain semantical properties such as soundness, it can help with analysing and understanding why a WF net is sound or not. The reduction can also be used to verify if a WF net is an AND-OR net. This class of WF nets was introduced in earlier work, and arguably describes nets that follow good hierar"},"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":"1701.02199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-06T16:10:48Z","cross_cats_sorted":[],"title_canon_sha256":"7f1ca8dbe232bb6ac96e1f8314b1a4d7cc1738c30ffd1ecc98ef46bb0828457f","abstract_canon_sha256":"3f3eaec89c6fa2370f5bfad0a2c04166add16e39f92414b416692bf2e761b991"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:11.462131Z","signature_b64":"QYTYEvpUqjdhF8cCIYyMx7QFaBUZ+b+JTYwMjapcOkAPSARfKEKlKYYQUhAiC8rOQyV9xqGMl1OZaswrOwH/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39e3a0d059ace93bd73a2bdd2242bcc08b6e74f60646c3837e53d972c3ff7909","last_reissued_at":"2026-05-18T00:53:11.461647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:11.461647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding AND-OR Hierarchies in Workflow Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jacek Sroka, Jan Hidders","submitted_at":"2017-01-06T16:10:48Z","abstract_excerpt":"This paper presents the notion of AND-OR reduction, which reduces a WF net to a smaller net by iteratively contracting certain well-formed subnets into single nodes until no more such contractions are possible. This reduction can reveal the hierarchical structure of a WF net, and since it preserves certain semantical properties such as soundness, it can help with analysing and understanding why a WF net is sound or not. The reduction can also be used to verify if a WF net is an AND-OR net. This class of WF nets was introduced in earlier work, and arguably describes nets that follow good hierar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02199","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":"1701.02199","created_at":"2026-05-18T00:53:11.461722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.02199v1","created_at":"2026-05-18T00:53:11.461722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02199","created_at":"2026-05-18T00:53:11.461722+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHR2BUCZVTUT","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHR2BUCZVTUTXVZ2","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHR2BUCZ","created_at":"2026-05-18T12:31:18.294218+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/HHR2BUCZVTUTXVZ2FPOSEQV4YC","json":"https://pith.science/pith/HHR2BUCZVTUTXVZ2FPOSEQV4YC.json","graph_json":"https://pith.science/api/pith-number/HHR2BUCZVTUTXVZ2FPOSEQV4YC/graph.json","events_json":"https://pith.science/api/pith-number/HHR2BUCZVTUTXVZ2FPOSEQV4YC/events.json","paper":"https://pith.science/paper/HHR2BUCZ"},"agent_actions":{"view_html":"https://pith.science/pith/HHR2BUCZVTUTXVZ2FPOSEQV4YC","download_json":"https://pith.science/pith/HHR2BUCZVTUTXVZ2FPOSEQV4YC.json","view_paper":"https://pith.science/paper/HHR2BUCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.02199&json=true","fetch_graph":"https://pith.science/api/pith-number/HHR2BUCZVTUTXVZ2FPOSEQV4YC/graph.json","fetch_events":"https://pith.science/api/pith-number/HHR2BUCZVTUTXVZ2FPOSEQV4YC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHR2BUCZVTUTXVZ2FPOSEQV4YC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHR2BUCZVTUTXVZ2FPOSEQV4YC/action/storage_attestation","attest_author":"https://pith.science/pith/HHR2BUCZVTUTXVZ2FPOSEQV4YC/action/author_attestation","sign_citation":"https://pith.science/pith/HHR2BUCZVTUTXVZ2FPOSEQV4YC/action/citation_signature","submit_replication":"https://pith.science/pith/HHR2BUCZVTUTXVZ2FPOSEQV4YC/action/replication_record"}},"created_at":"2026-05-18T00:53:11.461722+00:00","updated_at":"2026-05-18T00:53:11.461722+00:00"}