{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2CWZM37YHGU76IYXK453WII6F4","short_pith_number":"pith:2CWZM37Y","schema_version":"1.0","canonical_sha256":"d0ad966ff839a9ff2317573bbb211e2f32c2810a8b42ce50b81808387ad19026","source":{"kind":"arxiv","id":"1303.5891","version":1},"attestation_state":"computed","paper":{"title":"Fault Tolerance in Distributed Systems using Fused State Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bharath Balasubramanian, Vijay K. Garg","submitted_at":"2013-03-23T23:03:34Z","abstract_excerpt":"Replication is a standard technique for fault tolerance in distributed systems modeled as deterministic finite state machines (DFSMs or machines). To correct f crash or f/2 Byzantine faults among n different machines, replication requires nf additional backup machines. We present a solution called fusion that requires just f additional backup machines. First, we build a framework for fault tolerance in DFSMs based on the notion of Hamming distances. We introduce the concept of an (f,m)-fusion, which is a set of m backup machines that can correct f crash faults or f/2 Byzantine faults among a g"},"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":"1303.5891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-03-23T23:03:34Z","cross_cats_sorted":[],"title_canon_sha256":"b784ac6004410cc7beda306997d8c72246f1b95dcbed4fb2dceb81f7e21e79d5","abstract_canon_sha256":"d667b5c71b02647d7e252ee2032459670431ac9726f85a3808fb8b95c7d4f028"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:00.995069Z","signature_b64":"yjaoCvKGjrppz6oSVDVuctmzwIkwcEopu4JCWqrQKNQcWHy73HZKKwW+7Ndd9Ozy2JIQdkbNSbO5di899Hg3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0ad966ff839a9ff2317573bbb211e2f32c2810a8b42ce50b81808387ad19026","last_reissued_at":"2026-05-18T03:30:00.994409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:00.994409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault Tolerance in Distributed Systems using Fused State Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bharath Balasubramanian, Vijay K. Garg","submitted_at":"2013-03-23T23:03:34Z","abstract_excerpt":"Replication is a standard technique for fault tolerance in distributed systems modeled as deterministic finite state machines (DFSMs or machines). To correct f crash or f/2 Byzantine faults among n different machines, replication requires nf additional backup machines. We present a solution called fusion that requires just f additional backup machines. First, we build a framework for fault tolerance in DFSMs based on the notion of Hamming distances. We introduce the concept of an (f,m)-fusion, which is a set of m backup machines that can correct f crash faults or f/2 Byzantine faults among a g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5891","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":"1303.5891","created_at":"2026-05-18T03:30:00.994496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.5891v1","created_at":"2026-05-18T03:30:00.994496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5891","created_at":"2026-05-18T03:30:00.994496+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CWZM37YHGU7","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CWZM37YHGU76IYX","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CWZM37Y","created_at":"2026-05-18T12:27:30.460161+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/2CWZM37YHGU76IYXK453WII6F4","json":"https://pith.science/pith/2CWZM37YHGU76IYXK453WII6F4.json","graph_json":"https://pith.science/api/pith-number/2CWZM37YHGU76IYXK453WII6F4/graph.json","events_json":"https://pith.science/api/pith-number/2CWZM37YHGU76IYXK453WII6F4/events.json","paper":"https://pith.science/paper/2CWZM37Y"},"agent_actions":{"view_html":"https://pith.science/pith/2CWZM37YHGU76IYXK453WII6F4","download_json":"https://pith.science/pith/2CWZM37YHGU76IYXK453WII6F4.json","view_paper":"https://pith.science/paper/2CWZM37Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.5891&json=true","fetch_graph":"https://pith.science/api/pith-number/2CWZM37YHGU76IYXK453WII6F4/graph.json","fetch_events":"https://pith.science/api/pith-number/2CWZM37YHGU76IYXK453WII6F4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CWZM37YHGU76IYXK453WII6F4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CWZM37YHGU76IYXK453WII6F4/action/storage_attestation","attest_author":"https://pith.science/pith/2CWZM37YHGU76IYXK453WII6F4/action/author_attestation","sign_citation":"https://pith.science/pith/2CWZM37YHGU76IYXK453WII6F4/action/citation_signature","submit_replication":"https://pith.science/pith/2CWZM37YHGU76IYXK453WII6F4/action/replication_record"}},"created_at":"2026-05-18T03:30:00.994496+00:00","updated_at":"2026-05-18T03:30:00.994496+00:00"}