{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:R6OICF7MIK3HKVEHDBVC4EIVXL","short_pith_number":"pith:R6OICF7M","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"},"canonical_sha256":"8f9c8117ec42b6755487186a2e1115bade26919f69f2519546cacfc2ec3dce7f","source":{"kind":"arxiv","id":"1202.3084","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3084","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3084v2","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3084","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"pith_short_12","alias_value":"R6OICF7MIK3H","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"R6OICF7MIK3HKVEH","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"R6OICF7M","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:R6OICF7MIK3HKVEHDBVC4EIVXL","target":"record","payload":{"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"},"canonical_sha256":"8f9c8117ec42b6755487186a2e1115bade26919f69f2519546cacfc2ec3dce7f","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"},"source_kind":"arxiv","source_id":"1202.3084","source_version":2,"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-18T03:25:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2pYdSGis6NAA0U/a9ndA7gPLaInh5uGvkHFsZLh40XG8obl+LYjMCS4pn876gkFEwPjk4SZhSdmduq8HRRTAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:45:48.982482Z"},"content_sha256":"4961a92a84f6913b92fe469982ae85d1fa6b23bcba3174fe145268c02049943b","schema_version":"1.0","event_id":"sha256:4961a92a84f6913b92fe469982ae85d1fa6b23bcba3174fe145268c02049943b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:R6OICF7MIK3HKVEHDBVC4EIVXL","target":"graph","payload":{"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"},"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-18T03:25:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gWaccLVNGjo7XRJ14CBBFc5SJx95wfxJ8e6iZhRdD9KqtlP/gP1cpQ1ESf5k5vrySy4rHMBYXklzI1vX/+cfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:45:48.983187Z"},"content_sha256":"65f996803c120eaae115c70074354f4c28d299cfa7600535c911bf43d127c1c9","schema_version":"1.0","event_id":"sha256:65f996803c120eaae115c70074354f4c28d299cfa7600535c911bf43d127c1c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R6OICF7MIK3HKVEHDBVC4EIVXL/bundle.json","state_url":"https://pith.science/pith/R6OICF7MIK3HKVEHDBVC4EIVXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R6OICF7MIK3HKVEHDBVC4EIVXL/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-30T10:45:48Z","links":{"resolver":"https://pith.science/pith/R6OICF7MIK3HKVEHDBVC4EIVXL","bundle":"https://pith.science/pith/R6OICF7MIK3HKVEHDBVC4EIVXL/bundle.json","state":"https://pith.science/pith/R6OICF7MIK3HKVEHDBVC4EIVXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R6OICF7MIK3HKVEHDBVC4EIVXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:R6OICF7MIK3HKVEHDBVC4EIVXL","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":"bc7cdc133eba3a571cd4e8ac229d83b7d0b1d03b82129fcc9b54a286e0899520","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-02-14T16:50:12Z","title_canon_sha256":"f6fd732c901672e3f1c6931538fbbc086f22c140db80d54bf882e2799a3fc0fa"},"schema_version":"1.0","source":{"id":"1202.3084","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3084","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3084v2","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3084","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"pith_short_12","alias_value":"R6OICF7MIK3H","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"R6OICF7MIK3HKVEH","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"R6OICF7M","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:65f996803c120eaae115c70074354f4c28d299cfa7600535c911bf43d127c1c9","target":"graph","created_at":"2026-05-18T03:25:35Z","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 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 ","authors_text":"Anne-Marie Kermarrec, Florian Huc, Rachid Guerraoui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-02-14T16:50:12Z","title":"On Dynamic Distributed Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3084","kind":"arxiv","version":2},"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:4961a92a84f6913b92fe469982ae85d1fa6b23bcba3174fe145268c02049943b","target":"record","created_at":"2026-05-18T03:25:35Z","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":"bc7cdc133eba3a571cd4e8ac229d83b7d0b1d03b82129fcc9b54a286e0899520","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-02-14T16:50:12Z","title_canon_sha256":"f6fd732c901672e3f1c6931538fbbc086f22c140db80d54bf882e2799a3fc0fa"},"schema_version":"1.0","source":{"id":"1202.3084","kind":"arxiv","version":2}},"canonical_sha256":"8f9c8117ec42b6755487186a2e1115bade26919f69f2519546cacfc2ec3dce7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f9c8117ec42b6755487186a2e1115bade26919f69f2519546cacfc2ec3dce7f","first_computed_at":"2026-05-18T03:25:35.234138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:35.234138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5EBof5F7SlhWiw98bYQ1MMLOKieo4zRHrtHA9Rd3aKQiy0uB/2i8atFJim3ic5UBYzUhX2E+73PMY5sjwCR6BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:35.234876Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3084","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4961a92a84f6913b92fe469982ae85d1fa6b23bcba3174fe145268c02049943b","sha256:65f996803c120eaae115c70074354f4c28d299cfa7600535c911bf43d127c1c9"],"state_sha256":"a2e8b7fa544c203d4e911c5221b12803ed42205fa0a8c0a9f37a2d652edc8b38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l2ie6Jf2uCxtT89aQSkmt9os49yTuOwlRdpA+i0Hb0pg5V1Ga0qlWWj4rmZKpeGZylYKs1Scpm0X1k/B1v3yBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:45:48.986019Z","bundle_sha256":"89ddc38aef65ad4366b3f6c89de3c1ae43f753f47260fcbeed764a6fef8ab8c7"}}