{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FKTM7ZYPWJESLWQ347VR3VVOQZ","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":"a92b159e466c620ac568f8af059deaa6bfc808bbfa3ef15adfddd6f2387fb535","cross_cats_sorted":["cs.CR","cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-26T02:39:18Z","title_canon_sha256":"5fb1afa25ebd0ac9b389913126ae4c9d959e329b734fa8a75129851f470fff1f"},"schema_version":"1.0","source":{"id":"1906.10817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10817","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10817v1","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10817","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"FKTM7ZYPWJES","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FKTM7ZYPWJESLWQ3","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FKTM7ZYP","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:3ee09db026484ad6266d2db63d449b168dc110b99473e810c1e364c10cffa856","target":"graph","created_at":"2026-05-17T23:42:13Z","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":"We introduce an information-theoretic framework, named Coded State Machine (CSM), to securely and efficiently execute multiple state machines on untrusted network nodes, some of which are Byzantine. The standard method of solving this problem is using State Machine Replication, which achieves high security at the cost of low efficiency. We propose CSM, which achieves the optimal linear scaling in storage efficiency, throughput, and security simultaneously with the size of the network. The storage efficiency is scaled via the design of Lagrange coded states and coded input commands that require","authors_text":"Mingchao Yu, Pramod Viswanath, Saeid Sahraei, Salman Avestimehr, Songze Li, Sreeram Kannan","cross_cats":["cs.CR","cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-26T02:39:18Z","title":"Coded State Machine -- Scaling State Machine Execution under Byzantine Faults"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10817","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:0f05ab4acaf76fca806dbd4d9eaf0e13ecdf81493fb08417f98244ed6df3ddb1","target":"record","created_at":"2026-05-17T23:42:13Z","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":"a92b159e466c620ac568f8af059deaa6bfc808bbfa3ef15adfddd6f2387fb535","cross_cats_sorted":["cs.CR","cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-26T02:39:18Z","title_canon_sha256":"5fb1afa25ebd0ac9b389913126ae4c9d959e329b734fa8a75129851f470fff1f"},"schema_version":"1.0","source":{"id":"1906.10817","kind":"arxiv","version":1}},"canonical_sha256":"2aa6cfe70fb24925da1be7eb1dd6ae8654816e396744f28aecc992a811df32b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2aa6cfe70fb24925da1be7eb1dd6ae8654816e396744f28aecc992a811df32b4","first_computed_at":"2026-05-17T23:42:13.165694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:13.165694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K1kHZerVc6gxMc1VDWxFLpIj9WA+yk96bZd5uBGkjMVmLK5GmPU5tbIIX4HzbQPgsDiWgr2KL9pj4vItF3t4DQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:13.166291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.10817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f05ab4acaf76fca806dbd4d9eaf0e13ecdf81493fb08417f98244ed6df3ddb1","sha256:3ee09db026484ad6266d2db63d449b168dc110b99473e810c1e364c10cffa856"],"state_sha256":"52a0fb9e05d9530aaeaacb57452b022ecd758553be6c8e75b1f2df50a4f4a942"}