{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QMWIIHAZCTZ5HCISRHDLCLNMRH","short_pith_number":"pith:QMWIIHAZ","canonical_record":{"source":{"id":"1807.08588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-07-23T13:13:11Z","cross_cats_sorted":[],"title_canon_sha256":"d457e25d561ce617d3199c435edde35e76d51de3756788b9d1d5618da3d56e27","abstract_canon_sha256":"636e784e0add3bf3b2a80017934d13d4659be9f0cbaf527da1fd21873749803e"},"schema_version":"1.0"},"canonical_sha256":"832c841c1914f3d3891289c6b12dac89d1fbe2a7bff25547684535e4bbdab718","source":{"kind":"arxiv","id":"1807.08588","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08588","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08588v2","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08588","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"QMWIIHAZCTZ5","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QMWIIHAZCTZ5HCIS","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QMWIIHAZ","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QMWIIHAZCTZ5HCISRHDLCLNMRH","target":"record","payload":{"canonical_record":{"source":{"id":"1807.08588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-07-23T13:13:11Z","cross_cats_sorted":[],"title_canon_sha256":"d457e25d561ce617d3199c435edde35e76d51de3756788b9d1d5618da3d56e27","abstract_canon_sha256":"636e784e0add3bf3b2a80017934d13d4659be9f0cbaf527da1fd21873749803e"},"schema_version":"1.0"},"canonical_sha256":"832c841c1914f3d3891289c6b12dac89d1fbe2a7bff25547684535e4bbdab718","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:41.097675Z","signature_b64":"Kg6OgvxCoaMWP4T8TC71lbl2i/6+47l45UPK8OKfto6NcR21m1QFll1WgpzZWZOPal0XlUny1h6JDdlwPBK4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"832c841c1914f3d3891289c6b12dac89d1fbe2a7bff25547684535e4bbdab718","last_reissued_at":"2026-05-18T00:03:41.097099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:41.097099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.08588","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-18T00:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"epdp/GIPWFRdLg1a5gJ1SJOa/vZNkD8W92TOQkPwSzSOujOUz5kgqRJa3X3GgNLtRW0GrtKoE/AH7V87MS1dCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:59:26.601777Z"},"content_sha256":"773c3cdbf04c1b42d05ba27b056b0a8beaf9f0315d55c2ac1fc47b36265a2638","schema_version":"1.0","event_id":"sha256:773c3cdbf04c1b42d05ba27b056b0a8beaf9f0315d55c2ac1fc47b36265a2638"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QMWIIHAZCTZ5HCISRHDLCLNMRH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automating Verification of State Machines with Reactive Designs and Isabelle/UTP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alvaro Miyazawa, Ana Cavalcanti, James Baxter, Jim Woodcock, Simon Foster","submitted_at":"2018-07-23T13:13:11Z","abstract_excerpt":"State-machine based notations are ubiquitous in the description of component systems, particularly in the robotic domain. To ensure these systems are safe and predictable, formal verification techniques are important, and can be cost-effective if they are both automated and scalable. In this paper, we present a verification approach for a diagrammatic state machine language that utilises theorem proving and a denotational semantics based on Unifying Theories of Programming (UTP). We provide the necessary theory to underpin state machines (including induction theorems for iterative processes), "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08588","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-18T00:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZjeMMqEsBIAFMtU5LM1ZrcqGKjeQSDzfcRFN4a06cObq++5BBRL6yOqexFPPEDqpr141dCzTP9iXfMXWCnftAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:59:26.602296Z"},"content_sha256":"2be88fee0791f7219462821468adf5b9a72ed8fe021e0c5ef6082a4a74438663","schema_version":"1.0","event_id":"sha256:2be88fee0791f7219462821468adf5b9a72ed8fe021e0c5ef6082a4a74438663"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMWIIHAZCTZ5HCISRHDLCLNMRH/bundle.json","state_url":"https://pith.science/pith/QMWIIHAZCTZ5HCISRHDLCLNMRH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMWIIHAZCTZ5HCISRHDLCLNMRH/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-28T21:59:26Z","links":{"resolver":"https://pith.science/pith/QMWIIHAZCTZ5HCISRHDLCLNMRH","bundle":"https://pith.science/pith/QMWIIHAZCTZ5HCISRHDLCLNMRH/bundle.json","state":"https://pith.science/pith/QMWIIHAZCTZ5HCISRHDLCLNMRH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMWIIHAZCTZ5HCISRHDLCLNMRH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QMWIIHAZCTZ5HCISRHDLCLNMRH","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":"636e784e0add3bf3b2a80017934d13d4659be9f0cbaf527da1fd21873749803e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-07-23T13:13:11Z","title_canon_sha256":"d457e25d561ce617d3199c435edde35e76d51de3756788b9d1d5618da3d56e27"},"schema_version":"1.0","source":{"id":"1807.08588","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08588","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08588v2","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08588","created_at":"2026-05-18T00:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"QMWIIHAZCTZ5","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QMWIIHAZCTZ5HCIS","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QMWIIHAZ","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:2be88fee0791f7219462821468adf5b9a72ed8fe021e0c5ef6082a4a74438663","target":"graph","created_at":"2026-05-18T00:03:41Z","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":"State-machine based notations are ubiquitous in the description of component systems, particularly in the robotic domain. To ensure these systems are safe and predictable, formal verification techniques are important, and can be cost-effective if they are both automated and scalable. In this paper, we present a verification approach for a diagrammatic state machine language that utilises theorem proving and a denotational semantics based on Unifying Theories of Programming (UTP). We provide the necessary theory to underpin state machines (including induction theorems for iterative processes), ","authors_text":"Alvaro Miyazawa, Ana Cavalcanti, James Baxter, Jim Woodcock, Simon Foster","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-07-23T13:13:11Z","title":"Automating Verification of State Machines with Reactive Designs and Isabelle/UTP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08588","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:773c3cdbf04c1b42d05ba27b056b0a8beaf9f0315d55c2ac1fc47b36265a2638","target":"record","created_at":"2026-05-18T00:03:41Z","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":"636e784e0add3bf3b2a80017934d13d4659be9f0cbaf527da1fd21873749803e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-07-23T13:13:11Z","title_canon_sha256":"d457e25d561ce617d3199c435edde35e76d51de3756788b9d1d5618da3d56e27"},"schema_version":"1.0","source":{"id":"1807.08588","kind":"arxiv","version":2}},"canonical_sha256":"832c841c1914f3d3891289c6b12dac89d1fbe2a7bff25547684535e4bbdab718","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"832c841c1914f3d3891289c6b12dac89d1fbe2a7bff25547684535e4bbdab718","first_computed_at":"2026-05-18T00:03:41.097099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:41.097099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kg6OgvxCoaMWP4T8TC71lbl2i/6+47l45UPK8OKfto6NcR21m1QFll1WgpzZWZOPal0XlUny1h6JDdlwPBK4Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:41.097675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08588","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:773c3cdbf04c1b42d05ba27b056b0a8beaf9f0315d55c2ac1fc47b36265a2638","sha256:2be88fee0791f7219462821468adf5b9a72ed8fe021e0c5ef6082a4a74438663"],"state_sha256":"1bfc3fed1c499829d2f407906979fa9cd1fe20ca11236e1466208bd73eb83e28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V6BkU0pD4B09ABwzuCkKuTc6FSK/J7i4mxjLfmgeD8zGyy6hjsuS9HuRVSXWyWJJb7bDPk1X7TkJHj69kNuYBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:59:26.604782Z","bundle_sha256":"e11f6dd880caf444c4850ca10604b4ac3fdcec832bb165ae02fa1db79a665b14"}}