{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:R6OICF7MIK3HKVEHDBVC4EIVXL","short_pith_number":"pith:R6OICF7M","schema_version":"1.0","canonical_sha256":"8f9c8117ec42b6755487186a2e1115bade26919f69f2519546cacfc2ec3dce7f","source":{"kind":"arxiv","id":"1202.3084","version":2},"attestation_state":"computed","paper":{"title":"On Dynamic Distributed Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anne-Marie Kermarrec, Florian Huc, Rachid Guerraoui","submitted_at":"2012-02-14T16:50:12Z","abstract_excerpt":"This paper shows for the first time that distributed computing can be both reliable and efficient in an environment that is both highly dynamic and hostile. More specifically, we show how to maintain clusters of size $O(\\log N)$, each containing more than two thirds of honest nodes with high probability, within a system whose size can vary \\textit{polynomially} with respect to its initial size. Furthermore, the communication cost induced by each node arrival or departure is polylogarithmic with respect to $N$, the maximal size of the system. Our clustering can be achieved despite the presence "},"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":"1202.3084","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-02-14T16:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"f6fd732c901672e3f1c6931538fbbc086f22c140db80d54bf882e2799a3fc0fa","abstract_canon_sha256":"bc7cdc133eba3a571cd4e8ac229d83b7d0b1d03b82129fcc9b54a286e0899520"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:35.234876Z","signature_b64":"5EBof5F7SlhWiw98bYQ1MMLOKieo4zRHrtHA9Rd3aKQiy0uB/2i8atFJim3ic5UBYzUhX2E+73PMY5sjwCR6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f9c8117ec42b6755487186a2e1115bade26919f69f2519546cacfc2ec3dce7f","last_reissued_at":"2026-05-18T03:25:35.234138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:35.234138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Dynamic Distributed Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anne-Marie Kermarrec, Florian Huc, Rachid Guerraoui","submitted_at":"2012-02-14T16:50:12Z","abstract_excerpt":"This paper shows for the first time that distributed computing can be both reliable and efficient in an environment that is both highly dynamic and hostile. More specifically, we show how to maintain clusters of size $O(\\log N)$, each containing more than two thirds of honest nodes with high probability, within a system whose size can vary \\textit{polynomially} with respect to its initial size. Furthermore, the communication cost induced by each node arrival or departure is polylogarithmic with respect to $N$, the maximal size of the system. Our clustering can be achieved despite the presence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3084","kind":"arxiv","version":2},"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":"1202.3084","created_at":"2026-05-18T03:25:35.234245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3084v2","created_at":"2026-05-18T03:25:35.234245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3084","created_at":"2026-05-18T03:25:35.234245+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6OICF7MIK3H","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6OICF7MIK3HKVEH","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6OICF7M","created_at":"2026-05-18T12:27:20.899486+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/R6OICF7MIK3HKVEHDBVC4EIVXL","json":"https://pith.science/pith/R6OICF7MIK3HKVEHDBVC4EIVXL.json","graph_json":"https://pith.science/api/pith-number/R6OICF7MIK3HKVEHDBVC4EIVXL/graph.json","events_json":"https://pith.science/api/pith-number/R6OICF7MIK3HKVEHDBVC4EIVXL/events.json","paper":"https://pith.science/paper/R6OICF7M"},"agent_actions":{"view_html":"https://pith.science/pith/R6OICF7MIK3HKVEHDBVC4EIVXL","download_json":"https://pith.science/pith/R6OICF7MIK3HKVEHDBVC4EIVXL.json","view_paper":"https://pith.science/paper/R6OICF7M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3084&json=true","fetch_graph":"https://pith.science/api/pith-number/R6OICF7MIK3HKVEHDBVC4EIVXL/graph.json","fetch_events":"https://pith.science/api/pith-number/R6OICF7MIK3HKVEHDBVC4EIVXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6OICF7MIK3HKVEHDBVC4EIVXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6OICF7MIK3HKVEHDBVC4EIVXL/action/storage_attestation","attest_author":"https://pith.science/pith/R6OICF7MIK3HKVEHDBVC4EIVXL/action/author_attestation","sign_citation":"https://pith.science/pith/R6OICF7MIK3HKVEHDBVC4EIVXL/action/citation_signature","submit_replication":"https://pith.science/pith/R6OICF7MIK3HKVEHDBVC4EIVXL/action/replication_record"}},"created_at":"2026-05-18T03:25:35.234245+00:00","updated_at":"2026-05-18T03:25:35.234245+00:00"}