{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3B5CBHHJGYATJJA35YUXLXQAEO","short_pith_number":"pith:3B5CBHHJ","canonical_record":{"source":{"id":"1105.0653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-05-03T18:49:18Z","cross_cats_sorted":[],"title_canon_sha256":"045bcc5a055c545c2ec55a94887046072f90824cda9afccb5b8b42eafb70c959","abstract_canon_sha256":"2ea9f8891c6104836e4c7e82048cc1d2c1513f11d7532cea743454b241c78d23"},"schema_version":"1.0"},"canonical_sha256":"d87a209ce9360134a41bee2975de002389c9dabf5bf612d56b7f6e3fcbb3619f","source":{"kind":"arxiv","id":"1105.0653","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0653","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0653v1","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0653","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"3B5CBHHJGYAT","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3B5CBHHJGYATJJA3","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3B5CBHHJ","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3B5CBHHJGYATJJA35YUXLXQAEO","target":"record","payload":{"canonical_record":{"source":{"id":"1105.0653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-05-03T18:49:18Z","cross_cats_sorted":[],"title_canon_sha256":"045bcc5a055c545c2ec55a94887046072f90824cda9afccb5b8b42eafb70c959","abstract_canon_sha256":"2ea9f8891c6104836e4c7e82048cc1d2c1513f11d7532cea743454b241c78d23"},"schema_version":"1.0"},"canonical_sha256":"d87a209ce9360134a41bee2975de002389c9dabf5bf612d56b7f6e3fcbb3619f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:10.949305Z","signature_b64":"eQms6lkW3TM22ZheyMR4XCxnkpn2et/aCLahGFRAbel4K7SN1Tr2FM0YWdORJjeZh2/Fq7i3GJNgfW/adh9fAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d87a209ce9360134a41bee2975de002389c9dabf5bf612d56b7f6e3fcbb3619f","last_reissued_at":"2026-05-18T04:23:10.948809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:10.948809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.0653","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-18T04:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cuSreMFYBks/KrMeR/QKuYu7OkT1ZDcWWtLe1NfnIzNOZAMyvU74VzGGJ1vVTe8qyra+Mfh60aOAMVKatIAbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T22:04:25.856028Z"},"content_sha256":"1e90591a504941bce2a86c8222eec674b426ce8387b8834f1dd865c826fc3fec","schema_version":"1.0","event_id":"sha256:1e90591a504941bce2a86c8222eec674b426ce8387b8834f1dd865c826fc3fec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3B5CBHHJGYATJJA35YUXLXQAEO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model Checking of Boolean Process Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Christoph Schneider, Joachim Wehler","submitted_at":"2011-05-03T18:49:18Z","abstract_excerpt":"In the field of Business Process Management formal models for the control flow of business processes have been designed since more than 15 years. Which methods are best suited to verify the bulk of these models? The first step is to select a formal language which fixes the semantics of the models. We adopt the language of Boolean systems as reference language for Boolean process models. Boolean systems form a simple subclass of coloured Petri nets. Their characteristics are low tokens to model explicitly states with a subsequent skipping of activations and arbitrary logical rules of type AND, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0653","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-18T04:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nr3V9DSwwyIuvwqr4R1q0WppuE8atJPIHjHKuJkkCN7A+RJopd1ajO8QdVEjrsGDVLIhkgurWFBidY0MAfs0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T22:04:25.856671Z"},"content_sha256":"2d1fd4c5d5901f7c52954441a29f72999b7ed5b8c5e9b3f1e4a1af9258e45ef1","schema_version":"1.0","event_id":"sha256:2d1fd4c5d5901f7c52954441a29f72999b7ed5b8c5e9b3f1e4a1af9258e45ef1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3B5CBHHJGYATJJA35YUXLXQAEO/bundle.json","state_url":"https://pith.science/pith/3B5CBHHJGYATJJA35YUXLXQAEO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3B5CBHHJGYATJJA35YUXLXQAEO/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-23T22:04:25Z","links":{"resolver":"https://pith.science/pith/3B5CBHHJGYATJJA35YUXLXQAEO","bundle":"https://pith.science/pith/3B5CBHHJGYATJJA35YUXLXQAEO/bundle.json","state":"https://pith.science/pith/3B5CBHHJGYATJJA35YUXLXQAEO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3B5CBHHJGYATJJA35YUXLXQAEO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3B5CBHHJGYATJJA35YUXLXQAEO","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":"2ea9f8891c6104836e4c7e82048cc1d2c1513f11d7532cea743454b241c78d23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-05-03T18:49:18Z","title_canon_sha256":"045bcc5a055c545c2ec55a94887046072f90824cda9afccb5b8b42eafb70c959"},"schema_version":"1.0","source":{"id":"1105.0653","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0653","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0653v1","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0653","created_at":"2026-05-18T04:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"3B5CBHHJGYAT","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3B5CBHHJGYATJJA3","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3B5CBHHJ","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:2d1fd4c5d5901f7c52954441a29f72999b7ed5b8c5e9b3f1e4a1af9258e45ef1","target":"graph","created_at":"2026-05-18T04:23:10Z","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":"In the field of Business Process Management formal models for the control flow of business processes have been designed since more than 15 years. Which methods are best suited to verify the bulk of these models? The first step is to select a formal language which fixes the semantics of the models. We adopt the language of Boolean systems as reference language for Boolean process models. Boolean systems form a simple subclass of coloured Petri nets. Their characteristics are low tokens to model explicitly states with a subsequent skipping of activations and arbitrary logical rules of type AND, ","authors_text":"Christoph Schneider, Joachim Wehler","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-05-03T18:49:18Z","title":"Model Checking of Boolean Process Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0653","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:1e90591a504941bce2a86c8222eec674b426ce8387b8834f1dd865c826fc3fec","target":"record","created_at":"2026-05-18T04:23:10Z","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":"2ea9f8891c6104836e4c7e82048cc1d2c1513f11d7532cea743454b241c78d23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-05-03T18:49:18Z","title_canon_sha256":"045bcc5a055c545c2ec55a94887046072f90824cda9afccb5b8b42eafb70c959"},"schema_version":"1.0","source":{"id":"1105.0653","kind":"arxiv","version":1}},"canonical_sha256":"d87a209ce9360134a41bee2975de002389c9dabf5bf612d56b7f6e3fcbb3619f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d87a209ce9360134a41bee2975de002389c9dabf5bf612d56b7f6e3fcbb3619f","first_computed_at":"2026-05-18T04:23:10.948809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:10.948809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eQms6lkW3TM22ZheyMR4XCxnkpn2et/aCLahGFRAbel4K7SN1Tr2FM0YWdORJjeZh2/Fq7i3GJNgfW/adh9fAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:10.949305Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0653","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e90591a504941bce2a86c8222eec674b426ce8387b8834f1dd865c826fc3fec","sha256:2d1fd4c5d5901f7c52954441a29f72999b7ed5b8c5e9b3f1e4a1af9258e45ef1"],"state_sha256":"325845d51856fe946706cc474a43c7a14213fcb28fbb5638233e4fe9e5f6c7b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"62fC6a6KvDua02KqTBl5MaTwMzbaQbEO57MoOy2VGuGhfAXLFh8gAzUYGyVkqpaV5ykrLJmq6fWIuMEd0GJVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T22:04:25.859866Z","bundle_sha256":"8579dec8be8d2efece038eddb1e3ae13b530a12bda0687c03be6137c1a730925"}}