{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AAYHUFTEWEHEYUOG7RGP2GQP2J","short_pith_number":"pith:AAYHUFTE","schema_version":"1.0","canonical_sha256":"00307a1664b10e4c51c6fc4cfd1a0fd24e4a2c511b7bfc4d30dbc7f676e693d5","source":{"kind":"arxiv","id":"1905.07805","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.07805","created_at":"2026-05-17T23:45:48.433589+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.07805v1","created_at":"2026-05-17T23:45:48.433589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07805","created_at":"2026-05-17T23:45:48.433589+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAYHUFTEWEHE","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAYHUFTEWEHEYUOG","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAYHUFTE","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AAYHUFTEWEHEYUOG7RGP2GQP2J","json":"https://pith.science/pith/AAYHUFTEWEHEYUOG7RGP2GQP2J.json","graph_json":"https://pith.science/api/pith-number/AAYHUFTEWEHEYUOG7RGP2GQP2J/graph.json","events_json":"https://pith.science/api/pith-number/AAYHUFTEWEHEYUOG7RGP2GQP2J/events.json","paper":"https://pith.science/paper/AAYHUFTE"},"agent_actions":{"view_html":"https://pith.science/pith/AAYHUFTEWEHEYUOG7RGP2GQP2J","download_json":"https://pith.science/pith/AAYHUFTEWEHEYUOG7RGP2GQP2J.json","view_paper":"https://pith.science/paper/AAYHUFTE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.07805&json=true","fetch_graph":"https://pith.science/api/pith-number/AAYHUFTEWEHEYUOG7RGP2GQP2J/graph.json","fetch_events":"https://pith.science/api/pith-number/AAYHUFTEWEHEYUOG7RGP2GQP2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAYHUFTEWEHEYUOG7RGP2GQP2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAYHUFTEWEHEYUOG7RGP2GQP2J/action/storage_attestation","attest_author":"https://pith.science/pith/AAYHUFTEWEHEYUOG7RGP2GQP2J/action/author_attestation","sign_citation":"https://pith.science/pith/AAYHUFTEWEHEYUOG7RGP2GQP2J/action/citation_signature","submit_replication":"https://pith.science/pith/AAYHUFTEWEHEYUOG7RGP2GQP2J/action/replication_record"}},"created_at":"2026-05-17T23:45:48.433589+00:00","updated_at":"2026-05-17T23:45:48.433589+00:00"}