{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HHR2BUCZVTUTXVZ2FPOSEQV4YC","short_pith_number":"pith:HHR2BUCZ","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"},"canonical_sha256":"39e3a0d059ace93bd73a2bdd2242bcc08b6e74f60646c3837e53d972c3ff7909","source":{"kind":"arxiv","id":"1701.02199","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02199","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02199v1","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02199","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"pith_short_12","alias_value":"HHR2BUCZVTUT","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HHR2BUCZVTUTXVZ2","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HHR2BUCZ","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HHR2BUCZVTUTXVZ2FPOSEQV4YC","target":"record","payload":{"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"},"canonical_sha256":"39e3a0d059ace93bd73a2bdd2242bcc08b6e74f60646c3837e53d972c3ff7909","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"},"source_kind":"arxiv","source_id":"1701.02199","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-18T00:53:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GXJIzLCm9jF7I2t4vkGTqV1aLfaq+Wpc5Fz6ijTfbi7krqNVj48lmX2aAGZEnVpwhbR61HZuQC/XD18zxuKMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:15:44.898441Z"},"content_sha256":"6b5b5711f5cba3824c6ee305e401c005ab83af713393698e38d9c6a1f60987fc","schema_version":"1.0","event_id":"sha256:6b5b5711f5cba3824c6ee305e401c005ab83af713393698e38d9c6a1f60987fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HHR2BUCZVTUTXVZ2FPOSEQV4YC","target":"graph","payload":{"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"},"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-18T00:53:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"10ouSgo88MKpz+2gnWP6/OjhrcateI1dKP2oNfGTt1zlOzmLfWSDNcw6UtO5nYSMYY/UFexVL8fJQECZxe48Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:15:44.898784Z"},"content_sha256":"59f7857f584d575dc1bc0a89d4e79ecef6fe1275f6b88682aae1301c8f99fcab","schema_version":"1.0","event_id":"sha256:59f7857f584d575dc1bc0a89d4e79ecef6fe1275f6b88682aae1301c8f99fcab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHR2BUCZVTUTXVZ2FPOSEQV4YC/bundle.json","state_url":"https://pith.science/pith/HHR2BUCZVTUTXVZ2FPOSEQV4YC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHR2BUCZVTUTXVZ2FPOSEQV4YC/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-02T04:15:44Z","links":{"resolver":"https://pith.science/pith/HHR2BUCZVTUTXVZ2FPOSEQV4YC","bundle":"https://pith.science/pith/HHR2BUCZVTUTXVZ2FPOSEQV4YC/bundle.json","state":"https://pith.science/pith/HHR2BUCZVTUTXVZ2FPOSEQV4YC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHR2BUCZVTUTXVZ2FPOSEQV4YC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HHR2BUCZVTUTXVZ2FPOSEQV4YC","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":"3f3eaec89c6fa2370f5bfad0a2c04166add16e39f92414b416692bf2e761b991","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-06T16:10:48Z","title_canon_sha256":"7f1ca8dbe232bb6ac96e1f8314b1a4d7cc1738c30ffd1ecc98ef46bb0828457f"},"schema_version":"1.0","source":{"id":"1701.02199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02199","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02199v1","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02199","created_at":"2026-05-18T00:53:11Z"},{"alias_kind":"pith_short_12","alias_value":"HHR2BUCZVTUT","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HHR2BUCZVTUTXVZ2","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HHR2BUCZ","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:59f7857f584d575dc1bc0a89d4e79ecef6fe1275f6b88682aae1301c8f99fcab","target":"graph","created_at":"2026-05-18T00:53:11Z","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":"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","authors_text":"Jacek Sroka, Jan Hidders","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-06T16:10:48Z","title":"Finding AND-OR Hierarchies in Workflow Nets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02199","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:6b5b5711f5cba3824c6ee305e401c005ab83af713393698e38d9c6a1f60987fc","target":"record","created_at":"2026-05-18T00:53:11Z","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":"3f3eaec89c6fa2370f5bfad0a2c04166add16e39f92414b416692bf2e761b991","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-06T16:10:48Z","title_canon_sha256":"7f1ca8dbe232bb6ac96e1f8314b1a4d7cc1738c30ffd1ecc98ef46bb0828457f"},"schema_version":"1.0","source":{"id":"1701.02199","kind":"arxiv","version":1}},"canonical_sha256":"39e3a0d059ace93bd73a2bdd2242bcc08b6e74f60646c3837e53d972c3ff7909","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39e3a0d059ace93bd73a2bdd2242bcc08b6e74f60646c3837e53d972c3ff7909","first_computed_at":"2026-05-18T00:53:11.461647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:11.461647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QYTYEvpUqjdhF8cCIYyMx7QFaBUZ+b+JTYwMjapcOkAPSARfKEKlKYYQUhAiC8rOQyV9xqGMl1OZaswrOwH/Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:11.462131Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02199","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b5b5711f5cba3824c6ee305e401c005ab83af713393698e38d9c6a1f60987fc","sha256:59f7857f584d575dc1bc0a89d4e79ecef6fe1275f6b88682aae1301c8f99fcab"],"state_sha256":"b1418dab4c1e1035070390aeca02b27bc4f757a7ae7aa3b6e85a962995a6214f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RnpjqOQISifvEMSqSq6Gst12W4715K7/angway4NyjKJgoOitcULHKGmYF3ed8/97kZJTDBTNRWVrea3EI9MAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:15:44.900665Z","bundle_sha256":"e8027dfe1a5d1359edf615ed6431158eb52ce5b106b9cabdcf4ce224c3783b1e"}}