{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MHZXNEDT5ZKVGRNQUJPS3J6RLZ","short_pith_number":"pith:MHZXNEDT","canonical_record":{"source":{"id":"1608.05327","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2016-08-18T16:43:03Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"23530bce972bc41d891e8706aa5d96207d0d5f45a3d8f5d61c41c0bf2f3eac3b","abstract_canon_sha256":"cc8158746d478270e2a69149638fa3df16d125f35f4473766a8abe608281771f"},"schema_version":"1.0"},"canonical_sha256":"61f3769073ee555345b0a25f2da7d15e4c9cfb5d5fff7ea9d9989f3f6ebe615a","source":{"kind":"arxiv","id":"1608.05327","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05327","created_at":"2026-05-18T00:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05327v2","created_at":"2026-05-18T00:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05327","created_at":"2026-05-18T00:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"MHZXNEDT5ZKV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MHZXNEDT5ZKVGRNQ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MHZXNEDT","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MHZXNEDT5ZKVGRNQUJPS3J6RLZ","target":"record","payload":{"canonical_record":{"source":{"id":"1608.05327","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2016-08-18T16:43:03Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"23530bce972bc41d891e8706aa5d96207d0d5f45a3d8f5d61c41c0bf2f3eac3b","abstract_canon_sha256":"cc8158746d478270e2a69149638fa3df16d125f35f4473766a8abe608281771f"},"schema_version":"1.0"},"canonical_sha256":"61f3769073ee555345b0a25f2da7d15e4c9cfb5d5fff7ea9d9989f3f6ebe615a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:44.221452Z","signature_b64":"Hj4Q32Lr6TNoOAWd8FCduXilM0bnMjw160KDMaDCiofbFUQGB2LXiT20XOXNqJKIrKP+OCxqOte0RZdlOxtYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61f3769073ee555345b0a25f2da7d15e4c9cfb5d5fff7ea9d9989f3f6ebe615a","last_reissued_at":"2026-05-18T00:59:44.220886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:44.220886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.05327","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:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WK0Xh0cZZ2CWvpDGVNdQclhzOI/H3vZWYhWNoi0XkkS/KwcdYbpPcO6s2/Kzl1XLR0rpFnMZDn+uusZPNtDuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:44:17.160984Z"},"content_sha256":"72b39f2b37fb216c000165c8e103d2105d710e0514aa531fdbffb0ed5e010eab","schema_version":"1.0","event_id":"sha256:72b39f2b37fb216c000165c8e103d2105d710e0514aa531fdbffb0ed5e010eab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MHZXNEDT5ZKVGRNQUJPS3J6RLZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LO","authors_text":"Helmut Veith, Igor Konnov, Josef Widder, Marijana Lazic","submitted_at":"2016-08-18T16:43:03Z","abstract_excerpt":"Distributed algorithms have many mission-critical applications ranging from embedded systems and replicated databases to cloud computing. Due to asynchronous communication, process faults, or network failures, these algorithms are difficult to design and verify. Many algorithms achieve fault tolerance by using threshold guards that, for instance, ensure that a process waits until it has received an acknowledgment from a majority of its peers. Consequently, domain-specific languages for fault-tolerant distributed systems offer language support for threshold guards.\n  We introduce an automated m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05327","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:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HyrYpnFLksK5GRjbY0/LSW78bj5stF19XHuR+s4ZMeUI9U6CA2I/HzmfDtiY9zmoO6wJiOWM67dPHgYE41m2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:44:17.161347Z"},"content_sha256":"c89719ef3703951b62f65a0690108fee9405ab7f7dae5662cf1ab74d9fd15ac1","schema_version":"1.0","event_id":"sha256:c89719ef3703951b62f65a0690108fee9405ab7f7dae5662cf1ab74d9fd15ac1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MHZXNEDT5ZKVGRNQUJPS3J6RLZ/bundle.json","state_url":"https://pith.science/pith/MHZXNEDT5ZKVGRNQUJPS3J6RLZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MHZXNEDT5ZKVGRNQUJPS3J6RLZ/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-31T04:44:17Z","links":{"resolver":"https://pith.science/pith/MHZXNEDT5ZKVGRNQUJPS3J6RLZ","bundle":"https://pith.science/pith/MHZXNEDT5ZKVGRNQUJPS3J6RLZ/bundle.json","state":"https://pith.science/pith/MHZXNEDT5ZKVGRNQUJPS3J6RLZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MHZXNEDT5ZKVGRNQUJPS3J6RLZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MHZXNEDT5ZKVGRNQUJPS3J6RLZ","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":"cc8158746d478270e2a69149638fa3df16d125f35f4473766a8abe608281771f","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2016-08-18T16:43:03Z","title_canon_sha256":"23530bce972bc41d891e8706aa5d96207d0d5f45a3d8f5d61c41c0bf2f3eac3b"},"schema_version":"1.0","source":{"id":"1608.05327","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05327","created_at":"2026-05-18T00:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05327v2","created_at":"2026-05-18T00:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05327","created_at":"2026-05-18T00:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"MHZXNEDT5ZKV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MHZXNEDT5ZKVGRNQ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MHZXNEDT","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:c89719ef3703951b62f65a0690108fee9405ab7f7dae5662cf1ab74d9fd15ac1","target":"graph","created_at":"2026-05-18T00:59:44Z","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":"Distributed algorithms have many mission-critical applications ranging from embedded systems and replicated databases to cloud computing. Due to asynchronous communication, process faults, or network failures, these algorithms are difficult to design and verify. Many algorithms achieve fault tolerance by using threshold guards that, for instance, ensure that a process waits until it has received an acknowledgment from a majority of its peers. Consequently, domain-specific languages for fault-tolerant distributed systems offer language support for threshold guards.\n  We introduce an automated m","authors_text":"Helmut Veith, Igor Konnov, Josef Widder, Marijana Lazic","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2016-08-18T16:43:03Z","title":"A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05327","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:72b39f2b37fb216c000165c8e103d2105d710e0514aa531fdbffb0ed5e010eab","target":"record","created_at":"2026-05-18T00:59:44Z","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":"cc8158746d478270e2a69149638fa3df16d125f35f4473766a8abe608281771f","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2016-08-18T16:43:03Z","title_canon_sha256":"23530bce972bc41d891e8706aa5d96207d0d5f45a3d8f5d61c41c0bf2f3eac3b"},"schema_version":"1.0","source":{"id":"1608.05327","kind":"arxiv","version":2}},"canonical_sha256":"61f3769073ee555345b0a25f2da7d15e4c9cfb5d5fff7ea9d9989f3f6ebe615a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61f3769073ee555345b0a25f2da7d15e4c9cfb5d5fff7ea9d9989f3f6ebe615a","first_computed_at":"2026-05-18T00:59:44.220886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:44.220886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hj4Q32Lr6TNoOAWd8FCduXilM0bnMjw160KDMaDCiofbFUQGB2LXiT20XOXNqJKIrKP+OCxqOte0RZdlOxtYDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:44.221452Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05327","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72b39f2b37fb216c000165c8e103d2105d710e0514aa531fdbffb0ed5e010eab","sha256:c89719ef3703951b62f65a0690108fee9405ab7f7dae5662cf1ab74d9fd15ac1"],"state_sha256":"16359045dcad9b39a831a8d9d7c50f253415e3ed0e1dc624027423e7f8a2a745"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DkwiBfiGAxnJ+eBF5fxekVhO02J133vMi0UEA+Mw+mnZzN7SrZeA2x91JdY4gUksxiw9qeeFuBK0BIXcZ6BSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:44:17.163669Z","bundle_sha256":"98f9393a21321760e51c06457d1b5d35ad897d9afcfc0093b89de94fb14cc596"}}