{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DXW55QL622RQHN3Y45PZVX64JT","short_pith_number":"pith:DXW55QL6","canonical_record":{"source":{"id":"1206.0089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-01T06:14:29Z","cross_cats_sorted":[],"title_canon_sha256":"7750722e9e44b9341fa32d52cbe70091446e726022354588fb4bee6c0eb87bed","abstract_canon_sha256":"b2eb80eec9f07c9fec33fc67eedf6cfeb26ed10bc5b622e0ca6e4b7fb4030678"},"schema_version":"1.0"},"canonical_sha256":"1deddec17ed6a303b778e75f9adfdc4cec04205ec39aa7f11b4b8eb53609f5ba","source":{"kind":"arxiv","id":"1206.0089","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.0089","created_at":"2026-05-18T03:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"1206.0089v1","created_at":"2026-05-18T03:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0089","created_at":"2026-05-18T03:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"DXW55QL622RQ","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DXW55QL622RQHN3Y","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DXW55QL6","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DXW55QL622RQHN3Y45PZVX64JT","target":"record","payload":{"canonical_record":{"source":{"id":"1206.0089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-01T06:14:29Z","cross_cats_sorted":[],"title_canon_sha256":"7750722e9e44b9341fa32d52cbe70091446e726022354588fb4bee6c0eb87bed","abstract_canon_sha256":"b2eb80eec9f07c9fec33fc67eedf6cfeb26ed10bc5b622e0ca6e4b7fb4030678"},"schema_version":"1.0"},"canonical_sha256":"1deddec17ed6a303b778e75f9adfdc4cec04205ec39aa7f11b4b8eb53609f5ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:27.140357Z","signature_b64":"CAIdovUN03kQYDjVBdJeuBpJ5XWD3cIa+0PxHUU1GtCGvheVFW6NySnF9NCiABtqhmVAlatyqYDYguknlSkCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1deddec17ed6a303b778e75f9adfdc4cec04205ec39aa7f11b4b8eb53609f5ba","last_reissued_at":"2026-05-18T03:54:27.139663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:27.139663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.0089","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-18T03:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsss331oQ+FOleoLWZEAkRf+PQXzHM9ze/6ExDuodYQ/mnYnfaBeUnkMPq8CgMukszyiOfVuUt3XusNQgc5LCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T20:07:08.809478Z"},"content_sha256":"38a808ab293e842d4f4ba8b9f4ff176581d5db81ac120d0628b3de35cedd9df2","schema_version":"1.0","event_id":"sha256:38a808ab293e842d4f4ba8b9f4ff176581d5db81ac120d0628b3de35cedd9df2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DXW55QL622RQHN3Y45PZVX64JT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chuanyou Li, Michel Hurfin (INRIA - SUPELEC), Yun Wang","submitted_at":"2012-06-01T06:14:29Z","abstract_excerpt":"We consider the problem of approximate consensus in mobile networks containing Byzantine nodes. We assume that each correct node can communicate only with its neighbors and has no knowledge of the global topology. As all nodes have moving ability, the topology is dynamic. The number of Byzantine nodes is bounded by f and known by all correct nodes. We first introduce an approximate Byzantine consensus protocol which is based on the linear iteration method. As nodes are allowed to collect information during several consecutive rounds, moving gives them the opportunity to gather more values. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0089","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-18T03:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RXfKKc3XQIidVAHT9HmGJGzX+snZdUZ8wzQ/+Sj9EvtknGpgGJV9vCsm8XsWS3g69SR32rx1qh7P62quYhWcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T20:07:08.810132Z"},"content_sha256":"a6a374aee2f69363d03228ce7a8f5d9d86e6e50f52036114b596ad259a792770","schema_version":"1.0","event_id":"sha256:a6a374aee2f69363d03228ce7a8f5d9d86e6e50f52036114b596ad259a792770"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXW55QL622RQHN3Y45PZVX64JT/bundle.json","state_url":"https://pith.science/pith/DXW55QL622RQHN3Y45PZVX64JT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXW55QL622RQHN3Y45PZVX64JT/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-03T20:07:08Z","links":{"resolver":"https://pith.science/pith/DXW55QL622RQHN3Y45PZVX64JT","bundle":"https://pith.science/pith/DXW55QL622RQHN3Y45PZVX64JT/bundle.json","state":"https://pith.science/pith/DXW55QL622RQHN3Y45PZVX64JT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXW55QL622RQHN3Y45PZVX64JT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DXW55QL622RQHN3Y45PZVX64JT","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":"b2eb80eec9f07c9fec33fc67eedf6cfeb26ed10bc5b622e0ca6e4b7fb4030678","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-01T06:14:29Z","title_canon_sha256":"7750722e9e44b9341fa32d52cbe70091446e726022354588fb4bee6c0eb87bed"},"schema_version":"1.0","source":{"id":"1206.0089","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.0089","created_at":"2026-05-18T03:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"1206.0089v1","created_at":"2026-05-18T03:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0089","created_at":"2026-05-18T03:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"DXW55QL622RQ","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DXW55QL622RQHN3Y","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DXW55QL6","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:a6a374aee2f69363d03228ce7a8f5d9d86e6e50f52036114b596ad259a792770","target":"graph","created_at":"2026-05-18T03:54:27Z","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 consider the problem of approximate consensus in mobile networks containing Byzantine nodes. We assume that each correct node can communicate only with its neighbors and has no knowledge of the global topology. As all nodes have moving ability, the topology is dynamic. The number of Byzantine nodes is bounded by f and known by all correct nodes. We first introduce an approximate Byzantine consensus protocol which is based on the linear iteration method. As nodes are allowed to collect information during several consecutive rounds, moving gives them the opportunity to gather more values. We ","authors_text":"Chuanyou Li, Michel Hurfin (INRIA - SUPELEC), Yun Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-01T06:14:29Z","title":"Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0089","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:38a808ab293e842d4f4ba8b9f4ff176581d5db81ac120d0628b3de35cedd9df2","target":"record","created_at":"2026-05-18T03:54:27Z","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":"b2eb80eec9f07c9fec33fc67eedf6cfeb26ed10bc5b622e0ca6e4b7fb4030678","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-06-01T06:14:29Z","title_canon_sha256":"7750722e9e44b9341fa32d52cbe70091446e726022354588fb4bee6c0eb87bed"},"schema_version":"1.0","source":{"id":"1206.0089","kind":"arxiv","version":1}},"canonical_sha256":"1deddec17ed6a303b778e75f9adfdc4cec04205ec39aa7f11b4b8eb53609f5ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1deddec17ed6a303b778e75f9adfdc4cec04205ec39aa7f11b4b8eb53609f5ba","first_computed_at":"2026-05-18T03:54:27.139663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:27.139663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CAIdovUN03kQYDjVBdJeuBpJ5XWD3cIa+0PxHUU1GtCGvheVFW6NySnF9NCiABtqhmVAlatyqYDYguknlSkCDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:27.140357Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.0089","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38a808ab293e842d4f4ba8b9f4ff176581d5db81ac120d0628b3de35cedd9df2","sha256:a6a374aee2f69363d03228ce7a8f5d9d86e6e50f52036114b596ad259a792770"],"state_sha256":"e251995bf4a15b56aedadba749c64dc6b9e3db061d2798678b5336abdb1bdf49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqEBRulTh2WRfJ6Nq2kpnik9iqnCUPQ09oF2+Hqbur7GMGfRkUCoOcnH3XhwiiD764qCUOftAHruwENhJAykCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T20:07:08.812472Z","bundle_sha256":"b4b0c1dd1039a10541deade92361d12f0012f11ff3190b888ed45bae346bfd0b"}}