{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KHR4PDSBAE2PWD3TY4N5EAYDUB","short_pith_number":"pith:KHR4PDSB","schema_version":"1.0","canonical_sha256":"51e3c78e410134fb0f73c71bd20303a07242d90909a863bb0f7e403326f5bfe2","source":{"kind":"arxiv","id":"1807.11557","version":1},"attestation_state":"computed","paper":{"title":"Lattice Agreement in Message Passing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Changyong Hu, Vijay K. Garg, Xiong Zheng","submitted_at":"2018-07-30T20:25:16Z","abstract_excerpt":"This paper studies the lattice agreement problem and the generalized lattice agreement problem in distributed message passing systems. In the lattice agreement problem, given input values from a lattice, processes have to non-trivially decide output values that lie on a chain. We consider the lattice agreement problem in both synchronous and asynchronous systems. For synchronous lattice agreement, we present two algorithms which run in $\\log f$ and $\\min \\{O(\\log^2 h(L)), O(\\log^2 f)\\}$ rounds, respectively, where $h(L)$ denotes the height of the {\\em input sublattice} $L$, $f < n$ is the numb"},"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":"1807.11557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-30T20:25:16Z","cross_cats_sorted":[],"title_canon_sha256":"ef762511fb6a95ed65c7238fd160ae6efce1d182958d50373c1232cfba931d2c","abstract_canon_sha256":"ef8f3520d5fbad90ad95642ef82b81b8f6ad57cb2097173a557e4047c07fa105"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:21.887735Z","signature_b64":"cQg4gP8fAO3qW2JMXtpOEpCsw25JBlAfu5u0tSaKxjWuplkXvr+DBirRgBG2ibfvsyF1Y3QtNqnfHlvG/CRgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51e3c78e410134fb0f73c71bd20303a07242d90909a863bb0f7e403326f5bfe2","last_reissued_at":"2026-05-18T00:09:21.887192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:21.887192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lattice Agreement in Message Passing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Changyong Hu, Vijay K. Garg, Xiong Zheng","submitted_at":"2018-07-30T20:25:16Z","abstract_excerpt":"This paper studies the lattice agreement problem and the generalized lattice agreement problem in distributed message passing systems. In the lattice agreement problem, given input values from a lattice, processes have to non-trivially decide output values that lie on a chain. We consider the lattice agreement problem in both synchronous and asynchronous systems. For synchronous lattice agreement, we present two algorithms which run in $\\log f$ and $\\min \\{O(\\log^2 h(L)), O(\\log^2 f)\\}$ rounds, respectively, where $h(L)$ denotes the height of the {\\em input sublattice} $L$, $f < n$ is the numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11557","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":"1807.11557","created_at":"2026-05-18T00:09:21.887285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.11557v1","created_at":"2026-05-18T00:09:21.887285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11557","created_at":"2026-05-18T00:09:21.887285+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHR4PDSBAE2P","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHR4PDSBAE2PWD3T","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHR4PDSB","created_at":"2026-05-18T12:32:33.847187+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/KHR4PDSBAE2PWD3TY4N5EAYDUB","json":"https://pith.science/pith/KHR4PDSBAE2PWD3TY4N5EAYDUB.json","graph_json":"https://pith.science/api/pith-number/KHR4PDSBAE2PWD3TY4N5EAYDUB/graph.json","events_json":"https://pith.science/api/pith-number/KHR4PDSBAE2PWD3TY4N5EAYDUB/events.json","paper":"https://pith.science/paper/KHR4PDSB"},"agent_actions":{"view_html":"https://pith.science/pith/KHR4PDSBAE2PWD3TY4N5EAYDUB","download_json":"https://pith.science/pith/KHR4PDSBAE2PWD3TY4N5EAYDUB.json","view_paper":"https://pith.science/paper/KHR4PDSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.11557&json=true","fetch_graph":"https://pith.science/api/pith-number/KHR4PDSBAE2PWD3TY4N5EAYDUB/graph.json","fetch_events":"https://pith.science/api/pith-number/KHR4PDSBAE2PWD3TY4N5EAYDUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHR4PDSBAE2PWD3TY4N5EAYDUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHR4PDSBAE2PWD3TY4N5EAYDUB/action/storage_attestation","attest_author":"https://pith.science/pith/KHR4PDSBAE2PWD3TY4N5EAYDUB/action/author_attestation","sign_citation":"https://pith.science/pith/KHR4PDSBAE2PWD3TY4N5EAYDUB/action/citation_signature","submit_replication":"https://pith.science/pith/KHR4PDSBAE2PWD3TY4N5EAYDUB/action/replication_record"}},"created_at":"2026-05-18T00:09:21.887285+00:00","updated_at":"2026-05-18T00:09:21.887285+00:00"}