{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AAYHUFTEWEHEYUOG7RGP2GQP2J","short_pith_number":"pith:AAYHUFTE","canonical_record":{"source":{"id":"1905.07805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-19T20:40:05Z","cross_cats_sorted":["cs.DC","cs.LO"],"title_canon_sha256":"e55e125017c483b5f8f814940f97a747458354335e41daba27c6e6be7d67bbcb","abstract_canon_sha256":"0e6781c21c6ac9b84bebf9a5e84c70aa2f99aa1f29d9a2eb5108fcdd64850d44"},"schema_version":"1.0"},"canonical_sha256":"00307a1664b10e4c51c6fc4cfd1a0fd24e4a2c511b7bfc4d30dbc7f676e693d5","source":{"kind":"arxiv","id":"1905.07805","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07805","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07805v1","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07805","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"pith_short_12","alias_value":"AAYHUFTEWEHE","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AAYHUFTEWEHEYUOG","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AAYHUFTE","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AAYHUFTEWEHEYUOG7RGP2GQP2J","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-19T20:40:05Z","cross_cats_sorted":["cs.DC","cs.LO"],"title_canon_sha256":"e55e125017c483b5f8f814940f97a747458354335e41daba27c6e6be7d67bbcb","abstract_canon_sha256":"0e6781c21c6ac9b84bebf9a5e84c70aa2f99aa1f29d9a2eb5108fcdd64850d44"},"schema_version":"1.0"},"canonical_sha256":"00307a1664b10e4c51c6fc4cfd1a0fd24e4a2c511b7bfc4d30dbc7f676e693d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:48.434054Z","signature_b64":"RfeZue0ZWu+MK88Tx3PDUAgU1+QmxVRg8upjXPcPcFXNEajTbrbU41WeemRObOvg/An5e5SDGF42aMkkY9jRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00307a1664b10e4c51c6fc4cfd1a0fd24e4a2c511b7bfc4d30dbc7f676e693d5","last_reissued_at":"2026-05-17T23:45:48.433500Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:48.433500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07805","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-17T23:45:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y/9l1ZqV3LXg3FawelFhwh7PgnrmelG8ojzlGWD9Qk3lqrmo3oEn2fR2YH+MkXiBCjPuuJa+cXoAHoHfGr2MAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:15:09.887223Z"},"content_sha256":"28879366655b870f34f6ab6aa9cbb19161d7de29b815bccfd7d21e6be9804f7b","schema_version":"1.0","event_id":"sha256:28879366655b870f34f6ab6aa9cbb19161d7de29b815bccfd7d21e6be9804f7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AAYHUFTEWEHEYUOG7RGP2GQP2J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LO"],"primary_cat":"cs.PL","authors_text":"Giuliano Losa, Idan Berkovits, Marijana Lazic, Oded Padon, Sharon Shoham","submitted_at":"2019-05-19T20:40:05Z","abstract_excerpt":"Verification of fault-tolerant distributed protocols is an immensely difficult task. Often, in these protocols, thresholds on set cardinalities are used both in the process code and in its correctness proof, e.g., a process can perform an action only if it has received an acknowledgment from at least half of its peers. Verification of threshold-based protocols is extremely challenging as it involves two kinds of reasoning: first-order reasoning about the unbounded state of the protocol, together with reasoning about sets and cardinalities. In this work, we develop a new methodology for decompo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07805","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-17T23:45:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DvTY3tMFn6eAoMISY98FDu8WThmfdPoh8DMQ8KPpCr6Jee06cNfC8EHylt3uROdGfmzuTw974XMAhT0jwlBHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:15:09.887868Z"},"content_sha256":"b8f1f58fb9576391b9f0198c123ef8375d745cda22a9e35edc744b165a2be548","schema_version":"1.0","event_id":"sha256:b8f1f58fb9576391b9f0198c123ef8375d745cda22a9e35edc744b165a2be548"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AAYHUFTEWEHEYUOG7RGP2GQP2J/bundle.json","state_url":"https://pith.science/pith/AAYHUFTEWEHEYUOG7RGP2GQP2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AAYHUFTEWEHEYUOG7RGP2GQP2J/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-28T12:15:09Z","links":{"resolver":"https://pith.science/pith/AAYHUFTEWEHEYUOG7RGP2GQP2J","bundle":"https://pith.science/pith/AAYHUFTEWEHEYUOG7RGP2GQP2J/bundle.json","state":"https://pith.science/pith/AAYHUFTEWEHEYUOG7RGP2GQP2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AAYHUFTEWEHEYUOG7RGP2GQP2J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AAYHUFTEWEHEYUOG7RGP2GQP2J","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":"0e6781c21c6ac9b84bebf9a5e84c70aa2f99aa1f29d9a2eb5108fcdd64850d44","cross_cats_sorted":["cs.DC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-19T20:40:05Z","title_canon_sha256":"e55e125017c483b5f8f814940f97a747458354335e41daba27c6e6be7d67bbcb"},"schema_version":"1.0","source":{"id":"1905.07805","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07805","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07805v1","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07805","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"pith_short_12","alias_value":"AAYHUFTEWEHE","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AAYHUFTEWEHEYUOG","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AAYHUFTE","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:b8f1f58fb9576391b9f0198c123ef8375d745cda22a9e35edc744b165a2be548","target":"graph","created_at":"2026-05-17T23:45:48Z","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":"Verification of fault-tolerant distributed protocols is an immensely difficult task. Often, in these protocols, thresholds on set cardinalities are used both in the process code and in its correctness proof, e.g., a process can perform an action only if it has received an acknowledgment from at least half of its peers. Verification of threshold-based protocols is extremely challenging as it involves two kinds of reasoning: first-order reasoning about the unbounded state of the protocol, together with reasoning about sets and cardinalities. In this work, we develop a new methodology for decompo","authors_text":"Giuliano Losa, Idan Berkovits, Marijana Lazic, Oded Padon, Sharon Shoham","cross_cats":["cs.DC","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-19T20:40:05Z","title":"Verification of Threshold-Based Distributed Algorithms by Decomposition to Decidable Logics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07805","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:28879366655b870f34f6ab6aa9cbb19161d7de29b815bccfd7d21e6be9804f7b","target":"record","created_at":"2026-05-17T23:45:48Z","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":"0e6781c21c6ac9b84bebf9a5e84c70aa2f99aa1f29d9a2eb5108fcdd64850d44","cross_cats_sorted":["cs.DC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-05-19T20:40:05Z","title_canon_sha256":"e55e125017c483b5f8f814940f97a747458354335e41daba27c6e6be7d67bbcb"},"schema_version":"1.0","source":{"id":"1905.07805","kind":"arxiv","version":1}},"canonical_sha256":"00307a1664b10e4c51c6fc4cfd1a0fd24e4a2c511b7bfc4d30dbc7f676e693d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00307a1664b10e4c51c6fc4cfd1a0fd24e4a2c511b7bfc4d30dbc7f676e693d5","first_computed_at":"2026-05-17T23:45:48.433500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:48.433500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RfeZue0ZWu+MK88Tx3PDUAgU1+QmxVRg8upjXPcPcFXNEajTbrbU41WeemRObOvg/An5e5SDGF42aMkkY9jRCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:48.434054Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07805","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28879366655b870f34f6ab6aa9cbb19161d7de29b815bccfd7d21e6be9804f7b","sha256:b8f1f58fb9576391b9f0198c123ef8375d745cda22a9e35edc744b165a2be548"],"state_sha256":"bdd77e1076b423274224367b1e78d47cfd502e52c75f475a5b7b914916464ec7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R20gB+/qURUv8W1HIYkH69VWZHiRFAtgQiojz1DOoxS+EBVVJFvq1hiDWig4XwwcOGGXEMQC5XGpCmhzGUNhBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:15:09.890869Z","bundle_sha256":"a0acd591b8c4ef138efa98d5f62f43af6912e3562be9f1c1f9aa0900b162bbac"}}