{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:M2KIZG5UXSQAYPNG3NDVW7NFPY","short_pith_number":"pith:M2KIZG5U","canonical_record":{"source":{"id":"1707.05063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-17T09:44:55Z","cross_cats_sorted":[],"title_canon_sha256":"e4a4ed244f7d18291d376dbc5486c9a31cf63fc4021441f2fe7018b3cd44e30e","abstract_canon_sha256":"6d47754a704831d2f938382eeedd25855252dcb0b3b23095cdce2151c90e851e"},"schema_version":"1.0"},"canonical_sha256":"66948c9bb4bca00c3da6db475b7da57e346ac3b8e55cc12531b98418eed32a6f","source":{"kind":"arxiv","id":"1707.05063","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05063","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05063v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05063","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"M2KIZG5UXSQA","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M2KIZG5UXSQAYPNG","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M2KIZG5U","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:M2KIZG5UXSQAYPNG3NDVW7NFPY","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-17T09:44:55Z","cross_cats_sorted":[],"title_canon_sha256":"e4a4ed244f7d18291d376dbc5486c9a31cf63fc4021441f2fe7018b3cd44e30e","abstract_canon_sha256":"6d47754a704831d2f938382eeedd25855252dcb0b3b23095cdce2151c90e851e"},"schema_version":"1.0"},"canonical_sha256":"66948c9bb4bca00c3da6db475b7da57e346ac3b8e55cc12531b98418eed32a6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:11.467836Z","signature_b64":"wzvSo26lp7KzwxgSH/AyllhuZv1xeCu8D3ySiw9m3a4srkwxJkQAjcfS5CgwVJ2dLcRGohYiifrbUrHB1IR1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66948c9bb4bca00c3da6db475b7da57e346ac3b8e55cc12531b98418eed32a6f","last_reissued_at":"2026-05-18T00:40:11.467363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:11.467363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05063","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:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cl0A0hscCvnrz1bYypOidVUbyePjKAvQelsYwF6it5Gn64SSH9TiMUmnRBqPXj4ON6HplgbghvuIHnzhjS5cDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T00:14:03.854940Z"},"content_sha256":"01914ea4b1474ebf0eab3a87ba2242e93f9ccabd17929bb9cd4d2631aba3f005","schema_version":"1.0","event_id":"sha256:01914ea4b1474ebf0eab3a87ba2242e93f9ccabd17929bb9cd4d2631aba3f005"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:M2KIZG5UXSQAYPNG3NDVW7NFPY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Storage under Unsynchrononized Mobile Byzantine Faults","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Antonella Del Pozzo (Sorbonne University), Maria Potop-Butucaru (Sorbonne University), S\\'ebastien Tixeuil (Sorbonne University), Silvia Bonomi","submitted_at":"2017-07-17T09:44:55Z","abstract_excerpt":"In this paper we prove lower and matching upper bounds for the number of servers required to implement a regular shared register that tolerates unsynchronized Mobile Byzantine failures. We consider the strongest model of Mobile Byzantine failures to date: agents are moved arbitrarily by an omniscient adversary from a server to another in order to deviate their computation in an unforeseen manner. When a server is infected by an Byzantine agent, it behaves arbitrarily until the adversary decides to move the agent to another server. Previous approaches considered asynchronous servers with synchr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05063","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:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1xgy6kA1c05Xa2Z4aAsYpWeJKGusnX5R4uRcCaFqom9aRbjJp/DWhACUW/Joip+qvH+7DhiRlzgrOWURXCgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T00:14:03.855288Z"},"content_sha256":"08c58f9f8eb230962500e1338947bead0c0c2c6ed0ae9af4c655d949147a9b10","schema_version":"1.0","event_id":"sha256:08c58f9f8eb230962500e1338947bead0c0c2c6ed0ae9af4c655d949147a9b10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M2KIZG5UXSQAYPNG3NDVW7NFPY/bundle.json","state_url":"https://pith.science/pith/M2KIZG5UXSQAYPNG3NDVW7NFPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M2KIZG5UXSQAYPNG3NDVW7NFPY/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-07-01T00:14:03Z","links":{"resolver":"https://pith.science/pith/M2KIZG5UXSQAYPNG3NDVW7NFPY","bundle":"https://pith.science/pith/M2KIZG5UXSQAYPNG3NDVW7NFPY/bundle.json","state":"https://pith.science/pith/M2KIZG5UXSQAYPNG3NDVW7NFPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M2KIZG5UXSQAYPNG3NDVW7NFPY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:M2KIZG5UXSQAYPNG3NDVW7NFPY","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":"6d47754a704831d2f938382eeedd25855252dcb0b3b23095cdce2151c90e851e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-17T09:44:55Z","title_canon_sha256":"e4a4ed244f7d18291d376dbc5486c9a31cf63fc4021441f2fe7018b3cd44e30e"},"schema_version":"1.0","source":{"id":"1707.05063","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05063","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05063v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05063","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"M2KIZG5UXSQA","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"M2KIZG5UXSQAYPNG","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"M2KIZG5U","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:08c58f9f8eb230962500e1338947bead0c0c2c6ed0ae9af4c655d949147a9b10","target":"graph","created_at":"2026-05-18T00:40:11Z","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":"In this paper we prove lower and matching upper bounds for the number of servers required to implement a regular shared register that tolerates unsynchronized Mobile Byzantine failures. We consider the strongest model of Mobile Byzantine failures to date: agents are moved arbitrarily by an omniscient adversary from a server to another in order to deviate their computation in an unforeseen manner. When a server is infected by an Byzantine agent, it behaves arbitrarily until the adversary decides to move the agent to another server. Previous approaches considered asynchronous servers with synchr","authors_text":"Antonella Del Pozzo (Sorbonne University), Maria Potop-Butucaru (Sorbonne University), S\\'ebastien Tixeuil (Sorbonne University), Silvia Bonomi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-17T09:44:55Z","title":"Optimal Storage under Unsynchrononized Mobile Byzantine Faults"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05063","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:01914ea4b1474ebf0eab3a87ba2242e93f9ccabd17929bb9cd4d2631aba3f005","target":"record","created_at":"2026-05-18T00:40:11Z","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":"6d47754a704831d2f938382eeedd25855252dcb0b3b23095cdce2151c90e851e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-17T09:44:55Z","title_canon_sha256":"e4a4ed244f7d18291d376dbc5486c9a31cf63fc4021441f2fe7018b3cd44e30e"},"schema_version":"1.0","source":{"id":"1707.05063","kind":"arxiv","version":1}},"canonical_sha256":"66948c9bb4bca00c3da6db475b7da57e346ac3b8e55cc12531b98418eed32a6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66948c9bb4bca00c3da6db475b7da57e346ac3b8e55cc12531b98418eed32a6f","first_computed_at":"2026-05-18T00:40:11.467363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:11.467363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wzvSo26lp7KzwxgSH/AyllhuZv1xeCu8D3ySiw9m3a4srkwxJkQAjcfS5CgwVJ2dLcRGohYiifrbUrHB1IR1AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:11.467836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05063","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01914ea4b1474ebf0eab3a87ba2242e93f9ccabd17929bb9cd4d2631aba3f005","sha256:08c58f9f8eb230962500e1338947bead0c0c2c6ed0ae9af4c655d949147a9b10"],"state_sha256":"b540fbf07268be7313af9a381b47ee6a0a341f005eb41ea26ce12bd2a372ae0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KW30g1iSfoQwZNIpdL86P/wc16Ip1hkz73+ww58jpprcONkYFDta+pLkNSE8exkWJl0sva2aFAIKBpjR8xW/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T00:14:03.857293Z","bundle_sha256":"f6d4ab7f9e32b8489820ac8094b5b639a783582e3ff6dc944526b3f1d5b69ac8"}}