{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ONMZHK3FECUTA3X36OWFULHTQS","short_pith_number":"pith:ONMZHK3F","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"},"canonical_sha256":"735993ab6520a9306efbf3ac5a2cf384b08c19ffbef3d1e23f9801be83f3a015","source":{"kind":"arxiv","id":"1810.05871","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05871","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05871v1","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05871","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"ONMZHK3FECUT","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"ONMZHK3FECUTA3X3","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"ONMZHK3F","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ONMZHK3FECUTA3X36OWFULHTQS","target":"record","payload":{"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"},"canonical_sha256":"735993ab6520a9306efbf3ac5a2cf384b08c19ffbef3d1e23f9801be83f3a015","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"},"source_kind":"arxiv","source_id":"1810.05871","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-18T00:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B4IlZ2MGSxJiyhvtfrsVRhyFtfskJWBK+NSSlwf84lV+PB9v4wbRpH6o5fNx8YKlPgS3PkNKrMqwR7QwxOFTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:00:05.167150Z"},"content_sha256":"86e6b50e9523a8ca4b65fc5d7b1d69d1a2a8fca5ef7d6bb66cfcbea95c97179a","schema_version":"1.0","event_id":"sha256:86e6b50e9523a8ca4b65fc5d7b1d69d1a2a8fca5ef7d6bb66cfcbea95c97179a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ONMZHK3FECUTA3X36OWFULHTQS","target":"graph","payload":{"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"},"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-18T00:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mxrb22AG2yNMDfulTRyVhkoDILlzpHndVYD6AeXNblW/gn6DQ306H05Qi5BXTojR0eS5wvBHDwICT7KSYCXODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:00:05.167857Z"},"content_sha256":"4a6eba37ed14da3bbe6544e0ade765ef5461b271bdbfb6f14c8ee88d0c6c5f99","schema_version":"1.0","event_id":"sha256:4a6eba37ed14da3bbe6544e0ade765ef5461b271bdbfb6f14c8ee88d0c6c5f99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONMZHK3FECUTA3X36OWFULHTQS/bundle.json","state_url":"https://pith.science/pith/ONMZHK3FECUTA3X36OWFULHTQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONMZHK3FECUTA3X36OWFULHTQS/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-26T11:00:05Z","links":{"resolver":"https://pith.science/pith/ONMZHK3FECUTA3X36OWFULHTQS","bundle":"https://pith.science/pith/ONMZHK3FECUTA3X36OWFULHTQS/bundle.json","state":"https://pith.science/pith/ONMZHK3FECUTA3X36OWFULHTQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONMZHK3FECUTA3X36OWFULHTQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ONMZHK3FECUTA3X36OWFULHTQS","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":"01269597950f02a3ceadad3a3d2a08a16c017b8624246f91c197695a2ec1e9f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-13T15:06:52Z","title_canon_sha256":"15f5ef0bae0c214150f76e945d1ab55aad7defb71552936f6891fdfa221e36ab"},"schema_version":"1.0","source":{"id":"1810.05871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05871","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05871v1","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05871","created_at":"2026-05-18T00:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"ONMZHK3FECUT","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"ONMZHK3FECUTA3X3","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"ONMZHK3F","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:4a6eba37ed14da3bbe6544e0ade765ef5461b271bdbfb6f14c8ee88d0c6c5f99","target":"graph","created_at":"2026-05-18T00:03:26Z","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":"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","authors_text":"John Kaippallimalil, Vijay K. Garg, Xiong Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-13T15:06:52Z","title":"Linearizable Replicated State Machines with Lattice Agreement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05871","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:86e6b50e9523a8ca4b65fc5d7b1d69d1a2a8fca5ef7d6bb66cfcbea95c97179a","target":"record","created_at":"2026-05-18T00:03:26Z","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":"01269597950f02a3ceadad3a3d2a08a16c017b8624246f91c197695a2ec1e9f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-13T15:06:52Z","title_canon_sha256":"15f5ef0bae0c214150f76e945d1ab55aad7defb71552936f6891fdfa221e36ab"},"schema_version":"1.0","source":{"id":"1810.05871","kind":"arxiv","version":1}},"canonical_sha256":"735993ab6520a9306efbf3ac5a2cf384b08c19ffbef3d1e23f9801be83f3a015","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"735993ab6520a9306efbf3ac5a2cf384b08c19ffbef3d1e23f9801be83f3a015","first_computed_at":"2026-05-18T00:03:26.746791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:26.746791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L1u0UyG9V0SwQR0fuZP9g4P+v+QdUNMVBJ/w3sN03hckyZae+QQc4KXejnwXJ+TP1gKgQKiZR177q9tHtA+JCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:26.747274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86e6b50e9523a8ca4b65fc5d7b1d69d1a2a8fca5ef7d6bb66cfcbea95c97179a","sha256:4a6eba37ed14da3bbe6544e0ade765ef5461b271bdbfb6f14c8ee88d0c6c5f99"],"state_sha256":"c0600483819c1671186e762c80f59dd02067b613c51851232f83021633b19402"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2+bHy8U0zN67iN55FuvYELaGLeWQ1QEQVox8lfzPYT7krjfxLJt7X0XWutNDsXOU9K3Hjylziv9mWrS1hWrqCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:00:05.171468Z","bundle_sha256":"c7ad574a4507d019401a20615f40153ec0882030c3f626e59c6e5daaf1014e4e"}}