{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VPQME5M2PAUQJR2PO5B4FF2WZV","short_pith_number":"pith:VPQME5M2","canonical_record":{"source":{"id":"1210.3839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-14T20:51:31Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3bebdb4912ee47741a9bdc71926f3adda713d3c1c82f89f3663902a91eaf155d","abstract_canon_sha256":"5d3c8d96fd806b282a638d4bed61da02424c88a31ab466ee79a2be02339621b8"},"schema_version":"1.0"},"canonical_sha256":"abe0c2759a782904c74f7743c29756cd6347dd7f018a572415c430bff2ac05a2","source":{"kind":"arxiv","id":"1210.3839","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3839","created_at":"2026-05-18T03:43:16Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3839v1","created_at":"2026-05-18T03:43:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3839","created_at":"2026-05-18T03:43:16Z"},{"alias_kind":"pith_short_12","alias_value":"VPQME5M2PAUQ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VPQME5M2PAUQJR2P","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VPQME5M2","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VPQME5M2PAUQJR2PO5B4FF2WZV","target":"record","payload":{"canonical_record":{"source":{"id":"1210.3839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-14T20:51:31Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3bebdb4912ee47741a9bdc71926f3adda713d3c1c82f89f3663902a91eaf155d","abstract_canon_sha256":"5d3c8d96fd806b282a638d4bed61da02424c88a31ab466ee79a2be02339621b8"},"schema_version":"1.0"},"canonical_sha256":"abe0c2759a782904c74f7743c29756cd6347dd7f018a572415c430bff2ac05a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:16.979071Z","signature_b64":"Xk0mdlZ9wsLWJ0GBrVOSZsCVtw2Oe6RhkJXn1iomYTplj3JLi5GD5uAaRPxQL93BsFC8D1nd+YvOnnkvKooSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abe0c2759a782904c74f7743c29756cd6347dd7f018a572415c430bff2ac05a2","last_reissued_at":"2026-05-18T03:43:16.978647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:16.978647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.3839","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-18T03:43:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YK5HXIarWiJ0DV2Gt8CsBekjdsesOp7yRn1XF6M1B+/9fRRikraFOBhENXc+EypmapC8tX06MCZcrp18SFG3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:49:04.781926Z"},"content_sha256":"6b8932ae60e8d7af6b94c90843b2c2c9aa059142f00aa9aec0d6103647af1f49","schema_version":"1.0","event_id":"sha256:6b8932ae60e8d7af6b94c90843b2c2c9aa059142f00aa9aec0d6103647af1f49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VPQME5M2PAUQJR2PO5B4FF2WZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Starting a Dialog between Model Checking and Fault-tolerant Distributed Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.FL","authors_text":"Annu John, Helmut Veith, Igor Konnov, Josef Widder, Ulrich Schmid","submitted_at":"2012-10-14T20:51:31Z","abstract_excerpt":"Fault-tolerant distributed algorithms are central for building reliable spatially distributed systems. Unfortunately, the lack of a canonical precise framework for fault-tolerant algorithms is an obstacle for both verification and deployment. In this paper, we introduce a new domain-specific framework to capture the behavior of fault-tolerant distributed algorithms in an adequate and precise way. At the center of our framework is a parameterized system model where control flow automata are used for process specification. To account for the specific features and properties of fault-tolerant dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3839","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-18T03:43:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v2IS+1eXhzmzcp5QjzBy0e0nA8VOV3exmvpIMaebRHH5tPbZzqgueOhRqizJOKI4LRl29xkFffd4vutw559IDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:49:04.782276Z"},"content_sha256":"31f720363db484eadd646f8d851a92742b987ff823ff4806ad2a9199fef5331b","schema_version":"1.0","event_id":"sha256:31f720363db484eadd646f8d851a92742b987ff823ff4806ad2a9199fef5331b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VPQME5M2PAUQJR2PO5B4FF2WZV/bundle.json","state_url":"https://pith.science/pith/VPQME5M2PAUQJR2PO5B4FF2WZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VPQME5M2PAUQJR2PO5B4FF2WZV/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-10T21:49:04Z","links":{"resolver":"https://pith.science/pith/VPQME5M2PAUQJR2PO5B4FF2WZV","bundle":"https://pith.science/pith/VPQME5M2PAUQJR2PO5B4FF2WZV/bundle.json","state":"https://pith.science/pith/VPQME5M2PAUQJR2PO5B4FF2WZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VPQME5M2PAUQJR2PO5B4FF2WZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VPQME5M2PAUQJR2PO5B4FF2WZV","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":"5d3c8d96fd806b282a638d4bed61da02424c88a31ab466ee79a2be02339621b8","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-14T20:51:31Z","title_canon_sha256":"3bebdb4912ee47741a9bdc71926f3adda713d3c1c82f89f3663902a91eaf155d"},"schema_version":"1.0","source":{"id":"1210.3839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3839","created_at":"2026-05-18T03:43:16Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3839v1","created_at":"2026-05-18T03:43:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3839","created_at":"2026-05-18T03:43:16Z"},{"alias_kind":"pith_short_12","alias_value":"VPQME5M2PAUQ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VPQME5M2PAUQJR2P","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VPQME5M2","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:31f720363db484eadd646f8d851a92742b987ff823ff4806ad2a9199fef5331b","target":"graph","created_at":"2026-05-18T03:43:16Z","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":"Fault-tolerant distributed algorithms are central for building reliable spatially distributed systems. Unfortunately, the lack of a canonical precise framework for fault-tolerant algorithms is an obstacle for both verification and deployment. In this paper, we introduce a new domain-specific framework to capture the behavior of fault-tolerant distributed algorithms in an adequate and precise way. At the center of our framework is a parameterized system model where control flow automata are used for process specification. To account for the specific features and properties of fault-tolerant dis","authors_text":"Annu John, Helmut Veith, Igor Konnov, Josef Widder, Ulrich Schmid","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-14T20:51:31Z","title":"Starting a Dialog between Model Checking and Fault-tolerant Distributed Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3839","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:6b8932ae60e8d7af6b94c90843b2c2c9aa059142f00aa9aec0d6103647af1f49","target":"record","created_at":"2026-05-18T03:43:16Z","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":"5d3c8d96fd806b282a638d4bed61da02424c88a31ab466ee79a2be02339621b8","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-10-14T20:51:31Z","title_canon_sha256":"3bebdb4912ee47741a9bdc71926f3adda713d3c1c82f89f3663902a91eaf155d"},"schema_version":"1.0","source":{"id":"1210.3839","kind":"arxiv","version":1}},"canonical_sha256":"abe0c2759a782904c74f7743c29756cd6347dd7f018a572415c430bff2ac05a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abe0c2759a782904c74f7743c29756cd6347dd7f018a572415c430bff2ac05a2","first_computed_at":"2026-05-18T03:43:16.978647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:16.978647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xk0mdlZ9wsLWJ0GBrVOSZsCVtw2Oe6RhkJXn1iomYTplj3JLi5GD5uAaRPxQL93BsFC8D1nd+YvOnnkvKooSAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:16.979071Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.3839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b8932ae60e8d7af6b94c90843b2c2c9aa059142f00aa9aec0d6103647af1f49","sha256:31f720363db484eadd646f8d851a92742b987ff823ff4806ad2a9199fef5331b"],"state_sha256":"5e2ec65b726f37fe523a98b9e7bb60e5ccf6f869cfdb8554b026689138061e4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsouxfav0+43/DQHJouj5z16QFelI1sHWmZta5i9s5iomf9Pmv++qAQVQ35D7buZwhAdYMGCvgXRx+d/PAefDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:49:04.784214Z","bundle_sha256":"7b559288af83949d10a96543bd47544ca940315a97eefc48cd91d261dfe40530"}}