{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ONMZHK3FECUTA3X36OWFULHTQS","short_pith_number":"pith:ONMZHK3F","schema_version":"1.0","canonical_sha256":"735993ab6520a9306efbf3ac5a2cf384b08c19ffbef3d1e23f9801be83f3a015","source":{"kind":"arxiv","id":"1810.05871","version":1},"attestation_state":"computed","paper":{"title":"Linearizable Replicated State Machines with Lattice Agreement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"John Kaippallimalil, Vijay K. Garg, Xiong Zheng","submitted_at":"2018-10-13T15:06:52Z","abstract_excerpt":"This paper studies the lattice agreement problem in asynchronous systems and explores its application to building linearizable replicated state machines (RSM). First, we propose an algorithm to solve the lattice agreement problem in $O(\\log f)$ asynchronous rounds, where $f$ is the number of crash failures that the system can tolerate. This is an exponential improvement over the previous best upper bound. Second, Faleiro et al have shown in [Faleiro et al. PODC, 2012] that combination of conflict-free data types and lattice agreement protocols can be applied to implement linearizable RSM. They"},"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":"1810.05871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-13T15:06:52Z","cross_cats_sorted":[],"title_canon_sha256":"15f5ef0bae0c214150f76e945d1ab55aad7defb71552936f6891fdfa221e36ab","abstract_canon_sha256":"01269597950f02a3ceadad3a3d2a08a16c017b8624246f91c197695a2ec1e9f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:26.747274Z","signature_b64":"L1u0UyG9V0SwQR0fuZP9g4P+v+QdUNMVBJ/w3sN03hckyZae+QQc4KXejnwXJ+TP1gKgQKiZR177q9tHtA+JCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"735993ab6520a9306efbf3ac5a2cf384b08c19ffbef3d1e23f9801be83f3a015","last_reissued_at":"2026-05-18T00:03:26.746791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:26.746791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linearizable Replicated State Machines with Lattice Agreement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"John Kaippallimalil, Vijay K. Garg, Xiong Zheng","submitted_at":"2018-10-13T15:06:52Z","abstract_excerpt":"This paper studies the lattice agreement problem in asynchronous systems and explores its application to building linearizable replicated state machines (RSM). First, we propose an algorithm to solve the lattice agreement problem in $O(\\log f)$ asynchronous rounds, where $f$ is the number of crash failures that the system can tolerate. This is an exponential improvement over the previous best upper bound. Second, Faleiro et al have shown in [Faleiro et al. PODC, 2012] that combination of conflict-free data types and lattice agreement protocols can be applied to implement linearizable RSM. They"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05871","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":"1810.05871","created_at":"2026-05-18T00:03:26.746871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05871v1","created_at":"2026-05-18T00:03:26.746871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05871","created_at":"2026-05-18T00:03:26.746871+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONMZHK3FECUT","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONMZHK3FECUTA3X3","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONMZHK3F","created_at":"2026-05-18T12:32:43.782077+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/ONMZHK3FECUTA3X36OWFULHTQS","json":"https://pith.science/pith/ONMZHK3FECUTA3X36OWFULHTQS.json","graph_json":"https://pith.science/api/pith-number/ONMZHK3FECUTA3X36OWFULHTQS/graph.json","events_json":"https://pith.science/api/pith-number/ONMZHK3FECUTA3X36OWFULHTQS/events.json","paper":"https://pith.science/paper/ONMZHK3F"},"agent_actions":{"view_html":"https://pith.science/pith/ONMZHK3FECUTA3X36OWFULHTQS","download_json":"https://pith.science/pith/ONMZHK3FECUTA3X36OWFULHTQS.json","view_paper":"https://pith.science/paper/ONMZHK3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05871&json=true","fetch_graph":"https://pith.science/api/pith-number/ONMZHK3FECUTA3X36OWFULHTQS/graph.json","fetch_events":"https://pith.science/api/pith-number/ONMZHK3FECUTA3X36OWFULHTQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONMZHK3FECUTA3X36OWFULHTQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONMZHK3FECUTA3X36OWFULHTQS/action/storage_attestation","attest_author":"https://pith.science/pith/ONMZHK3FECUTA3X36OWFULHTQS/action/author_attestation","sign_citation":"https://pith.science/pith/ONMZHK3FECUTA3X36OWFULHTQS/action/citation_signature","submit_replication":"https://pith.science/pith/ONMZHK3FECUTA3X36OWFULHTQS/action/replication_record"}},"created_at":"2026-05-18T00:03:26.746871+00:00","updated_at":"2026-05-18T00:03:26.746871+00:00"}