{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3IXPNH7FWHLUUHF46QGE37OX4M","short_pith_number":"pith:3IXPNH7F","canonical_record":{"source":{"id":"1707.07659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-24T17:36:25Z","cross_cats_sorted":[],"title_canon_sha256":"ac78a37d24815d8b89bb5299f17018bd8882c5f0ee79aa7ff7eb3eac2610ca6b","abstract_canon_sha256":"23e40cf900bc2afc574adf87cc2e8c382f4581eefe31f16dc0ac133d5d735899"},"schema_version":"1.0"},"canonical_sha256":"da2ef69fe5b1d74a1cbcf40c4dfdd7e33bd78be4de4d1783b89020e680a23144","source":{"kind":"arxiv","id":"1707.07659","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07659","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07659v1","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07659","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"3IXPNH7FWHLU","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3IXPNH7FWHLUUHF4","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3IXPNH7F","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3IXPNH7FWHLUUHF46QGE37OX4M","target":"record","payload":{"canonical_record":{"source":{"id":"1707.07659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-24T17:36:25Z","cross_cats_sorted":[],"title_canon_sha256":"ac78a37d24815d8b89bb5299f17018bd8882c5f0ee79aa7ff7eb3eac2610ca6b","abstract_canon_sha256":"23e40cf900bc2afc574adf87cc2e8c382f4581eefe31f16dc0ac133d5d735899"},"schema_version":"1.0"},"canonical_sha256":"da2ef69fe5b1d74a1cbcf40c4dfdd7e33bd78be4de4d1783b89020e680a23144","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:41.476921Z","signature_b64":"tyyDNeISnqhk03TxpETUINVEeciVHyWLDTbRbtESAalhukT4eyscjmWImM/hy85ebu1qqxR9R4o0B7nSg71+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da2ef69fe5b1d74a1cbcf40c4dfdd7e33bd78be4de4d1783b89020e680a23144","last_reissued_at":"2026-05-18T00:39:41.476195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:41.476195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.07659","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:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EtkOdJ3QQQx1XHzLFs20FrZJERKFFDae4XoFR7npHK9smr1a4AymJaPTntozozoQleaTxvcmAspU5mvuY+OTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:07:33.536906Z"},"content_sha256":"6a28a07520a63a8456f6fb105976f5e6a4623995df7a2af853085f33b5b451e1","schema_version":"1.0","event_id":"sha256:6a28a07520a63a8456f6fb105976f5e6a4623995df7a2af853085f33b5b451e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3IXPNH7FWHLUUHF46QGE37OX4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Approximate Consensus Algorithm in the Presence of Mobile Faults","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Lewis Tseng","submitted_at":"2017-07-24T17:36:25Z","abstract_excerpt":"This paper explores the problem of reaching approximate consensus in synchronous point-to-point networks, where each pair of nodes is able to communicate with each other directly and reliably. We consider the mobile Byzantine fault model proposed by Garay '94 -- in the model, an omniscient adversary can corrupt up to $f$ nodes in each round, and at the beginning of each round, faults may \"move\" in the system (i.e., different sets of nodes may become faulty in different rounds). Recent work by Bonomi et al. '16 proposed a simple iterative approximate consensus algorithm which requires at least "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07659","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:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EBfsFoPvltXe9xBziJOG940sKyqJrghRkCWTTb+DMthy0kQT9197J0NwgGI/bHB0oYJbe+l3CIhuMxezkfnBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:07:33.537627Z"},"content_sha256":"cc81caeb7e350474c10e22544dc9d63320bdb8a05f5a752b15031bb608201928","schema_version":"1.0","event_id":"sha256:cc81caeb7e350474c10e22544dc9d63320bdb8a05f5a752b15031bb608201928"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3IXPNH7FWHLUUHF46QGE37OX4M/bundle.json","state_url":"https://pith.science/pith/3IXPNH7FWHLUUHF46QGE37OX4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3IXPNH7FWHLUUHF46QGE37OX4M/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-06-06T23:07:33Z","links":{"resolver":"https://pith.science/pith/3IXPNH7FWHLUUHF46QGE37OX4M","bundle":"https://pith.science/pith/3IXPNH7FWHLUUHF46QGE37OX4M/bundle.json","state":"https://pith.science/pith/3IXPNH7FWHLUUHF46QGE37OX4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3IXPNH7FWHLUUHF46QGE37OX4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3IXPNH7FWHLUUHF46QGE37OX4M","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":"23e40cf900bc2afc574adf87cc2e8c382f4581eefe31f16dc0ac133d5d735899","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-24T17:36:25Z","title_canon_sha256":"ac78a37d24815d8b89bb5299f17018bd8882c5f0ee79aa7ff7eb3eac2610ca6b"},"schema_version":"1.0","source":{"id":"1707.07659","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07659","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07659v1","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07659","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"3IXPNH7FWHLU","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3IXPNH7FWHLUUHF4","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3IXPNH7F","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:cc81caeb7e350474c10e22544dc9d63320bdb8a05f5a752b15031bb608201928","target":"graph","created_at":"2026-05-18T00:39:41Z","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 explores the problem of reaching approximate consensus in synchronous point-to-point networks, where each pair of nodes is able to communicate with each other directly and reliably. We consider the mobile Byzantine fault model proposed by Garay '94 -- in the model, an omniscient adversary can corrupt up to $f$ nodes in each round, and at the beginning of each round, faults may \"move\" in the system (i.e., different sets of nodes may become faulty in different rounds). Recent work by Bonomi et al. '16 proposed a simple iterative approximate consensus algorithm which requires at least ","authors_text":"Lewis Tseng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-24T17:36:25Z","title":"An Improved Approximate Consensus Algorithm in the Presence of Mobile Faults"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07659","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:6a28a07520a63a8456f6fb105976f5e6a4623995df7a2af853085f33b5b451e1","target":"record","created_at":"2026-05-18T00:39:41Z","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":"23e40cf900bc2afc574adf87cc2e8c382f4581eefe31f16dc0ac133d5d735899","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-24T17:36:25Z","title_canon_sha256":"ac78a37d24815d8b89bb5299f17018bd8882c5f0ee79aa7ff7eb3eac2610ca6b"},"schema_version":"1.0","source":{"id":"1707.07659","kind":"arxiv","version":1}},"canonical_sha256":"da2ef69fe5b1d74a1cbcf40c4dfdd7e33bd78be4de4d1783b89020e680a23144","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da2ef69fe5b1d74a1cbcf40c4dfdd7e33bd78be4de4d1783b89020e680a23144","first_computed_at":"2026-05-18T00:39:41.476195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:41.476195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tyyDNeISnqhk03TxpETUINVEeciVHyWLDTbRbtESAalhukT4eyscjmWImM/hy85ebu1qqxR9R4o0B7nSg71+Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:41.476921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.07659","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a28a07520a63a8456f6fb105976f5e6a4623995df7a2af853085f33b5b451e1","sha256:cc81caeb7e350474c10e22544dc9d63320bdb8a05f5a752b15031bb608201928"],"state_sha256":"fa1c1406ae2556606e7bb288578f201ba962717a4719c43133d6c5b4359d576b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DKQSBNtY5fxmrKZchL1KaahY5fS6WdQVg1u6rbZ00G5SFFUzS4+iDE82+f5sisVP2LBiVnNthhN8zXzEvBKuAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T23:07:33.541386Z","bundle_sha256":"edcee5bf2a6423b2a43c6e81ed908abc1eddf3d18429c5b97378ba36ab132c1d"}}