{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Z2H6C4ATWFFPO6OQQX5SPMFEWA","short_pith_number":"pith:Z2H6C4AT","schema_version":"1.0","canonical_sha256":"ce8fe17013b14af779d085fb27b0a4b00eb9de8fd253da465bfceaa3d9113fdf","source":{"kind":"arxiv","id":"1803.03620","version":1},"attestation_state":"computed","paper":{"title":"Stable and Consistent Membership at Scale with Rapid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dahlia Malkhi, Ivan Porto Carreiro, Lalith Suresh, Parikshit Gopalan, Zeeshan Lokhandwala","submitted_at":"2018-03-09T18:05:02Z","abstract_excerpt":"We present the design and evaluation of Rapid, a distributed membership service. At Rapid's core is a scheme for multi-process cut detection (CD) that revolves around two key insights: (i) it suspects a failure of a process only after alerts arrive from multiple sources, and (ii) when a group of processes experience problems, it detects failures of the entire group, rather than conclude about each process individually. Implementing these insights translates into a simple membership algorithm with low communication overhead.\n  We present evidence that our strategy suffices to drive unanimous de"},"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":"1803.03620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-09T18:05:02Z","cross_cats_sorted":[],"title_canon_sha256":"8765a1526bb2a53f9c299d1615f57392a3bdfdfea7547309ead4e633b0f3efe1","abstract_canon_sha256":"9e9861178731b99b327db71880723f7ade0fc1a9658170aa24c6cf7d9ee5566a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:38.925391Z","signature_b64":"Ml9Zk7trjxRw1LJhdkHthcU6ogVnpft37YyZFKHz68R9DZFEENBjCmVT30zCWSf9QOOmT7MhPoFcY370PKzNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce8fe17013b14af779d085fb27b0a4b00eb9de8fd253da465bfceaa3d9113fdf","last_reissued_at":"2026-05-18T00:21:38.924518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:38.924518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stable and Consistent Membership at Scale with Rapid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dahlia Malkhi, Ivan Porto Carreiro, Lalith Suresh, Parikshit Gopalan, Zeeshan Lokhandwala","submitted_at":"2018-03-09T18:05:02Z","abstract_excerpt":"We present the design and evaluation of Rapid, a distributed membership service. At Rapid's core is a scheme for multi-process cut detection (CD) that revolves around two key insights: (i) it suspects a failure of a process only after alerts arrive from multiple sources, and (ii) when a group of processes experience problems, it detects failures of the entire group, rather than conclude about each process individually. Implementing these insights translates into a simple membership algorithm with low communication overhead.\n  We present evidence that our strategy suffices to drive unanimous de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03620","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":"1803.03620","created_at":"2026-05-18T00:21:38.924675+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03620v1","created_at":"2026-05-18T00:21:38.924675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03620","created_at":"2026-05-18T00:21:38.924675+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2H6C4ATWFFP","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2H6C4ATWFFPO6OQ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2H6C4AT","created_at":"2026-05-18T12:33:04.347982+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/Z2H6C4ATWFFPO6OQQX5SPMFEWA","json":"https://pith.science/pith/Z2H6C4ATWFFPO6OQQX5SPMFEWA.json","graph_json":"https://pith.science/api/pith-number/Z2H6C4ATWFFPO6OQQX5SPMFEWA/graph.json","events_json":"https://pith.science/api/pith-number/Z2H6C4ATWFFPO6OQQX5SPMFEWA/events.json","paper":"https://pith.science/paper/Z2H6C4AT"},"agent_actions":{"view_html":"https://pith.science/pith/Z2H6C4ATWFFPO6OQQX5SPMFEWA","download_json":"https://pith.science/pith/Z2H6C4ATWFFPO6OQQX5SPMFEWA.json","view_paper":"https://pith.science/paper/Z2H6C4AT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03620&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2H6C4ATWFFPO6OQQX5SPMFEWA/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2H6C4ATWFFPO6OQQX5SPMFEWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2H6C4ATWFFPO6OQQX5SPMFEWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2H6C4ATWFFPO6OQQX5SPMFEWA/action/storage_attestation","attest_author":"https://pith.science/pith/Z2H6C4ATWFFPO6OQQX5SPMFEWA/action/author_attestation","sign_citation":"https://pith.science/pith/Z2H6C4ATWFFPO6OQQX5SPMFEWA/action/citation_signature","submit_replication":"https://pith.science/pith/Z2H6C4ATWFFPO6OQQX5SPMFEWA/action/replication_record"}},"created_at":"2026-05-18T00:21:38.924675+00:00","updated_at":"2026-05-18T00:21:38.924675+00:00"}