{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Z2H6C4ATWFFPO6OQQX5SPMFEWA","short_pith_number":"pith:Z2H6C4AT","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"},"canonical_sha256":"ce8fe17013b14af779d085fb27b0a4b00eb9de8fd253da465bfceaa3d9113fdf","source":{"kind":"arxiv","id":"1803.03620","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03620","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03620v1","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03620","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"Z2H6C4ATWFFP","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z2H6C4ATWFFPO6OQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z2H6C4AT","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Z2H6C4ATWFFPO6OQQX5SPMFEWA","target":"record","payload":{"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"},"canonical_sha256":"ce8fe17013b14af779d085fb27b0a4b00eb9de8fd253da465bfceaa3d9113fdf","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"},"source_kind":"arxiv","source_id":"1803.03620","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:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMQcfGyEmtAGwrHrh38jWcfu9PIHAaI4FphT4ZWzeYjgYNUNijxb4Y0rT2aqX40EXCVB0sBZG0g/NJI8CFheDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:49:58.843499Z"},"content_sha256":"2724285db9df07158cdfab03a5a01ec34390775d36a9950967642920c10b971a","schema_version":"1.0","event_id":"sha256:2724285db9df07158cdfab03a5a01ec34390775d36a9950967642920c10b971a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Z2H6C4ATWFFPO6OQQX5SPMFEWA","target":"graph","payload":{"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"},"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:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KnNMg4O8sThyUqCZWFjpXWVREQL9+0NRt9398a23sR+q/8hfkR9+9fq2kVVNBy/U6Op6D1XYndl1XG1ZLnu+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:49:58.844063Z"},"content_sha256":"8cc7c5e0ae5b33d856dc74143f2b6b4988a064892d037c23acfeea35c68b79ca","schema_version":"1.0","event_id":"sha256:8cc7c5e0ae5b33d856dc74143f2b6b4988a064892d037c23acfeea35c68b79ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z2H6C4ATWFFPO6OQQX5SPMFEWA/bundle.json","state_url":"https://pith.science/pith/Z2H6C4ATWFFPO6OQQX5SPMFEWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z2H6C4ATWFFPO6OQQX5SPMFEWA/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-28T07:49:58Z","links":{"resolver":"https://pith.science/pith/Z2H6C4ATWFFPO6OQQX5SPMFEWA","bundle":"https://pith.science/pith/Z2H6C4ATWFFPO6OQQX5SPMFEWA/bundle.json","state":"https://pith.science/pith/Z2H6C4ATWFFPO6OQQX5SPMFEWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z2H6C4ATWFFPO6OQQX5SPMFEWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Z2H6C4ATWFFPO6OQQX5SPMFEWA","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":"9e9861178731b99b327db71880723f7ade0fc1a9658170aa24c6cf7d9ee5566a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-09T18:05:02Z","title_canon_sha256":"8765a1526bb2a53f9c299d1615f57392a3bdfdfea7547309ead4e633b0f3efe1"},"schema_version":"1.0","source":{"id":"1803.03620","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03620","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03620v1","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03620","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"Z2H6C4ATWFFP","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z2H6C4ATWFFPO6OQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z2H6C4AT","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:8cc7c5e0ae5b33d856dc74143f2b6b4988a064892d037c23acfeea35c68b79ca","target":"graph","created_at":"2026-05-18T00:21:38Z","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 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","authors_text":"Dahlia Malkhi, Ivan Porto Carreiro, Lalith Suresh, Parikshit Gopalan, Zeeshan Lokhandwala","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-09T18:05:02Z","title":"Stable and Consistent Membership at Scale with Rapid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03620","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:2724285db9df07158cdfab03a5a01ec34390775d36a9950967642920c10b971a","target":"record","created_at":"2026-05-18T00:21:38Z","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":"9e9861178731b99b327db71880723f7ade0fc1a9658170aa24c6cf7d9ee5566a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-03-09T18:05:02Z","title_canon_sha256":"8765a1526bb2a53f9c299d1615f57392a3bdfdfea7547309ead4e633b0f3efe1"},"schema_version":"1.0","source":{"id":"1803.03620","kind":"arxiv","version":1}},"canonical_sha256":"ce8fe17013b14af779d085fb27b0a4b00eb9de8fd253da465bfceaa3d9113fdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce8fe17013b14af779d085fb27b0a4b00eb9de8fd253da465bfceaa3d9113fdf","first_computed_at":"2026-05-18T00:21:38.924518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:38.924518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ml9Zk7trjxRw1LJhdkHthcU6ogVnpft37YyZFKHz68R9DZFEENBjCmVT30zCWSf9QOOmT7MhPoFcY370PKzNBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:38.925391Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03620","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2724285db9df07158cdfab03a5a01ec34390775d36a9950967642920c10b971a","sha256:8cc7c5e0ae5b33d856dc74143f2b6b4988a064892d037c23acfeea35c68b79ca"],"state_sha256":"4422b3e541a5ae6bd23fd01c10c44cd6f523cd06d794b7a09ac8299d28507b7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nFNWviCNNtvUN5ssHb1KKYHXuJkJjGjHItGULaXuSd4HYVWD8jzfDGGFK55E/5kf20g/p6Frzd8EsrySpgj4Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:49:58.846273Z","bundle_sha256":"b0b9ae269d5558162ce49059f77cc21bbc0bb39a629f853e4d9ec07c71ad800b"}}